./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/memsafety/test-0235-3.i --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.i -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 02c65307022e35fe6a7161faa785e5b34e94ccda4b82967e279eadaf3aa37bc3 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:44:55,292 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:44:55,334 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-30 10:44:55,341 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:44:55,341 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:44:55,358 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:44:55,358 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:44:55,359 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:44:55,359 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:44:55,359 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:44:55,360 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:44:55,360 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:44:55,360 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:44:55,360 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:44:55,361 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:44:55,361 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:44:55,361 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:44:55,361 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:44:55,361 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:44:55,361 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:44:55,361 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-30 10:44:55,361 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-30 10:44:55,362 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-30 10:44:55,362 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:44:55,362 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-30 10:44:55,362 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:44:55,362 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:44:55,362 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:44:55,362 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:44:55,362 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:44:55,363 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:44:55,363 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:44:55,363 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:44:55,363 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:44:55,363 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:44:55,363 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:44:55,363 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:44:55,363 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:44:55,363 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:44:55,363 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:44:55,363 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:44:55,363 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:44:55,364 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:44:55,364 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:44:55,364 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:44:55,364 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:44:55,364 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 -> 02c65307022e35fe6a7161faa785e5b34e94ccda4b82967e279eadaf3aa37bc3 [2025-04-30 10:44:55,577 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:44:55,584 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:44:55,586 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:44:55,587 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:44:55,588 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:44:55,589 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0235-3.i [2025-04-30 10:44:56,877 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12080157d/d20bc20765a642e19aef05dc6913b610/FLAG30698f465 [2025-04-30 10:44:57,115 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:44:57,115 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/memsafety/test-0235-3.i [2025-04-30 10:44:57,125 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12080157d/d20bc20765a642e19aef05dc6913b610/FLAG30698f465 [2025-04-30 10:44:57,927 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12080157d/d20bc20765a642e19aef05dc6913b610 [2025-04-30 10:44:57,929 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:44:57,930 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:44:57,931 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:44:57,931 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:44:57,934 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:44:57,934 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:44:57" (1/1) ... [2025-04-30 10:44:57,936 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c867203 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:57, skipping insertion in model container [2025-04-30 10:44:57,936 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:44:57" (1/1) ... [2025-04-30 10:44:57,959 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:44:58,271 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:44:58,281 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:44:58,325 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:44:58,352 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:44:58,352 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:58 WrapperNode [2025-04-30 10:44:58,353 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:44:58,353 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:44:58,353 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:44:58,353 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:44:58,357 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:58" (1/1) ... [2025-04-30 10:44:58,373 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:58" (1/1) ... [2025-04-30 10:44:58,393 INFO L138 Inliner]: procedures = 188, calls = 73, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 236 [2025-04-30 10:44:58,393 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:44:58,394 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:44:58,394 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:44:58,394 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:44:58,403 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:58" (1/1) ... [2025-04-30 10:44:58,403 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:58" (1/1) ... [2025-04-30 10:44:58,408 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:58" (1/1) ... [2025-04-30 10:44:58,443 INFO L175 MemorySlicer]: Split 39 memory accesses to 3 slices as follows [2, 26, 11]. 67 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 13 writes are split as follows [0, 12, 1]. [2025-04-30 10:44:58,443 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:58" (1/1) ... [2025-04-30 10:44:58,444 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:58" (1/1) ... [2025-04-30 10:44:58,453 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:58" (1/1) ... [2025-04-30 10:44:58,454 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:58" (1/1) ... [2025-04-30 10:44:58,459 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:58" (1/1) ... [2025-04-30 10:44:58,461 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:58" (1/1) ... [2025-04-30 10:44:58,462 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:58" (1/1) ... [2025-04-30 10:44:58,468 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:44:58,469 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:44:58,469 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:44:58,470 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:44:58,470 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:58" (1/1) ... [2025-04-30 10:44:58,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:44:58,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:58,494 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-30 10:44:58,496 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-30 10:44:58,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-30 10:44:58,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:44:58,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-30 10:44:58,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-30 10:44:58,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-04-30 10:44:58,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-30 10:44:58,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-30 10:44:58,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-04-30 10:44:58,514 INFO L130 BoogieDeclarations]: Found specification of procedure zalloc_or_die [2025-04-30 10:44:58,514 INFO L138 BoogieDeclarations]: Found implementation of procedure zalloc_or_die [2025-04-30 10:44:58,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-30 10:44:58,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-30 10:44:58,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-30 10:44:58,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-04-30 10:44:58,514 INFO L130 BoogieDeclarations]: Found specification of procedure l0_destroy [2025-04-30 10:44:58,514 INFO L138 BoogieDeclarations]: Found implementation of procedure l0_destroy [2025-04-30 10:44:58,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-30 10:44:58,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-30 10:44:58,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-30 10:44:58,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:44:58,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:44:58,621 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:44:58,623 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:44:59,063 INFO L? ?]: Removed 203 outVars from TransFormulas that were not future-live. [2025-04-30 10:44:59,064 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:44:59,078 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:44:59,078 INFO L312 CfgBuilder]: Removed 10 assume(true) statements. [2025-04-30 10:44:59,079 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:44:59 BoogieIcfgContainer [2025-04-30 10:44:59,079 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:44:59,080 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:44:59,080 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:44:59,083 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:44:59,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:44:57" (1/3) ... [2025-04-30 10:44:59,084 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c7b62c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:44:59, skipping insertion in model container [2025-04-30 10:44:59,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:58" (2/3) ... [2025-04-30 10:44:59,085 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c7b62c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:44:59, skipping insertion in model container [2025-04-30 10:44:59,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:44:59" (3/3) ... [2025-04-30 10:44:59,086 INFO L128 eAbstractionObserver]: Analyzing ICFG test-0235-3.i [2025-04-30 10:44:59,097 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:44:59,099 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-0235-3.i that has 3 procedures, 238 locations, 293 edges, 1 initial locations, 11 loop locations, and 89 error locations. [2025-04-30 10:44:59,138 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:44:59,149 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;@616e32be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:44:59,150 INFO L341 AbstractCegarLoop]: Starting to check reachability of 89 error locations. [2025-04-30 10:44:59,155 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-30 10:44:59,159 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-04-30 10:44:59,160 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:59,160 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-04-30 10:44:59,161 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-04-30 10:44:59,164 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:59,165 INFO L85 PathProgramCache]: Analyzing trace with hash 7887142, now seen corresponding path program 1 times [2025-04-30 10:44:59,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:59,170 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982973297] [2025-04-30 10:44:59,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:59,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:59,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-30 10:44:59,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-30 10:44:59,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:59,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:59,254 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-30 10:44:59,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:59,254 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982973297] [2025-04-30 10:44:59,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982973297] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:59,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:59,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:44:59,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177348958] [2025-04-30 10:44:59,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:59,260 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-30 10:44:59,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:59,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-30 10:44:59,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-30 10:44:59,281 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-30 10:44:59,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:59,310 INFO L93 Difference]: Finished difference Result 238 states and 269 transitions. [2025-04-30 10:44:59,311 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-30 10:44:59,312 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-30 10:44:59,312 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:59,316 INFO L225 Difference]: With dead ends: 238 [2025-04-30 10:44:59,317 INFO L226 Difference]: Without dead ends: 236 [2025-04-30 10:44:59,319 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-30 10:44:59,323 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-30 10:44:59,324 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-30 10:44:59,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-04-30 10:44:59,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2025-04-30 10:44:59,353 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-30 10:44:59,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 267 transitions. [2025-04-30 10:44:59,362 INFO L79 Accepts]: Start accepts. Automaton has 236 states and 267 transitions. Word has length 4 [2025-04-30 10:44:59,362 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:59,363 INFO L485 AbstractCegarLoop]: Abstraction has 236 states and 267 transitions. [2025-04-30 10:44:59,363 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-30 10:44:59,363 INFO L278 IsEmpty]: Start isEmpty. Operand 236 states and 267 transitions. [2025-04-30 10:44:59,363 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-30 10:44:59,363 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:59,363 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-30 10:44:59,364 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:44:59,364 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-04-30 10:44:59,364 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:59,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1014365960, now seen corresponding path program 1 times [2025-04-30 10:44:59,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:59,365 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580094305] [2025-04-30 10:44:59,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:59,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:59,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-30 10:44:59,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-30 10:44:59,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:59,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:59,486 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-30 10:44:59,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:59,487 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580094305] [2025-04-30 10:44:59,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580094305] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:59,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:59,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:44:59,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214152695] [2025-04-30 10:44:59,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:59,488 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:44:59,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:59,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:44:59,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:44:59,489 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-30 10:44:59,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:59,633 INFO L93 Difference]: Finished difference Result 235 states and 266 transitions. [2025-04-30 10:44:59,634 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:44:59,634 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-30 10:44:59,634 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:59,635 INFO L225 Difference]: With dead ends: 235 [2025-04-30 10:44:59,635 INFO L226 Difference]: Without dead ends: 235 [2025-04-30 10:44:59,635 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-30 10:44:59,636 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-30 10:44:59,636 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-30 10:44:59,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-04-30 10:44:59,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2025-04-30 10:44:59,645 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-30 10:44:59,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 266 transitions. [2025-04-30 10:44:59,651 INFO L79 Accepts]: Start accepts. Automaton has 235 states and 266 transitions. Word has length 6 [2025-04-30 10:44:59,651 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:59,651 INFO L485 AbstractCegarLoop]: Abstraction has 235 states and 266 transitions. [2025-04-30 10:44:59,652 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-30 10:44:59,652 INFO L278 IsEmpty]: Start isEmpty. Operand 235 states and 266 transitions. [2025-04-30 10:44:59,652 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-30 10:44:59,652 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:59,652 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:59,652 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:44:59,652 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-04-30 10:44:59,653 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:59,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1380573448, now seen corresponding path program 1 times [2025-04-30 10:44:59,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:59,653 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449992661] [2025-04-30 10:44:59,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:59,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:59,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:44:59,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:44:59,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:59,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-30 10:44:59,683 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1145257512] [2025-04-30 10:44:59,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:59,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:59,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:59,689 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-30 10:44:59,690 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-30 10:44:59,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:44:59,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:44:59,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:59,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:59,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-30 10:44:59,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:59,802 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-30 10:44:59,821 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-30 10:44:59,822 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:44:59,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:59,822 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449992661] [2025-04-30 10:44:59,822 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-30 10:44:59,822 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145257512] [2025-04-30 10:44:59,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145257512] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:59,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:59,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:44:59,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936944243] [2025-04-30 10:44:59,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:59,824 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:44:59,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:59,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:44:59,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:44:59,825 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-30 10:44:59,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:59,954 INFO L93 Difference]: Finished difference Result 244 states and 275 transitions. [2025-04-30 10:44:59,954 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:44:59,955 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-30 10:44:59,955 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:59,956 INFO L225 Difference]: With dead ends: 244 [2025-04-30 10:44:59,956 INFO L226 Difference]: Without dead ends: 244 [2025-04-30 10:44:59,956 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-30 10:44:59,956 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-30 10:44:59,957 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-30 10:44:59,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-04-30 10:44:59,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2025-04-30 10:44:59,966 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-30 10:44:59,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 275 transitions. [2025-04-30 10:44:59,982 INFO L79 Accepts]: Start accepts. Automaton has 244 states and 275 transitions. Word has length 7 [2025-04-30 10:44:59,982 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:59,982 INFO L485 AbstractCegarLoop]: Abstraction has 244 states and 275 transitions. [2025-04-30 10:44:59,982 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-30 10:44:59,982 INFO L278 IsEmpty]: Start isEmpty. Operand 244 states and 275 transitions. [2025-04-30 10:44:59,983 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-04-30 10:44:59,984 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:59,984 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-30 10:44:59,991 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-30 10:45:00,188 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-30 10:45:00,188 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-04-30 10:45:00,189 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:45:00,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1507517037, now seen corresponding path program 1 times [2025-04-30 10:45:00,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:45:00,189 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041154165] [2025-04-30 10:45:00,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:45:00,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:45:00,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-04-30 10:45:00,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-04-30 10:45:00,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:45:00,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-30 10:45:00,249 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1860320263] [2025-04-30 10:45:00,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:45:00,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:45:00,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:45:00,251 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-30 10:45:00,252 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-30 10:45:00,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-04-30 10:45:00,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-04-30 10:45:00,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:45:00,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:45:00,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 79 conjuncts are in the unsatisfiable core [2025-04-30 10:45:00,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:45:00,452 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-04-30 10:45:00,453 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:45:00,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:45:00,453 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041154165] [2025-04-30 10:45:00,453 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-30 10:45:00,453 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860320263] [2025-04-30 10:45:00,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860320263] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:45:00,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:45:00,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:45:00,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452446424] [2025-04-30 10:45:00,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:45:00,454 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:45:00,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:45:00,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:45:00,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:45:00,455 INFO L87 Difference]: Start difference. First operand 244 states and 275 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-04-30 10:45:00,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:45:00,492 INFO L93 Difference]: Finished difference Result 256 states and 287 transitions. [2025-04-30 10:45:00,492 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:45:00,492 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 66 [2025-04-30 10:45:00,493 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:45:00,493 INFO L225 Difference]: With dead ends: 256 [2025-04-30 10:45:00,494 INFO L226 Difference]: Without dead ends: 246 [2025-04-30 10:45:00,494 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:45:00,495 INFO L437 NwaCegarLoop]: 262 mSDtfsCounter, 2 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:45:00,496 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 771 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:45:00,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-04-30 10:45:00,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2025-04-30 10:45:00,508 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-30 10:45:00,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 277 transitions. [2025-04-30 10:45:00,513 INFO L79 Accepts]: Start accepts. Automaton has 246 states and 277 transitions. Word has length 66 [2025-04-30 10:45:00,513 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:45:00,513 INFO L485 AbstractCegarLoop]: Abstraction has 246 states and 277 transitions. [2025-04-30 10:45:00,513 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-04-30 10:45:00,513 INFO L278 IsEmpty]: Start isEmpty. Operand 246 states and 277 transitions. [2025-04-30 10:45:00,514 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-04-30 10:45:00,514 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:45:00,515 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-30 10:45:00,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-30 10:45:00,715 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-30 10:45:00,715 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-04-30 10:45:00,716 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:45:00,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1682868603, now seen corresponding path program 1 times [2025-04-30 10:45:00,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:45:00,716 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3513686] [2025-04-30 10:45:00,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:45:00,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:45:00,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-04-30 10:45:00,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-04-30 10:45:00,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:45:00,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-30 10:45:00,909 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1052013483] [2025-04-30 10:45:00,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:45:00,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:45:00,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:45:00,917 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-30 10:45:00,919 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-30 10:45:01,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-04-30 10:45:01,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-04-30 10:45:01,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:45:01,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:45:01,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-30 10:45:01,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:45:01,139 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-30 10:45:01,157 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2025-04-30 10:45:01,157 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:45:01,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:45:01,158 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3513686] [2025-04-30 10:45:01,158 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-30 10:45:01,158 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1052013483] [2025-04-30 10:45:01,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1052013483] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:45:01,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:45:01,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:45:01,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994122629] [2025-04-30 10:45:01,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:45:01,158 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:45:01,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:45:01,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:45:01,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:45:01,159 INFO L87 Difference]: Start difference. First operand 246 states and 277 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-30 10:45:01,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:45:01,276 INFO L93 Difference]: Finished difference Result 245 states and 276 transitions. [2025-04-30 10:45:01,276 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:45:01,276 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 71 [2025-04-30 10:45:01,277 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:45:01,277 INFO L225 Difference]: With dead ends: 245 [2025-04-30 10:45:01,278 INFO L226 Difference]: Without dead ends: 245 [2025-04-30 10:45:01,278 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 68 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-30 10:45:01,278 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-30 10:45:01,278 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-30 10:45:01,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-04-30 10:45:01,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2025-04-30 10:45:01,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 142 states have (on average 1.7605633802816902) 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-30 10:45:01,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 276 transitions. [2025-04-30 10:45:01,290 INFO L79 Accepts]: Start accepts. Automaton has 245 states and 276 transitions. Word has length 71 [2025-04-30 10:45:01,290 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:45:01,290 INFO L485 AbstractCegarLoop]: Abstraction has 245 states and 276 transitions. [2025-04-30 10:45:01,290 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-30 10:45:01,290 INFO L278 IsEmpty]: Start isEmpty. Operand 245 states and 276 transitions. [2025-04-30 10:45:01,293 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-04-30 10:45:01,293 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:45:01,294 INFO L218 NwaCegarLoop]: trace histogram [6, 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-30 10:45:01,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-30 10:45:01,494 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-30 10:45:01,494 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-04-30 10:45:01,495 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:45:01,495 INFO L85 PathProgramCache]: Analyzing trace with hash 2058394538, now seen corresponding path program 1 times [2025-04-30 10:45:01,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:45:01,495 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347434520] [2025-04-30 10:45:01,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:45:01,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:45:01,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-04-30 10:45:01,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-04-30 10:45:01,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:45:01,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:45:02,053 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 93 proven. 11 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-04-30 10:45:02,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:45:02,054 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347434520] [2025-04-30 10:45:02,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347434520] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:45:02,054 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094438532] [2025-04-30 10:45:02,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:45:02,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:45:02,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:45:02,056 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-30 10:45:02,058 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-30 10:45:02,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-04-30 10:45:02,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-04-30 10:45:02,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:45:02,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:45:02,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 619 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-04-30 10:45:02,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:45:02,290 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-30 10:45:02,318 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-30 10:45:02,318 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-30 10:45:02,331 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 93 proven. 1 refuted. 0 times theorem prover too weak. 82 trivial. 10 not checked. [2025-04-30 10:45:02,332 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:45:02,539 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-30 10:45:02,539 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-30 10:45:02,558 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 93 proven. 11 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-04-30 10:45:02,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094438532] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:45:02,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:45:02,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 16 [2025-04-30 10:45:02,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921301060] [2025-04-30 10:45:02,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:45:02,559 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-30 10:45:02,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:45:02,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-30 10:45:02,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=198, Unknown=1, NotChecked=28, Total=272 [2025-04-30 10:45:02,560 INFO L87 Difference]: Start difference. First operand 245 states and 276 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-30 10:45:03,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:45:03,129 INFO L93 Difference]: Finished difference Result 344 states and 396 transitions. [2025-04-30 10:45:03,129 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:45:03,129 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 79 [2025-04-30 10:45:03,130 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:45:03,132 INFO L225 Difference]: With dead ends: 344 [2025-04-30 10:45:03,132 INFO L226 Difference]: Without dead ends: 344 [2025-04-30 10:45:03,132 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 150 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-30 10:45:03,134 INFO L437 NwaCegarLoop]: 214 mSDtfsCounter, 453 mSDsluCounter, 1381 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 1595 SdHoareTripleChecker+Invalid, 1286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 377 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-30 10:45:03,135 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 1595 Invalid, 1286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 859 Invalid, 0 Unknown, 377 Unchecked, 0.4s Time] [2025-04-30 10:45:03,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2025-04-30 10:45:03,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 243. [2025-04-30 10:45:03,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 142 states have (on average 1.7464788732394365) internal successors, (248), 226 states have internal predecessors, (248), 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-30 10:45:03,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 274 transitions. [2025-04-30 10:45:03,144 INFO L79 Accepts]: Start accepts. Automaton has 243 states and 274 transitions. Word has length 79 [2025-04-30 10:45:03,145 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:45:03,145 INFO L485 AbstractCegarLoop]: Abstraction has 243 states and 274 transitions. [2025-04-30 10:45:03,145 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-30 10:45:03,145 INFO L278 IsEmpty]: Start isEmpty. Operand 243 states and 274 transitions. [2025-04-30 10:45:03,148 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-04-30 10:45:03,148 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:45:03,149 INFO L218 NwaCegarLoop]: trace histogram [6, 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-30 10:45:03,156 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-30 10:45:03,349 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-30 10:45:03,350 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-04-30 10:45:03,350 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:45:03,350 INFO L85 PathProgramCache]: Analyzing trace with hash 2058394539, now seen corresponding path program 1 times [2025-04-30 10:45:03,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:45:03,350 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067836653] [2025-04-30 10:45:03,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:45:03,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:45:03,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-04-30 10:45:03,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-04-30 10:45:03,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:45:03,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-30 10:45:03,478 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [350051855] [2025-04-30 10:45:03,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:45:03,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:45:03,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:45:03,480 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-30 10:45:03,482 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-30 10:45:03,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-04-30 10:45:03,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-04-30 10:45:03,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:45:03,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:45:03,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 619 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-04-30 10:45:03,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:45:03,697 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 1 [2025-04-30 10:45:03,726 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-30 10:45:03,783 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 54 proven. 11 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2025-04-30 10:45:03,783 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:45:03,932 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 55 proven. 1 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2025-04-30 10:45:03,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:45:03,932 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067836653] [2025-04-30 10:45:03,932 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-30 10:45:03,932 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350051855] [2025-04-30 10:45:03,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350051855] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:45:03,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:45:03,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2025-04-30 10:45:03,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963967079] [2025-04-30 10:45:03,933 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:45:03,933 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-30 10:45:03,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:45:03,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-30 10:45:03,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:45:03,934 INFO L87 Difference]: Start difference. First operand 243 states and 274 transitions. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2025-04-30 10:45:04,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:45:04,212 INFO L93 Difference]: Finished difference Result 262 states and 294 transitions. [2025-04-30 10:45:04,212 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-30 10:45:04,213 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 79 [2025-04-30 10:45:04,213 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:45:04,213 INFO L225 Difference]: With dead ends: 262 [2025-04-30 10:45:04,213 INFO L226 Difference]: Without dead ends: 247 [2025-04-30 10:45:04,214 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2025-04-30 10:45:04,214 INFO L437 NwaCegarLoop]: 253 mSDtfsCounter, 21 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1361 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:45:04,214 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1361 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:45:04,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-04-30 10:45:04,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2025-04-30 10:45:04,218 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-30 10:45:04,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 278 transitions. [2025-04-30 10:45:04,220 INFO L79 Accepts]: Start accepts. Automaton has 247 states and 278 transitions. Word has length 79 [2025-04-30 10:45:04,220 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:45:04,220 INFO L485 AbstractCegarLoop]: Abstraction has 247 states and 278 transitions. [2025-04-30 10:45:04,220 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2025-04-30 10:45:04,220 INFO L278 IsEmpty]: Start isEmpty. Operand 247 states and 278 transitions. [2025-04-30 10:45:04,220 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-04-30 10:45:04,220 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:45:04,221 INFO L218 NwaCegarLoop]: trace histogram [14, 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-30 10:45:04,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-30 10:45:04,425 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-30 10:45:04,425 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-04-30 10:45:04,426 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:45:04,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1119355149, now seen corresponding path program 2 times [2025-04-30 10:45:04,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:45:04,426 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346061358] [2025-04-30 10:45:04,426 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:45:04,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:45:04,445 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 87 statements into 2 equivalence classes. [2025-04-30 10:45:04,516 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 87 of 87 statements. [2025-04-30 10:45:04,516 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:45:04,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-30 10:45:04,519 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [860372745] [2025-04-30 10:45:04,519 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:45:04,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:45:04,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:45:04,521 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-30 10:45:04,523 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-30 10:45:04,627 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 87 statements into 2 equivalence classes. [2025-04-30 10:45:04,775 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 87 of 87 statements. [2025-04-30 10:45:04,776 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:45:04,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:45:04,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 739 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-04-30 10:45:04,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:45:04,799 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-30 10:45:05,006 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-30 10:45:05,060 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:45:05,060 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-30 10:45:05,069 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:45:05,069 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-30 10:45:05,082 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 22 not checked. [2025-04-30 10:45:05,082 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:45:05,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:45:05,164 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346061358] [2025-04-30 10:45:05,164 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-30 10:45:05,164 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860372745] [2025-04-30 10:45:05,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860372745] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:45:05,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:45:05,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2025-04-30 10:45:05,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303211533] [2025-04-30 10:45:05,164 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-04-30 10:45:05,164 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-30 10:45:05,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:45:05,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-30 10:45:05,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=153, Unknown=1, NotChecked=24, Total=210 [2025-04-30 10:45:05,165 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-30 10:45:06,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:45:06,440 INFO L93 Difference]: Finished difference Result 346 states and 398 transitions. [2025-04-30 10:45:06,440 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-30 10:45:06,440 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 87 [2025-04-30 10:45:06,441 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:45:06,442 INFO L225 Difference]: With dead ends: 346 [2025-04-30 10:45:06,442 INFO L226 Difference]: Without dead ends: 346 [2025-04-30 10:45:06,442 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 75 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-30 10:45:06,442 INFO L437 NwaCegarLoop]: 122 mSDtfsCounter, 120 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 2197 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 2586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 374 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:45:06,442 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 623 Invalid, 2586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2197 Invalid, 0 Unknown, 374 Unchecked, 1.1s Time] [2025-04-30 10:45:06,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2025-04-30 10:45:06,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 245. [2025-04-30 10:45:06,448 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-30 10:45:06,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 276 transitions. [2025-04-30 10:45:06,450 INFO L79 Accepts]: Start accepts. Automaton has 245 states and 276 transitions. Word has length 87 [2025-04-30 10:45:06,451 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:45:06,451 INFO L485 AbstractCegarLoop]: Abstraction has 245 states and 276 transitions. [2025-04-30 10:45:06,451 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-30 10:45:06,451 INFO L278 IsEmpty]: Start isEmpty. Operand 245 states and 276 transitions. [2025-04-30 10:45:06,453 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-04-30 10:45:06,453 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:45:06,453 INFO L218 NwaCegarLoop]: trace histogram [14, 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-30 10:45:06,462 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-30 10:45:06,656 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-30 10:45:06,656 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-04-30 10:45:06,656 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:45:06,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1958480685, now seen corresponding path program 1 times [2025-04-30 10:45:06,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:45:06,656 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361892408] [2025-04-30 10:45:06,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:45:06,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:45:06,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-04-30 10:45:06,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-04-30 10:45:06,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:45:06,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:45:07,222 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 188 proven. 42 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-04-30 10:45:07,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:45:07,222 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361892408] [2025-04-30 10:45:07,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361892408] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:45:07,222 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848903068] [2025-04-30 10:45:07,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:45:07,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:45:07,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:45:07,224 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-30 10:45:07,226 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-30 10:45:07,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-04-30 10:45:07,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-04-30 10:45:07,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:45:07,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:45:07,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 756 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-30 10:45:07,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:45:07,433 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-30 10:45:07,491 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-30 10:45:07,491 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-30 10:45:07,510 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-30 10:45:07,535 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-30 10:45:07,535 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-30 10:45:07,546 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 170 proven. 1 refuted. 0 times theorem prover too weak. 80 trivial. 59 not checked. [2025-04-30 10:45:07,547 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:45:07,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848903068] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:45:07,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:45:07,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 17 [2025-04-30 10:45:07,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925446088] [2025-04-30 10:45:07,710 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:45:07,710 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-30 10:45:07,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:45:07,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-30 10:45:07,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=290, Unknown=2, NotChecked=70, Total=420 [2025-04-30 10:45:07,711 INFO L87 Difference]: Start difference. First operand 245 states and 276 transitions. Second operand has 18 states, 17 states have (on average 4.176470588235294) internal successors, (71), 16 states have internal predecessors, (71), 2 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-04-30 10:45:08,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:45:08,340 INFO L93 Difference]: Finished difference Result 343 states and 395 transitions. [2025-04-30 10:45:08,340 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:45:08,340 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.176470588235294) internal successors, (71), 16 states have internal predecessors, (71), 2 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 89 [2025-04-30 10:45:08,341 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:45:08,342 INFO L225 Difference]: With dead ends: 343 [2025-04-30 10:45:08,342 INFO L226 Difference]: Without dead ends: 343 [2025-04-30 10:45:08,342 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 101 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=463, Unknown=2, NotChecked=90, Total=650 [2025-04-30 10:45:08,342 INFO L437 NwaCegarLoop]: 203 mSDtfsCounter, 471 mSDsluCounter, 1758 mSDsCounter, 0 mSdLazyCounter, 1155 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 1961 SdHoareTripleChecker+Invalid, 1946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 743 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-30 10:45:08,343 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 1961 Invalid, 1946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1155 Invalid, 0 Unknown, 743 Unchecked, 0.5s Time] [2025-04-30 10:45:08,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2025-04-30 10:45:08,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 242. [2025-04-30 10:45:08,348 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-30 10:45:08,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 273 transitions. [2025-04-30 10:45:08,350 INFO L79 Accepts]: Start accepts. Automaton has 242 states and 273 transitions. Word has length 89 [2025-04-30 10:45:08,350 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:45:08,350 INFO L485 AbstractCegarLoop]: Abstraction has 242 states and 273 transitions. [2025-04-30 10:45:08,350 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.176470588235294) internal successors, (71), 16 states have internal predecessors, (71), 2 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-04-30 10:45:08,350 INFO L278 IsEmpty]: Start isEmpty. Operand 242 states and 273 transitions. [2025-04-30 10:45:08,351 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-04-30 10:45:08,351 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:45:08,351 INFO L218 NwaCegarLoop]: trace histogram [14, 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-30 10:45:08,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-30 10:45:08,551 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-30 10:45:08,551 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-04-30 10:45:08,552 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:45:08,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1958480686, now seen corresponding path program 1 times [2025-04-30 10:45:08,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:45:08,552 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859709560] [2025-04-30 10:45:08,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:45:08,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:45:08,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-04-30 10:45:08,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-04-30 10:45:08,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:45:08,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:45:09,619 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 157 proven. 25 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-04-30 10:45:09,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:45:09,620 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859709560] [2025-04-30 10:45:09,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859709560] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:45:09,620 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356571046] [2025-04-30 10:45:09,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:45:09,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:45:09,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:45:09,622 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-30 10:45:09,623 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-30 10:45:09,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-04-30 10:45:09,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-04-30 10:45:09,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:45:09,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:45:09,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 756 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-04-30 10:45:09,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:45:09,938 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-30 10:45:10,755 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-30 10:45:10,799 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:45:10,800 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-30 10:45:10,806 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:45:10,806 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-30 10:45:10,844 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 143 proven. 28 refuted. 0 times theorem prover too weak. 107 trivial. 32 not checked. [2025-04-30 10:45:10,844 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:45:10,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356571046] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:45:10,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:45:10,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 31 [2025-04-30 10:45:10,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244961440] [2025-04-30 10:45:10,927 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:45:10,927 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-30 10:45:10,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:45:10,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-30 10:45:10,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=907, Unknown=1, NotChecked=60, Total=1056 [2025-04-30 10:45:10,928 INFO L87 Difference]: Start difference. First operand 242 states and 273 transitions. Second operand has 31 states, 29 states have (on average 2.310344827586207) internal successors, (67), 26 states have internal predecessors, (67), 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-30 10:45:14,963 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-30 10:45:17,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:45:17,619 INFO L93 Difference]: Finished difference Result 352 states and 409 transitions. [2025-04-30 10:45:17,619 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-30 10:45:17,620 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 2.310344827586207) internal successors, (67), 26 states have internal predecessors, (67), 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 89 [2025-04-30 10:45:17,620 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:45:17,621 INFO L225 Difference]: With dead ends: 352 [2025-04-30 10:45:17,621 INFO L226 Difference]: Without dead ends: 349 [2025-04-30 10:45:17,622 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=162, Invalid=1481, Unknown=1, NotChecked=78, Total=1722 [2025-04-30 10:45:17,622 INFO L437 NwaCegarLoop]: 132 mSDtfsCounter, 243 mSDsluCounter, 1369 mSDsCounter, 0 mSdLazyCounter, 4694 mSolverCounterSat, 14 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 1501 SdHoareTripleChecker+Invalid, 5088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 4694 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 379 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:45:17,622 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 1501 Invalid, 5088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 4694 Invalid, 1 Unknown, 379 Unchecked, 6.1s Time] [2025-04-30 10:45:17,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2025-04-30 10:45:17,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 248. [2025-04-30 10:45:17,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 151 states have (on average 1.6754966887417218) internal successors, (253), 231 states have internal predecessors, (253), 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-30 10:45:17,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 283 transitions. [2025-04-30 10:45:17,628 INFO L79 Accepts]: Start accepts. Automaton has 248 states and 283 transitions. Word has length 89 [2025-04-30 10:45:17,629 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:45:17,629 INFO L485 AbstractCegarLoop]: Abstraction has 248 states and 283 transitions. [2025-04-30 10:45:17,629 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 2.310344827586207) internal successors, (67), 26 states have internal predecessors, (67), 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-30 10:45:17,629 INFO L278 IsEmpty]: Start isEmpty. Operand 248 states and 283 transitions. [2025-04-30 10:45:17,629 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-04-30 10:45:17,629 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:45:17,630 INFO L218 NwaCegarLoop]: trace histogram [15, 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-30 10:45:17,638 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-30 10:45:17,830 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-30 10:45:17,830 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-04-30 10:45:17,830 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:45:17,830 INFO L85 PathProgramCache]: Analyzing trace with hash 314938362, now seen corresponding path program 2 times [2025-04-30 10:45:17,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:45:17,831 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509235703] [2025-04-30 10:45:17,831 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:45:17,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:45:17,852 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 90 statements into 2 equivalence classes. [2025-04-30 10:45:17,927 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 90 of 90 statements. [2025-04-30 10:45:17,928 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:45:17,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:45:18,788 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 169 proven. 33 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-04-30 10:45:18,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:45:18,789 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509235703] [2025-04-30 10:45:18,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509235703] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:45:18,789 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994975613] [2025-04-30 10:45:18,789 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:45:18,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:45:18,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:45:18,791 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-30 10:45:18,792 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-30 10:45:18,915 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 90 statements into 2 equivalence classes. [2025-04-30 10:45:19,022 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 90 of 90 statements. [2025-04-30 10:45:19,022 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:45:19,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:45:19,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-04-30 10:45:19,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:45:19,040 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-30 10:45:27,845 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-30 10:45:28,084 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:45:28,084 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-30 10:45:28,094 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:45:28,094 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-30 10:45:28,140 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 169 proven. 36 refuted. 0 times theorem prover too weak. 118 trivial. 7 not checked. [2025-04-30 10:45:28,141 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:45:28,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994975613] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:45:28,264 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:45:28,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 22] total 36 [2025-04-30 10:45:28,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648578456] [2025-04-30 10:45:28,265 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:45:28,265 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-30 10:45:28,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:45:28,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-30 10:45:28,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1231, Unknown=2, NotChecked=70, Total=1406 [2025-04-30 10:45:28,267 INFO L87 Difference]: Start difference. First operand 248 states and 283 transitions. Second operand has 36 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 31 states have internal predecessors, (69), 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-30 10:45:32,613 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-30 10:45:36,985 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-04-30 10:45:41,261 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-30 10:45:45,738 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-04-30 10:45:50,852 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-04-30 10:45:57,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:45:57,248 INFO L93 Difference]: Finished difference Result 358 states and 419 transitions. [2025-04-30 10:45:57,248 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-30 10:45:57,248 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 31 states have internal predecessors, (69), 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 90 [2025-04-30 10:45:57,249 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:45:57,250 INFO L225 Difference]: With dead ends: 358 [2025-04-30 10:45:57,250 INFO L226 Difference]: Without dead ends: 355 [2025-04-30 10:45:57,250 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=203, Invalid=2054, Unknown=3, NotChecked=92, Total=2352 [2025-04-30 10:45:57,251 INFO L437 NwaCegarLoop]: 140 mSDtfsCounter, 245 mSDsluCounter, 1410 mSDsCounter, 0 mSdLazyCounter, 5459 mSolverCounterSat, 16 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 1550 SdHoareTripleChecker+Invalid, 5871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 5459 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 391 IncrementalHoareTripleChecker+Unchecked, 27.4s IncrementalHoareTripleChecker+Time [2025-04-30 10:45:57,251 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 1550 Invalid, 5871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 5459 Invalid, 5 Unknown, 391 Unchecked, 27.4s Time] [2025-04-30 10:45:57,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-04-30 10:45:57,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 249. [2025-04-30 10:45:57,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 152 states have (on average 1.6776315789473684) internal successors, (255), 232 states have internal predecessors, (255), 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-30 10:45:57,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 285 transitions. [2025-04-30 10:45:57,260 INFO L79 Accepts]: Start accepts. Automaton has 249 states and 285 transitions. Word has length 90 [2025-04-30 10:45:57,260 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:45:57,261 INFO L485 AbstractCegarLoop]: Abstraction has 249 states and 285 transitions. [2025-04-30 10:45:57,261 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 31 states have internal predecessors, (69), 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-30 10:45:57,261 INFO L278 IsEmpty]: Start isEmpty. Operand 249 states and 285 transitions. [2025-04-30 10:45:57,261 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-04-30 10:45:57,261 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:45:57,261 INFO L218 NwaCegarLoop]: trace histogram [16, 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-30 10:45:57,271 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-30 10:45:57,462 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-30 10:45:57,462 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-04-30 10:45:57,462 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:45:57,462 INFO L85 PathProgramCache]: Analyzing trace with hash 904733870, now seen corresponding path program 3 times [2025-04-30 10:45:57,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:45:57,462 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194856972] [2025-04-30 10:45:57,462 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:45:57,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:45:57,482 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 91 statements into 9 equivalence classes. [2025-04-30 10:45:57,509 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 61 of 91 statements. [2025-04-30 10:45:57,509 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-30 10:45:57,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:45:58,634 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 181 proven. 42 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-04-30 10:45:58,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:45:58,634 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194856972] [2025-04-30 10:45:58,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194856972] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:45:58,634 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720263461] [2025-04-30 10:45:58,634 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:45:58,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:45:58,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:45:58,636 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-30 10:45:58,637 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-30 10:45:58,766 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 91 statements into 9 equivalence classes. [2025-04-30 10:45:58,834 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 45 of 91 statements. [2025-04-30 10:45:58,834 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-30 10:45:58,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:45:58,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-30 10:45:58,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:45:58,851 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-30 10:45:58,954 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-30 10:45:59,322 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 120 proven. 10 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2025-04-30 10:45:59,322 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:45:59,985 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 120 proven. 10 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2025-04-30 10:45:59,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720263461] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:45:59,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:45:59,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9, 9] total 32 [2025-04-30 10:45:59,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519936424] [2025-04-30 10:45:59,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:45:59,987 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-30 10:45:59,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:45:59,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-30 10:45:59,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=879, Unknown=0, NotChecked=0, Total=992 [2025-04-30 10:45:59,988 INFO L87 Difference]: Start difference. First operand 249 states and 285 transitions. Second operand has 32 states, 31 states have (on average 2.2903225806451615) internal successors, (71), 29 states have internal predecessors, (71), 2 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2025-04-30 10:46:05,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:46:05,644 INFO L93 Difference]: Finished difference Result 372 states and 429 transitions. [2025-04-30 10:46:05,645 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-30 10:46:05,645 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.2903225806451615) internal successors, (71), 29 states have internal predecessors, (71), 2 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) Word has length 91 [2025-04-30 10:46:05,645 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:46:05,646 INFO L225 Difference]: With dead ends: 372 [2025-04-30 10:46:05,646 INFO L226 Difference]: Without dead ends: 352 [2025-04-30 10:46:05,647 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=533, Invalid=2547, Unknown=0, NotChecked=0, Total=3080 [2025-04-30 10:46:05,647 INFO L437 NwaCegarLoop]: 129 mSDtfsCounter, 386 mSDsluCounter, 1739 mSDsCounter, 0 mSdLazyCounter, 4432 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 1868 SdHoareTripleChecker+Invalid, 4471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 4432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-04-30 10:46:05,647 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 1868 Invalid, 4471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 4432 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-04-30 10:46:05,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2025-04-30 10:46:05,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 251. [2025-04-30 10:46:05,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 155 states have (on average 1.6516129032258065) internal successors, (256), 234 states have internal predecessors, (256), 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-30 10:46:05,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 282 transitions. [2025-04-30 10:46:05,653 INFO L79 Accepts]: Start accepts. Automaton has 251 states and 282 transitions. Word has length 91 [2025-04-30 10:46:05,653 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:46:05,653 INFO L485 AbstractCegarLoop]: Abstraction has 251 states and 282 transitions. [2025-04-30 10:46:05,653 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.2903225806451615) internal successors, (71), 29 states have internal predecessors, (71), 2 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2025-04-30 10:46:05,653 INFO L278 IsEmpty]: Start isEmpty. Operand 251 states and 282 transitions. [2025-04-30 10:46:05,654 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-04-30 10:46:05,654 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:46:05,654 INFO L218 NwaCegarLoop]: trace histogram [35, 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-30 10:46:05,662 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-30 10:46:05,854 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-30 10:46:05,854 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-04-30 10:46:05,855 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:05,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1609661098, now seen corresponding path program 4 times [2025-04-30 10:46:05,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:46:05,855 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002432347] [2025-04-30 10:46:05,855 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:46:05,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:46:05,885 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 110 statements into 2 equivalence classes. [2025-04-30 10:46:05,968 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 110 of 110 statements. [2025-04-30 10:46:05,968 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-30 10:46:05,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15