./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/memsafety/test-0235-2.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-2.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 5243781ee83706d005235269371a592cabf9c2dbc613c235cbe81d6e89d326d7 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:44:52,925 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:44:52,971 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:52,976 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:44:52,978 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:44:52,994 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:44:52,995 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:44:52,995 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:44:52,995 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:44:52,995 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:44:52,995 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:44:52,995 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:44:52,996 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:44:52,996 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:44:52,996 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:44:52,996 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:44:52,996 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:44:52,996 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:44:52,998 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:44:52,998 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:44:52,998 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-30 10:44:52,998 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-30 10:44:52,998 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-30 10:44:52,999 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:44:52,999 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-30 10:44:52,999 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:44:52,999 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:44:52,999 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:44:52,999 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:44:52,999 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:44:52,999 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:44:52,999 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:44:53,000 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:44:53,000 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:44:53,000 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:44:53,000 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:44:53,000 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:44:53,000 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:44:53,000 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:44:53,000 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:44:53,000 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:44:53,000 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:44:53,000 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:44:53,000 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:44:53,001 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:44:53,001 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:44:53,001 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 -> 5243781ee83706d005235269371a592cabf9c2dbc613c235cbe81d6e89d326d7 [2025-04-30 10:44:53,185 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:44:53,192 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:44:53,194 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:44:53,194 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:44:53,195 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:44:53,195 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0235-2.i [2025-04-30 10:44:54,407 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12ea2a5ec/a68dd9905b26477b8c4c4996e7f2d21c/FLAG0d4fba6e2 [2025-04-30 10:44:54,631 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:44:54,631 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/memsafety/test-0235-2.i [2025-04-30 10:44:54,644 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12ea2a5ec/a68dd9905b26477b8c4c4996e7f2d21c/FLAG0d4fba6e2 [2025-04-30 10:44:55,607 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12ea2a5ec/a68dd9905b26477b8c4c4996e7f2d21c [2025-04-30 10:44:55,609 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:44:55,610 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:44:55,611 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:44:55,611 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:44:55,614 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:44:55,614 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:44:55" (1/1) ... [2025-04-30 10:44:55,615 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b635398 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:55, skipping insertion in model container [2025-04-30 10:44:55,615 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:44:55" (1/1) ... [2025-04-30 10:44:55,637 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:44:55,888 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:44:55,897 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:44:55,963 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:44:55,993 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:44:55,993 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:55 WrapperNode [2025-04-30 10:44:55,993 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:44:55,994 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:44:55,995 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:44:55,995 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:44:55,999 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:55" (1/1) ... [2025-04-30 10:44:56,019 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:55" (1/1) ... [2025-04-30 10:44:56,048 INFO L138 Inliner]: procedures = 188, calls = 71, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 233 [2025-04-30 10:44:56,052 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:44:56,052 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:44:56,052 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:44:56,052 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:44:56,062 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:55" (1/1) ... [2025-04-30 10:44:56,062 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:55" (1/1) ... [2025-04-30 10:44:56,066 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:55" (1/1) ... [2025-04-30 10:44:56,098 INFO L175 MemorySlicer]: Split 38 memory accesses to 3 slices as follows [2, 10, 26]. 68 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 13 writes are split as follows [0, 1, 12]. [2025-04-30 10:44:56,098 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:55" (1/1) ... [2025-04-30 10:44:56,098 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:55" (1/1) ... [2025-04-30 10:44:56,111 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:55" (1/1) ... [2025-04-30 10:44:56,112 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:55" (1/1) ... [2025-04-30 10:44:56,118 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:55" (1/1) ... [2025-04-30 10:44:56,119 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:55" (1/1) ... [2025-04-30 10:44:56,120 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:55" (1/1) ... [2025-04-30 10:44:56,123 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:44:56,124 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:44:56,124 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:44:56,124 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:44:56,125 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:55" (1/1) ... [2025-04-30 10:44:56,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:44:56,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:56,158 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:56,160 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:56,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-30 10:44:56,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:44:56,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-30 10:44:56,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-30 10:44:56,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-04-30 10:44:56,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-30 10:44:56,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-30 10:44:56,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-04-30 10:44:56,182 INFO L130 BoogieDeclarations]: Found specification of procedure zalloc_or_die [2025-04-30 10:44:56,182 INFO L138 BoogieDeclarations]: Found implementation of procedure zalloc_or_die [2025-04-30 10:44:56,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-30 10:44:56,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-30 10:44:56,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-30 10:44:56,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-04-30 10:44:56,182 INFO L130 BoogieDeclarations]: Found specification of procedure l0_destroy [2025-04-30 10:44:56,182 INFO L138 BoogieDeclarations]: Found implementation of procedure l0_destroy [2025-04-30 10:44:56,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-30 10:44:56,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-30 10:44:56,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-30 10:44:56,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:44:56,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:44:56,296 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:44:56,298 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:44:56,665 INFO L? ?]: Removed 203 outVars from TransFormulas that were not future-live. [2025-04-30 10:44:56,666 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:44:56,674 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:44:56,674 INFO L312 CfgBuilder]: Removed 10 assume(true) statements. [2025-04-30 10:44:56,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:44:56 BoogieIcfgContainer [2025-04-30 10:44:56,674 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:44:56,676 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:44:56,676 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:44:56,692 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:44:56,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:44:55" (1/3) ... [2025-04-30 10:44:56,693 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dbbb30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:44:56, skipping insertion in model container [2025-04-30 10:44:56,693 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:55" (2/3) ... [2025-04-30 10:44:56,693 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dbbb30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:44:56, skipping insertion in model container [2025-04-30 10:44:56,693 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:44:56" (3/3) ... [2025-04-30 10:44:56,694 INFO L128 eAbstractionObserver]: Analyzing ICFG test-0235-2.i [2025-04-30 10:44:56,703 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:44:56,704 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-0235-2.i that has 3 procedures, 233 locations, 286 edges, 1 initial locations, 11 loop locations, and 87 error locations. [2025-04-30 10:44:56,734 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:44:56,741 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;@34586df0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:44:56,741 INFO L341 AbstractCegarLoop]: Starting to check reachability of 87 error locations. [2025-04-30 10:44:56,746 INFO L278 IsEmpty]: Start isEmpty. Operand has 233 states, 131 states have (on average 1.9083969465648856) internal successors, (250), 218 states have internal predecessors, (250), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-04-30 10:44:56,749 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-04-30 10:44:56,749 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:56,749 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-04-30 10:44:56,750 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2025-04-30 10:44:56,754 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:56,754 INFO L85 PathProgramCache]: Analyzing trace with hash 7887142, now seen corresponding path program 1 times [2025-04-30 10:44:56,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:56,759 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630744557] [2025-04-30 10:44:56,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:56,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:56,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-30 10:44:56,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-30 10:44:56,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:56,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:56,850 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:56,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:56,851 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630744557] [2025-04-30 10:44:56,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630744557] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:56,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:56,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:44:56,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137762425] [2025-04-30 10:44:56,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:56,856 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-30 10:44:56,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:56,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-30 10:44:56,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-30 10:44:56,874 INFO L87 Difference]: Start difference. First operand has 233 states, 131 states have (on average 1.9083969465648856) internal successors, (250), 218 states have internal predecessors, (250), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) 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:56,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:56,897 INFO L93 Difference]: Finished difference Result 233 states and 263 transitions. [2025-04-30 10:44:56,898 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-30 10:44:56,899 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:56,899 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:56,904 INFO L225 Difference]: With dead ends: 233 [2025-04-30 10:44:56,904 INFO L226 Difference]: Without dead ends: 231 [2025-04-30 10:44:56,905 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:56,906 INFO L437 NwaCegarLoop]: 263 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, 263 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:56,907 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 263 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:56,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-04-30 10:44:56,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2025-04-30 10:44:56,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 130 states have (on average 1.823076923076923) internal successors, (237), 216 states have internal predecessors, (237), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-04-30 10:44:56,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 261 transitions. [2025-04-30 10:44:56,944 INFO L79 Accepts]: Start accepts. Automaton has 231 states and 261 transitions. Word has length 4 [2025-04-30 10:44:56,945 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:56,945 INFO L485 AbstractCegarLoop]: Abstraction has 231 states and 261 transitions. [2025-04-30 10:44:56,945 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:56,945 INFO L278 IsEmpty]: Start isEmpty. Operand 231 states and 261 transitions. [2025-04-30 10:44:56,945 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-30 10:44:56,945 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:56,945 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-30 10:44:56,945 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:44:56,946 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2025-04-30 10:44:56,946 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:56,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1014370765, now seen corresponding path program 1 times [2025-04-30 10:44:56,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:56,947 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443649830] [2025-04-30 10:44:56,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:56,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:56,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-30 10:44:56,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-30 10:44:56,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:56,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:57,031 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:57,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:57,031 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443649830] [2025-04-30 10:44:57,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443649830] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:57,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:57,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:44:57,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904771913] [2025-04-30 10:44:57,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:57,032 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:44:57,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:57,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:44:57,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:44:57,033 INFO L87 Difference]: Start difference. First operand 231 states and 261 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:57,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:57,173 INFO L93 Difference]: Finished difference Result 230 states and 260 transitions. [2025-04-30 10:44:57,174 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:44:57,174 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:57,174 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:57,177 INFO L225 Difference]: With dead ends: 230 [2025-04-30 10:44:57,177 INFO L226 Difference]: Without dead ends: 230 [2025-04-30 10:44:57,177 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:57,178 INFO L437 NwaCegarLoop]: 255 mSDtfsCounter, 4 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:57,178 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 427 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:57,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-04-30 10:44:57,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2025-04-30 10:44:57,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 130 states have (on average 1.8153846153846154) internal successors, (236), 215 states have internal predecessors, (236), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-04-30 10:44:57,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 260 transitions. [2025-04-30 10:44:57,190 INFO L79 Accepts]: Start accepts. Automaton has 230 states and 260 transitions. Word has length 6 [2025-04-30 10:44:57,190 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:57,190 INFO L485 AbstractCegarLoop]: Abstraction has 230 states and 260 transitions. [2025-04-30 10:44:57,191 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:57,191 INFO L278 IsEmpty]: Start isEmpty. Operand 230 states and 260 transitions. [2025-04-30 10:44:57,191 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-30 10:44:57,191 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:57,191 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:57,191 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:44:57,191 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2025-04-30 10:44:57,191 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:57,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1380722403, now seen corresponding path program 1 times [2025-04-30 10:44:57,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:57,191 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323173955] [2025-04-30 10:44:57,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:57,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:57,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:44:57,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:44:57,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:57,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-30 10:44:57,220 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1035708059] [2025-04-30 10:44:57,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:57,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:57,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:57,223 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:57,224 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:57,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:44:57,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:44:57,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:57,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:57,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-30 10:44:57,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:57,348 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:57,367 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:57,368 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:44:57,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:57,369 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323173955] [2025-04-30 10:44:57,370 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-30 10:44:57,370 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035708059] [2025-04-30 10:44:57,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1035708059] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:57,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:57,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:44:57,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979153868] [2025-04-30 10:44:57,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:57,370 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:44:57,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:57,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:44:57,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:44:57,371 INFO L87 Difference]: Start difference. First operand 230 states and 260 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:57,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:57,502 INFO L93 Difference]: Finished difference Result 239 states and 269 transitions. [2025-04-30 10:44:57,502 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:44:57,503 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:57,503 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:57,504 INFO L225 Difference]: With dead ends: 239 [2025-04-30 10:44:57,505 INFO L226 Difference]: Without dead ends: 239 [2025-04-30 10:44:57,505 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:57,505 INFO L437 NwaCegarLoop]: 250 mSDtfsCounter, 11 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:57,506 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 679 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:57,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-04-30 10:44:57,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2025-04-30 10:44:57,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 138 states have (on average 1.7753623188405796) internal successors, (245), 223 states have internal predecessors, (245), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-04-30 10:44:57,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 269 transitions. [2025-04-30 10:44:57,517 INFO L79 Accepts]: Start accepts. Automaton has 239 states and 269 transitions. Word has length 7 [2025-04-30 10:44:57,517 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:57,517 INFO L485 AbstractCegarLoop]: Abstraction has 239 states and 269 transitions. [2025-04-30 10:44:57,517 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:57,517 INFO L278 IsEmpty]: Start isEmpty. Operand 239 states and 269 transitions. [2025-04-30 10:44:57,518 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-04-30 10:44:57,518 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:57,518 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:57,524 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:44:57,721 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:44:57,721 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2025-04-30 10:44:57,722 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:57,722 INFO L85 PathProgramCache]: Analyzing trace with hash -282348366, now seen corresponding path program 1 times [2025-04-30 10:44:57,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:57,722 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049995182] [2025-04-30 10:44:57,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:57,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:57,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-04-30 10:44:57,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-04-30 10:44:57,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:57,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-30 10:44:57,819 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [114297120] [2025-04-30 10:44:57,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:57,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:57,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:57,824 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:44:57,825 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:44:57,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-04-30 10:44:57,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-04-30 10:44:57,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:57,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:57,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 79 conjuncts are in the unsatisfiable core [2025-04-30 10:44:57,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:58,012 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:44:58,013 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:44:58,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:58,013 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049995182] [2025-04-30 10:44:58,013 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-30 10:44:58,013 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114297120] [2025-04-30 10:44:58,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114297120] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:58,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:58,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:44:58,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656067879] [2025-04-30 10:44:58,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:58,014 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:44:58,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:58,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:44:58,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:44:58,015 INFO L87 Difference]: Start difference. First operand 239 states and 269 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:44:58,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:58,051 INFO L93 Difference]: Finished difference Result 251 states and 281 transitions. [2025-04-30 10:44:58,051 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:44:58,052 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:44:58,052 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:58,053 INFO L225 Difference]: With dead ends: 251 [2025-04-30 10:44:58,053 INFO L226 Difference]: Without dead ends: 241 [2025-04-30 10:44:58,053 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:44:58,054 INFO L437 NwaCegarLoop]: 256 mSDtfsCounter, 2 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 753 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:44:58,055 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 753 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:44:58,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-04-30 10:44:58,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2025-04-30 10:44:58,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 140 states have (on average 1.7642857142857142) internal successors, (247), 225 states have internal predecessors, (247), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-04-30 10:44:58,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 271 transitions. [2025-04-30 10:44:58,068 INFO L79 Accepts]: Start accepts. Automaton has 241 states and 271 transitions. Word has length 66 [2025-04-30 10:44:58,068 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:58,069 INFO L485 AbstractCegarLoop]: Abstraction has 241 states and 271 transitions. [2025-04-30 10:44:58,069 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:44:58,069 INFO L278 IsEmpty]: Start isEmpty. Operand 241 states and 271 transitions. [2025-04-30 10:44:58,070 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-04-30 10:44:58,070 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:58,070 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:44:58,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-30 10:44:58,271 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:44:58,271 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2025-04-30 10:44:58,271 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:58,271 INFO L85 PathProgramCache]: Analyzing trace with hash -403824716, now seen corresponding path program 1 times [2025-04-30 10:44:58,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:58,271 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381179408] [2025-04-30 10:44:58,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:58,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:58,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-04-30 10:44:58,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-04-30 10:44:58,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:58,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-30 10:44:58,482 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1746265946] [2025-04-30 10:44:58,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:58,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:58,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:58,484 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:44:58,485 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:44:58,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-04-30 10:44:58,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-04-30 10:44:58,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:58,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:58,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-30 10:44:58,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:58,696 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:44:58,724 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:44:58,783 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 92 proven. 7 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-04-30 10:44:58,783 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:44:58,924 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 48 proven. 12 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-04-30 10:44:58,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:58,924 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381179408] [2025-04-30 10:44:58,924 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-30 10:44:58,924 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746265946] [2025-04-30 10:44:58,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746265946] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:44:58,924 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:44:58,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2025-04-30 10:44:58,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289474692] [2025-04-30 10:44:58,924 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:44:58,925 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-30 10:44:58,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:58,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-30 10:44:58,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:44:58,925 INFO L87 Difference]: Start difference. First operand 241 states and 271 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-04-30 10:44:59,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:59,190 INFO L93 Difference]: Finished difference Result 260 states and 291 transitions. [2025-04-30 10:44:59,190 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-30 10:44:59,190 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 71 [2025-04-30 10:44:59,190 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:59,191 INFO L225 Difference]: With dead ends: 260 [2025-04-30 10:44:59,191 INFO L226 Difference]: Without dead ends: 245 [2025-04-30 10:44:59,191 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2025-04-30 10:44:59,192 INFO L437 NwaCegarLoop]: 254 mSDtfsCounter, 22 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 1191 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:59,192 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 1191 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:59,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-04-30 10:44:59,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2025-04-30 10:44:59,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 144 states have (on average 1.7430555555555556) internal successors, (251), 229 states have internal predecessors, (251), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-04-30 10:44:59,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 275 transitions. [2025-04-30 10:44:59,198 INFO L79 Accepts]: Start accepts. Automaton has 245 states and 275 transitions. Word has length 71 [2025-04-30 10:44:59,198 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:59,198 INFO L485 AbstractCegarLoop]: Abstraction has 245 states and 275 transitions. [2025-04-30 10:44:59,198 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-04-30 10:44:59,198 INFO L278 IsEmpty]: Start isEmpty. Operand 245 states and 275 transitions. [2025-04-30 10:44:59,199 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-04-30 10:44:59,199 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:59,199 INFO L218 NwaCegarLoop]: trace histogram [20, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:59,206 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:44:59,402 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:44:59,403 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2025-04-30 10:44:59,403 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:59,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1345968334, now seen corresponding path program 2 times [2025-04-30 10:44:59,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:59,403 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010097733] [2025-04-30 10:44:59,403 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:44:59,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:59,430 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 86 statements into 2 equivalence classes. [2025-04-30 10:44:59,550 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 86 of 86 statements. [2025-04-30 10:44:59,551 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:44:59,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-30 10:44:59,557 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1649402379] [2025-04-30 10:44:59,560 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:44:59,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:59,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:59,561 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:44:59,563 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:44:59,671 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 86 statements into 2 equivalence classes. [2025-04-30 10:44:59,841 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 86 of 86 statements. [2025-04-30 10:44:59,841 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:44:59,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:59,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 800 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-04-30 10:44:59,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:59,903 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:44:59,927 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:00,036 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 243 proven. 78 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-04-30 10:45:00,036 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:45:00,319 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 79 proven. 74 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-04-30 10:45:00,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:45:00,319 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010097733] [2025-04-30 10:45:00,319 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-30 10:45:00,320 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649402379] [2025-04-30 10:45:00,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649402379] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:45:00,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:45:00,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2025-04-30 10:45:00,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660879405] [2025-04-30 10:45:00,320 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:45:00,320 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-30 10:45:00,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:45:00,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-30 10:45:00,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2025-04-30 10:45:00,321 INFO L87 Difference]: Start difference. First operand 245 states and 275 transitions. Second operand has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-04-30 10:45:08,525 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification. DAG size of input: 44 DAG size of output: 36 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-30 10:45:17,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:45:17,173 INFO L93 Difference]: Finished difference Result 269 states and 305 transitions. [2025-04-30 10:45:17,173 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-30 10:45:17,174 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 86 [2025-04-30 10:45:17,174 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:45:17,175 INFO L225 Difference]: With dead ends: 269 [2025-04-30 10:45:17,175 INFO L226 Difference]: Without dead ends: 254 [2025-04-30 10:45:17,175 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=307, Invalid=952, Unknown=1, NotChecked=0, Total=1260 [2025-04-30 10:45:17,176 INFO L437 NwaCegarLoop]: 254 mSDtfsCounter, 31 mSDsluCounter, 2610 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 2864 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:45:17,176 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 2864 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-30 10:45:17,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-04-30 10:45:17,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2025-04-30 10:45:17,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 153 states have (on average 1.7189542483660132) internal successors, (263), 238 states have internal predecessors, (263), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-04-30 10:45:17,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 287 transitions. [2025-04-30 10:45:17,182 INFO L79 Accepts]: Start accepts. Automaton has 254 states and 287 transitions. Word has length 86 [2025-04-30 10:45:17,182 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:45:17,182 INFO L485 AbstractCegarLoop]: Abstraction has 254 states and 287 transitions. [2025-04-30 10:45:17,183 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-04-30 10:45:17,183 INFO L278 IsEmpty]: Start isEmpty. Operand 254 states and 287 transitions. [2025-04-30 10:45:17,185 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-04-30 10:45:17,185 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:45:17,185 INFO L218 NwaCegarLoop]: trace histogram [40, 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:45:17,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-30 10:45:17,385 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:17,386 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2025-04-30 10:45:17,386 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:45:17,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1501472334, now seen corresponding path program 3 times [2025-04-30 10:45:17,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:45:17,386 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227445430] [2025-04-30 10:45:17,386 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:45:17,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:45:17,427 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 106 statements into 18 equivalence classes. [2025-04-30 10:45:17,759 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) and asserted 106 of 106 statements. [2025-04-30 10:45:17,760 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2025-04-30 10:45:17,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-30 10:45:17,771 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [834613641] [2025-04-30 10:45:17,771 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:45:17,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:45:17,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:45:17,779 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:17,781 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:17,934 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 106 statements into 18 equivalence classes. [2025-04-30 10:45:17,950 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 106 statements. [2025-04-30 10:45:17,950 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-30 10:45:17,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:45:17,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-30 10:45:17,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:45:17,984 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:17,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1085 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 1070 trivial. 0 not checked. [2025-04-30 10:45:18,000 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:45:18,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:45:18,001 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227445430] [2025-04-30 10:45:18,001 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-30 10:45:18,001 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834613641] [2025-04-30 10:45:18,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834613641] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:45:18,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:45:18,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:45:18,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594386878] [2025-04-30 10:45:18,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:45:18,002 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:45:18,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:45:18,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:45:18,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:45:18,002 INFO L87 Difference]: Start difference. First operand 254 states and 287 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:18,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:45:18,122 INFO L93 Difference]: Finished difference Result 253 states and 286 transitions. [2025-04-30 10:45:18,122 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:45:18,122 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 106 [2025-04-30 10:45:18,123 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:45:18,124 INFO L225 Difference]: With dead ends: 253 [2025-04-30 10:45:18,124 INFO L226 Difference]: Without dead ends: 253 [2025-04-30 10:45:18,124 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 103 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:18,124 INFO L437 NwaCegarLoop]: 262 mSDtfsCounter, 11 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:45:18,124 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 701 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:45:18,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-04-30 10:45:18,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2025-04-30 10:45:18,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 153 states have (on average 1.7124183006535947) internal successors, (262), 237 states have internal predecessors, (262), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-04-30 10:45:18,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 286 transitions. [2025-04-30 10:45:18,131 INFO L79 Accepts]: Start accepts. Automaton has 253 states and 286 transitions. Word has length 106 [2025-04-30 10:45:18,132 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:45:18,132 INFO L485 AbstractCegarLoop]: Abstraction has 253 states and 286 transitions. [2025-04-30 10:45:18,132 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:18,132 INFO L278 IsEmpty]: Start isEmpty. Operand 253 states and 286 transitions. [2025-04-30 10:45:18,134 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-04-30 10:45:18,135 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:45:18,136 INFO L218 NwaCegarLoop]: trace histogram [42, 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:18,141 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:18,336 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:18,336 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2025-04-30 10:45:18,337 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:45:18,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1552200972, now seen corresponding path program 1 times [2025-04-30 10:45:18,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:45:18,337 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306140046] [2025-04-30 10:45:18,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:45:18,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:45:18,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-04-30 10:45:18,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-04-30 10:45:18,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:45:18,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:45:19,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 523 proven. 4 refuted. 0 times theorem prover too weak. 721 trivial. 0 not checked. [2025-04-30 10:45:19,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:45:19,214 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306140046] [2025-04-30 10:45:19,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306140046] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:45:19,214 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817969237] [2025-04-30 10:45:19,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:45:19,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:45:19,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:45:19,217 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:19,218 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:19,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-04-30 10:45:19,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-04-30 10:45:19,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:45:19,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:45:19,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 1159 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-04-30 10:45:19,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:45:19,568 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:19,606 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-30 10:45:19,606 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:19,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 493 proven. 1 refuted. 0 times theorem prover too weak. 721 trivial. 33 not checked. [2025-04-30 10:45:19,619 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:45:19,808 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-30 10:45:19,808 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:19,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 493 proven. 34 refuted. 0 times theorem prover too weak. 721 trivial. 0 not checked. [2025-04-30 10:45:19,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817969237] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:45:19,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:45:19,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 15 [2025-04-30 10:45:19,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574356073] [2025-04-30 10:45:19,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:45:19,826 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-30 10:45:19,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:45:19,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-30 10:45:19,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=172, Unknown=1, NotChecked=26, Total=240 [2025-04-30 10:45:19,826 INFO L87 Difference]: Start difference. First operand 253 states and 286 transitions. Second operand has 16 states, 15 states have (on average 4.0) internal successors, (60), 14 states have internal predecessors, (60), 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:20,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:45:20,456 INFO L93 Difference]: Finished difference Result 352 states and 405 transitions. [2025-04-30 10:45:20,457 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:45:20,457 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.0) internal successors, (60), 14 states have internal predecessors, (60), 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 115 [2025-04-30 10:45:20,457 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:45:20,459 INFO L225 Difference]: With dead ends: 352 [2025-04-30 10:45:20,459 INFO L226 Difference]: Without dead ends: 352 [2025-04-30 10:45:20,459 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 222 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=277, Unknown=1, NotChecked=34, Total=380 [2025-04-30 10:45:20,460 INFO L437 NwaCegarLoop]: 208 mSDtfsCounter, 457 mSDsluCounter, 1637 mSDsCounter, 0 mSdLazyCounter, 1025 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 1845 SdHoareTripleChecker+Invalid, 1440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 370 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-30 10:45:20,460 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 1845 Invalid, 1440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1025 Invalid, 0 Unknown, 370 Unchecked, 0.5s Time] [2025-04-30 10:45:20,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2025-04-30 10:45:20,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 251. [2025-04-30 10:45:20,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 153 states have (on average 1.6993464052287581) internal successors, (260), 235 states have internal predecessors, (260), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-04-30 10:45:20,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 284 transitions. [2025-04-30 10:45:20,466 INFO L79 Accepts]: Start accepts. Automaton has 251 states and 284 transitions. Word has length 115 [2025-04-30 10:45:20,467 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:45:20,467 INFO L485 AbstractCegarLoop]: Abstraction has 251 states and 284 transitions. [2025-04-30 10:45:20,467 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.0) internal successors, (60), 14 states have internal predecessors, (60), 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:20,467 INFO L278 IsEmpty]: Start isEmpty. Operand 251 states and 284 transitions. [2025-04-30 10:45:20,468 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-04-30 10:45:20,468 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:45:20,468 INFO L218 NwaCegarLoop]: trace histogram [42, 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:20,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-30 10:45:20,668 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:20,668 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2025-04-30 10:45:20,669 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:45:20,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1552200973, now seen corresponding path program 1 times [2025-04-30 10:45:20,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:45:20,669 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79190025] [2025-04-30 10:45:20,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:45:20,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:45:20,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-04-30 10:45:20,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-04-30 10:45:20,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:45:20,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:45:22,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 493 proven. 70 refuted. 0 times theorem prover too weak. 685 trivial. 0 not checked. [2025-04-30 10:45:22,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:45:22,417 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79190025] [2025-04-30 10:45:22,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79190025] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:45:22,417 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108054061] [2025-04-30 10:45:22,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:45:22,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:45:22,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:45:22,419 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:22,421 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:22,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-04-30 10:45:23,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-04-30 10:45:23,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:45:23,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:45:23,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 1159 conjuncts, 85 conjuncts are in the unsatisfiable core [2025-04-30 10:45:23,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:45:23,642 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:25,388 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:25,444 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:45:25,445 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:25,451 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:45:25,451 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:25,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 405 proven. 352 refuted. 0 times theorem prover too weak. 433 trivial. 58 not checked. [2025-04-30 10:45:25,489 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:45:25,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108054061] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:45:25,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:45:25,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 29] total 47 [2025-04-30 10:45:25,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030332145] [2025-04-30 10:45:25,645 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:45:25,645 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-04-30 10:45:25,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:45:25,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-04-30 10:45:25,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=2195, Unknown=1, NotChecked=94, Total=2450 [2025-04-30 10:45:25,647 INFO L87 Difference]: Start difference. First operand 251 states and 284 transitions. Second operand has 48 states, 45 states have (on average 1.8444444444444446) internal successors, (83), 43 states have internal predecessors, (83), 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:30,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:45:30,998 INFO L93 Difference]: Finished difference Result 381 states and 445 transitions. [2025-04-30 10:45:30,998 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-30 10:45:30,998 INFO L79 Accepts]: Start accepts. Automaton has has 48 states, 45 states have (on average 1.8444444444444446) internal successors, (83), 43 states have internal predecessors, (83), 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 115 [2025-04-30 10:45:30,999 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:45:31,000 INFO L225 Difference]: With dead ends: 381 [2025-04-30 10:45:31,000 INFO L226 Difference]: Without dead ends: 381 [2025-04-30 10:45:31,002 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1073 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=344, Invalid=4351, Unknown=1, NotChecked=134, Total=4830 [2025-04-30 10:45:31,003 INFO L437 NwaCegarLoop]: 121 mSDtfsCounter, 388 mSDsluCounter, 2215 mSDsCounter, 0 mSdLazyCounter, 6734 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 2336 SdHoareTripleChecker+Invalid, 7153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 6734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 389 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-04-30 10:45:31,003 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 2336 Invalid, 7153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 6734 Invalid, 0 Unknown, 389 Unchecked, 3.9s Time] [2025-04-30 10:45:31,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2025-04-30 10:45:31,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 249. [2025-04-30 10:45:31,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 153 states have (on average 1.6862745098039216) internal successors, (258), 233 states have internal predecessors, (258), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-04-30 10:45:31,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 282 transitions. [2025-04-30 10:45:31,013 INFO L79 Accepts]: Start accepts. Automaton has 249 states and 282 transitions. Word has length 115 [2025-04-30 10:45:31,013 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:45:31,013 INFO L485 AbstractCegarLoop]: Abstraction has 249 states and 282 transitions. [2025-04-30 10:45:31,014 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 45 states have (on average 1.8444444444444446) internal successors, (83), 43 states have internal predecessors, (83), 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:31,014 INFO L278 IsEmpty]: Start isEmpty. Operand 249 states and 282 transitions. [2025-04-30 10:45:31,014 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-04-30 10:45:31,014 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:45:31,014 INFO L218 NwaCegarLoop]: trace histogram [42, 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:31,035 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:31,215 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:31,215 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2025-04-30 10:45:31,216 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:45:31,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1311489837, now seen corresponding path program 1 times [2025-04-30 10:45:31,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:45:31,216 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443011889] [2025-04-30 10:45:31,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:45:31,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:45:31,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-04-30 10:45:31,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-04-30 10:45:31,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:45:31,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:45:32,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 698 proven. 96 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2025-04-30 10:45:32,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:45:32,158 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443011889] [2025-04-30 10:45:32,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443011889] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:45:32,158 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970456926] [2025-04-30 10:45:32,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:45:32,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:45:32,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:45:32,160 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:32,162 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:32,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-04-30 10:45:32,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-04-30 10:45:32,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:45:32,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:45:32,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 1176 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-30 10:45:32,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:45:32,503 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:32,536 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-30 10:45:32,536 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:32,572 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-30 10:45:32,572 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:32,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 638 proven. 2 refuted. 0 times theorem prover too weak. 488 trivial. 120 not checked. [2025-04-30 10:45:32,583 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:45:32,927 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-30 10:45:32,928 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:32,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 638 proven. 122 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked. [2025-04-30 10:45:32,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1970456926] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:45:32,942 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:45:32,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 11] total 22 [2025-04-30 10:45:32,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91969042] [2025-04-30 10:45:32,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:45:32,943 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-30 10:45:32,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:45:32,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-30 10:45:32,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=403, Unknown=1, NotChecked=40, Total=506 [2025-04-30 10:45:32,944 INFO L87 Difference]: Start difference. First operand 249 states and 282 transitions. Second operand has 23 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 20 states have internal predecessors, (73), 3 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) [2025-04-30 10:45:33,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:45:33,885 INFO L93 Difference]: Finished difference Result 347 states and 400 transitions. [2025-04-30 10:45:33,885 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:45:33,886 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 20 states have internal predecessors, (73), 3 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) Word has length 117 [2025-04-30 10:45:33,886 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:45:33,887 INFO L225 Difference]: With dead ends: 347 [2025-04-30 10:45:33,887 INFO L226 Difference]: Without dead ends: 347 [2025-04-30 10:45:33,887 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 224 SyntacticMatches, 8 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=606, Unknown=1, NotChecked=50, Total=756 [2025-04-30 10:45:33,887 INFO L437 NwaCegarLoop]: 197 mSDtfsCounter, 361 mSDsluCounter, 2486 mSDsCounter, 0 mSdLazyCounter, 1670 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 2683 SdHoareTripleChecker+Invalid, 2069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 365 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-30 10:45:33,888 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 2683 Invalid, 2069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1670 Invalid, 0 Unknown, 365 Unchecked, 0.8s Time] [2025-04-30 10:45:33,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2025-04-30 10:45:33,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 246. [2025-04-30 10:45:33,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 153 states have (on average 1.6666666666666667) internal successors, (255), 230 states have internal predecessors, (255), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-04-30 10:45:33,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 279 transitions. [2025-04-30 10:45:33,893 INFO L79 Accepts]: Start accepts. Automaton has 246 states and 279 transitions. Word has length 117 [2025-04-30 10:45:33,893 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:45:33,894 INFO L485 AbstractCegarLoop]: Abstraction has 246 states and 279 transitions. [2025-04-30 10:45:33,894 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 20 states have internal predecessors, (73), 3 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) [2025-04-30 10:45:33,894 INFO L278 IsEmpty]: Start isEmpty. Operand 246 states and 279 transitions. [2025-04-30 10:45:33,894 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-04-30 10:45:33,894 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:45:33,894 INFO L218 NwaCegarLoop]: trace histogram [42, 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:33,903 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:34,095 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:34,095 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2025-04-30 10:45:34,095 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:45:34,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1311489838, now seen corresponding path program 1 times [2025-04-30 10:45:34,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:45:34,096 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532932027] [2025-04-30 10:45:34,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:45:34,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:45:34,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-04-30 10:45:34,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-04-30 10:45:34,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:45:34,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:45:35,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 638 proven. 192 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked. [2025-04-30 10:45:35,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:45:35,998 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532932027] [2025-04-30 10:45:35,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532932027] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:45:35,998 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053093084] [2025-04-30 10:45:35,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:45:35,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:45:35,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:45:36,000 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:36,001 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:36,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-04-30 10:45:36,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-04-30 10:45:36,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:45:36,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:45:36,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 1176 conjuncts, 126 conjuncts are in the unsatisfiable core [2025-04-30 10:45:36,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:45:37,126 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:38,773 WARN L871 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (store |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1) |c_#valid|) (= (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:39,200 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:45:39,200 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:39,223 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-30 10:45:39,224 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-04-30 10:45:39,326 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:39,367 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:45:39,368 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-30 10:45:39,380 INFO L325 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-04-30 10:45:39,380 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-04-30 10:45:39,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 386 proven. 569 refuted. 0 times theorem prover too weak. 117 trivial. 176 not checked. [2025-04-30 10:45:39,764 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:45:39,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1053093084] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:45:39,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:45:39,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 38] total 59 [2025-04-30 10:45:39,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058100968] [2025-04-30 10:45:39,903 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:45:39,903 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2025-04-30 10:45:39,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:45:39,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2025-04-30 10:45:39,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=3351, Unknown=2, NotChecked=234, Total=3782 [2025-04-30 10:45:39,904 INFO L87 Difference]: Start difference. First operand 246 states and 279 transitions. Second operand has 60 states, 58 states have (on average 1.9482758620689655) internal successors, (113), 57 states have internal predecessors, (113), 4 states have call successors, (8), 2 states have call predecessors, (8), 7 states have return successors, (9), 7 states have call predecessors, (9), 4 states have call successors, (9) [2025-04-30 10:45:43,954 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:48,268 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:52,440 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:56,621 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:46:00,865 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] Killed by 15