./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/memsafety/test-0235-3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version da043454 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 ../../../trunk/examples/svcomp/memsafety/test-0235-3.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-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 32bit --witnessprinter.graph.data.programhash c2c613697edc82870b8750bfc454d913e15ae48b14b4ceb8ca927e66f6c2bea5 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:25:08,563 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:25:08,624 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-29 11:25:08,630 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:25:08,633 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:25:08,656 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:25:08,656 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:25:08,657 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:25:08,657 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:25:08,657 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:25:08,657 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:25:08,657 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:25:08,657 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:25:08,657 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:25:08,658 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:25:08,658 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:25:08,658 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:25:08,658 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:25:08,658 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:25:08,658 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:25:08,658 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-29 11:25:08,658 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-29 11:25:08,658 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-29 11:25:08,658 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:25:08,658 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-29 11:25:08,659 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:25:08,659 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:25:08,659 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:25:08,659 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:25:08,659 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:25:08,659 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:25:08,659 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:25:08,659 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:25:08,659 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:25:08,659 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:25:08,659 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:25:08,660 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:25:08,660 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:25:08,660 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:25:08,660 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:25:08,660 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:25:08,660 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:25:08,660 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:25:08,660 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:25:08,660 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:25:08,661 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:25:08,661 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c2c613697edc82870b8750bfc454d913e15ae48b14b4ceb8ca927e66f6c2bea5 [2025-04-29 11:25:08,885 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:25:08,892 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:25:08,893 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:25:08,895 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:25:08,896 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:25:08,897 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0235-3.c [2025-04-29 11:25:10,152 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9a6f1687/da07ed6fc41843a69c3143fc1c322260/FLAG77f3dc04f [2025-04-29 11:25:10,328 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:25:10,329 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/memsafety/test-0235-3.c [2025-04-29 11:25:10,332 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:25:10,333 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:25:10,333 WARN L117 ultiparseSymbolTable]: System include string.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:25:10,349 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9a6f1687/da07ed6fc41843a69c3143fc1c322260/FLAG77f3dc04f [2025-04-29 11:25:11,153 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9a6f1687/da07ed6fc41843a69c3143fc1c322260 [2025-04-29 11:25:11,155 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:25:11,156 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:25:11,156 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:25:11,156 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:25:11,159 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:25:11,159 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:25:11" (1/1) ... [2025-04-29 11:25:11,160 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57b04189 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:25:11, skipping insertion in model container [2025-04-29 11:25:11,160 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:25:11" (1/1) ... [2025-04-29 11:25:11,174 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:25:11,331 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:25:11,336 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:25:11,371 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:25:11,386 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:25:11,387 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:25:11 WrapperNode [2025-04-29 11:25:11,387 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:25:11,388 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:25:11,388 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:25:11,388 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:25:11,392 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:25:11" (1/1) ... [2025-04-29 11:25:11,399 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:25:11" (1/1) ... [2025-04-29 11:25:11,425 INFO L138 Inliner]: procedures = 25, calls = 69, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 231 [2025-04-29 11:25:11,425 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:25:11,426 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:25:11,426 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:25:11,426 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:25:11,431 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:25:11" (1/1) ... [2025-04-29 11:25:11,431 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:25:11" (1/1) ... [2025-04-29 11:25:11,434 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:25:11" (1/1) ... [2025-04-29 11:25:11,461 INFO L175 MemorySlicer]: Split 36 memory accesses to 2 slices as follows [11, 25]. 69 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [1, 0]. The 12 writes are split as follows [1, 11]. [2025-04-29 11:25:11,461 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:25:11" (1/1) ... [2025-04-29 11:25:11,461 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:25:11" (1/1) ... [2025-04-29 11:25:11,468 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:25:11" (1/1) ... [2025-04-29 11:25:11,469 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:25:11" (1/1) ... [2025-04-29 11:25:11,472 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:25:11" (1/1) ... [2025-04-29 11:25:11,473 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:25:11" (1/1) ... [2025-04-29 11:25:11,473 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:25:11" (1/1) ... [2025-04-29 11:25:11,477 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:25:11,478 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:25:11,478 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:25:11,478 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:25:11,479 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:25:11" (1/1) ... [2025-04-29 11:25:11,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:25:11,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:25:11,500 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-04-29 11:25:11,502 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-04-29 11:25:11,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-29 11:25:11,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-29 11:25:11,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 11:25:11,517 INFO L130 BoogieDeclarations]: Found specification of procedure l0_destroy [2025-04-29 11:25:11,517 INFO L138 BoogieDeclarations]: Found implementation of procedure l0_destroy [2025-04-29 11:25:11,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-29 11:25:11,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-29 11:25:11,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-29 11:25:11,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-29 11:25:11,517 INFO L130 BoogieDeclarations]: Found specification of procedure zalloc_or_die [2025-04-29 11:25:11,517 INFO L138 BoogieDeclarations]: Found implementation of procedure zalloc_or_die [2025-04-29 11:25:11,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:25:11,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:25:11,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:25:11,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 11:25:11,602 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:25:11,604 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:25:12,002 INFO L? ?]: Removed 203 outVars from TransFormulas that were not future-live. [2025-04-29 11:25:12,002 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:25:12,013 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:25:12,013 INFO L312 CfgBuilder]: Removed 10 assume(true) statements. [2025-04-29 11:25:12,014 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:25:12 BoogieIcfgContainer [2025-04-29 11:25:12,014 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:25:12,015 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:25:12,015 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:25:12,018 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:25:12,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:25:11" (1/3) ... [2025-04-29 11:25:12,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63c0a2b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:25:12, skipping insertion in model container [2025-04-29 11:25:12,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:25:11" (2/3) ... [2025-04-29 11:25:12,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63c0a2b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:25:12, skipping insertion in model container [2025-04-29 11:25:12,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:25:12" (3/3) ... [2025-04-29 11:25:12,020 INFO L128 eAbstractionObserver]: Analyzing ICFG test-0235-3.c [2025-04-29 11:25:12,028 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:25:12,029 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-0235-3.c that has 3 procedures, 238 locations, 293 edges, 1 initial locations, 11 loop locations, and 89 error locations. [2025-04-29 11:25:12,059 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:25:12,066 INFO L340 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;@59764a94, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:25:12,066 INFO L341 AbstractCegarLoop]: Starting to check reachability of 89 error locations. [2025-04-29 11:25:12,071 INFO L278 IsEmpty]: Start isEmpty. Operand has 238 states, 133 states have (on average 1.9097744360902256) internal successors, (254), 222 states have internal predecessors, (254), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-04-29 11:25:12,073 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-04-29 11:25:12,074 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:12,074 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-04-29 11:25:12,074 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-04-29 11:25:12,078 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:12,078 INFO L85 PathProgramCache]: Analyzing trace with hash 929958, now seen corresponding path program 1 times [2025-04-29 11:25:12,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:12,083 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034705580] [2025-04-29 11:25:12,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:12,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:12,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-29 11:25:12,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-29 11:25:12,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:12,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:12,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:12,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:12,160 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034705580] [2025-04-29 11:25:12,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034705580] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:25:12,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:25:12,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:25:12,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552621879] [2025-04-29 11:25:12,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:25:12,164 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-29 11:25:12,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:12,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-29 11:25:12,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-29 11:25:12,206 INFO L87 Difference]: Start difference. First operand has 238 states, 133 states have (on average 1.9097744360902256) internal successors, (254), 222 states have internal predecessors, (254), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:12,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:12,236 INFO L93 Difference]: Finished difference Result 238 states and 269 transitions. [2025-04-29 11:25:12,239 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-29 11:25:12,240 INFO L79 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-04-29 11:25:12,240 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:12,244 INFO L225 Difference]: With dead ends: 238 [2025-04-29 11:25:12,244 INFO L226 Difference]: Without dead ends: 236 [2025-04-29 11:25:12,245 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-29 11:25:12,248 INFO L437 NwaCegarLoop]: 269 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:12,251 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:25:12,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-04-29 11:25:12,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2025-04-29 11:25:12,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 132 states have (on average 1.8257575757575757) internal successors, (241), 220 states have internal predecessors, (241), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-04-29 11:25:12,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 267 transitions. [2025-04-29 11:25:12,285 INFO L79 Accepts]: Start accepts. Automaton has 236 states and 267 transitions. Word has length 4 [2025-04-29 11:25:12,286 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:12,286 INFO L485 AbstractCegarLoop]: Abstraction has 236 states and 267 transitions. [2025-04-29 11:25:12,286 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:12,287 INFO L278 IsEmpty]: Start isEmpty. Operand 236 states and 267 transitions. [2025-04-29 11:25:12,287 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-29 11:25:12,287 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:12,287 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-29 11:25:12,288 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:25:12,288 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-04-29 11:25:12,289 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:12,289 INFO L85 PathProgramCache]: Analyzing trace with hash 889937946, now seen corresponding path program 1 times [2025-04-29 11:25:12,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:12,289 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94852248] [2025-04-29 11:25:12,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:12,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:12,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 11:25:12,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 11:25:12,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:12,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:12,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:12,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:12,404 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94852248] [2025-04-29 11:25:12,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94852248] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:25:12,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:25:12,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:25:12,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368129706] [2025-04-29 11:25:12,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:25:12,405 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:25:12,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:12,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:25:12,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:25:12,406 INFO L87 Difference]: Start difference. First operand 236 states and 267 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-04-29 11:25:12,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:12,532 INFO L93 Difference]: Finished difference Result 235 states and 266 transitions. [2025-04-29 11:25:12,532 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:25:12,532 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2025-04-29 11:25:12,532 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:12,535 INFO L225 Difference]: With dead ends: 235 [2025-04-29 11:25:12,535 INFO L226 Difference]: Without dead ends: 235 [2025-04-29 11:25:12,535 INFO L436 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-04-29 11:25:12,536 INFO L437 NwaCegarLoop]: 261 mSDtfsCounter, 4 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:12,537 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 437 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:25:12,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-04-29 11:25:12,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2025-04-29 11:25:12,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 132 states have (on average 1.8181818181818181) internal successors, (240), 219 states have internal predecessors, (240), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-04-29 11:25:12,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 266 transitions. [2025-04-29 11:25:12,552 INFO L79 Accepts]: Start accepts. Automaton has 235 states and 266 transitions. Word has length 6 [2025-04-29 11:25:12,552 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:12,552 INFO L485 AbstractCegarLoop]: Abstraction has 235 states and 266 transitions. [2025-04-29 11:25:12,552 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-04-29 11:25:12,553 INFO L278 IsEmpty]: Start isEmpty. Operand 235 states and 266 transitions. [2025-04-29 11:25:12,553 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-29 11:25:12,553 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:12,553 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:25:12,553 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:25:12,553 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-04-29 11:25:12,553 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:12,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1818272976, now seen corresponding path program 1 times [2025-04-29 11:25:12,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:12,553 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648411961] [2025-04-29 11:25:12,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:12,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:12,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:25:12,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:25:12,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:12,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-29 11:25:12,582 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1552629945] [2025-04-29 11:25:12,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:12,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:25:12,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:25:12,585 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-04-29 11:25:12,586 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-04-29 11:25:12,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:25:12,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:25:12,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:12,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:12,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-29 11:25:12,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:25:12,694 INFO L354 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-04-29 11:25:12,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:12,711 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:25:12,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:12,712 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648411961] [2025-04-29 11:25:12,712 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-29 11:25:12,712 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552629945] [2025-04-29 11:25:12,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1552629945] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:25:12,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:25:12,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:25:12,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947829478] [2025-04-29 11:25:12,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:25:12,713 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:25:12,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:12,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:25:12,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:25:12,713 INFO L87 Difference]: Start difference. First operand 235 states and 266 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:12,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:12,838 INFO L93 Difference]: Finished difference Result 244 states and 275 transitions. [2025-04-29 11:25:12,838 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:25:12,839 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-04-29 11:25:12,839 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:12,839 INFO L225 Difference]: With dead ends: 244 [2025-04-29 11:25:12,839 INFO L226 Difference]: Without dead ends: 244 [2025-04-29 11:25:12,840 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:25:12,840 INFO L437 NwaCegarLoop]: 256 mSDtfsCounter, 11 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:12,840 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 695 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:25:12,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-04-29 11:25:12,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2025-04-29 11:25:12,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 140 states have (on average 1.7785714285714285) internal successors, (249), 227 states have internal predecessors, (249), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-04-29 11:25:12,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 275 transitions. [2025-04-29 11:25:12,856 INFO L79 Accepts]: Start accepts. Automaton has 244 states and 275 transitions. Word has length 7 [2025-04-29 11:25:12,856 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:12,856 INFO L485 AbstractCegarLoop]: Abstraction has 244 states and 275 transitions. [2025-04-29 11:25:12,856 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:12,856 INFO L278 IsEmpty]: Start isEmpty. Operand 244 states and 275 transitions. [2025-04-29 11:25:12,857 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-04-29 11:25:12,857 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:12,857 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 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-04-29 11:25:12,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-29 11:25:13,057 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:25:13,058 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-04-29 11:25:13,058 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:13,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1632464615, now seen corresponding path program 1 times [2025-04-29 11:25:13,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:13,059 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504399844] [2025-04-29 11:25:13,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:13,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:13,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-04-29 11:25:13,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-04-29 11:25:13,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:13,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-29 11:25:13,109 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1375675197] [2025-04-29 11:25:13,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:13,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:25:13,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:25:13,111 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-04-29 11:25:13,112 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-04-29 11:25:13,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-04-29 11:25:13,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-04-29 11:25:13,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:13,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:13,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-29 11:25:13,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:25:13,289 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2025-04-29 11:25:13,323 INFO L354 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 13 treesize of output 9 [2025-04-29 11:25:13,379 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-04-29 11:25:13,379 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:25:13,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:13,379 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504399844] [2025-04-29 11:25:13,380 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-29 11:25:13,380 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375675197] [2025-04-29 11:25:13,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375675197] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:25:13,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:25:13,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:25:13,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539802121] [2025-04-29 11:25:13,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:25:13,380 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:25:13,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:13,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:25:13,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:25:13,381 INFO L87 Difference]: Start difference. First operand 244 states and 275 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2025-04-29 11:25:13,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:13,518 INFO L93 Difference]: Finished difference Result 256 states and 287 transitions. [2025-04-29 11:25:13,519 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:25:13,519 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 66 [2025-04-29 11:25:13,519 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:13,520 INFO L225 Difference]: With dead ends: 256 [2025-04-29 11:25:13,520 INFO L226 Difference]: Without dead ends: 246 [2025-04-29 11:25:13,520 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:25:13,520 INFO L437 NwaCegarLoop]: 261 mSDtfsCounter, 3 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 952 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:13,521 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 952 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:25:13,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-04-29 11:25:13,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2025-04-29 11:25:13,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 142 states have (on average 1.767605633802817) internal successors, (251), 229 states have internal predecessors, (251), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-04-29 11:25:13,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 277 transitions. [2025-04-29 11:25:13,528 INFO L79 Accepts]: Start accepts. Automaton has 246 states and 277 transitions. Word has length 66 [2025-04-29 11:25:13,528 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:13,528 INFO L485 AbstractCegarLoop]: Abstraction has 246 states and 277 transitions. [2025-04-29 11:25:13,528 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2025-04-29 11:25:13,528 INFO L278 IsEmpty]: Start isEmpty. Operand 246 states and 277 transitions. [2025-04-29 11:25:13,529 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-04-29 11:25:13,529 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:13,529 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 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-04-29 11:25:13,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-29 11:25:13,730 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-04-29 11:25:13,730 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-04-29 11:25:13,730 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:13,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1536774091, now seen corresponding path program 1 times [2025-04-29 11:25:13,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:13,731 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649921181] [2025-04-29 11:25:13,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:13,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:13,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-04-29 11:25:13,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-04-29 11:25:13,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:13,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-29 11:25:13,909 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1270898737] [2025-04-29 11:25:13,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:13,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:25:13,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:25:13,915 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-04-29 11:25:13,917 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-04-29 11:25:14,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-04-29 11:25:14,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-04-29 11:25:14,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:14,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:14,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-29 11:25:14,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:25:14,119 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2025-04-29 11:25:14,150 INFO L354 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 13 treesize of output 9 [2025-04-29 11:25:14,217 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 58 proven. 9 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-04-29 11:25:14,218 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:25:14,385 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 59 proven. 1 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-04-29 11:25:14,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:14,386 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649921181] [2025-04-29 11:25:14,386 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-29 11:25:14,386 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270898737] [2025-04-29 11:25:14,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270898737] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:25:14,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:25:14,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2025-04-29 11:25:14,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765338302] [2025-04-29 11:25:14,387 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:25:14,387 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-29 11:25:14,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:14,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-29 11:25:14,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-04-29 11:25:14,389 INFO L87 Difference]: Start difference. First operand 246 states and 277 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2025-04-29 11:25:14,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:14,647 INFO L93 Difference]: Finished difference Result 265 states and 297 transitions. [2025-04-29 11:25:14,647 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:25:14,647 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 71 [2025-04-29 11:25:14,647 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:14,648 INFO L225 Difference]: With dead ends: 265 [2025-04-29 11:25:14,649 INFO L226 Difference]: Without dead ends: 250 [2025-04-29 11:25:14,649 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2025-04-29 11:25:14,649 INFO L437 NwaCegarLoop]: 260 mSDtfsCounter, 19 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 1219 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:14,650 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 1219 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:25:14,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-04-29 11:25:14,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2025-04-29 11:25:14,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 146 states have (on average 1.7465753424657535) internal successors, (255), 233 states have internal predecessors, (255), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-04-29 11:25:14,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 281 transitions. [2025-04-29 11:25:14,657 INFO L79 Accepts]: Start accepts. Automaton has 250 states and 281 transitions. Word has length 71 [2025-04-29 11:25:14,657 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:14,657 INFO L485 AbstractCegarLoop]: Abstraction has 250 states and 281 transitions. [2025-04-29 11:25:14,657 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2025-04-29 11:25:14,657 INFO L278 IsEmpty]: Start isEmpty. Operand 250 states and 281 transitions. [2025-04-29 11:25:14,659 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-04-29 11:25:14,659 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:14,659 INFO L218 NwaCegarLoop]: trace histogram [20, 6, 6, 5, 5, 5, 5, 5, 5, 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-04-29 11:25:14,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-29 11:25:14,863 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:25:14,863 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-04-29 11:25:14,863 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:14,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1330470809, now seen corresponding path program 2 times [2025-04-29 11:25:14,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:14,864 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980129516] [2025-04-29 11:25:14,864 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:25:14,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:14,893 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 86 statements into 2 equivalence classes. [2025-04-29 11:25:15,032 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 86 of 86 statements. [2025-04-29 11:25:15,032 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:25:15,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-29 11:25:15,038 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [205998157] [2025-04-29 11:25:15,038 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:25:15,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:25:15,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:25:15,040 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-04-29 11:25:15,042 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-04-29 11:25:15,134 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 86 statements into 2 equivalence classes. [2025-04-29 11:25:15,271 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 86 of 86 statements. [2025-04-29 11:25:15,271 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:25:15,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:15,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 696 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-29 11:25:15,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:25:15,295 INFO L354 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-04-29 11:25:15,309 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-04-29 11:25:15,310 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:25:15,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:15,310 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980129516] [2025-04-29 11:25:15,310 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-29 11:25:15,310 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205998157] [2025-04-29 11:25:15,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [205998157] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:25:15,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:25:15,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:25:15,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039271978] [2025-04-29 11:25:15,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:25:15,311 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:25:15,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:15,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:25:15,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:25:15,311 INFO L87 Difference]: Start difference. First operand 250 states and 281 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-04-29 11:25:15,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:15,407 INFO L93 Difference]: Finished difference Result 249 states and 280 transitions. [2025-04-29 11:25:15,407 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:25:15,407 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 86 [2025-04-29 11:25:15,407 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:15,408 INFO L225 Difference]: With dead ends: 249 [2025-04-29 11:25:15,408 INFO L226 Difference]: Without dead ends: 249 [2025-04-29 11:25:15,409 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:25:15,409 INFO L437 NwaCegarLoop]: 268 mSDtfsCounter, 11 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:15,409 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 717 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:25:15,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-04-29 11:25:15,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2025-04-29 11:25:15,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 146 states have (on average 1.7397260273972603) internal successors, (254), 232 states have internal predecessors, (254), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-04-29 11:25:15,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 280 transitions. [2025-04-29 11:25:15,416 INFO L79 Accepts]: Start accepts. Automaton has 249 states and 280 transitions. Word has length 86 [2025-04-29 11:25:15,417 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:15,417 INFO L485 AbstractCegarLoop]: Abstraction has 249 states and 280 transitions. [2025-04-29 11:25:15,417 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-04-29 11:25:15,417 INFO L278 IsEmpty]: Start isEmpty. Operand 249 states and 280 transitions. [2025-04-29 11:25:15,418 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-04-29 11:25:15,419 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:15,419 INFO L218 NwaCegarLoop]: trace histogram [22, 6, 6, 6, 6, 6, 6, 6, 6, 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-04-29 11:25:15,427 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-29 11:25:15,620 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:25:15,620 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-04-29 11:25:15,620 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:15,620 INFO L85 PathProgramCache]: Analyzing trace with hash -253544918, now seen corresponding path program 1 times [2025-04-29 11:25:15,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:15,621 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34060614] [2025-04-29 11:25:15,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:15,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:15,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-04-29 11:25:15,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-04-29 11:25:15,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:15,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:16,207 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 221 proven. 22 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2025-04-29 11:25:16,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:16,208 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34060614] [2025-04-29 11:25:16,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34060614] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:25:16,209 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266280232] [2025-04-29 11:25:16,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:16,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:25:16,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:25:16,212 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:25:16,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-29 11:25:16,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-04-29 11:25:16,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-04-29 11:25:16,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:16,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:16,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-04-29 11:25:16,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:25:16,445 WARN L871 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (store |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1) |c_#valid|)) is different from true [2025-04-29 11:25:16,469 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-29 11:25:16,469 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-04-29 11:25:16,480 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 221 proven. 1 refuted. 0 times theorem prover too weak. 255 trivial. 21 not checked. [2025-04-29 11:25:16,480 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:25:16,637 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-29 11:25:16,638 INFO L354 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 12 treesize of output 11 [2025-04-29 11:25:16,657 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 221 proven. 22 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2025-04-29 11:25:16,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266280232] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:25:16,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:25:16,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 16 [2025-04-29 11:25:16,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517834100] [2025-04-29 11:25:16,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:25:16,657 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-29 11:25:16,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:16,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-29 11:25:16,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=198, Unknown=1, NotChecked=28, Total=272 [2025-04-29 11:25:16,658 INFO L87 Difference]: Start difference. First operand 249 states and 280 transitions. Second operand has 17 states, 16 states have (on average 3.9375) internal successors, (63), 15 states have internal predecessors, (63), 2 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-04-29 11:25:17,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:17,225 INFO L93 Difference]: Finished difference Result 348 states and 400 transitions. [2025-04-29 11:25:17,225 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:25:17,225 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.9375) internal successors, (63), 15 states have internal predecessors, (63), 2 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 95 [2025-04-29 11:25:17,226 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:17,227 INFO L225 Difference]: With dead ends: 348 [2025-04-29 11:25:17,228 INFO L226 Difference]: Without dead ends: 348 [2025-04-29 11:25:17,228 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 182 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=310, Unknown=1, NotChecked=36, Total=420 [2025-04-29 11:25:17,228 INFO L437 NwaCegarLoop]: 214 mSDtfsCounter, 123 mSDsluCounter, 1668 mSDsCounter, 0 mSdLazyCounter, 1056 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 1882 SdHoareTripleChecker+Invalid, 1447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 377 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:17,228 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 1882 Invalid, 1447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1056 Invalid, 0 Unknown, 377 Unchecked, 0.5s Time] [2025-04-29 11:25:17,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2025-04-29 11:25:17,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 247. [2025-04-29 11:25:17,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 146 states have (on average 1.726027397260274) internal successors, (252), 230 states have internal predecessors, (252), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-04-29 11:25:17,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 278 transitions. [2025-04-29 11:25:17,240 INFO L79 Accepts]: Start accepts. Automaton has 247 states and 278 transitions. Word has length 95 [2025-04-29 11:25:17,240 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:17,240 INFO L485 AbstractCegarLoop]: Abstraction has 247 states and 278 transitions. [2025-04-29 11:25:17,240 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.9375) internal successors, (63), 15 states have internal predecessors, (63), 2 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-04-29 11:25:17,240 INFO L278 IsEmpty]: Start isEmpty. Operand 247 states and 278 transitions. [2025-04-29 11:25:17,241 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-04-29 11:25:17,242 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:17,243 INFO L218 NwaCegarLoop]: trace histogram [22, 6, 6, 6, 6, 6, 6, 6, 6, 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-04-29 11:25:17,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-29 11:25:17,443 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:25:17,443 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-04-29 11:25:17,444 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:17,444 INFO L85 PathProgramCache]: Analyzing trace with hash -253544917, now seen corresponding path program 1 times [2025-04-29 11:25:17,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:17,444 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493010234] [2025-04-29 11:25:17,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:17,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:17,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-04-29 11:25:17,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-04-29 11:25:17,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:17,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-29 11:25:17,570 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [658835813] [2025-04-29 11:25:17,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:17,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:25:17,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:25:17,573 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:25:17,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-29 11:25:17,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-04-29 11:25:17,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-04-29 11:25:17,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:17,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:17,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-04-29 11:25:17,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:25:17,831 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2025-04-29 11:25:18,033 WARN L871 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (store |c_old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| (select |c_#length| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)) |c_#length|) (= (select |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0))) is different from true [2025-04-29 11:25:18,080 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:25:18,081 INFO L354 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-04-29 11:25:18,089 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:25:18,089 INFO L354 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-04-29 11:25:18,101 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 22 not checked. [2025-04-29 11:25:18,101 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:25:18,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:18,180 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493010234] [2025-04-29 11:25:18,180 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-29 11:25:18,180 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658835813] [2025-04-29 11:25:18,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658835813] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:25:18,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:25:18,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2025-04-29 11:25:18,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462456762] [2025-04-29 11:25:18,181 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-04-29 11:25:18,181 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-29 11:25:18,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:18,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-29 11:25:18,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=153, Unknown=1, NotChecked=24, Total=210 [2025-04-29 11:25:18,181 INFO L87 Difference]: Start difference. First operand 247 states and 278 transitions. Second operand has 13 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-04-29 11:25:19,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:19,236 INFO L93 Difference]: Finished difference Result 346 states and 398 transitions. [2025-04-29 11:25:19,237 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:25:19,237 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 95 [2025-04-29 11:25:19,237 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:19,238 INFO L225 Difference]: With dead ends: 346 [2025-04-29 11:25:19,238 INFO L226 Difference]: Without dead ends: 346 [2025-04-29 11:25:19,239 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=328, Unknown=1, NotChecked=36, Total=420 [2025-04-29 11:25:19,239 INFO L437 NwaCegarLoop]: 122 mSDtfsCounter, 122 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 1986 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 2375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 374 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:19,239 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 577 Invalid, 2375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1986 Invalid, 0 Unknown, 374 Unchecked, 0.9s Time] [2025-04-29 11:25:19,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2025-04-29 11:25:19,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 245. [2025-04-29 11:25:19,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 146 states have (on average 1.7123287671232876) internal successors, (250), 228 states have internal predecessors, (250), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-04-29 11:25:19,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 276 transitions. [2025-04-29 11:25:19,245 INFO L79 Accepts]: Start accepts. Automaton has 245 states and 276 transitions. Word has length 95 [2025-04-29 11:25:19,246 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:19,246 INFO L485 AbstractCegarLoop]: Abstraction has 245 states and 276 transitions. [2025-04-29 11:25:19,246 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-04-29 11:25:19,246 INFO L278 IsEmpty]: Start isEmpty. Operand 245 states and 276 transitions. [2025-04-29 11:25:19,249 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-04-29 11:25:19,250 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:19,250 INFO L218 NwaCegarLoop]: trace histogram [22, 6, 6, 6, 6, 6, 6, 6, 6, 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-04-29 11:25:19,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-29 11:25:19,451 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:25:19,451 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-04-29 11:25:19,451 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:19,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1156469899, now seen corresponding path program 1 times [2025-04-29 11:25:19,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:19,451 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654207031] [2025-04-29 11:25:19,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:19,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:19,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-04-29 11:25:19,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-04-29 11:25:19,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:19,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:20,126 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 266 proven. 76 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2025-04-29 11:25:20,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:20,127 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654207031] [2025-04-29 11:25:20,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654207031] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:25:20,127 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130728934] [2025-04-29 11:25:20,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:20,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:25:20,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:25:20,129 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:25:20,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-29 11:25:20,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-04-29 11:25:20,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-04-29 11:25:20,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:20,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:20,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 760 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-29 11:25:20,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:25:20,359 WARN L871 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (store |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1) |c_#valid|)) is different from true [2025-04-29 11:25:20,380 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-29 11:25:20,380 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-04-29 11:25:20,419 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-29 11:25:20,420 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-04-29 11:25:20,437 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 266 proven. 2 refuted. 0 times theorem prover too weak. 178 trivial. 52 not checked. [2025-04-29 11:25:20,437 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:25:20,715 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-29 11:25:20,715 INFO L354 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 12 treesize of output 11 [2025-04-29 11:25:20,725 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 266 proven. 54 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2025-04-29 11:25:20,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1130728934] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:25:20,726 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:25:20,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 11] total 19 [2025-04-29 11:25:20,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930117631] [2025-04-29 11:25:20,726 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:25:20,726 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-29 11:25:20,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:20,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-29 11:25:20,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=288, Unknown=1, NotChecked=34, Total=380 [2025-04-29 11:25:20,727 INFO L87 Difference]: Start difference. First operand 245 states and 276 transitions. Second operand has 20 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 18 states have internal predecessors, (75), 2 states have call successors, (8), 3 states have call predecessors, (8), 6 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2025-04-29 11:25:21,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:21,222 INFO L93 Difference]: Finished difference Result 343 states and 395 transitions. [2025-04-29 11:25:21,223 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:25:21,223 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 18 states have internal predecessors, (75), 2 states have call successors, (8), 3 states have call predecessors, (8), 6 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 97 [2025-04-29 11:25:21,223 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:21,224 INFO L225 Difference]: With dead ends: 343 [2025-04-29 11:25:21,224 INFO L226 Difference]: Without dead ends: 343 [2025-04-29 11:25:21,224 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 183 SyntacticMatches, 9 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=461, Unknown=1, NotChecked=44, Total=600 [2025-04-29 11:25:21,225 INFO L437 NwaCegarLoop]: 203 mSDtfsCounter, 247 mSDsluCounter, 1718 mSDsCounter, 0 mSdLazyCounter, 1109 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 1921 SdHoareTripleChecker+Invalid, 1507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 372 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:21,225 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 1921 Invalid, 1507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1109 Invalid, 0 Unknown, 372 Unchecked, 0.4s Time] [2025-04-29 11:25:21,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2025-04-29 11:25:21,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 242. [2025-04-29 11:25:21,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 146 states have (on average 1.6917808219178083) internal successors, (247), 225 states have internal predecessors, (247), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-04-29 11:25:21,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 273 transitions. [2025-04-29 11:25:21,231 INFO L79 Accepts]: Start accepts. Automaton has 242 states and 273 transitions. Word has length 97 [2025-04-29 11:25:21,231 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:21,231 INFO L485 AbstractCegarLoop]: Abstraction has 242 states and 273 transitions. [2025-04-29 11:25:21,231 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 18 states have internal predecessors, (75), 2 states have call successors, (8), 3 states have call predecessors, (8), 6 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2025-04-29 11:25:21,232 INFO L278 IsEmpty]: Start isEmpty. Operand 242 states and 273 transitions. [2025-04-29 11:25:21,232 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-04-29 11:25:21,232 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:21,232 INFO L218 NwaCegarLoop]: trace histogram [22, 6, 6, 6, 6, 6, 6, 6, 6, 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-04-29 11:25:21,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-29 11:25:21,433 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:25:21,433 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-04-29 11:25:21,433 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:21,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1156469900, now seen corresponding path program 1 times [2025-04-29 11:25:21,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:21,433 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249099357] [2025-04-29 11:25:21,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:21,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:21,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-04-29 11:25:21,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-04-29 11:25:21,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:21,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:22,580 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 221 proven. 32 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-04-29 11:25:22,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:22,581 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249099357] [2025-04-29 11:25:22,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249099357] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:25:22,581 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86463574] [2025-04-29 11:25:22,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:22,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:25:22,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:25:22,583 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:25:22,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-29 11:25:22,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-04-29 11:25:22,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-04-29 11:25:22,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:22,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:22,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 760 conjuncts, 90 conjuncts are in the unsatisfiable core [2025-04-29 11:25:22,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:25:22,889 INFO L354 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 10 treesize of output 9 [2025-04-29 11:25:28,579 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-29 11:25:28,579 INFO L354 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 17 treesize of output 21 [2025-04-29 11:25:28,600 INFO L354 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 18 treesize of output 13 [2025-04-29 11:25:28,814 WARN L871 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (store |c_old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| (select |c_#length| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)) |c_#length|) (= (select |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0))) is different from true [2025-04-29 11:25:28,869 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:25:28,870 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-29 11:25:28,881 INFO L325 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-04-29 11:25:28,882 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-04-29 11:25:28,971 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 230 proven. 108 refuted. 0 times theorem prover too weak. 107 trivial. 53 not checked. [2025-04-29 11:25:28,971 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:25:29,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86463574] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:25:29,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:25:29,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 27] total 43 [2025-04-29 11:25:29,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153391791] [2025-04-29 11:25:29,129 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:25:29,129 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-04-29 11:25:29,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:29,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-04-29 11:25:29,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1753, Unknown=2, NotChecked=84, Total=1980 [2025-04-29 11:25:29,130 INFO L87 Difference]: Start difference. First operand 242 states and 273 transitions. Second operand has 43 states, 40 states have (on average 2.125) internal successors, (85), 38 states have internal predecessors, (85), 4 states have call successors, (8), 2 states have call predecessors, (8), 6 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2025-04-29 11:25:33,173 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-04-29 11:25:37,498 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-04-29 11:25:41,665 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-04-29 11:25:45,827 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-04-29 11:25:53,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:53,221 INFO L93 Difference]: Finished difference Result 363 states and 425 transitions. [2025-04-29 11:25:53,221 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-29 11:25:53,222 INFO L79 Accepts]: Start accepts. Automaton has has 43 states, 40 states have (on average 2.125) internal successors, (85), 38 states have internal predecessors, (85), 4 states have call successors, (8), 2 states have call predecessors, (8), 6 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) Word has length 97 [2025-04-29 11:25:53,222 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:53,223 INFO L225 Difference]: With dead ends: 363 [2025-04-29 11:25:53,223 INFO L226 Difference]: Without dead ends: 360 [2025-04-29 11:25:53,224 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 854 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=361, Invalid=4197, Unknown=2, NotChecked=132, Total=4692 [2025-04-29 11:25:53,225 INFO L437 NwaCegarLoop]: 115 mSDtfsCounter, 385 mSDsluCounter, 1495 mSDsCounter, 0 mSdLazyCounter, 5941 mSolverCounterSat, 36 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 1610 SdHoareTripleChecker+Invalid, 6362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 5941 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 381 IncrementalHoareTripleChecker+Unchecked, 20.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:53,225 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 1610 Invalid, 6362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 5941 Invalid, 4 Unknown, 381 Unchecked, 20.3s Time] [2025-04-29 11:25:53,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-04-29 11:25:53,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 246. [2025-04-29 11:25:53,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 151 states have (on average 1.6622516556291391) internal successors, (251), 229 states have internal predecessors, (251), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2025-04-29 11:25:53,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 281 transitions. [2025-04-29 11:25:53,236 INFO L79 Accepts]: Start accepts. Automaton has 246 states and 281 transitions. Word has length 97 [2025-04-29 11:25:53,236 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:53,236 INFO L485 AbstractCegarLoop]: Abstraction has 246 states and 281 transitions. [2025-04-29 11:25:53,237 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 40 states have (on average 2.125) internal successors, (85), 38 states have internal predecessors, (85), 4 states have call successors, (8), 2 states have call predecessors, (8), 6 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2025-04-29 11:25:53,237 INFO L278 IsEmpty]: Start isEmpty. Operand 246 states and 281 transitions. [2025-04-29 11:25:53,237 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-04-29 11:25:53,237 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:53,238 INFO L218 NwaCegarLoop]: trace histogram [23, 6, 6, 6, 6, 6, 6, 6, 6, 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-04-29 11:25:53,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-29 11:25:53,439 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-04-29 11:25:53,439 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-04-29 11:25:53,439 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:53,439 INFO L85 PathProgramCache]: Analyzing trace with hash 881973997, now seen corresponding path program 1 times [2025-04-29 11:25:53,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:53,439 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691995017] [2025-04-29 11:25:53,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:53,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:53,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-04-29 11:25:53,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-04-29 11:25:53,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:53,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:54,330 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 276 proven. 154 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-04-29 11:25:54,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:54,330 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691995017] [2025-04-29 11:25:54,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691995017] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:25:54,330 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517436392] [2025-04-29 11:25:54,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:54,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:25:54,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:25:54,332 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:25:54,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-29 11:25:54,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-04-29 11:25:54,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-04-29 11:25:54,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:54,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:54,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 808 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-04-29 11:25:54,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:25:54,599 WARN L871 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|))) (= (select |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0))) is different from true [2025-04-29 11:25:54,654 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-29 11:25:54,654 INFO L354 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-04-29 11:25:54,716 WARN L849 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_19| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_19| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_19| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= .cse0 |c_ULTIMATE.start_l4_insert_#t~ret3#1.base|)))) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) is different from false [2025-04-29 11:25:54,717 WARN L871 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_19| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_19| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_19| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= .cse0 |c_ULTIMATE.start_l4_insert_#t~ret3#1.base|)))) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) is different from true [2025-04-29 11:25:54,729 WARN L849 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_19| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_19| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_19| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))))) is different from false [2025-04-29 11:25:54,731 WARN L871 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_19| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_19| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_19| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))))) is different from true [2025-04-29 11:25:54,765 WARN L871 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (store |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1) |c_#valid|)) is different from true [2025-04-29 11:25:54,793 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-29 11:25:54,793 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-04-29 11:25:54,809 WARN L849 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_19| |v_old(#valid)_AFTER_CALL_46|))) (and (= (select |v_#valid_BEFORE_CALL_19| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= (store |v_#valid_BEFORE_CALL_19| .cse0 (select |v_old(#valid)_AFTER_CALL_46| .cse0)) |v_old(#valid)_AFTER_CALL_46|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) is different from false [2025-04-29 11:25:54,811 WARN L871 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_19| |v_old(#valid)_AFTER_CALL_46|))) (and (= (select |v_#valid_BEFORE_CALL_19| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= (store |v_#valid_BEFORE_CALL_19| .cse0 (select |v_old(#valid)_AFTER_CALL_46| .cse0)) |v_old(#valid)_AFTER_CALL_46|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) is different from true [2025-04-29 11:25:54,827 WARN L849 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (or (exists ((|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_19| |v_old(#valid)_AFTER_CALL_46|))) (and (= (select |v_#valid_BEFORE_CALL_19| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= (store |v_#valid_BEFORE_CALL_19| .cse0 (select |v_old(#valid)_AFTER_CALL_46| .cse0)) |v_old(#valid)_AFTER_CALL_46|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) is different from false [2025-04-29 11:25:54,829 WARN L871 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (or (exists ((|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_19| |v_old(#valid)_AFTER_CALL_46|))) (and (= (select |v_#valid_BEFORE_CALL_19| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= (store |v_#valid_BEFORE_CALL_19| .cse0 (select |v_old(#valid)_AFTER_CALL_46| .cse0)) |v_old(#valid)_AFTER_CALL_46|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) is different from true [2025-04-29 11:25:54,918 WARN L849 $PredicateComparison]: unable to prove that (or (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (exists ((v_ArrVal_1359 Int)) (= (select |c_#valid| v_ArrVal_1359) 1))) (exists ((|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_19| |v_old(#valid)_AFTER_CALL_46|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_19| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= (store |v_#valid_BEFORE_CALL_19| .cse0 (select |v_old(#valid)_AFTER_CALL_46| .cse0)) |v_old(#valid)_AFTER_CALL_46|) (= (select |c_#valid| .cse0) 1))))) is different from false [2025-04-29 11:25:54,920 WARN L871 $PredicateComparison]: unable to prove that (or (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (exists ((v_ArrVal_1359 Int)) (= (select |c_#valid| v_ArrVal_1359) 1))) (exists ((|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_19| |v_old(#valid)_AFTER_CALL_46|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_19| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= (store |v_#valid_BEFORE_CALL_19| .cse0 (select |v_old(#valid)_AFTER_CALL_46| .cse0)) |v_old(#valid)_AFTER_CALL_46|) (= (select |c_#valid| .cse0) 1))))) is different from true [2025-04-29 11:25:54,945 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 255 proven. 39 refuted. 0 times theorem prover too weak. 96 trivial. 136 not checked. [2025-04-29 11:25:54,945 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:25:55,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517436392] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:25:55,503 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:25:55,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22] total 29 [2025-04-29 11:25:55,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760266786] [2025-04-29 11:25:55,503 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:25:55,503 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-29 11:25:55,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:55,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-29 11:25:55,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=867, Unknown=12, NotChecked=462, Total=1482 [2025-04-29 11:25:55,504 INFO L87 Difference]: Start difference. First operand 246 states and 281 transitions. Second operand has 30 states, 28 states have (on average 3.5714285714285716) internal successors, (100), 25 states have internal predecessors, (100), 4 states have call successors, (7), 2 states have call predecessors, (7), 7 states have return successors, (9), 7 states have call predecessors, (9), 4 states have call successors, (9) [2025-04-29 11:25:55,802 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~item~2#1.base|) 1) .cse0 (or (exists ((|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_19| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_19| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_19| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= .cse1 |c_ULTIMATE.start_l4_insert_#t~ret3#1.base|)))) .cse0))) is different from false [2025-04-29 11:25:55,804 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~item~2#1.base|) 1) .cse0 (or (exists ((|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_19| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_19| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_19| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= .cse1 |c_ULTIMATE.start_l4_insert_#t~ret3#1.base|)))) .cse0))) is different from true [2025-04-29 11:25:55,806 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or .cse0 (exists ((|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_19| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_19| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_19| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))))) (or (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l3_insert_~list#1.base|) .cse0))) is different from false [2025-04-29 11:25:55,807 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or .cse0 (exists ((|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_19| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_19| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_19| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))))) (or (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l3_insert_~list#1.base|) .cse0))) is different from true [2025-04-29 11:25:55,809 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l3_insert_~list#1.base|) .cse0) (or (exists ((|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_19| |v_old(#valid)_AFTER_CALL_46|))) (and (= (select |v_#valid_BEFORE_CALL_19| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1) (= (store |v_#valid_BEFORE_CALL_19| .cse1 (select |v_old(#valid)_AFTER_CALL_46| .cse1)) |v_old(#valid)_AFTER_CALL_46|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse0)))) is different from false [2025-04-29 11:25:55,811 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l3_insert_~list#1.base|) .cse0) (or (exists ((|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_19| |v_old(#valid)_AFTER_CALL_46|))) (and (= (select |v_#valid_BEFORE_CALL_19| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1) (= (store |v_#valid_BEFORE_CALL_19| .cse1 (select |v_old(#valid)_AFTER_CALL_46| .cse1)) |v_old(#valid)_AFTER_CALL_46|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse0)))) is different from true [2025-04-29 11:25:55,813 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) .cse0 (or (exists ((|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_19| |v_old(#valid)_AFTER_CALL_46|))) (and (= (select |v_#valid_BEFORE_CALL_19| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1) (= (store |v_#valid_BEFORE_CALL_19| .cse1 (select |v_old(#valid)_AFTER_CALL_46| .cse1)) |v_old(#valid)_AFTER_CALL_46|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse0)))) is different from false [2025-04-29 11:25:55,814 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) .cse0 (or (exists ((|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_19| |v_old(#valid)_AFTER_CALL_46|))) (and (= (select |v_#valid_BEFORE_CALL_19| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1) (= (store |v_#valid_BEFORE_CALL_19| .cse1 (select |v_old(#valid)_AFTER_CALL_46| .cse1)) |v_old(#valid)_AFTER_CALL_46|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse0)))) is different from true [2025-04-29 11:25:55,818 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse0 (exists ((v_ArrVal_1359 Int)) (= (select |c_#valid| v_ArrVal_1359) 1))) (exists ((|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_19| |v_old(#valid)_AFTER_CALL_46|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_19| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= (store |v_#valid_BEFORE_CALL_19| .cse1 (select |v_old(#valid)_AFTER_CALL_46| .cse1)) |v_old(#valid)_AFTER_CALL_46|) (= (select |c_#valid| .cse1) 1))))) .cse0)) is different from false [2025-04-29 11:25:55,819 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse0 (exists ((v_ArrVal_1359 Int)) (= (select |c_#valid| v_ArrVal_1359) 1))) (exists ((|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_19| |v_old(#valid)_AFTER_CALL_46|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_19| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= (store |v_#valid_BEFORE_CALL_19| .cse1 (select |v_old(#valid)_AFTER_CALL_46| .cse1)) |v_old(#valid)_AFTER_CALL_46|) (= (select |c_#valid| .cse1) 1))))) .cse0)) is different from true [2025-04-29 11:25:56,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:56,773 INFO L93 Difference]: Finished difference Result 367 states and 430 transitions. [2025-04-29 11:25:56,774 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-29 11:25:56,774 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 3.5714285714285716) internal successors, (100), 25 states have internal predecessors, (100), 4 states have call successors, (7), 2 states have call predecessors, (7), 7 states have return successors, (9), 7 states have call predecessors, (9), 4 states have call successors, (9) Word has length 104 [2025-04-29 11:25:56,774 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:56,775 INFO L225 Difference]: With dead ends: 367 [2025-04-29 11:25:56,775 INFO L226 Difference]: Without dead ends: 367 [2025-04-29 11:25:56,776 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 127 SyntacticMatches, 6 SemanticMatches, 47 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=216, Invalid=1142, Unknown=22, NotChecked=972, Total=2352 [2025-04-29 11:25:56,776 INFO L437 NwaCegarLoop]: 213 mSDtfsCounter, 123 mSDsluCounter, 3114 mSDsCounter, 0 mSdLazyCounter, 2091 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 3327 SdHoareTripleChecker+Invalid, 5207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3097 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:56,776 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 3327 Invalid, 5207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2091 Invalid, 0 Unknown, 3097 Unchecked, 1.1s Time] [2025-04-29 11:25:56,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2025-04-29 11:25:56,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 265. [2025-04-29 11:25:56,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 167 states have (on average 1.622754491017964) internal successors, (271), 245 states have internal predecessors, (271), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (21), 16 states have call predecessors, (21), 16 states have call successors, (21) [2025-04-29 11:25:56,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 308 transitions. [2025-04-29 11:25:56,783 INFO L79 Accepts]: Start accepts. Automaton has 265 states and 308 transitions. Word has length 104 [2025-04-29 11:25:56,783 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:56,783 INFO L485 AbstractCegarLoop]: Abstraction has 265 states and 308 transitions. [2025-04-29 11:25:56,784 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 3.5714285714285716) internal successors, (100), 25 states have internal predecessors, (100), 4 states have call successors, (7), 2 states have call predecessors, (7), 7 states have return successors, (9), 7 states have call predecessors, (9), 4 states have call successors, (9) [2025-04-29 11:25:56,784 INFO L278 IsEmpty]: Start isEmpty. Operand 265 states and 308 transitions. [2025-04-29 11:25:56,784 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-04-29 11:25:56,784 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:56,784 INFO L218 NwaCegarLoop]: trace histogram [23, 6, 6, 6, 6, 6, 6, 6, 6, 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-04-29 11:25:56,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-29 11:25:56,989 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:25:56,989 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-04-29 11:25:56,989 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:56,989 INFO L85 PathProgramCache]: Analyzing trace with hash 881973998, now seen corresponding path program 1 times [2025-04-29 11:25:56,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:56,989 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574439662] [2025-04-29 11:25:56,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:56,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:57,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-04-29 11:25:57,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-04-29 11:25:57,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:57,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:58,111 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 273 proven. 89 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2025-04-29 11:25:58,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:58,111 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574439662] [2025-04-29 11:25:58,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574439662] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:25:58,111 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680137503] [2025-04-29 11:25:58,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:58,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:25:58,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:25:58,114 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:25:58,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-29 11:25:58,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-04-29 11:25:58,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-04-29 11:25:58,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:58,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:58,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 808 conjuncts, 68 conjuncts are in the unsatisfiable core [2025-04-29 11:25:58,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:25:58,537 INFO L354 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 10 treesize of output 9 [2025-04-29 11:25:59,607 WARN L871 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (store |c_old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| (select |c_#length| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)) |c_#length|) (= (select |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0))) is different from true [2025-04-29 11:25:59,640 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:25:59,640 INFO L354 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-04-29 11:25:59,648 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:25:59,648 INFO L354 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-04-29 11:25:59,702 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 201 proven. 125 refuted. 0 times theorem prover too weak. 160 trivial. 40 not checked. [2025-04-29 11:25:59,703 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:25:59,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [680137503] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:25:59,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:25:59,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 24] total 41 [2025-04-29 11:25:59,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6576414] [2025-04-29 11:25:59,848 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:25:59,848 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-29 11:25:59,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:59,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-29 11:25:59,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1586, Unknown=1, NotChecked=80, Total=1806 [2025-04-29 11:25:59,850 INFO L87 Difference]: Start difference. First operand 265 states and 308 transitions. Second operand has 41 states, 39 states have (on average 2.230769230769231) internal successors, (87), 36 states have internal predecessors, (87), 3 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2025-04-29 11:26:04,899 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-04-29 11:26:07,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:26:07,057 INFO L93 Difference]: Finished difference Result 392 states and 473 transitions. [2025-04-29 11:26:07,057 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-29 11:26:07,057 INFO L79 Accepts]: Start accepts. Automaton has has 41 states, 39 states have (on average 2.230769230769231) internal successors, (87), 36 states have internal predecessors, (87), 3 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) Word has length 104 [2025-04-29 11:26:07,058 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:26:07,059 INFO L225 Difference]: With dead ends: 392 [2025-04-29 11:26:07,059 INFO L226 Difference]: Without dead ends: 386 [2025-04-29 11:26:07,060 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 722 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=301, Invalid=3124, Unknown=1, NotChecked=114, Total=3540 [2025-04-29 11:26:07,060 INFO L437 NwaCegarLoop]: 135 mSDtfsCounter, 354 mSDsluCounter, 1385 mSDsCounter, 0 mSdLazyCounter, 3781 mSolverCounterSat, 28 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 1520 SdHoareTripleChecker+Invalid, 4195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 3781 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 385 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:26:07,060 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 1520 Invalid, 4195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 3781 Invalid, 1 Unknown, 385 Unchecked, 6.3s Time] [2025-04-29 11:26:07,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2025-04-29 11:26:07,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 266. [2025-04-29 11:26:07,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 168 states have (on average 1.625) internal successors, (273), 246 states have internal predecessors, (273), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (21), 16 states have call predecessors, (21), 16 states have call successors, (21) [2025-04-29 11:26:07,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 310 transitions. [2025-04-29 11:26:07,072 INFO L79 Accepts]: Start accepts. Automaton has 266 states and 310 transitions. Word has length 104 [2025-04-29 11:26:07,072 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:26:07,072 INFO L485 AbstractCegarLoop]: Abstraction has 266 states and 310 transitions. [2025-04-29 11:26:07,072 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 39 states have (on average 2.230769230769231) internal successors, (87), 36 states have internal predecessors, (87), 3 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2025-04-29 11:26:07,072 INFO L278 IsEmpty]: Start isEmpty. Operand 266 states and 310 transitions. [2025-04-29 11:26:07,073 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-04-29 11:26:07,074 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:26:07,074 INFO L218 NwaCegarLoop]: trace histogram [24, 6, 6, 6, 6, 6, 6, 6, 6, 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-04-29 11:26:07,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-29 11:26:07,274 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-04-29 11:26:07,275 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-04-29 11:26:07,275 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:26:07,275 INFO L85 PathProgramCache]: Analyzing trace with hash -163049768, now seen corresponding path program 2 times [2025-04-29 11:26:07,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:26:07,275 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365128899] [2025-04-29 11:26:07,275 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:26:07,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:26:07,298 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 105 statements into 2 equivalence classes. [2025-04-29 11:26:07,384 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 105 of 105 statements. [2025-04-29 11:26:07,384 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:26:07,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:08,246 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 261 proven. 49 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-04-29 11:26:08,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:26:08,246 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365128899] [2025-04-29 11:26:08,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365128899] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:26:08,247 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222500671] [2025-04-29 11:26:08,247 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:26:08,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:26:08,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:26:08,249 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:26:08,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-29 11:26:08,388 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 105 statements into 2 equivalence classes. [2025-04-29 11:26:08,697 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 105 of 105 statements. [2025-04-29 11:26:08,697 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:26:08,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:08,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 819 conjuncts, 89 conjuncts are in the unsatisfiable core [2025-04-29 11:26:08,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:26:08,865 INFO L354 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 10 treesize of output 9 [2025-04-29 11:26:10,151 WARN L871 $PredicateComparison]: unable to prove that (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (store |c_old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| (select |c_#length| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)) |c_#length|) (= (select |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0))) (exists ((|v_zalloc_or_die_calloc_model_~nmemb#1_214| Int) (|v_zalloc_or_die_calloc_model_~size#1_214| Int)) (= (* |v_zalloc_or_die_calloc_model_~size#1_214| |v_zalloc_or_die_calloc_model_~nmemb#1_214|) |c_zalloc_or_die_#Ultimate.C_memset_#amount#1|))) is different from true [2025-04-29 11:26:10,347 WARN L871 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (store |c_old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| (select |c_#length| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)) |c_#length|) (= (select |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0))) is different from true [2025-04-29 11:26:10,362 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:26:10,362 INFO L354 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-04-29 11:26:10,368 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:26:10,368 INFO L354 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-04-29 11:26:10,421 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 190 proven. 248 refuted. 0 times theorem prover too weak. 110 trivial. 7 not checked. [2025-04-29 11:26:10,421 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:26:10,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222500671] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:26:10,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:26:10,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 30] total 48 [2025-04-29 11:26:10,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296621012] [2025-04-29 11:26:10,566 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:26:10,566 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-04-29 11:26:10,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:26:10,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-04-29 11:26:10,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=2100, Unknown=2, NotChecked=186, Total=2450 [2025-04-29 11:26:10,567 INFO L87 Difference]: Start difference. First operand 266 states and 310 transitions. Second operand has 48 states, 46 states have (on average 1.9565217391304348) internal successors, (90), 43 states have internal predecessors, (90), 3 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2025-04-29 11:26:14,616 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] Killed by 15