./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-recursive-malloc/rec_strcopy_malloc.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/termination-recursive-malloc/rec_strcopy_malloc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 4f531da4514da78f664dbd663145b26ee24930c7e93acdc31160c6cc4e4d5de8 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:39:32,923 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:39:33,006 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-09 07:39:33,012 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:39:33,014 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:39:33,040 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:39:33,041 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:39:33,042 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:39:33,042 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:39:33,043 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:39:33,043 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:39:33,043 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:39:33,044 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:39:33,046 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:39:33,046 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:39:33,047 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:39:33,047 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:39:33,047 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:39:33,048 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:39:33,048 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:39:33,048 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 07:39:33,052 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:39:33,053 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:39:33,053 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:39:33,053 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:39:33,053 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:39:33,054 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:39:33,054 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:39:33,054 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:39:33,054 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:39:33,055 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:39:33,055 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:39:33,055 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:39:33,055 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:39:33,055 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:39:33,056 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:39:33,056 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:39:33,056 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:39:33,057 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:39:33,058 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4f531da4514da78f664dbd663145b26ee24930c7e93acdc31160c6cc4e4d5de8 [2024-11-09 07:39:33,338 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:39:33,361 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:39:33,365 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:39:33,366 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:39:33,367 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:39:33,368 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-recursive-malloc/rec_strcopy_malloc.i [2024-11-09 07:39:34,711 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:39:34,893 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:39:34,894 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/rec_strcopy_malloc.i [2024-11-09 07:39:34,900 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89f94b365/6d8354b0e6dc4697827542dc3192267a/FLAG16cf2c8cd [2024-11-09 07:39:35,277 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89f94b365/6d8354b0e6dc4697827542dc3192267a [2024-11-09 07:39:35,280 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:39:35,282 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:39:35,286 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:39:35,286 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:39:35,291 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:39:35,292 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:39:35" (1/1) ... [2024-11-09 07:39:35,293 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37c9a1c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:39:35, skipping insertion in model container [2024-11-09 07:39:35,293 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:39:35" (1/1) ... [2024-11-09 07:39:35,314 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:39:35,494 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:39:35,509 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:39:35,517 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:39:35,532 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:39:35,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:39:35,570 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:39:35,570 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:39:35 WrapperNode [2024-11-09 07:39:35,571 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:39:35,572 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:39:35,572 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:39:35,572 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:39:35,580 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:39:35" (1/1) ... [2024-11-09 07:39:35,587 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:39:35" (1/1) ... [2024-11-09 07:39:35,604 INFO L138 Inliner]: procedures = 13, calls = 14, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 39 [2024-11-09 07:39:35,605 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:39:35,606 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:39:35,606 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:39:35,606 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:39:35,616 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:39:35" (1/1) ... [2024-11-09 07:39:35,616 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:39:35" (1/1) ... [2024-11-09 07:39:35,620 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:39:35" (1/1) ... [2024-11-09 07:39:35,636 INFO L175 MemorySlicer]: Split 4 memory accesses to 2 slices as follows [1, 3]. 75 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 2 writes are split as follows [1, 1]. [2024-11-09 07:39:35,637 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:39:35" (1/1) ... [2024-11-09 07:39:35,637 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:39:35" (1/1) ... [2024-11-09 07:39:35,643 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:39:35" (1/1) ... [2024-11-09 07:39:35,646 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:39:35" (1/1) ... [2024-11-09 07:39:35,647 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:39:35" (1/1) ... [2024-11-09 07:39:35,648 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:39:35" (1/1) ... [2024-11-09 07:39:35,653 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:39:35,654 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:39:35,654 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:39:35,654 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:39:35,655 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:39:35" (1/1) ... [2024-11-09 07:39:35,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:39:35,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:39:35,683 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 07:39:35,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 07:39:35,729 INFO L130 BoogieDeclarations]: Found specification of procedure rec_strcopy_helper [2024-11-09 07:39:35,729 INFO L138 BoogieDeclarations]: Found implementation of procedure rec_strcopy_helper [2024-11-09 07:39:35,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 07:39:35,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 07:39:35,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:39:35,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:39:35,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:39:35,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 07:39:35,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 07:39:35,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:39:35,812 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:39:35,824 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:39:36,052 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2024-11-09 07:39:36,053 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:39:36,071 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:39:36,071 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 07:39:36,071 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:39:36 BoogieIcfgContainer [2024-11-09 07:39:36,072 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:39:36,074 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:39:36,074 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:39:36,077 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:39:36,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:39:35" (1/3) ... [2024-11-09 07:39:36,078 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6474b6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:39:36, skipping insertion in model container [2024-11-09 07:39:36,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:39:35" (2/3) ... [2024-11-09 07:39:36,079 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6474b6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:39:36, skipping insertion in model container [2024-11-09 07:39:36,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:39:36" (3/3) ... [2024-11-09 07:39:36,080 INFO L112 eAbstractionObserver]: Analyzing ICFG rec_strcopy_malloc.i [2024-11-09 07:39:36,096 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:39:36,097 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 15 error locations. [2024-11-09 07:39:36,132 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:39:36,138 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@79cae95, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:39:36,139 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-11-09 07:39:36,143 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 40 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:39:36,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 07:39:36,147 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:39:36,148 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 07:39:36,148 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-09 07:39:36,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:39:36,152 INFO L85 PathProgramCache]: Analyzing trace with hash 46825623, now seen corresponding path program 1 times [2024-11-09 07:39:36,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:39:36,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405424884] [2024-11-09 07:39:36,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:39:36,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:39:36,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:36,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:39:36,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:39:36,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405424884] [2024-11-09 07:39:36,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405424884] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:39:36,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:39:36,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:39:36,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123013059] [2024-11-09 07:39:36,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:39:36,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:39:36,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:39:36,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:39:36,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:39:36,398 INFO L87 Difference]: Start difference. First operand has 43 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 40 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:39:36,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:39:36,461 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2024-11-09 07:39:36,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:39:36,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-09 07:39:36,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:39:36,470 INFO L225 Difference]: With dead ends: 42 [2024-11-09 07:39:36,471 INFO L226 Difference]: Without dead ends: 40 [2024-11-09 07:39:36,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:39:36,476 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:39:36,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 66 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:39:36,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-09 07:39:36,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-09 07:39:36,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 37 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:39:36,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2024-11-09 07:39:36,504 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 5 [2024-11-09 07:39:36,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:39:36,504 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2024-11-09 07:39:36,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:39:36,504 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2024-11-09 07:39:36,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 07:39:36,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:39:36,505 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 07:39:36,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:39:36,506 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-09 07:39:36,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:39:36,507 INFO L85 PathProgramCache]: Analyzing trace with hash 46825624, now seen corresponding path program 1 times [2024-11-09 07:39:36,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:39:36,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986357967] [2024-11-09 07:39:36,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:39:36,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:39:36,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:36,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:39:36,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:39:36,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986357967] [2024-11-09 07:39:36,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986357967] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:39:36,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:39:36,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:39:36,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954437035] [2024-11-09 07:39:36,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:39:36,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:39:36,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:39:36,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:39:36,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:39:36,702 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:39:36,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:39:36,766 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2024-11-09 07:39:36,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:39:36,767 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-09 07:39:36,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:39:36,767 INFO L225 Difference]: With dead ends: 44 [2024-11-09 07:39:36,768 INFO L226 Difference]: Without dead ends: 44 [2024-11-09 07:39:36,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:39:36,769 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 3 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:39:36,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 107 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:39:36,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-09 07:39:36,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2024-11-09 07:39:36,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 25 states have (on average 1.6) internal successors, (40), 39 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:39:36,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2024-11-09 07:39:36,778 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 5 [2024-11-09 07:39:36,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:39:36,778 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2024-11-09 07:39:36,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:39:36,779 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2024-11-09 07:39:36,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 07:39:36,780 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:39:36,780 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 07:39:36,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:39:36,781 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-09 07:39:36,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:39:36,781 INFO L85 PathProgramCache]: Analyzing trace with hash 46827546, now seen corresponding path program 1 times [2024-11-09 07:39:36,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:39:36,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488663892] [2024-11-09 07:39:36,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:39:36,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:39:36,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:36,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:39:36,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:39:36,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488663892] [2024-11-09 07:39:36,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488663892] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:39:36,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:39:36,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:39:36,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339567124] [2024-11-09 07:39:36,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:39:36,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:39:36,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:39:36,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:39:36,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:39:36,966 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:39:37,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:39:37,030 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2024-11-09 07:39:37,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:39:37,032 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-09 07:39:37,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:39:37,033 INFO L225 Difference]: With dead ends: 41 [2024-11-09 07:39:37,033 INFO L226 Difference]: Without dead ends: 41 [2024-11-09 07:39:37,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:39:37,034 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 6 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:39:37,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 99 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:39:37,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-09 07:39:37,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2024-11-09 07:39:37,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 23 states have (on average 1.608695652173913) internal successors, (37), 36 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:39:37,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2024-11-09 07:39:37,046 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 5 [2024-11-09 07:39:37,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:39:37,046 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2024-11-09 07:39:37,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:39:37,046 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2024-11-09 07:39:37,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 07:39:37,047 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:39:37,047 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:39:37,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 07:39:37,048 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-09 07:39:37,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:39:37,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1718638621, now seen corresponding path program 1 times [2024-11-09 07:39:37,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:39:37,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31141030] [2024-11-09 07:39:37,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:39:37,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:39:37,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:37,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:39:37,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:39:37,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31141030] [2024-11-09 07:39:37,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31141030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:39:37,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:39:37,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:39:37,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880506135] [2024-11-09 07:39:37,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:39:37,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:39:37,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:39:37,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:39:37,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:39:37,309 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand has 7 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:39:37,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:39:37,424 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2024-11-09 07:39:37,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:39:37,425 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-09 07:39:37,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:39:37,426 INFO L225 Difference]: With dead ends: 37 [2024-11-09 07:39:37,426 INFO L226 Difference]: Without dead ends: 37 [2024-11-09 07:39:37,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:39:37,427 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 22 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:39:37,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 100 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:39:37,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-09 07:39:37,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-09 07:39:37,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 34 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:39:37,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2024-11-09 07:39:37,433 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 10 [2024-11-09 07:39:37,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:39:37,433 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2024-11-09 07:39:37,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:39:37,434 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2024-11-09 07:39:37,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 07:39:37,435 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:39:37,435 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:39:37,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 07:39:37,436 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-09 07:39:37,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:39:37,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1718638620, now seen corresponding path program 1 times [2024-11-09 07:39:37,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:39:37,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996297448] [2024-11-09 07:39:37,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:39:37,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:39:37,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:37,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:39:37,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:39:37,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996297448] [2024-11-09 07:39:37,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996297448] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:39:37,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:39:37,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 07:39:37,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405551943] [2024-11-09 07:39:37,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:39:37,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:39:37,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:39:37,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:39:37,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:39:37,743 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 8 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:39:37,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:39:37,900 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2024-11-09 07:39:37,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:39:37,901 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 8 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-09 07:39:37,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:39:37,901 INFO L225 Difference]: With dead ends: 48 [2024-11-09 07:39:37,901 INFO L226 Difference]: Without dead ends: 48 [2024-11-09 07:39:37,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-09 07:39:37,903 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 23 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:39:37,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 186 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:39:37,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-09 07:39:37,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2024-11-09 07:39:37,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 30 states have (on average 1.5) internal successors, (45), 42 states have internal predecessors, (45), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:39:37,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2024-11-09 07:39:37,913 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 10 [2024-11-09 07:39:37,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:39:37,914 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2024-11-09 07:39:37,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 8 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:39:37,915 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2024-11-09 07:39:37,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 07:39:37,915 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:39:37,915 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:39:37,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 07:39:37,916 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-09 07:39:37,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:39:37,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1738189725, now seen corresponding path program 1 times [2024-11-09 07:39:37,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:39:37,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380680412] [2024-11-09 07:39:37,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:39:37,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:39:37,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:37,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:39:37,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:39:37,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380680412] [2024-11-09 07:39:37,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380680412] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:39:37,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:39:37,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:39:37,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932807816] [2024-11-09 07:39:37,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:39:37,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:39:37,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:39:37,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:39:37,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:39:37,976 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand has 5 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:39:38,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:39:38,037 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2024-11-09 07:39:38,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:39:38,039 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-09 07:39:38,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:39:38,040 INFO L225 Difference]: With dead ends: 45 [2024-11-09 07:39:38,040 INFO L226 Difference]: Without dead ends: 45 [2024-11-09 07:39:38,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:39:38,041 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 19 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:39:38,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 71 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:39:38,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-09 07:39:38,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-11-09 07:39:38,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 41 states have internal predecessors, (43), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:39:38,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2024-11-09 07:39:38,049 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 11 [2024-11-09 07:39:38,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:39:38,049 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2024-11-09 07:39:38,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:39:38,050 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2024-11-09 07:39:38,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 07:39:38,050 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:39:38,051 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:39:38,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 07:39:38,051 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting rec_strcopy_helperErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-09 07:39:38,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:39:38,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1738189724, now seen corresponding path program 1 times [2024-11-09 07:39:38,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:39:38,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244465666] [2024-11-09 07:39:38,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:39:38,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:39:38,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:38,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:39:38,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:39:38,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244465666] [2024-11-09 07:39:38,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244465666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:39:38,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:39:38,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:39:38,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406935296] [2024-11-09 07:39:38,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:39:38,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:39:38,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:39:38,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:39:38,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:39:38,216 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 6 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:39:38,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:39:38,303 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2024-11-09 07:39:38,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:39:38,304 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-09 07:39:38,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:39:38,304 INFO L225 Difference]: With dead ends: 60 [2024-11-09 07:39:38,304 INFO L226 Difference]: Without dead ends: 60 [2024-11-09 07:39:38,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:39:38,305 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 14 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:39:38,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 127 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:39:38,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-09 07:39:38,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2024-11-09 07:39:38,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 54 states have internal predecessors, (55), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 07:39:38,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2024-11-09 07:39:38,315 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 11 [2024-11-09 07:39:38,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:39:38,316 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2024-11-09 07:39:38,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:39:38,316 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2024-11-09 07:39:38,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 07:39:38,317 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:39:38,317 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:39:38,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 07:39:38,317 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting rec_strcopy_helperErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-09 07:39:38,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:39:38,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1058131354, now seen corresponding path program 1 times [2024-11-09 07:39:38,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:39:38,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033955518] [2024-11-09 07:39:38,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:39:38,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:39:38,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:38,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:39:38,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:39:38,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033955518] [2024-11-09 07:39:38,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033955518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:39:38,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:39:38,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:39:38,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457993207] [2024-11-09 07:39:38,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:39:38,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:39:38,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:39:38,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:39:38,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:39:38,459 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:39:38,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:39:38,534 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2024-11-09 07:39:38,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:39:38,535 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-09 07:39:38,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:39:38,537 INFO L225 Difference]: With dead ends: 59 [2024-11-09 07:39:38,537 INFO L226 Difference]: Without dead ends: 59 [2024-11-09 07:39:38,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:39:38,538 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 14 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:39:38,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 116 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:39:38,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-09 07:39:38,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 45. [2024-11-09 07:39:38,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.4) internal successors, (42), 41 states have internal predecessors, (42), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:39:38,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2024-11-09 07:39:38,549 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 11 [2024-11-09 07:39:38,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:39:38,550 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2024-11-09 07:39:38,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:39:38,550 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2024-11-09 07:39:38,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 07:39:38,550 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:39:38,550 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:39:38,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 07:39:38,551 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-09 07:39:38,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:39:38,551 INFO L85 PathProgramCache]: Analyzing trace with hash -794664304, now seen corresponding path program 1 times [2024-11-09 07:39:38,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:39:38,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882008465] [2024-11-09 07:39:38,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:39:38,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:39:38,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:38,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:39:38,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:39:38,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882008465] [2024-11-09 07:39:38,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882008465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:39:38,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:39:38,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 07:39:38,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362149772] [2024-11-09 07:39:38,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:39:38,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 07:39:38,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:39:38,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 07:39:38,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:39:38,779 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:39:38,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:39:38,891 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2024-11-09 07:39:38,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:39:38,892 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-09 07:39:38,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:39:38,892 INFO L225 Difference]: With dead ends: 60 [2024-11-09 07:39:38,892 INFO L226 Difference]: Without dead ends: 60 [2024-11-09 07:39:38,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-09 07:39:38,893 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 13 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:39:38,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 250 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:39:38,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-09 07:39:38,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2024-11-09 07:39:38,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 53 states have internal predecessors, (53), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 07:39:38,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2024-11-09 07:39:38,904 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 17 [2024-11-09 07:39:38,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:39:38,904 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2024-11-09 07:39:38,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:39:38,906 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2024-11-09 07:39:38,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 07:39:38,906 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:39:38,906 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:39:38,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 07:39:38,907 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-09 07:39:38,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:39:38,907 INFO L85 PathProgramCache]: Analyzing trace with hash -2074527982, now seen corresponding path program 1 times [2024-11-09 07:39:38,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:39:38,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724975666] [2024-11-09 07:39:38,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:39:38,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:39:38,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:39,339 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:39:39,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:39:39,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724975666] [2024-11-09 07:39:39,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724975666] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:39:39,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845606503] [2024-11-09 07:39:39,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:39:39,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:39:39,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:39:39,342 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:39:39,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 07:39:39,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:39,415 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-09 07:39:39,421 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:39:39,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 07:39:39,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:39:39,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-09 07:39:39,696 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 07:39:39,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-09 07:39:39,781 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:39:39,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 07:39:40,108 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:39:40,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2024-11-09 07:39:40,226 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:39:40,226 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:39:40,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2024-11-09 07:39:40,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2024-11-09 07:39:41,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2024-11-09 07:39:41,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:39:41,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845606503] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:39:41,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:39:41,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 32 [2024-11-09 07:39:41,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665876527] [2024-11-09 07:39:41,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:39:41,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-09 07:39:41,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:39:41,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-09 07:39:41,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=952, Unknown=0, NotChecked=0, Total=1056 [2024-11-09 07:39:41,064 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand has 33 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 28 states have internal predecessors, (38), 6 states have call successors, (6), 5 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:39:41,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:39:41,956 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2024-11-09 07:39:41,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 07:39:41,956 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 28 states have internal predecessors, (38), 6 states have call successors, (6), 5 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-09 07:39:41,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:39:41,957 INFO L225 Difference]: With dead ends: 69 [2024-11-09 07:39:41,957 INFO L226 Difference]: Without dead ends: 69 [2024-11-09 07:39:41,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=191, Invalid=1531, Unknown=0, NotChecked=0, Total=1722 [2024-11-09 07:39:41,959 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 74 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:39:41,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 460 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 07:39:41,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-09 07:39:41,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2024-11-09 07:39:41,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 60 states have internal predecessors, (61), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 07:39:41,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2024-11-09 07:39:41,968 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 17 [2024-11-09 07:39:41,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:39:41,968 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2024-11-09 07:39:41,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 28 states have internal predecessors, (38), 6 states have call successors, (6), 5 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:39:41,968 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2024-11-09 07:39:41,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 07:39:41,969 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:39:41,969 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:39:41,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 07:39:42,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-09 07:39:42,170 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting rec_strcopy_helperErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-09 07:39:42,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:39:42,171 INFO L85 PathProgramCache]: Analyzing trace with hash 114141942, now seen corresponding path program 1 times [2024-11-09 07:39:42,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:39:42,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223914450] [2024-11-09 07:39:42,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:39:42,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:39:42,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:42,637 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:39:42,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:39:42,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223914450] [2024-11-09 07:39:42,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223914450] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:39:42,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965510632] [2024-11-09 07:39:42,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:39:42,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:39:42,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:39:42,640 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:39:42,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 07:39:42,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:42,713 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-09 07:39:42,722 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:39:42,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:39:42,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 07:39:42,848 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 07:39:42,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 18 [2024-11-09 07:39:42,868 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:39:42,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 07:39:43,253 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:39:43,254 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:39:43,745 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:39:43,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [965510632] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:39:43,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:39:43,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2024-11-09 07:39:43,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484668042] [2024-11-09 07:39:43,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:39:43,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-09 07:39:43,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:39:43,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-09 07:39:43,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=776, Unknown=0, NotChecked=0, Total=870 [2024-11-09 07:39:43,748 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand has 30 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 24 states have internal predecessors, (42), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:39:44,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:39:44,388 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2024-11-09 07:39:44,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 07:39:44,389 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 24 states have internal predecessors, (42), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-09 07:39:44,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:39:44,390 INFO L225 Difference]: With dead ends: 65 [2024-11-09 07:39:44,390 INFO L226 Difference]: Without dead ends: 65 [2024-11-09 07:39:44,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=191, Invalid=1291, Unknown=0, NotChecked=0, Total=1482 [2024-11-09 07:39:44,391 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 104 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:39:44,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 419 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:39:44,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-09 07:39:44,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-09 07:39:44,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 59 states have internal predecessors, (59), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 07:39:44,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2024-11-09 07:39:44,396 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 18 [2024-11-09 07:39:44,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:39:44,396 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2024-11-09 07:39:44,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 24 states have internal predecessors, (42), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:39:44,397 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2024-11-09 07:39:44,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 07:39:44,397 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:39:44,397 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:39:44,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 07:39:44,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-09 07:39:44,598 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-09 07:39:44,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:39:44,599 INFO L85 PathProgramCache]: Analyzing trace with hash 885260528, now seen corresponding path program 1 times [2024-11-09 07:39:44,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:39:44,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643830851] [2024-11-09 07:39:44,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:39:44,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:39:44,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:44,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 07:39:44,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:44,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:39:44,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:39:44,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643830851] [2024-11-09 07:39:44,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643830851] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:39:44,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:39:44,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:39:44,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166950666] [2024-11-09 07:39:44,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:39:44,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:39:44,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:39:44,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:39:44,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:39:44,655 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:39:44,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:39:44,675 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2024-11-09 07:39:44,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:39:44,676 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-11-09 07:39:44,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:39:44,677 INFO L225 Difference]: With dead ends: 64 [2024-11-09 07:39:44,677 INFO L226 Difference]: Without dead ends: 64 [2024-11-09 07:39:44,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:39:44,678 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 3 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:39:44,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 139 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:39:44,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-09 07:39:44,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-09 07:39:44,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 58 states have internal predecessors, (58), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 07:39:44,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2024-11-09 07:39:44,683 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 19 [2024-11-09 07:39:44,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:39:44,683 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2024-11-09 07:39:44,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:39:44,684 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2024-11-09 07:39:44,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 07:39:44,684 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:39:44,684 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:39:44,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 07:39:44,684 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-09 07:39:44,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:39:44,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1673272664, now seen corresponding path program 1 times [2024-11-09 07:39:44,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:39:44,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656633453] [2024-11-09 07:39:44,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:39:44,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:39:44,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:44,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 07:39:44,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:44,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:39:44,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:39:44,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656633453] [2024-11-09 07:39:44,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656633453] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:39:44,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:39:44,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:39:44,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928697702] [2024-11-09 07:39:44,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:39:44,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:39:44,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:39:44,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:39:44,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:39:44,754 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:39:44,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:39:44,802 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2024-11-09 07:39:44,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:39:44,803 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-11-09 07:39:44,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:39:44,803 INFO L225 Difference]: With dead ends: 63 [2024-11-09 07:39:44,803 INFO L226 Difference]: Without dead ends: 63 [2024-11-09 07:39:44,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:39:44,804 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 4 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:39:44,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 108 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:39:44,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-09 07:39:44,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-09 07:39:44,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 48 states have (on average 1.1875) internal successors, (57), 57 states have internal predecessors, (57), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 07:39:44,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2024-11-09 07:39:44,808 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 20 [2024-11-09 07:39:44,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:39:44,810 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2024-11-09 07:39:44,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:39:44,810 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2024-11-09 07:39:44,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 07:39:44,811 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:39:44,811 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:39:44,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 07:39:44,812 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-09 07:39:44,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:39:44,812 INFO L85 PathProgramCache]: Analyzing trace with hash 331845106, now seen corresponding path program 1 times [2024-11-09 07:39:44,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:39:44,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230377836] [2024-11-09 07:39:44,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:39:44,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:39:44,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:44,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 07:39:44,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:44,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:39:44,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:39:44,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230377836] [2024-11-09 07:39:44,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230377836] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:39:44,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:39:44,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:39:44,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408902611] [2024-11-09 07:39:44,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:39:44,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:39:44,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:39:44,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:39:44,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:39:44,898 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand has 8 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:39:44,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:39:44,973 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2024-11-09 07:39:44,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:39:44,973 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-11-09 07:39:44,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:39:44,974 INFO L225 Difference]: With dead ends: 62 [2024-11-09 07:39:44,974 INFO L226 Difference]: Without dead ends: 62 [2024-11-09 07:39:44,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:39:44,976 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 11 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:39:44,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 108 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:39:44,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-09 07:39:44,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-09 07:39:44,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 56 states have internal predecessors, (56), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 07:39:44,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2024-11-09 07:39:44,980 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 21 [2024-11-09 07:39:44,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:39:44,980 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2024-11-09 07:39:44,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:39:44,980 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2024-11-09 07:39:44,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 07:39:44,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:39:44,981 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:39:44,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 07:39:44,981 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-09 07:39:44,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:39:44,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1697263770, now seen corresponding path program 1 times [2024-11-09 07:39:44,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:39:44,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211963916] [2024-11-09 07:39:44,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:39:44,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:39:44,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:45,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 07:39:45,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:45,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:39:45,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:39:45,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211963916] [2024-11-09 07:39:45,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211963916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:39:45,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:39:45,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:39:45,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519284814] [2024-11-09 07:39:45,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:39:45,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:39:45,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:39:45,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:39:45,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:39:45,034 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:39:45,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:39:45,050 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2024-11-09 07:39:45,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:39:45,051 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2024-11-09 07:39:45,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:39:45,052 INFO L225 Difference]: With dead ends: 61 [2024-11-09 07:39:45,052 INFO L226 Difference]: Without dead ends: 61 [2024-11-09 07:39:45,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:39:45,053 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 3 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:39:45,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 128 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:39:45,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-09 07:39:45,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-09 07:39:45,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 55 states have internal predecessors, (55), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 07:39:45,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2024-11-09 07:39:45,056 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 22 [2024-11-09 07:39:45,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:39:45,057 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2024-11-09 07:39:45,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:39:45,057 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2024-11-09 07:39:45,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 07:39:45,058 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:39:45,058 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:39:45,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 07:39:45,058 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-09 07:39:45,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:39:45,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1413481378, now seen corresponding path program 2 times [2024-11-09 07:39:45,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:39:45,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108720503] [2024-11-09 07:39:45,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:39:45,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:39:45,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:45,782 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:39:45,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:39:45,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108720503] [2024-11-09 07:39:45,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108720503] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:39:45,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578895380] [2024-11-09 07:39:45,783 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:39:45,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:39:45,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:39:45,785 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:39:45,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 07:39:45,862 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 07:39:45,863 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:39:45,865 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-09 07:39:45,868 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:39:45,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-09 07:39:45,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-09 07:39:46,062 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-09 07:39:46,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 37 [2024-11-09 07:39:46,880 INFO L349 Elim1Store]: treesize reduction 4, result has 87.9 percent of original size [2024-11-09 07:39:46,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 39 [2024-11-09 07:39:47,247 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:39:47,247 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:39:48,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2024-11-09 07:39:48,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2024-11-09 07:39:48,337 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:39:48,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578895380] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:39:48,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:39:48,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 17] total 45 [2024-11-09 07:39:48,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671133791] [2024-11-09 07:39:48,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:39:48,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-09 07:39:48,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:39:48,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-09 07:39:48,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1905, Unknown=0, NotChecked=0, Total=2070 [2024-11-09 07:39:48,340 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand has 46 states, 37 states have (on average 1.5675675675675675) internal successors, (58), 37 states have internal predecessors, (58), 9 states have call successors, (9), 9 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:39:51,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:39:51,053 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2024-11-09 07:39:51,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-09 07:39:51,054 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 37 states have (on average 1.5675675675675675) internal successors, (58), 37 states have internal predecessors, (58), 9 states have call successors, (9), 9 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-09 07:39:51,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:39:51,055 INFO L225 Difference]: With dead ends: 96 [2024-11-09 07:39:51,055 INFO L226 Difference]: Without dead ends: 96 [2024-11-09 07:39:51,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 853 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=469, Invalid=3953, Unknown=0, NotChecked=0, Total=4422 [2024-11-09 07:39:51,058 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 234 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 07:39:51,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 590 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 921 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 07:39:51,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-09 07:39:51,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 88. [2024-11-09 07:39:51,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 69 states have (on average 1.144927536231884) internal successors, (79), 79 states have internal predecessors, (79), 8 states have call successors, (8), 7 states have call predecessors, (8), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 07:39:51,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2024-11-09 07:39:51,065 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 24 [2024-11-09 07:39:51,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:39:51,065 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2024-11-09 07:39:51,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 37 states have (on average 1.5675675675675675) internal successors, (58), 37 states have internal predecessors, (58), 9 states have call successors, (9), 9 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:39:51,066 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2024-11-09 07:39:51,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 07:39:51,067 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:39:51,067 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:39:51,085 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 07:39:51,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:39:51,272 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-09 07:39:51,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:39:51,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1075569396, now seen corresponding path program 1 times [2024-11-09 07:39:51,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:39:51,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544435845] [2024-11-09 07:39:51,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:39:51,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:39:51,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:51,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 07:39:51,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:51,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:39:51,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:39:51,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544435845] [2024-11-09 07:39:51,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544435845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:39:51,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:39:51,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:39:51,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761727942] [2024-11-09 07:39:51,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:39:51,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:39:51,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:39:51,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:39:51,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:39:51,334 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:39:51,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:39:51,367 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2024-11-09 07:39:51,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:39:51,367 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-11-09 07:39:51,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:39:51,368 INFO L225 Difference]: With dead ends: 87 [2024-11-09 07:39:51,368 INFO L226 Difference]: Without dead ends: 87 [2024-11-09 07:39:51,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:39:51,369 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 4 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:39:51,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 96 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:39:51,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-09 07:39:51,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-09 07:39:51,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 69 states have (on average 1.1304347826086956) internal successors, (78), 78 states have internal predecessors, (78), 8 states have call successors, (8), 7 states have call predecessors, (8), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 07:39:51,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2024-11-09 07:39:51,373 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 23 [2024-11-09 07:39:51,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:39:51,373 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2024-11-09 07:39:51,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:39:51,373 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2024-11-09 07:39:51,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 07:39:51,374 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:39:51,374 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:39:51,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 07:39:51,375 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-09 07:39:51,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:39:51,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1017087012, now seen corresponding path program 1 times [2024-11-09 07:39:51,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:39:51,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907182521] [2024-11-09 07:39:51,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:39:51,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:39:51,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:51,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 07:39:51,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:51,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:39:51,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:39:51,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907182521] [2024-11-09 07:39:51,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907182521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:39:51,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:39:51,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 07:39:51,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729642307] [2024-11-09 07:39:51,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:39:51,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:39:51,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:39:51,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:39:51,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:39:51,503 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:39:51,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:39:51,569 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2024-11-09 07:39:51,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:39:51,570 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2024-11-09 07:39:51,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:39:51,571 INFO L225 Difference]: With dead ends: 86 [2024-11-09 07:39:51,571 INFO L226 Difference]: Without dead ends: 86 [2024-11-09 07:39:51,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:39:51,571 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 3 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:39:51,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 104 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:39:51,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-09 07:39:51,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-09 07:39:51,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 69 states have (on average 1.1159420289855073) internal successors, (77), 77 states have internal predecessors, (77), 8 states have call successors, (8), 7 states have call predecessors, (8), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 07:39:51,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2024-11-09 07:39:51,575 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 24 [2024-11-09 07:39:51,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:39:51,575 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2024-11-09 07:39:51,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:39:51,575 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2024-11-09 07:39:51,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 07:39:51,576 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:39:51,576 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:39:51,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 07:39:51,577 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-09 07:39:51,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:39:51,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1464926217, now seen corresponding path program 1 times [2024-11-09 07:39:51,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:39:51,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837145146] [2024-11-09 07:39:51,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:39:51,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:39:51,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:51,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 07:39:51,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:51,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:39:51,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:39:51,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837145146] [2024-11-09 07:39:51,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837145146] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:39:51,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:39:51,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 07:39:51,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597537647] [2024-11-09 07:39:51,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:39:51,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 07:39:51,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:39:51,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 07:39:51,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:39:51,786 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:39:51,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:39:51,866 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2024-11-09 07:39:51,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:39:51,866 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2024-11-09 07:39:51,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:39:51,867 INFO L225 Difference]: With dead ends: 85 [2024-11-09 07:39:51,867 INFO L226 Difference]: Without dead ends: 51 [2024-11-09 07:39:51,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:39:51,868 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 4 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:39:51,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 111 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:39:51,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-09 07:39:51,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2024-11-09 07:39:51,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:39:51,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2024-11-09 07:39:51,870 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 25 [2024-11-09 07:39:51,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:39:51,870 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2024-11-09 07:39:51,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:39:51,870 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2024-11-09 07:39:51,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-09 07:39:51,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:39:51,872 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:39:51,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 07:39:51,872 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-09 07:39:51,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:39:51,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1253297390, now seen corresponding path program 3 times [2024-11-09 07:39:51,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:39:51,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949591215] [2024-11-09 07:39:51,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:39:51,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:39:51,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:53,259 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:39:53,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:39:53,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949591215] [2024-11-09 07:39:53,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949591215] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:39:53,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059432331] [2024-11-09 07:39:53,260 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 07:39:53,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:39:53,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:39:53,262 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:39:53,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 07:39:53,368 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-09 07:39:53,368 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:39:53,371 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 105 conjuncts are in the unsatisfiable core [2024-11-09 07:39:53,375 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:39:53,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 07:39:53,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:39:53,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-09 07:39:53,571 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:39:53,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 07:39:53,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:40:49,366 INFO L349 Elim1Store]: treesize reduction 16, result has 88.7 percent of original size [2024-11-09 07:40:49,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 50 treesize of output 147 [2024-11-09 07:40:49,883 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:40:49,883 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:40:54,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 56 [2024-11-09 07:40:54,888 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:40:54,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 106 treesize of output 176 [2024-11-09 07:40:59,482 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:40:59,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059432331] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:40:59,482 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:40:59,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 28, 28] total 75 [2024-11-09 07:40:59,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352105861] [2024-11-09 07:40:59,483 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:40:59,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2024-11-09 07:40:59,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:40:59,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2024-11-09 07:40:59,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=431, Invalid=5260, Unknown=9, NotChecked=0, Total=5700 [2024-11-09 07:40:59,485 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand has 76 states, 61 states have (on average 1.8360655737704918) internal successors, (112), 58 states have internal predecessors, (112), 18 states have call successors, (18), 18 states have call predecessors, (18), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)