./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-broom/sll-nested-sll-lst-data.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-broom/sll-nested-sll-lst-data.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 6c22cd9939cf4e0054fcfe90f9b6c0796fdde4127b9efff81228419797dcb062 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:49:11,421 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:49:11,474 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-03-04 07:49:11,479 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:49:11,480 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:49:11,496 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:49:11,496 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:49:11,497 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:49:11,497 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:49:11,497 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:49:11,497 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:49:11,497 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:49:11,497 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:49:11,497 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:49:11,497 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:49:11,497 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:49:11,497 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:49:11,497 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:49:11,497 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:49:11,497 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:49:11,497 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 07:49:11,498 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:49:11,498 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:49:11,498 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:49:11,498 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:49:11,498 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:49:11,498 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:49:11,498 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:49:11,498 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:49:11,498 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:49:11,498 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:49:11,498 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:49:11,498 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:49:11,498 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 07:49:11,498 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 07:49:11,498 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:49:11,498 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:49:11,499 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:49:11,499 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:49:11,499 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6c22cd9939cf4e0054fcfe90f9b6c0796fdde4127b9efff81228419797dcb062 [2025-03-04 07:49:11,711 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:49:11,717 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:49:11,720 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:49:11,721 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:49:11,721 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:49:11,722 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-broom/sll-nested-sll-lst-data.i [2025-03-04 07:49:12,832 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ec0dfcee/32f6fbf73378484cb94a745c50f35f73/FLAGfd3a3e505 [2025-03-04 07:49:13,112 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:49:13,112 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-nested-sll-lst-data.i [2025-03-04 07:49:13,137 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ec0dfcee/32f6fbf73378484cb94a745c50f35f73/FLAGfd3a3e505 [2025-03-04 07:49:13,395 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ec0dfcee/32f6fbf73378484cb94a745c50f35f73 [2025-03-04 07:49:13,398 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:49:13,400 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:49:13,402 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:49:13,403 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:49:13,406 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:49:13,407 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:49:13" (1/1) ... [2025-03-04 07:49:13,408 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76b6c844 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:49:13, skipping insertion in model container [2025-03-04 07:49:13,409 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:49:13" (1/1) ... [2025-03-04 07:49:13,446 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:49:13,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:49:13,674 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:49:13,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:49:13,741 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:49:13,742 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:49:13 WrapperNode [2025-03-04 07:49:13,742 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:49:13,743 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:49:13,743 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:49:13,743 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:49:13,747 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:49:13" (1/1) ... [2025-03-04 07:49:13,754 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:49:13" (1/1) ... [2025-03-04 07:49:13,766 INFO L138 Inliner]: procedures = 125, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 78 [2025-03-04 07:49:13,766 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:49:13,767 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:49:13,767 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:49:13,767 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:49:13,772 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:49:13" (1/1) ... [2025-03-04 07:49:13,772 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:49:13" (1/1) ... [2025-03-04 07:49:13,775 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:49:13" (1/1) ... [2025-03-04 07:49:13,791 INFO L175 MemorySlicer]: Split 19 memory accesses to 1 slices as follows [19]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 9 writes are split as follows [9]. [2025-03-04 07:49:13,791 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:49:13" (1/1) ... [2025-03-04 07:49:13,791 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:49:13" (1/1) ... [2025-03-04 07:49:13,801 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:49:13" (1/1) ... [2025-03-04 07:49:13,803 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:49:13" (1/1) ... [2025-03-04 07:49:13,804 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:49:13" (1/1) ... [2025-03-04 07:49:13,804 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:49:13" (1/1) ... [2025-03-04 07:49:13,806 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:49:13,811 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:49:13,811 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:49:13,811 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:49:13,812 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:49:13" (1/1) ... [2025-03-04 07:49:13,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:49:13,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:13,840 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 07:49:13,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 07:49:13,864 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero_internal [2025-03-04 07:49:13,865 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero_internal [2025-03-04 07:49:13,865 INFO L130 BoogieDeclarations]: Found specification of procedure create_internal [2025-03-04 07:49:13,865 INFO L138 BoogieDeclarations]: Found implementation of procedure create_internal [2025-03-04 07:49:13,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 07:49:13,865 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2025-03-04 07:49:13,865 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2025-03-04 07:49:13,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 07:49:13,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 07:49:13,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 07:49:13,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:49:13,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:49:13,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:49:13,964 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:49:13,966 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:49:14,299 INFO L? ?]: Removed 127 outVars from TransFormulas that were not future-live. [2025-03-04 07:49:14,300 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:49:14,310 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:49:14,310 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:49:14,310 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:49:14 BoogieIcfgContainer [2025-03-04 07:49:14,310 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:49:14,313 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:49:14,313 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:49:14,316 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:49:14,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:49:13" (1/3) ... [2025-03-04 07:49:14,318 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c870659 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:49:14, skipping insertion in model container [2025-03-04 07:49:14,319 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:49:13" (2/3) ... [2025-03-04 07:49:14,319 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c870659 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:49:14, skipping insertion in model container [2025-03-04 07:49:14,319 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:49:14" (3/3) ... [2025-03-04 07:49:14,320 INFO L128 eAbstractionObserver]: Analyzing ICFG sll-nested-sll-lst-data.i [2025-03-04 07:49:14,330 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:49:14,331 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll-nested-sll-lst-data.i that has 4 procedures, 124 locations, 1 initial locations, 6 loop locations, and 45 error locations. [2025-03-04 07:49:14,359 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:49:14,370 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;@43af39e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:49:14,370 INFO L334 AbstractCegarLoop]: Starting to check reachability of 45 error locations. [2025-03-04 07:49:14,373 INFO L276 IsEmpty]: Start isEmpty. Operand has 124 states, 69 states have (on average 1.7681159420289856) internal successors, (122), 114 states have internal predecessors, (122), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 07:49:14,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 07:49:14,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:14,378 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 07:49:14,379 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-03-04 07:49:14,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:14,382 INFO L85 PathProgramCache]: Analyzing trace with hash 117388294, now seen corresponding path program 1 times [2025-03-04 07:49:14,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:14,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78075604] [2025-03-04 07:49:14,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:14,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:14,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 07:49:14,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 07:49:14,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:14,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:14,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:14,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:14,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78075604] [2025-03-04 07:49:14,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78075604] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:14,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:14,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:49:14,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199831413] [2025-03-04 07:49:14,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:14,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:49:14,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:14,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:49:14,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:49:14,545 INFO L87 Difference]: Start difference. First operand has 124 states, 69 states have (on average 1.7681159420289856) internal successors, (122), 114 states have internal predecessors, (122), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2025-03-04 07:49:14,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:14,635 INFO L93 Difference]: Finished difference Result 122 states and 130 transitions. [2025-03-04 07:49:14,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:49:14,637 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), 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 5 [2025-03-04 07:49:14,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:14,642 INFO L225 Difference]: With dead ends: 122 [2025-03-04 07:49:14,642 INFO L226 Difference]: Without dead ends: 120 [2025-03-04 07:49:14,644 INFO L434 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 [2025-03-04 07:49:14,647 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 2 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:14,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 206 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:49:14,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-04 07:49:14,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-03-04 07:49:14,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 68 states have (on average 1.7058823529411764) internal successors, (116), 110 states have internal predecessors, (116), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 07:49:14,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2025-03-04 07:49:14,701 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 5 [2025-03-04 07:49:14,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:14,702 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2025-03-04 07:49:14,702 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), 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) [2025-03-04 07:49:14,702 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2025-03-04 07:49:14,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 07:49:14,702 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:14,702 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 07:49:14,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 07:49:14,703 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting alloc_and_zeroErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-03-04 07:49:14,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:14,704 INFO L85 PathProgramCache]: Analyzing trace with hash 117388295, now seen corresponding path program 1 times [2025-03-04 07:49:14,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:14,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717158370] [2025-03-04 07:49:14,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:14,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:14,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 07:49:14,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 07:49:14,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:14,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:14,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:14,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:14,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717158370] [2025-03-04 07:49:14,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717158370] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:14,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:14,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:49:14,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004243168] [2025-03-04 07:49:14,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:14,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:49:14,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:14,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:49:14,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:49:14,813 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2025-03-04 07:49:14,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:14,894 INFO L93 Difference]: Finished difference Result 118 states and 126 transitions. [2025-03-04 07:49:14,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:49:14,896 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), 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 5 [2025-03-04 07:49:14,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:14,896 INFO L225 Difference]: With dead ends: 118 [2025-03-04 07:49:14,897 INFO L226 Difference]: Without dead ends: 118 [2025-03-04 07:49:14,897 INFO L434 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 [2025-03-04 07:49:14,897 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 2 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:14,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 210 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:49:14,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-04 07:49:14,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2025-03-04 07:49:14,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 68 states have (on average 1.6764705882352942) internal successors, (114), 108 states have internal predecessors, (114), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 07:49:14,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 126 transitions. [2025-03-04 07:49:14,911 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 126 transitions. Word has length 5 [2025-03-04 07:49:14,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:14,911 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 126 transitions. [2025-03-04 07:49:14,912 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), 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) [2025-03-04 07:49:14,912 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 126 transitions. [2025-03-04 07:49:14,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 07:49:14,912 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:14,912 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:14,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 07:49:14,913 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting alloc_and_zero_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-03-04 07:49:14,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:14,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1119616697, now seen corresponding path program 1 times [2025-03-04 07:49:14,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:14,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105231225] [2025-03-04 07:49:14,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:14,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:14,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 07:49:14,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 07:49:14,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:14,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:15,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:15,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:15,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105231225] [2025-03-04 07:49:15,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105231225] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:15,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:15,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:49:15,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896169272] [2025-03-04 07:49:15,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:15,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:49:15,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:15,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:49:15,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:49:15,013 INFO L87 Difference]: Start difference. First operand 118 states and 126 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:49:15,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:15,081 INFO L93 Difference]: Finished difference Result 117 states and 125 transitions. [2025-03-04 07:49:15,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:49:15,082 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2025-03-04 07:49:15,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:15,083 INFO L225 Difference]: With dead ends: 117 [2025-03-04 07:49:15,084 INFO L226 Difference]: Without dead ends: 117 [2025-03-04 07:49:15,084 INFO L434 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 [2025-03-04 07:49:15,084 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 1 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:15,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 201 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:49:15,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-04 07:49:15,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-03-04 07:49:15,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 68 states have (on average 1.661764705882353) internal successors, (113), 107 states have internal predecessors, (113), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 07:49:15,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 125 transitions. [2025-03-04 07:49:15,096 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 125 transitions. Word has length 14 [2025-03-04 07:49:15,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:15,097 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 125 transitions. [2025-03-04 07:49:15,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:49:15,097 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 125 transitions. [2025-03-04 07:49:15,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 07:49:15,097 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:15,097 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:15,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 07:49:15,098 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting alloc_and_zero_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-03-04 07:49:15,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:15,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1119616698, now seen corresponding path program 1 times [2025-03-04 07:49:15,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:15,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895765149] [2025-03-04 07:49:15,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:15,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:15,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 07:49:15,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 07:49:15,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:15,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:15,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:15,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:15,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895765149] [2025-03-04 07:49:15,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895765149] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:15,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:15,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:49:15,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592776780] [2025-03-04 07:49:15,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:15,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:49:15,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:15,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:49:15,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:49:15,176 INFO L87 Difference]: Start difference. First operand 117 states and 125 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:49:15,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:15,218 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2025-03-04 07:49:15,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:49:15,219 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2025-03-04 07:49:15,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:15,219 INFO L225 Difference]: With dead ends: 116 [2025-03-04 07:49:15,219 INFO L226 Difference]: Without dead ends: 116 [2025-03-04 07:49:15,220 INFO L434 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 [2025-03-04 07:49:15,220 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 1 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:15,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 208 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:49:15,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-04 07:49:15,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-03-04 07:49:15,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 68 states have (on average 1.6470588235294117) internal successors, (112), 106 states have internal predecessors, (112), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 07:49:15,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 124 transitions. [2025-03-04 07:49:15,224 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 124 transitions. Word has length 14 [2025-03-04 07:49:15,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:15,225 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 124 transitions. [2025-03-04 07:49:15,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:49:15,225 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 124 transitions. [2025-03-04 07:49:15,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 07:49:15,225 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:15,225 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:15,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 07:49:15,225 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting create_internalErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-03-04 07:49:15,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:15,226 INFO L85 PathProgramCache]: Analyzing trace with hash -394738834, now seen corresponding path program 1 times [2025-03-04 07:49:15,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:15,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442561281] [2025-03-04 07:49:15,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:15,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:15,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 07:49:15,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 07:49:15,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:15,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:15,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:15,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:15,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442561281] [2025-03-04 07:49:15,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442561281] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:15,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:15,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:49:15,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186383267] [2025-03-04 07:49:15,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:15,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:49:15,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:15,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:49:15,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:49:15,353 INFO L87 Difference]: Start difference. First operand 116 states and 124 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:49:15,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:15,497 INFO L93 Difference]: Finished difference Result 119 states and 130 transitions. [2025-03-04 07:49:15,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:49:15,497 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2025-03-04 07:49:15,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:15,498 INFO L225 Difference]: With dead ends: 119 [2025-03-04 07:49:15,499 INFO L226 Difference]: Without dead ends: 119 [2025-03-04 07:49:15,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:49:15,499 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 14 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:15,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 382 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:49:15,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-04 07:49:15,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 113. [2025-03-04 07:49:15,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 68 states have (on average 1.6029411764705883) internal successors, (109), 103 states have internal predecessors, (109), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 07:49:15,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 121 transitions. [2025-03-04 07:49:15,511 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 121 transitions. Word has length 19 [2025-03-04 07:49:15,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:15,511 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 121 transitions. [2025-03-04 07:49:15,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:49:15,511 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 121 transitions. [2025-03-04 07:49:15,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 07:49:15,512 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:15,512 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:15,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 07:49:15,512 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting create_internalErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-03-04 07:49:15,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:15,512 INFO L85 PathProgramCache]: Analyzing trace with hash -394738833, now seen corresponding path program 1 times [2025-03-04 07:49:15,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:15,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329351162] [2025-03-04 07:49:15,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:15,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:15,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 07:49:15,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 07:49:15,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:15,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:15,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:15,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:15,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329351162] [2025-03-04 07:49:15,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329351162] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:15,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:15,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:49:15,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119015522] [2025-03-04 07:49:15,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:15,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:49:15,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:15,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:49:15,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:49:15,683 INFO L87 Difference]: Start difference. First operand 113 states and 121 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:49:15,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:15,792 INFO L93 Difference]: Finished difference Result 118 states and 129 transitions. [2025-03-04 07:49:15,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:49:15,793 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2025-03-04 07:49:15,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:15,794 INFO L225 Difference]: With dead ends: 118 [2025-03-04 07:49:15,794 INFO L226 Difference]: Without dead ends: 118 [2025-03-04 07:49:15,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:49:15,795 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 7 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:15,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 458 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:49:15,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-04 07:49:15,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 112. [2025-03-04 07:49:15,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 68 states have (on average 1.588235294117647) internal successors, (108), 102 states have internal predecessors, (108), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 07:49:15,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2025-03-04 07:49:15,800 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 19 [2025-03-04 07:49:15,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:15,800 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2025-03-04 07:49:15,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:49:15,801 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2025-03-04 07:49:15,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-04 07:49:15,801 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:15,801 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:15,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 07:49:15,802 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-03-04 07:49:15,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:15,802 INFO L85 PathProgramCache]: Analyzing trace with hash 544847417, now seen corresponding path program 1 times [2025-03-04 07:49:15,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:15,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291540915] [2025-03-04 07:49:15,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:15,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:15,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 07:49:15,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 07:49:15,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:15,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:16,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:16,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:16,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291540915] [2025-03-04 07:49:16,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291540915] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:16,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:16,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 07:49:16,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869660629] [2025-03-04 07:49:16,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:16,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:49:16,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:16,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:49:16,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:49:16,038 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 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) [2025-03-04 07:49:16,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:16,351 INFO L93 Difference]: Finished difference Result 129 states and 145 transitions. [2025-03-04 07:49:16,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 07:49:16,352 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 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) Word has length 26 [2025-03-04 07:49:16,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:16,352 INFO L225 Difference]: With dead ends: 129 [2025-03-04 07:49:16,352 INFO L226 Difference]: Without dead ends: 129 [2025-03-04 07:49:16,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-04 07:49:16,353 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 18 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:16,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 509 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:49:16,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-04 07:49:16,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 124. [2025-03-04 07:49:16,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 79 states have (on average 1.5822784810126582) internal successors, (125), 111 states have internal predecessors, (125), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2025-03-04 07:49:16,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 141 transitions. [2025-03-04 07:49:16,364 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 141 transitions. Word has length 26 [2025-03-04 07:49:16,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:16,364 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 141 transitions. [2025-03-04 07:49:16,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 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) [2025-03-04 07:49:16,364 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 141 transitions. [2025-03-04 07:49:16,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-04 07:49:16,365 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:16,365 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:16,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 07:49:16,365 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-03-04 07:49:16,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:16,366 INFO L85 PathProgramCache]: Analyzing trace with hash 544847418, now seen corresponding path program 1 times [2025-03-04 07:49:16,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:16,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047542683] [2025-03-04 07:49:16,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:16,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:16,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 07:49:16,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 07:49:16,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:16,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:16,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:16,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:16,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047542683] [2025-03-04 07:49:16,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047542683] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:16,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:16,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 07:49:16,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614576374] [2025-03-04 07:49:16,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:16,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:49:16,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:16,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:49:16,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:49:16,705 INFO L87 Difference]: Start difference. First operand 124 states and 141 transitions. Second operand has 10 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 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) [2025-03-04 07:49:16,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:16,994 INFO L93 Difference]: Finished difference Result 140 states and 161 transitions. [2025-03-04 07:49:16,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 07:49:16,994 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 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) Word has length 26 [2025-03-04 07:49:16,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:16,995 INFO L225 Difference]: With dead ends: 140 [2025-03-04 07:49:16,995 INFO L226 Difference]: Without dead ends: 140 [2025-03-04 07:49:16,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-04 07:49:16,997 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 25 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:16,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 393 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:49:16,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-03-04 07:49:17,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 135. [2025-03-04 07:49:17,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 88 states have (on average 1.5454545454545454) internal successors, (136), 120 states have internal predecessors, (136), 9 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (12), 11 states have call predecessors, (12), 9 states have call successors, (12) [2025-03-04 07:49:17,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 157 transitions. [2025-03-04 07:49:17,001 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 157 transitions. Word has length 26 [2025-03-04 07:49:17,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:17,001 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 157 transitions. [2025-03-04 07:49:17,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 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) [2025-03-04 07:49:17,002 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 157 transitions. [2025-03-04 07:49:17,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-04 07:49:17,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:17,002 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:17,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 07:49:17,003 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting create_internalErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-03-04 07:49:17,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:17,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1003490057, now seen corresponding path program 1 times [2025-03-04 07:49:17,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:17,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73834171] [2025-03-04 07:49:17,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:17,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:17,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 07:49:17,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 07:49:17,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:17,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:17,180 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:17,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:17,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73834171] [2025-03-04 07:49:17,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73834171] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:17,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465189972] [2025-03-04 07:49:17,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:17,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:17,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:17,183 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:49:17,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 07:49:17,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 07:49:17,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 07:49:17,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:17,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:17,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 07:49:17,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:49:17,315 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base (select |c_#valid| alloc_and_zero_internal_~pi~1.base))) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2025-03-04 07:49:17,368 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 07:49:17,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-04 07:49:17,373 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:17,374 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:49:17,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465189972] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:17,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:49:17,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 10 [2025-03-04 07:49:17,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429320156] [2025-03-04 07:49:17,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:17,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:49:17,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:17,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:49:17,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=69, Unknown=1, NotChecked=16, Total=110 [2025-03-04 07:49:17,375 INFO L87 Difference]: Start difference. First operand 135 states and 157 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:49:17,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:17,452 INFO L93 Difference]: Finished difference Result 137 states and 161 transitions. [2025-03-04 07:49:17,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:49:17,453 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2025-03-04 07:49:17,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:17,453 INFO L225 Difference]: With dead ends: 137 [2025-03-04 07:49:17,453 INFO L226 Difference]: Without dead ends: 137 [2025-03-04 07:49:17,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=69, Unknown=1, NotChecked=16, Total=110 [2025-03-04 07:49:17,454 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 11 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 140 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:17,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 232 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 97 Invalid, 0 Unknown, 140 Unchecked, 0.1s Time] [2025-03-04 07:49:17,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-04 07:49:17,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2025-03-04 07:49:17,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 89 states have (on average 1.550561797752809) internal successors, (138), 121 states have internal predecessors, (138), 10 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (13), 12 states have call predecessors, (13), 10 states have call successors, (13) [2025-03-04 07:49:17,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 161 transitions. [2025-03-04 07:49:17,464 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 161 transitions. Word has length 29 [2025-03-04 07:49:17,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:17,464 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 161 transitions. [2025-03-04 07:49:17,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:49:17,464 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 161 transitions. [2025-03-04 07:49:17,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-04 07:49:17,465 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:17,465 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:17,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 07:49:17,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:17,666 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting create_internalErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-03-04 07:49:17,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:17,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1003490058, now seen corresponding path program 1 times [2025-03-04 07:49:17,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:17,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138648002] [2025-03-04 07:49:17,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:17,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:17,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 07:49:17,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 07:49:17,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:17,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:17,965 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:17,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:17,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138648002] [2025-03-04 07:49:17,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138648002] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:17,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624522883] [2025-03-04 07:49:17,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:17,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:17,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:17,968 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:49:17,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 07:49:18,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 07:49:18,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 07:49:18,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:18,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:18,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 07:49:18,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:49:18,057 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 [2025-03-04 07:49:18,186 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) |c_#length|) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2025-03-04 07:49:18,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:49:18,213 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 [2025-03-04 07:49:18,219 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:49:18,219 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 [2025-03-04 07:49:18,222 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-03-04 07:49:18,222 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:49:18,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624522883] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:18,319 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:49:18,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2025-03-04 07:49:18,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417220898] [2025-03-04 07:49:18,319 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:49:18,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 07:49:18,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:18,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 07:49:18,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=230, Unknown=1, NotChecked=30, Total=306 [2025-03-04 07:49:18,320 INFO L87 Difference]: Start difference. First operand 137 states and 161 transitions. Second operand has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 12 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 07:49:18,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:18,683 INFO L93 Difference]: Finished difference Result 145 states and 168 transitions. [2025-03-04 07:49:18,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 07:49:18,683 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 12 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 29 [2025-03-04 07:49:18,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:18,685 INFO L225 Difference]: With dead ends: 145 [2025-03-04 07:49:18,685 INFO L226 Difference]: Without dead ends: 145 [2025-03-04 07:49:18,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=353, Unknown=1, NotChecked=38, Total=462 [2025-03-04 07:49:18,686 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 33 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 133 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:18,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 791 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 499 Invalid, 0 Unknown, 133 Unchecked, 0.3s Time] [2025-03-04 07:49:18,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-03-04 07:49:18,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2025-03-04 07:49:18,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 95 states have (on average 1.5263157894736843) internal successors, (145), 127 states have internal predecessors, (145), 10 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (13), 12 states have call predecessors, (13), 10 states have call successors, (13) [2025-03-04 07:49:18,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 168 transitions. [2025-03-04 07:49:18,692 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 168 transitions. Word has length 29 [2025-03-04 07:49:18,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:18,693 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 168 transitions. [2025-03-04 07:49:18,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 12 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 07:49:18,693 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 168 transitions. [2025-03-04 07:49:18,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-04 07:49:18,693 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:18,693 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:18,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 07:49:18,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-04 07:49:18,900 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting create_internalErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-03-04 07:49:18,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:18,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1870186435, now seen corresponding path program 1 times [2025-03-04 07:49:18,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:18,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121384884] [2025-03-04 07:49:18,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:18,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:18,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 07:49:18,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 07:49:18,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:18,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:18,998 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:49:18,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:18,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121384884] [2025-03-04 07:49:18,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121384884] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:18,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:19,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:49:19,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360358904] [2025-03-04 07:49:19,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:19,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:49:19,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:19,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:49:19,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:49:19,000 INFO L87 Difference]: Start difference. First operand 143 states and 168 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 07:49:19,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:19,125 INFO L93 Difference]: Finished difference Result 142 states and 166 transitions. [2025-03-04 07:49:19,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:49:19,125 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2025-03-04 07:49:19,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:19,126 INFO L225 Difference]: With dead ends: 142 [2025-03-04 07:49:19,126 INFO L226 Difference]: Without dead ends: 142 [2025-03-04 07:49:19,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:49:19,126 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 5 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:19,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 469 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:49:19,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-04 07:49:19,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2025-03-04 07:49:19,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 95 states have (on average 1.5052631578947369) internal successors, (143), 126 states have internal predecessors, (143), 10 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (13), 12 states have call predecessors, (13), 10 states have call successors, (13) [2025-03-04 07:49:19,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 166 transitions. [2025-03-04 07:49:19,130 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 166 transitions. Word has length 33 [2025-03-04 07:49:19,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:19,130 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 166 transitions. [2025-03-04 07:49:19,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 07:49:19,131 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 166 transitions. [2025-03-04 07:49:19,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-04 07:49:19,131 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:19,131 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:19,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 07:49:19,131 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting create_internalErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-03-04 07:49:19,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:19,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1870186436, now seen corresponding path program 1 times [2025-03-04 07:49:19,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:19,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21150293] [2025-03-04 07:49:19,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:19,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:19,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 07:49:19,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 07:49:19,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:19,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:19,304 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:49:19,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:19,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21150293] [2025-03-04 07:49:19,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21150293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:19,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:19,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:49:19,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687344116] [2025-03-04 07:49:19,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:19,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:49:19,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:19,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:49:19,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:49:19,307 INFO L87 Difference]: Start difference. First operand 142 states and 166 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 07:49:19,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:19,430 INFO L93 Difference]: Finished difference Result 141 states and 164 transitions. [2025-03-04 07:49:19,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:49:19,430 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2025-03-04 07:49:19,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:19,431 INFO L225 Difference]: With dead ends: 141 [2025-03-04 07:49:19,431 INFO L226 Difference]: Without dead ends: 141 [2025-03-04 07:49:19,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:49:19,432 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 4 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:19,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 495 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:49:19,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-04 07:49:19,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2025-03-04 07:49:19,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 95 states have (on average 1.4842105263157894) internal successors, (141), 125 states have internal predecessors, (141), 10 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (13), 12 states have call predecessors, (13), 10 states have call successors, (13) [2025-03-04 07:49:19,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 164 transitions. [2025-03-04 07:49:19,435 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 164 transitions. Word has length 33 [2025-03-04 07:49:19,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:19,435 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 164 transitions. [2025-03-04 07:49:19,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 07:49:19,436 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 164 transitions. [2025-03-04 07:49:19,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-04 07:49:19,436 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:19,436 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:19,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 07:49:19,436 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-03-04 07:49:19,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:19,437 INFO L85 PathProgramCache]: Analyzing trace with hash 121919992, now seen corresponding path program 1 times [2025-03-04 07:49:19,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:19,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424739050] [2025-03-04 07:49:19,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:19,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:19,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 07:49:19,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 07:49:19,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:19,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:19,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:19,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:19,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424739050] [2025-03-04 07:49:19,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424739050] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:19,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:19,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:49:19,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879080338] [2025-03-04 07:49:19,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:19,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:49:19,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:19,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:49:19,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:49:19,490 INFO L87 Difference]: Start difference. First operand 141 states and 164 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:49:19,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:19,597 INFO L93 Difference]: Finished difference Result 161 states and 195 transitions. [2025-03-04 07:49:19,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:49:19,597 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2025-03-04 07:49:19,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:19,598 INFO L225 Difference]: With dead ends: 161 [2025-03-04 07:49:19,598 INFO L226 Difference]: Without dead ends: 161 [2025-03-04 07:49:19,598 INFO L434 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 [2025-03-04 07:49:19,599 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 28 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:19,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 370 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:49:19,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-03-04 07:49:19,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 156. [2025-03-04 07:49:19,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 110 states have (on average 1.509090909090909) internal successors, (166), 138 states have internal predecessors, (166), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (15), 14 states have call predecessors, (15), 11 states have call successors, (15) [2025-03-04 07:49:19,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 192 transitions. [2025-03-04 07:49:19,603 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 192 transitions. Word has length 33 [2025-03-04 07:49:19,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:19,603 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 192 transitions. [2025-03-04 07:49:19,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:49:19,603 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 192 transitions. [2025-03-04 07:49:19,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-04 07:49:19,604 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:19,604 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:19,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 07:49:19,604 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-03-04 07:49:19,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:19,605 INFO L85 PathProgramCache]: Analyzing trace with hash 121919993, now seen corresponding path program 1 times [2025-03-04 07:49:19,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:19,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516837231] [2025-03-04 07:49:19,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:19,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:19,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 07:49:19,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 07:49:19,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:19,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:19,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:19,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:19,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516837231] [2025-03-04 07:49:19,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516837231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:19,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:19,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 07:49:19,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91312532] [2025-03-04 07:49:19,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:19,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 07:49:19,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:19,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 07:49:19,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:49:19,718 INFO L87 Difference]: Start difference. First operand 156 states and 192 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:49:19,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:19,855 INFO L93 Difference]: Finished difference Result 171 states and 207 transitions. [2025-03-04 07:49:19,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 07:49:19,855 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2025-03-04 07:49:19,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:19,856 INFO L225 Difference]: With dead ends: 171 [2025-03-04 07:49:19,856 INFO L226 Difference]: Without dead ends: 171 [2025-03-04 07:49:19,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:49:19,857 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 23 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:19,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 668 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:49:19,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-03-04 07:49:19,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 167. [2025-03-04 07:49:19,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 121 states have (on average 1.4958677685950412) internal successors, (181), 149 states have internal predecessors, (181), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (15), 14 states have call predecessors, (15), 11 states have call successors, (15) [2025-03-04 07:49:19,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 207 transitions. [2025-03-04 07:49:19,862 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 207 transitions. Word has length 33 [2025-03-04 07:49:19,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:19,862 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 207 transitions. [2025-03-04 07:49:19,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:49:19,862 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 207 transitions. [2025-03-04 07:49:19,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-04 07:49:19,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:19,862 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:19,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 07:49:19,866 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-03-04 07:49:19,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:19,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1201011974, now seen corresponding path program 1 times [2025-03-04 07:49:19,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:19,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482730856] [2025-03-04 07:49:19,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:19,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:19,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 07:49:19,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 07:49:19,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:19,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:19,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:19,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:19,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482730856] [2025-03-04 07:49:19,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482730856] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:19,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:19,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 07:49:19,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776701191] [2025-03-04 07:49:19,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:19,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:49:19,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:19,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:49:19,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:49:19,966 INFO L87 Difference]: Start difference. First operand 167 states and 207 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:49:20,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:20,012 INFO L93 Difference]: Finished difference Result 178 states and 220 transitions. [2025-03-04 07:49:20,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:49:20,012 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2025-03-04 07:49:20,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:20,013 INFO L225 Difference]: With dead ends: 178 [2025-03-04 07:49:20,013 INFO L226 Difference]: Without dead ends: 178 [2025-03-04 07:49:20,013 INFO L434 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 [2025-03-04 07:49:20,014 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 28 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:20,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 713 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:49:20,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-03-04 07:49:20,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 168. [2025-03-04 07:49:20,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 122 states have (on average 1.4754098360655739) internal successors, (180), 150 states have internal predecessors, (180), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (15), 14 states have call predecessors, (15), 11 states have call successors, (15) [2025-03-04 07:49:20,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 206 transitions. [2025-03-04 07:49:20,024 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 206 transitions. Word has length 35 [2025-03-04 07:49:20,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:20,024 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 206 transitions. [2025-03-04 07:49:20,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:49:20,024 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 206 transitions. [2025-03-04 07:49:20,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-04 07:49:20,027 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:20,027 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:20,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 07:49:20,027 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-03-04 07:49:20,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:20,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1188932525, now seen corresponding path program 1 times [2025-03-04 07:49:20,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:20,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448318794] [2025-03-04 07:49:20,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:20,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:20,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 07:49:20,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 07:49:20,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:20,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:20,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:20,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:20,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448318794] [2025-03-04 07:49:20,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448318794] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:20,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:20,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-04 07:49:20,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018272514] [2025-03-04 07:49:20,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:20,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 07:49:20,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:20,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 07:49:20,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2025-03-04 07:49:20,351 INFO L87 Difference]: Start difference. First operand 168 states and 206 transitions. Second operand has 17 states, 15 states have (on average 2.066666666666667) internal successors, (31), 14 states have internal predecessors, (31), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:49:20,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:20,759 INFO L93 Difference]: Finished difference Result 186 states and 225 transitions. [2025-03-04 07:49:20,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 07:49:20,759 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.066666666666667) internal successors, (31), 14 states have internal predecessors, (31), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2025-03-04 07:49:20,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:20,760 INFO L225 Difference]: With dead ends: 186 [2025-03-04 07:49:20,760 INFO L226 Difference]: Without dead ends: 186 [2025-03-04 07:49:20,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2025-03-04 07:49:20,761 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 34 mSDsluCounter, 893 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 979 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:20,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 979 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:49:20,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-03-04 07:49:20,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 176. [2025-03-04 07:49:20,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 130 states have (on average 1.4615384615384615) internal successors, (190), 158 states have internal predecessors, (190), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (15), 14 states have call predecessors, (15), 11 states have call successors, (15) [2025-03-04 07:49:20,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 216 transitions. [2025-03-04 07:49:20,770 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 216 transitions. Word has length 37 [2025-03-04 07:49:20,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:20,770 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 216 transitions. [2025-03-04 07:49:20,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.066666666666667) internal successors, (31), 14 states have internal predecessors, (31), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:49:20,770 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 216 transitions. [2025-03-04 07:49:20,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-04 07:49:20,771 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:20,771 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:20,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 07:49:20,771 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-03-04 07:49:20,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:20,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1188932524, now seen corresponding path program 1 times [2025-03-04 07:49:20,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:20,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770805095] [2025-03-04 07:49:20,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:20,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:20,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 07:49:20,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 07:49:20,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:20,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:21,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:21,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:21,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770805095] [2025-03-04 07:49:21,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770805095] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:21,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:21,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-04 07:49:21,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964688493] [2025-03-04 07:49:21,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:21,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 07:49:21,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:21,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 07:49:21,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2025-03-04 07:49:21,233 INFO L87 Difference]: Start difference. First operand 176 states and 216 transitions. Second operand has 17 states, 15 states have (on average 2.066666666666667) internal successors, (31), 14 states have internal predecessors, (31), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:49:21,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:21,622 INFO L93 Difference]: Finished difference Result 186 states and 224 transitions. [2025-03-04 07:49:21,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 07:49:21,622 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.066666666666667) internal successors, (31), 14 states have internal predecessors, (31), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2025-03-04 07:49:21,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:21,623 INFO L225 Difference]: With dead ends: 186 [2025-03-04 07:49:21,623 INFO L226 Difference]: Without dead ends: 186 [2025-03-04 07:49:21,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2025-03-04 07:49:21,623 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 33 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 1041 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:21,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 1041 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:49:21,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-03-04 07:49:21,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 176. [2025-03-04 07:49:21,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 130 states have (on average 1.4538461538461538) internal successors, (189), 158 states have internal predecessors, (189), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (15), 14 states have call predecessors, (15), 11 states have call successors, (15) [2025-03-04 07:49:21,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 215 transitions. [2025-03-04 07:49:21,632 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 215 transitions. Word has length 37 [2025-03-04 07:49:21,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:21,632 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 215 transitions. [2025-03-04 07:49:21,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.066666666666667) internal successors, (31), 14 states have internal predecessors, (31), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:49:21,635 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 215 transitions. [2025-03-04 07:49:21,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-04 07:49:21,636 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:21,636 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:21,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 07:49:21,636 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-03-04 07:49:21,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:21,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1130313846, now seen corresponding path program 1 times [2025-03-04 07:49:21,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:21,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212811382] [2025-03-04 07:49:21,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:21,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:21,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 07:49:21,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 07:49:21,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:21,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:22,449 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:22,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:22,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212811382] [2025-03-04 07:49:22,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212811382] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:22,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744489011] [2025-03-04 07:49:22,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:22,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:22,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:22,453 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:49:22,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 07:49:22,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 07:49:22,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 07:49:22,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:22,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:22,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-04 07:49:22,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:49:22,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 07:49:22,911 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 20 treesize of output 8 [2025-03-04 07:49:22,975 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:22,975 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:49:22,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744489011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:22,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:49:22,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [20] total 32 [2025-03-04 07:49:22,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454887757] [2025-03-04 07:49:22,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:22,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 07:49:22,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:22,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 07:49:22,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992 [2025-03-04 07:49:22,978 INFO L87 Difference]: Start difference. First operand 176 states and 215 transitions. Second operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:49:23,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:23,252 INFO L93 Difference]: Finished difference Result 183 states and 219 transitions. [2025-03-04 07:49:23,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 07:49:23,252 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 40 [2025-03-04 07:49:23,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:23,253 INFO L225 Difference]: With dead ends: 183 [2025-03-04 07:49:23,253 INFO L226 Difference]: Without dead ends: 183 [2025-03-04 07:49:23,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=85, Invalid=1105, Unknown=0, NotChecked=0, Total=1190 [2025-03-04 07:49:23,254 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 41 mSDsluCounter, 960 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:23,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 1054 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:49:23,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-03-04 07:49:23,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 177. [2025-03-04 07:49:23,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 131 states have (on average 1.4427480916030535) internal successors, (189), 159 states have internal predecessors, (189), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (15), 14 states have call predecessors, (15), 11 states have call successors, (15) [2025-03-04 07:49:23,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 215 transitions. [2025-03-04 07:49:23,260 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 215 transitions. Word has length 40 [2025-03-04 07:49:23,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:23,260 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 215 transitions. [2025-03-04 07:49:23,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:49:23,260 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 215 transitions. [2025-03-04 07:49:23,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-04 07:49:23,261 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:23,261 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:23,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 07:49:23,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 07:49:23,462 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-03-04 07:49:23,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:23,462 INFO L85 PathProgramCache]: Analyzing trace with hash -955336558, now seen corresponding path program 1 times [2025-03-04 07:49:23,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:23,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635338547] [2025-03-04 07:49:23,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:23,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:23,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 07:49:23,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 07:49:23,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:23,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:23,789 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:49:23,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:23,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635338547] [2025-03-04 07:49:23,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635338547] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:23,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464352840] [2025-03-04 07:49:23,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:23,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:23,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:23,792 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:49:23,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 07:49:23,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 07:49:23,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 07:49:23,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:23,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:23,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-04 07:49:23,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:49:23,898 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 [2025-03-04 07:49:23,933 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base (select |c_#valid| alloc_and_zero_internal_~pi~1.base))) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2025-03-04 07:49:24,012 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|))) (and (= |v_old(#valid)_AFTER_CALL_12| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base (select |v_old(#valid)_AFTER_CALL_12| alloc_and_zero_internal_~pi~1.base))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| .cse0 (select |c_#valid| .cse0))) (= |c_create_internal_#t~ret8.base| .cse0)))) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base (select |c_#valid| alloc_and_zero_internal_~pi~1.base))) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0)))) is different from false [2025-03-04 07:49:24,014 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|))) (and (= |v_old(#valid)_AFTER_CALL_12| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base (select |v_old(#valid)_AFTER_CALL_12| alloc_and_zero_internal_~pi~1.base))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| .cse0 (select |c_#valid| .cse0))) (= |c_create_internal_#t~ret8.base| .cse0)))) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base (select |c_#valid| alloc_and_zero_internal_~pi~1.base))) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0)))) is different from true [2025-03-04 07:49:24,035 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 1 [2025-03-04 07:49:24,038 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|))) (and (= |v_old(#valid)_AFTER_CALL_12| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base (select |v_old(#valid)_AFTER_CALL_12| alloc_and_zero_internal_~pi~1.base))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| .cse0 (select |c_#valid| .cse0))) (= (select (select |c_#memory_$Pointer$#0.base| c_create_internal_~now~0.base) (+ 4 c_create_internal_~now~0.offset)) .cse0)))))) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base (select |c_#valid| alloc_and_zero_internal_~pi~1.base))) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0)))) is different from false [2025-03-04 07:49:24,040 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|))) (and (= |v_old(#valid)_AFTER_CALL_12| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base (select |v_old(#valid)_AFTER_CALL_12| alloc_and_zero_internal_~pi~1.base))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| .cse0 (select |c_#valid| .cse0))) (= (select (select |c_#memory_$Pointer$#0.base| c_create_internal_~now~0.base) (+ 4 c_create_internal_~now~0.offset)) .cse0)))))) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base (select |c_#valid| alloc_and_zero_internal_~pi~1.base))) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0)))) is different from true [2025-03-04 07:49:24,063 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 62 treesize of output 50 [2025-03-04 07:49:24,088 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base (select |c_#valid| alloc_and_zero_internal_~pi~1.base))) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) (exists ((v_prenex_2 Int) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|))) (and (= |c_create_internal_#t~mem9.base| .cse0) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| .cse0 (select |c_#valid| .cse0))) (= (select |c_old(#valid)| v_prenex_2) 0) (= (store |c_old(#valid)| v_prenex_2 (select |v_old(#valid)_AFTER_CALL_12| v_prenex_2)) |v_old(#valid)_AFTER_CALL_12|))))) is different from false [2025-03-04 07:49:28,404 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base (select |c_#valid| alloc_and_zero_internal_~pi~1.base))) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) (exists ((v_prenex_2 Int) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|))) (and (= |c_create_internal_#t~mem9.base| .cse0) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| .cse0 (select |c_#valid| .cse0))) (= (select |c_old(#valid)| v_prenex_2) 0) (= (store |c_old(#valid)| v_prenex_2 (select |v_old(#valid)_AFTER_CALL_12| v_prenex_2)) |v_old(#valid)_AFTER_CALL_12|))))) is different from true [2025-03-04 07:49:28,705 WARN L851 $PredicateComparison]: unable to prove that (or (and (exists ((|v_create_internal_#t~mem9.base_6| Int)) (= (select |c_#valid| |v_create_internal_#t~mem9.base_6|) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base (select |c_#valid| alloc_and_zero_internal_~pi~1.base))) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0)))) (exists ((v_prenex_2 Int) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|) 1)) (= (select |c_old(#valid)| v_prenex_2) 0) (= (store |c_old(#valid)| v_prenex_2 (select |v_old(#valid)_AFTER_CALL_12| v_prenex_2)) |v_old(#valid)_AFTER_CALL_12|)))) is different from false [2025-03-04 07:49:32,718 WARN L873 $PredicateComparison]: unable to prove that (or (and (exists ((|v_create_internal_#t~mem9.base_6| Int)) (= (select |c_#valid| |v_create_internal_#t~mem9.base_6|) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base (select |c_#valid| alloc_and_zero_internal_~pi~1.base))) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0)))) (exists ((v_prenex_2 Int) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|) 1)) (= (select |c_old(#valid)| v_prenex_2) 0) (= (store |c_old(#valid)| v_prenex_2 (select |v_old(#valid)_AFTER_CALL_12| v_prenex_2)) |v_old(#valid)_AFTER_CALL_12|)))) is different from true [2025-03-04 07:49:34,203 INFO L349 Elim1Store]: treesize reduction 65, result has 40.4 percent of original size [2025-03-04 07:49:34,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 48 treesize of output 102 [2025-03-04 07:49:35,038 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 7 treesize of output 5 [2025-03-04 07:49:35,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 7 treesize of output 5 [2025-03-04 07:49:35,738 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:49:35,739 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 17 treesize of output 3 [2025-03-04 07:49:39,204 INFO L349 Elim1Store]: treesize reduction 333, result has 37.1 percent of original size [2025-03-04 07:49:39,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 8 new quantified variables, introduced 22 case distinctions, treesize of input 93 treesize of output 400