./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/rec_strcopy_malloc.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/rec_strcopy_malloc.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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-dev-84cfde4 [2024-10-11 17:52:59,888 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:52:59,951 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-10-11 17:52:59,955 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:52:59,956 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:52:59,985 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:52:59,985 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:52:59,986 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:52:59,986 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 17:52:59,987 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 17:52:59,987 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:52:59,988 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:52:59,988 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:52:59,989 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:52:59,991 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:52:59,991 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:52:59,991 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:52:59,992 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:52:59,992 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 17:52:59,992 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 17:52:59,992 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 17:52:59,993 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:52:59,993 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 17:52:59,993 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:52:59,994 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:52:59,994 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:52:59,994 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:52:59,994 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:52:59,995 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 17:52:59,995 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:52:59,995 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:52:59,996 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:52:59,996 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:52:59,996 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:52:59,996 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:52:59,997 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:52:59,997 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:52:59,997 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:52:59,997 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:52:59,998 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-clean/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-clean/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-10-11 17:53:00,285 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:53:00,312 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:53:00,315 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:53:00,317 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:53:00,318 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:53:00,319 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/rec_strcopy_malloc.i [2024-10-11 17:53:01,704 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:53:01,911 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:53:01,912 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/rec_strcopy_malloc.i [2024-10-11 17:53:01,928 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c78df55cc/86053353b7544b35a60297237aad5c9c/FLAG9626a606d [2024-10-11 17:53:01,949 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c78df55cc/86053353b7544b35a60297237aad5c9c [2024-10-11 17:53:01,952 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:53:01,954 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:53:01,956 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:53:01,957 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:53:01,963 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:53:01,964 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:53:01" (1/1) ... [2024-10-11 17:53:01,966 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b376fe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:53:01, skipping insertion in model container [2024-10-11 17:53:01,966 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:53:01" (1/1) ... [2024-10-11 17:53:01,986 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:53:02,171 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:53:02,183 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:53:02,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:53:02,217 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:53:02,217 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:53:02 WrapperNode [2024-10-11 17:53:02,218 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:53:02,219 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:53:02,219 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:53:02,219 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:53:02,226 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:53:02" (1/1) ... [2024-10-11 17:53:02,234 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:53:02" (1/1) ... [2024-10-11 17:53:02,251 INFO L138 Inliner]: procedures = 13, calls = 14, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 39 [2024-10-11 17:53:02,252 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:53:02,253 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:53:02,254 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:53:02,254 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:53:02,263 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:53:02" (1/1) ... [2024-10-11 17:53:02,264 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:53:02" (1/1) ... [2024-10-11 17:53:02,269 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:53:02" (1/1) ... [2024-10-11 17:53:02,291 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-10-11 17:53:02,291 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:53:02" (1/1) ... [2024-10-11 17:53:02,291 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:53:02" (1/1) ... [2024-10-11 17:53:02,297 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:53:02" (1/1) ... [2024-10-11 17:53:02,302 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:53:02" (1/1) ... [2024-10-11 17:53:02,306 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:53:02" (1/1) ... [2024-10-11 17:53:02,308 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:53:02" (1/1) ... [2024-10-11 17:53:02,310 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:53:02,313 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:53:02,313 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:53:02,313 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:53:02,314 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:53:02" (1/1) ... [2024-10-11 17:53:02,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:53:02,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:53:02,347 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:53:02,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:53:02,397 INFO L130 BoogieDeclarations]: Found specification of procedure rec_strcopy_helper [2024-10-11 17:53:02,398 INFO L138 BoogieDeclarations]: Found implementation of procedure rec_strcopy_helper [2024-10-11 17:53:02,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 17:53:02,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 17:53:02,398 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 17:53:02,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:53:02,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:53:02,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 17:53:02,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 17:53:02,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 17:53:02,467 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:53:02,469 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:53:02,705 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2024-10-11 17:53:02,705 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:53:02,761 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:53:02,762 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 17:53:02,763 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:53:02 BoogieIcfgContainer [2024-10-11 17:53:02,763 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:53:02,764 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:53:02,765 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:53:02,768 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:53:02,769 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:53:01" (1/3) ... [2024-10-11 17:53:02,769 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e45f820 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:53:02, skipping insertion in model container [2024-10-11 17:53:02,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:53:02" (2/3) ... [2024-10-11 17:53:02,770 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e45f820 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:53:02, skipping insertion in model container [2024-10-11 17:53:02,771 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:53:02" (3/3) ... [2024-10-11 17:53:02,772 INFO L112 eAbstractionObserver]: Analyzing ICFG rec_strcopy_malloc.i [2024-10-11 17:53:02,789 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:53:02,789 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 15 error locations. [2024-10-11 17:53:02,835 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:53:02,841 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;@75180c6a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:53:02,841 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-10-11 17:53:02,844 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 18 states have (on average 1.9444444444444444) 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-10-11 17:53:02,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 17:53:02,849 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:53:02,850 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 17:53:02,850 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-10-11 17:53:02,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:53:02,856 INFO L85 PathProgramCache]: Analyzing trace with hash 2764734, now seen corresponding path program 1 times [2024-10-11 17:53:02,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:53:02,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960953308] [2024-10-11 17:53:02,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:53:02,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:53:02,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:03,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:53:03,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:53:03,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960953308] [2024-10-11 17:53:03,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960953308] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:53:03,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:53:03,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:53:03,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104168378] [2024-10-11 17:53:03,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:53:03,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:53:03,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:53:03,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:53:03,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:53:03,121 INFO L87 Difference]: Start difference. First operand has 37 states, 18 states have (on average 1.9444444444444444) 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) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-10-11 17:53:03,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:53:03,168 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2024-10-11 17:53:03,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:53:03,170 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2024-10-11 17:53:03,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:53:03,177 INFO L225 Difference]: With dead ends: 36 [2024-10-11 17:53:03,177 INFO L226 Difference]: Without dead ends: 35 [2024-10-11 17:53:03,180 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-10-11 17:53:03,185 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:53:03,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:53:03,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-11 17:53:03,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-10-11 17:53:03,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 32 states have internal predecessors, (33), 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-10-11 17:53:03,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2024-10-11 17:53:03,228 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 4 [2024-10-11 17:53:03,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:53:03,228 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2024-10-11 17:53:03,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-10-11 17:53:03,229 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2024-10-11 17:53:03,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 17:53:03,229 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:53:03,229 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 17:53:03,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:53:03,230 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-10-11 17:53:03,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:53:03,231 INFO L85 PathProgramCache]: Analyzing trace with hash 2764735, now seen corresponding path program 1 times [2024-10-11 17:53:03,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:53:03,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532889555] [2024-10-11 17:53:03,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:53:03,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:53:03,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:03,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-10-11 17:53:03,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:53:03,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532889555] [2024-10-11 17:53:03,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532889555] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:53:03,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:53:03,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:53:03,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136857644] [2024-10-11 17:53:03,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:53:03,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:53:03,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:53:03,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:53:03,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:53:03,460 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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-10-11 17:53:03,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:53:03,530 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2024-10-11 17:53:03,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:53:03,531 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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 4 [2024-10-11 17:53:03,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:53:03,531 INFO L225 Difference]: With dead ends: 37 [2024-10-11 17:53:03,532 INFO L226 Difference]: Without dead ends: 37 [2024-10-11 17:53:03,532 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-10-11 17:53:03,534 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 1 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:53:03,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 88 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:53:03,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-11 17:53:03,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-10-11 17:53:03,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 20 states have (on average 1.75) 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-10-11 17:53:03,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2024-10-11 17:53:03,545 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 4 [2024-10-11 17:53:03,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:53:03,546 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2024-10-11 17:53:03,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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-10-11 17:53:03,546 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2024-10-11 17:53:03,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 17:53:03,547 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:53:03,547 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 17:53:03,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:53:03,548 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-10-11 17:53:03,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:53:03,549 INFO L85 PathProgramCache]: Analyzing trace with hash 2766657, now seen corresponding path program 1 times [2024-10-11 17:53:03,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:53:03,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476894907] [2024-10-11 17:53:03,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:53:03,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:53:03,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:03,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:53:03,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:53:03,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476894907] [2024-10-11 17:53:03,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476894907] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:53:03,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:53:03,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:53:03,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960540147] [2024-10-11 17:53:03,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:53:03,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:53:03,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:53:03,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:53:03,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:53:03,749 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand has 5 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 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-10-11 17:53:03,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:53:03,812 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2024-10-11 17:53:03,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:53:03,813 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 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 4 [2024-10-11 17:53:03,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:53:03,814 INFO L225 Difference]: With dead ends: 36 [2024-10-11 17:53:03,814 INFO L226 Difference]: Without dead ends: 36 [2024-10-11 17:53:03,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 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-10-11 17:53:03,815 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 2 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:53:03,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 82 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:53:03,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-11 17:53:03,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2024-10-11 17:53:03,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 31 states have internal predecessors, (32), 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-10-11 17:53:03,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2024-10-11 17:53:03,821 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 4 [2024-10-11 17:53:03,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:53:03,822 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2024-10-11 17:53:03,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 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-10-11 17:53:03,822 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2024-10-11 17:53:03,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 17:53:03,823 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:53:03,823 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:53:03,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:53:03,824 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-10-11 17:53:03,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:53:03,824 INFO L85 PathProgramCache]: Analyzing trace with hash 760879643, now seen corresponding path program 1 times [2024-10-11 17:53:03,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:53:03,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088621379] [2024-10-11 17:53:03,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:53:03,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:53:03,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:04,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:53:04,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:53:04,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088621379] [2024-10-11 17:53:04,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088621379] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:53:04,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:53:04,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:53:04,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655869831] [2024-10-11 17:53:04,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:53:04,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:53:04,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:53:04,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:53:04,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:53:04,014 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand has 6 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 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-10-11 17:53:04,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:53:04,101 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2024-10-11 17:53:04,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:53:04,102 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 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 7 [2024-10-11 17:53:04,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:53:04,103 INFO L225 Difference]: With dead ends: 32 [2024-10-11 17:53:04,103 INFO L226 Difference]: Without dead ends: 32 [2024-10-11 17:53:04,104 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-10-11 17:53:04,105 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 19 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:53:04,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 70 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:53:04,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-11 17:53:04,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-11 17:53:04,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 29 states have internal predecessors, (30), 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-10-11 17:53:04,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2024-10-11 17:53:04,110 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 7 [2024-10-11 17:53:04,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:53:04,111 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2024-10-11 17:53:04,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 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-10-11 17:53:04,111 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2024-10-11 17:53:04,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 17:53:04,113 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:53:04,113 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:53:04,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:53:04,113 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-10-11 17:53:04,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:53:04,114 INFO L85 PathProgramCache]: Analyzing trace with hash 760879644, now seen corresponding path program 1 times [2024-10-11 17:53:04,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:53:04,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909985430] [2024-10-11 17:53:04,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:53:04,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:53:04,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:04,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:53:04,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:53:04,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909985430] [2024-10-11 17:53:04,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909985430] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:53:04,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:53:04,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 17:53:04,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548268556] [2024-10-11 17:53:04,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:53:04,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 17:53:04,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:53:04,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 17:53:04,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:53:04,317 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 7 states, 5 states have (on average 1.2) internal successors, (6), 6 states have internal predecessors, (6), 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-10-11 17:53:04,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:53:04,407 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2024-10-11 17:53:04,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 17:53:04,408 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.2) internal successors, (6), 6 states have internal predecessors, (6), 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 7 [2024-10-11 17:53:04,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:53:04,408 INFO L225 Difference]: With dead ends: 42 [2024-10-11 17:53:04,408 INFO L226 Difference]: Without dead ends: 42 [2024-10-11 17:53:04,409 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-10-11 17:53:04,410 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 17 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:53:04,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 125 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:53:04,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-11 17:53:04,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2024-10-11 17:53:04,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 24 states have (on average 1.625) internal successors, (39), 36 states have internal predecessors, (39), 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-10-11 17:53:04,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2024-10-11 17:53:04,422 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 7 [2024-10-11 17:53:04,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:53:04,422 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2024-10-11 17:53:04,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.2) internal successors, (6), 6 states have internal predecessors, (6), 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-10-11 17:53:04,422 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2024-10-11 17:53:04,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 17:53:04,423 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:53:04,423 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:53:04,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:53:04,423 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-10-11 17:53:04,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:53:04,424 INFO L85 PathProgramCache]: Analyzing trace with hash 2112432427, now seen corresponding path program 1 times [2024-10-11 17:53:04,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:53:04,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964285194] [2024-10-11 17:53:04,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:53:04,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:53:04,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:04,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:53:04,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:53:04,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964285194] [2024-10-11 17:53:04,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964285194] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:53:04,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:53:04,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:53:04,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137031763] [2024-10-11 17:53:04,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:53:04,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:53:04,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:53:04,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:53:04,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:53:04,495 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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-10-11 17:53:04,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:53:04,546 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2024-10-11 17:53:04,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:53:04,546 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 8 [2024-10-11 17:53:04,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:53:04,547 INFO L225 Difference]: With dead ends: 39 [2024-10-11 17:53:04,547 INFO L226 Difference]: Without dead ends: 39 [2024-10-11 17:53:04,547 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-10-11 17:53:04,548 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 17 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:53:04,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 58 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:53:04,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-11 17:53:04,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-10-11 17:53:04,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 35 states have internal predecessors, (37), 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-10-11 17:53:04,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2024-10-11 17:53:04,552 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 8 [2024-10-11 17:53:04,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:53:04,552 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2024-10-11 17:53:04,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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-10-11 17:53:04,553 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2024-10-11 17:53:04,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 17:53:04,553 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:53:04,553 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:53:04,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:53:04,553 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-10-11 17:53:04,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:53:04,554 INFO L85 PathProgramCache]: Analyzing trace with hash 2112432428, now seen corresponding path program 1 times [2024-10-11 17:53:04,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:53:04,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177260405] [2024-10-11 17:53:04,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:53:04,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:53:04,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:04,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:53:04,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:53:04,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177260405] [2024-10-11 17:53:04,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177260405] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:53:04,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:53:04,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:53:04,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501168317] [2024-10-11 17:53:04,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:53:04,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:53:04,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:53:04,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:53:04,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:53:04,690 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 6 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 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-10-11 17:53:04,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:53:04,767 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2024-10-11 17:53:04,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:53:04,768 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 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 8 [2024-10-11 17:53:04,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:53:04,769 INFO L225 Difference]: With dead ends: 51 [2024-10-11 17:53:04,769 INFO L226 Difference]: Without dead ends: 51 [2024-10-11 17:53:04,770 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-10-11 17:53:04,770 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 12 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 105 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-10-11 17:53:04,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 105 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:53:04,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-11 17:53:04,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2024-10-11 17:53:04,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 32 states have (on average 1.4375) internal successors, (46), 45 states have internal predecessors, (46), 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-10-11 17:53:04,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2024-10-11 17:53:04,782 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 8 [2024-10-11 17:53:04,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:53:04,782 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2024-10-11 17:53:04,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 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-10-11 17:53:04,782 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2024-10-11 17:53:04,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 17:53:04,783 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:53:04,783 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:53:04,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:53:04,783 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-10-11 17:53:04,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:53:04,784 INFO L85 PathProgramCache]: Analyzing trace with hash -407527506, now seen corresponding path program 1 times [2024-10-11 17:53:04,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:53:04,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905008844] [2024-10-11 17:53:04,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:53:04,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:53:04,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:04,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:53:04,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:53:04,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905008844] [2024-10-11 17:53:04,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905008844] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:53:04,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:53:04,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:53:04,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392632933] [2024-10-11 17:53:04,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:53:04,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 17:53:04,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:53:04,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 17:53:04,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:53:04,913 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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-10-11 17:53:04,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:53:04,979 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2024-10-11 17:53:04,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 17:53:04,980 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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 8 [2024-10-11 17:53:04,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:53:04,981 INFO L225 Difference]: With dead ends: 50 [2024-10-11 17:53:04,981 INFO L226 Difference]: Without dead ends: 50 [2024-10-11 17:53:04,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 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-10-11 17:53:04,983 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 12 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 93 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-10-11 17:53:04,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 93 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:53:04,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-11 17:53:04,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 39. [2024-10-11 17:53:04,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 24 states have (on average 1.5) internal successors, (36), 35 states have internal predecessors, (36), 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-10-11 17:53:04,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2024-10-11 17:53:04,993 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 8 [2024-10-11 17:53:04,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:53:04,993 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2024-10-11 17:53:04,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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-10-11 17:53:04,994 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2024-10-11 17:53:04,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 17:53:04,994 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:53:04,994 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:53:04,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:53:04,994 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-10-11 17:53:04,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:53:04,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1751514772, now seen corresponding path program 1 times [2024-10-11 17:53:04,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:53:04,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045597090] [2024-10-11 17:53:04,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:53:04,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:53:05,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:05,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:53:05,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:53:05,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045597090] [2024-10-11 17:53:05,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045597090] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:53:05,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:53:05,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 17:53:05,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987071846] [2024-10-11 17:53:05,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:53:05,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 17:53:05,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:53:05,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 17:53:05,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:53:05,212 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 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-10-11 17:53:05,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:53:05,301 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2024-10-11 17:53:05,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 17:53:05,302 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 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 13 [2024-10-11 17:53:05,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:53:05,303 INFO L225 Difference]: With dead ends: 50 [2024-10-11 17:53:05,303 INFO L226 Difference]: Without dead ends: 50 [2024-10-11 17:53:05,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-11 17:53:05,304 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 10 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:53:05,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 155 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:53:05,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-11 17:53:05,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2024-10-11 17:53:05,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.375) internal successors, (44), 44 states have internal predecessors, (44), 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-10-11 17:53:05,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2024-10-11 17:53:05,309 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 13 [2024-10-11 17:53:05,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:53:05,310 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2024-10-11 17:53:05,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 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-10-11 17:53:05,310 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2024-10-11 17:53:05,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 17:53:05,311 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:53:05,311 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:53:05,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:53:05,312 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-10-11 17:53:05,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:53:05,312 INFO L85 PathProgramCache]: Analyzing trace with hash 2009680210, now seen corresponding path program 1 times [2024-10-11 17:53:05,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:53:05,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794295952] [2024-10-11 17:53:05,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:53:05,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:53:05,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:05,621 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:53:05,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:53:05,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794295952] [2024-10-11 17:53:05,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794295952] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:53:05,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725478347] [2024-10-11 17:53:05,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:53:05,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:53:05,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:53:05,624 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:53:05,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 17:53:05,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:05,695 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-10-11 17:53:05,708 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:53:05,784 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-10-11 17:53:05,787 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-10-11 17:53:05,853 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-10-11 17:53:05,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 17:53:05,864 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-10-11 17:53:05,895 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 17:53:05,896 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-10-11 17:53:06,172 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:53:06,172 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-10-11 17:53:06,298 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:53:06,298 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:53:06,679 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-10-11 17:53:06,688 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-10-11 17:53:06,882 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-10-11 17:53:06,899 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:53:06,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725478347] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:53:06,900 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:53:06,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 26 [2024-10-11 17:53:06,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287499961] [2024-10-11 17:53:06,900 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:53:06,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-11 17:53:06,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:53:06,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-11 17:53:06,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=615, Unknown=0, NotChecked=0, Total=702 [2024-10-11 17:53:06,901 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand has 27 states, 20 states have (on average 1.4) internal successors, (28), 22 states have internal predecessors, (28), 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-10-11 17:53:07,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:53:07,505 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2024-10-11 17:53:07,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 17:53:07,506 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 20 states have (on average 1.4) internal successors, (28), 22 states have internal predecessors, (28), 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 13 [2024-10-11 17:53:07,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:53:07,506 INFO L225 Difference]: With dead ends: 59 [2024-10-11 17:53:07,506 INFO L226 Difference]: Without dead ends: 59 [2024-10-11 17:53:07,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=161, Invalid=961, Unknown=0, NotChecked=0, Total=1122 [2024-10-11 17:53:07,507 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 70 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 17:53:07,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 318 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 17:53:07,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-11 17:53:07,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2024-10-11 17:53:07,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 50 states have internal predecessors, (51), 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-10-11 17:53:07,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2024-10-11 17:53:07,513 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 13 [2024-10-11 17:53:07,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:53:07,513 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2024-10-11 17:53:07,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 20 states have (on average 1.4) internal successors, (28), 22 states have internal predecessors, (28), 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-10-11 17:53:07,514 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2024-10-11 17:53:07,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 17:53:07,514 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:53:07,514 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:53:07,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 17:53:07,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 17:53:07,720 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-10-11 17:53:07,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:53:07,720 INFO L85 PathProgramCache]: Analyzing trace with hash -2124422986, now seen corresponding path program 1 times [2024-10-11 17:53:07,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:53:07,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833984139] [2024-10-11 17:53:07,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:53:07,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:53:07,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:08,095 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:53:08,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:53:08,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833984139] [2024-10-11 17:53:08,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833984139] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:53:08,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867527544] [2024-10-11 17:53:08,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:53:08,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:53:08,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:53:08,098 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:53:08,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 17:53:08,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:08,161 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-10-11 17:53:08,163 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:53:08,171 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-10-11 17:53:08,225 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-11 17:53:08,225 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 19 treesize of output 17 [2024-10-11 17:53:08,543 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:53:08,543 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:53:08,875 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:53:08,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867527544] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:53:08,876 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:53:08,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 24 [2024-10-11 17:53:08,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943812483] [2024-10-11 17:53:08,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:53:08,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-11 17:53:08,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:53:08,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-11 17:53:08,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2024-10-11 17:53:08,879 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 25 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 19 states have internal predecessors, (32), 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-10-11 17:53:09,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:53:09,316 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2024-10-11 17:53:09,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 17:53:09,317 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 19 states have internal predecessors, (32), 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 14 [2024-10-11 17:53:09,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:53:09,317 INFO L225 Difference]: With dead ends: 55 [2024-10-11 17:53:09,318 INFO L226 Difference]: Without dead ends: 55 [2024-10-11 17:53:09,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=168, Invalid=888, Unknown=0, NotChecked=0, Total=1056 [2024-10-11 17:53:09,319 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 115 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:53:09,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 266 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:53:09,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-11 17:53:09,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-10-11 17:53:09,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 49 states have internal predecessors, (49), 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-10-11 17:53:09,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2024-10-11 17:53:09,329 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 14 [2024-10-11 17:53:09,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:53:09,329 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2024-10-11 17:53:09,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 19 states have internal predecessors, (32), 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-10-11 17:53:09,330 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2024-10-11 17:53:09,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 17:53:09,330 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:53:09,330 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:53:09,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 17:53:09,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:53:09,535 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-10-11 17:53:09,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:53:09,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1535890983, now seen corresponding path program 1 times [2024-10-11 17:53:09,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:53:09,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141430210] [2024-10-11 17:53:09,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:53:09,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:53:09,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:09,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 17:53:09,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:09,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:53:09,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:53:09,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141430210] [2024-10-11 17:53:09,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141430210] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:53:09,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:53:09,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:53:09,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418248259] [2024-10-11 17:53:09,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:53:09,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:53:09,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:53:09,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:53:09,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:53:09,607 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-10-11 17:53:09,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:53:09,626 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2024-10-11 17:53:09,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:53:09,626 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 14 [2024-10-11 17:53:09,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:53:09,627 INFO L225 Difference]: With dead ends: 54 [2024-10-11 17:53:09,627 INFO L226 Difference]: Without dead ends: 54 [2024-10-11 17:53:09,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:53:09,628 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 3 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:53:09,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 93 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:53:09,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-11 17:53:09,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-10-11 17:53:09,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 38 states have (on average 1.263157894736842) internal successors, (48), 48 states have internal predecessors, (48), 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-10-11 17:53:09,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2024-10-11 17:53:09,635 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 14 [2024-10-11 17:53:09,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:53:09,635 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2024-10-11 17:53:09,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-10-11 17:53:09,636 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2024-10-11 17:53:09,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 17:53:09,638 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:53:09,638 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:53:09,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 17:53:09,639 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-10-11 17:53:09,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:53:09,639 INFO L85 PathProgramCache]: Analyzing trace with hash -367980145, now seen corresponding path program 1 times [2024-10-11 17:53:09,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:53:09,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044179440] [2024-10-11 17:53:09,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:53:09,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:53:09,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:09,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 17:53:09,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:09,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:53:09,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:53:09,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044179440] [2024-10-11 17:53:09,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044179440] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:53:09,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:53:09,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:53:09,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505236572] [2024-10-11 17:53:09,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:53:09,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:53:09,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:53:09,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:53:09,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:53:09,688 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-10-11 17:53:09,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:53:09,713 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2024-10-11 17:53:09,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:53:09,713 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 15 [2024-10-11 17:53:09,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:53:09,714 INFO L225 Difference]: With dead ends: 53 [2024-10-11 17:53:09,714 INFO L226 Difference]: Without dead ends: 53 [2024-10-11 17:53:09,714 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:53:09,716 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:53:09,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 72 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:53:09,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-10-11 17:53:09,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-10-11 17:53:09,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 38 states have (on average 1.236842105263158) internal successors, (47), 47 states have internal predecessors, (47), 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-10-11 17:53:09,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2024-10-11 17:53:09,722 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 15 [2024-10-11 17:53:09,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:53:09,722 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2024-10-11 17:53:09,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-10-11 17:53:09,723 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2024-10-11 17:53:09,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 17:53:09,723 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:53:09,725 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:53:09,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 17:53:09,725 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-10-11 17:53:09,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:53:09,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1477517467, now seen corresponding path program 1 times [2024-10-11 17:53:09,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:53:09,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757346926] [2024-10-11 17:53:09,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:53:09,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:53:09,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:09,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 17:53:09,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:09,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:53:09,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:53:09,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757346926] [2024-10-11 17:53:09,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757346926] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:53:09,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:53:09,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 17:53:09,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081376908] [2024-10-11 17:53:09,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:53:09,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 17:53:09,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:53:09,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 17:53:09,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:53:09,821 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 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-10-11 17:53:09,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:53:09,893 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2024-10-11 17:53:09,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 17:53:09,894 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 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 16 [2024-10-11 17:53:09,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:53:09,894 INFO L225 Difference]: With dead ends: 52 [2024-10-11 17:53:09,894 INFO L226 Difference]: Without dead ends: 52 [2024-10-11 17:53:09,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-10-11 17:53:09,895 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 8 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:53:09,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 79 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:53:09,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-11 17:53:09,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-11 17:53:09,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 46 states have internal predecessors, (46), 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-10-11 17:53:09,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2024-10-11 17:53:09,901 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 16 [2024-10-11 17:53:09,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:53:09,901 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2024-10-11 17:53:09,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 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-10-11 17:53:09,902 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2024-10-11 17:53:09,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 17:53:09,902 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:53:09,902 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:53:09,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 17:53:09,902 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-10-11 17:53:09,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:53:09,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1441598703, now seen corresponding path program 1 times [2024-10-11 17:53:09,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:53:09,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668889167] [2024-10-11 17:53:09,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:53:09,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:53:09,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:09,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 17:53:09,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:09,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:53:09,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:53:09,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668889167] [2024-10-11 17:53:09,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668889167] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:53:09,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:53:09,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:53:09,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512218110] [2024-10-11 17:53:09,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:53:09,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:53:09,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:53:09,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:53:09,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:53:09,949 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-10-11 17:53:09,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:53:09,962 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2024-10-11 17:53:09,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:53:09,963 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 17 [2024-10-11 17:53:09,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:53:09,964 INFO L225 Difference]: With dead ends: 51 [2024-10-11 17:53:09,964 INFO L226 Difference]: Without dead ends: 51 [2024-10-11 17:53:09,964 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:53:09,965 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 3 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:53:09,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 79 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:53:09,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-11 17:53:09,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-10-11 17:53:09,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 45 states have internal predecessors, (45), 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-10-11 17:53:09,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2024-10-11 17:53:09,968 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 17 [2024-10-11 17:53:09,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:53:09,968 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2024-10-11 17:53:09,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-10-11 17:53:09,972 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2024-10-11 17:53:09,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 17:53:09,973 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:53:09,973 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-11 17:53:09,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 17:53:09,974 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-10-11 17:53:09,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:53:09,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1359375690, now seen corresponding path program 2 times [2024-10-11 17:53:09,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:53:09,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837269492] [2024-10-11 17:53:09,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:53:09,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:53:09,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:10,592 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:53:10,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:53:10,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837269492] [2024-10-11 17:53:10,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837269492] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:53:10,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245137180] [2024-10-11 17:53:10,593 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 17:53:10,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:53:10,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:53:10,595 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:53:10,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 17:53:10,670 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 17:53:10,671 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:53:10,673 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-10-11 17:53:10,675 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:53:10,705 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-10-11 17:53:10,761 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-11 17:53:10,761 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 47 treesize of output 41 [2024-10-11 17:53:10,769 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 19 treesize of output 15 [2024-10-11 17:53:11,550 INFO L349 Elim1Store]: treesize reduction 4, result has 87.9 percent of original size [2024-10-11 17:53:11,550 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-10-11 17:53:11,899 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:53:11,900 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:53:12,584 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-10-11 17:53:12,592 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-10-11 17:53:12,732 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:53:12,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245137180] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:53:12,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:53:12,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 15] total 39 [2024-10-11 17:53:12,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872958916] [2024-10-11 17:53:12,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:53:12,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-10-11 17:53:12,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:53:12,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-10-11 17:53:12,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1408, Unknown=0, NotChecked=0, Total=1560 [2024-10-11 17:53:12,736 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand has 40 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 31 states have internal predecessors, (45), 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-10-11 17:53:14,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:53:14,815 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2024-10-11 17:53:14,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-11 17:53:14,815 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 31 states have internal predecessors, (45), 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 19 [2024-10-11 17:53:14,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:53:14,816 INFO L225 Difference]: With dead ends: 83 [2024-10-11 17:53:14,816 INFO L226 Difference]: Without dead ends: 83 [2024-10-11 17:53:14,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=408, Invalid=2898, Unknown=0, NotChecked=0, Total=3306 [2024-10-11 17:53:14,818 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 190 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 17:53:14,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 374 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 17:53:14,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-11 17:53:14,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 75. [2024-10-11 17:53:14,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 56 states have (on average 1.1785714285714286) internal successors, (66), 66 states have internal predecessors, (66), 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-10-11 17:53:14,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2024-10-11 17:53:14,822 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 19 [2024-10-11 17:53:14,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:53:14,822 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2024-10-11 17:53:14,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 31 states have internal predecessors, (45), 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-10-11 17:53:14,823 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2024-10-11 17:53:14,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 17:53:14,823 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:53:14,823 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:53:14,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 17:53:15,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:53:15,028 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-10-11 17:53:15,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:53:15,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1739886755, now seen corresponding path program 1 times [2024-10-11 17:53:15,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:53:15,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678348264] [2024-10-11 17:53:15,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:53:15,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:53:15,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:15,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 17:53:15,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:15,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:53:15,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:53:15,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678348264] [2024-10-11 17:53:15,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678348264] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:53:15,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:53:15,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:53:15,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687068953] [2024-10-11 17:53:15,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:53:15,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:53:15,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:53:15,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:53:15,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:53:15,084 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-10-11 17:53:15,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:53:15,110 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2024-10-11 17:53:15,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:53:15,110 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 18 [2024-10-11 17:53:15,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:53:15,112 INFO L225 Difference]: With dead ends: 74 [2024-10-11 17:53:15,112 INFO L226 Difference]: Without dead ends: 74 [2024-10-11 17:53:15,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:53:15,113 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 4 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:53:15,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 58 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:53:15,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-11 17:53:15,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-10-11 17:53:15,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 65 states have internal predecessors, (65), 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-10-11 17:53:15,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2024-10-11 17:53:15,118 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 18 [2024-10-11 17:53:15,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:53:15,118 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2024-10-11 17:53:15,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-10-11 17:53:15,118 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2024-10-11 17:53:15,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 17:53:15,119 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:53:15,119 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-10-11 17:53:15,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 17:53:15,123 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-10-11 17:53:15,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:53:15,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1898085523, now seen corresponding path program 1 times [2024-10-11 17:53:15,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:53:15,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962132919] [2024-10-11 17:53:15,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:53:15,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:53:15,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:15,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 17:53:15,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:15,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:53:15,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:53:15,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962132919] [2024-10-11 17:53:15,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962132919] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:53:15,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:53:15,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:53:15,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898756383] [2024-10-11 17:53:15,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:53:15,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:53:15,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:53:15,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:53:15,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:53:15,209 INFO L87 Difference]: Start difference. First operand 74 states and 81 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-10-11 17:53:15,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:53:15,247 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2024-10-11 17:53:15,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:53:15,248 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-10-11 17:53:15,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:53:15,248 INFO L225 Difference]: With dead ends: 73 [2024-10-11 17:53:15,248 INFO L226 Difference]: Without dead ends: 73 [2024-10-11 17:53:15,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:53:15,249 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 3 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:53:15,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 59 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:53:15,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-11 17:53:15,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-10-11 17:53:15,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 64 states have internal predecessors, (64), 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-10-11 17:53:15,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2024-10-11 17:53:15,253 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 19 [2024-10-11 17:53:15,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:53:15,253 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2024-10-11 17:53:15,253 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-10-11 17:53:15,253 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2024-10-11 17:53:15,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 17:53:15,254 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:53:15,254 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-10-11 17:53:15,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 17:53:15,254 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-10-11 17:53:15,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:53:15,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1288890848, now seen corresponding path program 1 times [2024-10-11 17:53:15,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:53:15,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326747566] [2024-10-11 17:53:15,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:53:15,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:53:15,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:15,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 17:53:15,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:15,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:53:15,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:53:15,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326747566] [2024-10-11 17:53:15,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326747566] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:53:15,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:53:15,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 17:53:15,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551127223] [2024-10-11 17:53:15,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:53:15,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 17:53:15,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:53:15,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 17:53:15,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:53:15,399 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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-10-11 17:53:15,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:53:15,447 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2024-10-11 17:53:15,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 17:53:15,448 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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-10-11 17:53:15,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:53:15,448 INFO L225 Difference]: With dead ends: 72 [2024-10-11 17:53:15,448 INFO L226 Difference]: Without dead ends: 42 [2024-10-11 17:53:15,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:53:15,449 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 4 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:53:15,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 76 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:53:15,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-11 17:53:15,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2024-10-11 17:53:15,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 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-10-11 17:53:15,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2024-10-11 17:53:15,450 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 20 [2024-10-11 17:53:15,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:53:15,450 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2024-10-11 17:53:15,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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-10-11 17:53:15,451 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2024-10-11 17:53:15,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-11 17:53:15,453 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:53:15,453 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2024-10-11 17:53:15,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 17:53:15,454 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-10-11 17:53:15,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:53:15,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1935753934, now seen corresponding path program 3 times [2024-10-11 17:53:15,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:53:15,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737014170] [2024-10-11 17:53:15,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:53:15,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:53:15,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:16,501 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:53:16,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:53:16,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737014170] [2024-10-11 17:53:16,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737014170] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:53:16,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357747776] [2024-10-11 17:53:16,502 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 17:53:16,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:53:16,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:53:16,503 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:53:16,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 17:53:16,615 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-11 17:53:16,616 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:53:16,619 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 115 conjuncts are in the unsatisfiable core [2024-10-11 17:53:16,622 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:53:16,637 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-10-11 17:53:16,682 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 13 treesize of output 9 [2024-10-11 17:53:16,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 17:53:16,687 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 14 treesize of output 9 [2024-10-11 17:53:16,694 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 17:53:16,694 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-10-11 17:53:18,086 INFO L349 Elim1Store]: treesize reduction 16, result has 61.0 percent of original size [2024-10-11 17:53:18,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 49 treesize of output 47 [2024-10-11 17:53:18,281 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:53:18,281 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:53:19,872 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 29 treesize of output 25 [2024-10-11 17:53:19,888 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 74 treesize of output 64 [2024-10-11 17:53:19,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 56 [2024-10-11 17:53:20,005 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:53:20,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357747776] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:53:20,006 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:53:20,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 26, 26] total 67 [2024-10-11 17:53:20,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559351917] [2024-10-11 17:53:20,006 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:53:20,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2024-10-11 17:53:20,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:53:20,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2024-10-11 17:53:20,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=4205, Unknown=0, NotChecked=0, Total=4556 [2024-10-11 17:53:20,009 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand has 68 states, 53 states have (on average 1.679245283018868) internal successors, (89), 50 states have internal predecessors, (89), 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) [2024-10-11 17:53:23,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:53:23,349 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2024-10-11 17:53:23,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-10-11 17:53:23,349 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 53 states have (on average 1.679245283018868) internal successors, (89), 50 states have internal predecessors, (89), 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) Word has length 37 [2024-10-11 17:53:23,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:53:23,350 INFO L225 Difference]: With dead ends: 72 [2024-10-11 17:53:23,350 INFO L226 Difference]: Without dead ends: 72 [2024-10-11 17:53:23,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2021 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1133, Invalid=10209, Unknown=0, NotChecked=0, Total=11342 [2024-10-11 17:53:23,352 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 248 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 1546 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 1551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 17:53:23,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 62 Invalid, 1551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1546 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 17:53:23,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-11 17:53:23,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2024-10-11 17:53:23,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 11 states have call successors, (11), 11 states have call predecessors, (11), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:53:23,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2024-10-11 17:53:23,355 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 37 [2024-10-11 17:53:23,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:53:23,355 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2024-10-11 17:53:23,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 53 states have (on average 1.679245283018868) internal successors, (89), 50 states have internal predecessors, (89), 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) [2024-10-11 17:53:23,355 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2024-10-11 17:53:23,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-11 17:53:23,356 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:53:23,356 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2024-10-11 17:53:23,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 17:53:23,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:53:23,561 INFO L396 AbstractCegarLoop]: === Iteration 21 === 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-10-11 17:53:23,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:53:23,561 INFO L85 PathProgramCache]: Analyzing trace with hash -135863030, now seen corresponding path program 4 times [2024-10-11 17:53:23,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:53:23,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433420730] [2024-10-11 17:53:23,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:53:23,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:53:23,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:26,444 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 0 proven. 290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:53:26,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:53:26,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433420730] [2024-10-11 17:53:26,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433420730] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:53:26,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055832057] [2024-10-11 17:53:26,446 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 17:53:26,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:53:26,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:53:26,448 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:53:26,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 17:53:26,613 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 17:53:26,613 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:53:26,617 INFO L255 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 178 conjuncts are in the unsatisfiable core [2024-10-11 17:53:26,621 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:53:26,653 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-10-11 17:53:26,721 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-11 17:53:26,722 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 47 treesize of output 41 [2024-10-11 17:53:26,731 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 19 treesize of output 15 [2024-10-11 17:53:32,274 INFO L349 Elim1Store]: treesize reduction 36, result has 74.5 percent of original size [2024-10-11 17:53:32,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 113 treesize of output 147 [2024-10-11 17:53:32,282 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts.