./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/memsafety/test-0237.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-0237.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 59c31190ccc8063bc9e40e87ef868627685497d396c28c826c00fa8abad7dfea --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:45:08,151 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:45:08,195 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-30 10:45:08,200 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:45:08,202 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:45:08,218 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:45:08,218 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:45:08,218 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:45:08,219 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:45:08,219 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:45:08,219 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:45:08,219 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:45:08,219 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:45:08,219 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:45:08,219 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:45:08,219 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:45:08,219 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:45:08,220 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:45:08,220 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:45:08,220 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:45:08,220 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-30 10:45:08,220 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-30 10:45:08,220 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-30 10:45:08,220 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:45:08,220 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-30 10:45:08,220 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:45:08,220 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:45:08,220 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:45:08,220 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:45:08,221 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:45:08,221 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:45:08,221 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:45:08,221 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:45:08,221 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:45:08,221 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:45:08,221 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:45:08,221 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:45:08,221 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:45:08,221 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:45:08,221 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:45:08,222 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:45:08,222 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:45:08,222 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:45:08,222 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:45:08,222 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:45:08,222 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:45:08,222 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 -> 59c31190ccc8063bc9e40e87ef868627685497d396c28c826c00fa8abad7dfea [2025-04-30 10:45:08,446 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:45:08,451 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:45:08,452 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:45:08,453 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:45:08,453 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:45:08,454 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0237.i [2025-04-30 10:45:09,696 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cc54bb39/fb2d4306d43a4777a98ffcbe3ef163f9/FLAGac1b568e4 [2025-04-30 10:45:09,933 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:45:09,934 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/memsafety/test-0237.i [2025-04-30 10:45:09,953 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cc54bb39/fb2d4306d43a4777a98ffcbe3ef163f9/FLAGac1b568e4 [2025-04-30 10:45:11,797 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cc54bb39/fb2d4306d43a4777a98ffcbe3ef163f9 [2025-04-30 10:45:11,799 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:45:11,799 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:45:11,800 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:45:11,800 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:45:11,803 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:45:11,804 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:45:11" (1/1) ... [2025-04-30 10:45:11,804 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@166c005a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:45:11, skipping insertion in model container [2025-04-30 10:45:11,805 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:45:11" (1/1) ... [2025-04-30 10:45:11,831 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:45:12,119 WARN L1150 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-04-30 10:45:12,139 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:45:12,147 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:45:12,199 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:45:12,222 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:45:12,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:45:12 WrapperNode [2025-04-30 10:45:12,223 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:45:12,224 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:45:12,224 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:45:12,224 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:45:12,227 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:45:12" (1/1) ... [2025-04-30 10:45:12,240 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:45:12" (1/1) ... [2025-04-30 10:45:12,258 INFO L138 Inliner]: procedures = 188, calls = 66, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 212 [2025-04-30 10:45:12,258 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:45:12,258 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:45:12,258 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:45:12,258 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:45:12,267 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:45:12" (1/1) ... [2025-04-30 10:45:12,267 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:45:12" (1/1) ... [2025-04-30 10:45:12,273 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:45:12" (1/1) ... [2025-04-30 10:45:12,305 INFO L175 MemorySlicer]: Split 38 memory accesses to 3 slices as follows [2, 4, 32]. 84 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 18 writes are split as follows [0, 1, 17]. [2025-04-30 10:45:12,305 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:45:12" (1/1) ... [2025-04-30 10:45:12,305 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:45:12" (1/1) ... [2025-04-30 10:45:12,312 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:45:12" (1/1) ... [2025-04-30 10:45:12,313 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:45:12" (1/1) ... [2025-04-30 10:45:12,315 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:45:12" (1/1) ... [2025-04-30 10:45:12,316 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:45:12" (1/1) ... [2025-04-30 10:45:12,317 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:45:12" (1/1) ... [2025-04-30 10:45:12,321 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:45:12,322 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:45:12,322 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:45:12,322 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:45:12,322 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:45:12" (1/1) ... [2025-04-30 10:45:12,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:45:12,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:45:12,350 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:45:12,352 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:45:12,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-30 10:45:12,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:45:12,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-30 10:45:12,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-30 10:45:12,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-04-30 10:45:12,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-30 10:45:12,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-30 10:45:12,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-04-30 10:45:12,366 INFO L130 BoogieDeclarations]: Found specification of procedure zalloc_or_die [2025-04-30 10:45:12,366 INFO L138 BoogieDeclarations]: Found implementation of procedure zalloc_or_die [2025-04-30 10:45:12,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-30 10:45:12,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-30 10:45:12,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-30 10:45:12,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-04-30 10:45:12,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-30 10:45:12,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-30 10:45:12,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-30 10:45:12,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:45:12,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:45:12,482 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:45:12,484 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:45:12,902 INFO L? ?]: Removed 225 outVars from TransFormulas that were not future-live. [2025-04-30 10:45:12,902 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:45:12,915 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:45:12,915 INFO L312 CfgBuilder]: Removed 10 assume(true) statements. [2025-04-30 10:45:12,915 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:45:12 BoogieIcfgContainer [2025-04-30 10:45:12,915 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:45:12,935 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:45:12,935 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:45:12,939 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:45:12,939 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:45:11" (1/3) ... [2025-04-30 10:45:12,940 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59e34ebb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:45:12, skipping insertion in model container [2025-04-30 10:45:12,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:45:12" (2/3) ... [2025-04-30 10:45:12,941 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59e34ebb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:45:12, skipping insertion in model container [2025-04-30 10:45:12,941 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:45:12" (3/3) ... [2025-04-30 10:45:12,942 INFO L128 eAbstractionObserver]: Analyzing ICFG test-0237.i [2025-04-30 10:45:12,952 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:45:12,952 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-0237.i that has 2 procedures, 205 locations, 237 edges, 1 initial locations, 11 loop locations, and 87 error locations. [2025-04-30 10:45:12,982 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:45:12,988 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;@10eb5c28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:45:12,988 INFO L341 AbstractCegarLoop]: Starting to check reachability of 87 error locations. [2025-04-30 10:45:12,991 INFO L278 IsEmpty]: Start isEmpty. Operand has 205 states, 110 states have (on average 1.990909090909091) internal successors, (219), 197 states have internal predecessors, (219), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-30 10:45:12,994 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-04-30 10:45:12,994 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:45:12,995 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-04-30 10:45:12,995 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2025-04-30 10:45:12,998 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:45:12,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1546246, now seen corresponding path program 1 times [2025-04-30 10:45:13,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:45:13,003 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835051596] [2025-04-30 10:45:13,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:45:13,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:45:13,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-30 10:45:13,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-30 10:45:13,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:45:13,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:45:13,086 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:45:13,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:45:13,087 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835051596] [2025-04-30 10:45:13,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835051596] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:45:13,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:45:13,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:45:13,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704653726] [2025-04-30 10:45:13,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:45:13,092 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-30 10:45:13,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:45:13,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-30 10:45:13,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-30 10:45:13,111 INFO L87 Difference]: Start difference. First operand has 205 states, 110 states have (on average 1.990909090909091) internal successors, (219), 197 states have internal predecessors, (219), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) 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:45:13,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:45:13,138 INFO L93 Difference]: Finished difference Result 205 states and 220 transitions. [2025-04-30 10:45:13,138 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-30 10:45:13,139 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:45:13,139 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:45:13,145 INFO L225 Difference]: With dead ends: 205 [2025-04-30 10:45:13,145 INFO L226 Difference]: Without dead ends: 203 [2025-04-30 10:45:13,148 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:45:13,150 INFO L437 NwaCegarLoop]: 220 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, 220 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:45:13,153 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:45:13,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-04-30 10:45:13,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2025-04-30 10:45:13,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 109 states have (on average 1.889908256880734) internal successors, (206), 195 states have internal predecessors, (206), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-30 10:45:13,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 218 transitions. [2025-04-30 10:45:13,194 INFO L79 Accepts]: Start accepts. Automaton has 203 states and 218 transitions. Word has length 4 [2025-04-30 10:45:13,194 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:45:13,195 INFO L485 AbstractCegarLoop]: Abstraction has 203 states and 218 transitions. [2025-04-30 10:45:13,195 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:45:13,195 INFO L278 IsEmpty]: Start isEmpty. Operand 203 states and 218 transitions. [2025-04-30 10:45:13,195 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-30 10:45:13,195 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:45:13,195 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-30 10:45:13,195 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:45:13,195 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2025-04-30 10:45:13,196 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:45:13,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1481495860, now seen corresponding path program 1 times [2025-04-30 10:45:13,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:45:13,197 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566181331] [2025-04-30 10:45:13,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:45:13,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:45:13,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-30 10:45:13,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-30 10:45:13,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:45:13,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:45:13,324 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:45:13,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:45:13,325 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566181331] [2025-04-30 10:45:13,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566181331] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:45:13,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:45:13,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:45:13,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738759239] [2025-04-30 10:45:13,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:45:13,326 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:45:13,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:45:13,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:45:13,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:45:13,327 INFO L87 Difference]: Start difference. First operand 203 states and 218 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:45:13,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:45:13,444 INFO L93 Difference]: Finished difference Result 202 states and 217 transitions. [2025-04-30 10:45:13,444 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:45:13,444 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:45:13,444 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:45:13,445 INFO L225 Difference]: With dead ends: 202 [2025-04-30 10:45:13,445 INFO L226 Difference]: Without dead ends: 202 [2025-04-30 10:45:13,445 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:45:13,446 INFO L437 NwaCegarLoop]: 212 mSDtfsCounter, 4 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 341 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:45:13,446 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 341 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:45:13,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-04-30 10:45:13,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2025-04-30 10:45:13,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 109 states have (on average 1.8807339449541285) internal successors, (205), 194 states have internal predecessors, (205), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-30 10:45:13,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 217 transitions. [2025-04-30 10:45:13,456 INFO L79 Accepts]: Start accepts. Automaton has 202 states and 217 transitions. Word has length 6 [2025-04-30 10:45:13,456 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:45:13,456 INFO L485 AbstractCegarLoop]: Abstraction has 202 states and 217 transitions. [2025-04-30 10:45:13,457 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:45:13,457 INFO L278 IsEmpty]: Start isEmpty. Operand 202 states and 217 transitions. [2025-04-30 10:45:13,458 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-30 10:45:13,458 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:45:13,458 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:45:13,458 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:45:13,458 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2025-04-30 10:45:13,458 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:45:13,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1318268562, now seen corresponding path program 1 times [2025-04-30 10:45:13,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:45:13,459 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428675876] [2025-04-30 10:45:13,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:45:13,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:45:13,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:45:13,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:45:13,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:45:13,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-30 10:45:13,485 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1254218659] [2025-04-30 10:45:13,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:45:13,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:45:13,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:45:13,489 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:45:13,491 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:45:13,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:45:13,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:45:13,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:45:13,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:45:13,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-30 10:45:13,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:45:13,614 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:13,634 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:45:13,635 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:45:13,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:45:13,635 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428675876] [2025-04-30 10:45:13,635 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-30 10:45:13,635 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254218659] [2025-04-30 10:45:13,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254218659] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:45:13,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:45:13,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:45:13,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691039434] [2025-04-30 10:45:13,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:45:13,636 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:45:13,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:45:13,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:45:13,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:45:13,636 INFO L87 Difference]: Start difference. First operand 202 states and 217 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:45:13,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:45:13,757 INFO L93 Difference]: Finished difference Result 211 states and 226 transitions. [2025-04-30 10:45:13,757 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:45:13,757 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:45:13,757 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:45:13,758 INFO L225 Difference]: With dead ends: 211 [2025-04-30 10:45:13,758 INFO L226 Difference]: Without dead ends: 211 [2025-04-30 10:45:13,758 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:45:13,759 INFO L437 NwaCegarLoop]: 211 mSDtfsCounter, 11 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 562 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:45:13,759 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 562 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:45:13,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-04-30 10:45:13,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2025-04-30 10:45:13,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 117 states have (on average 1.829059829059829) internal successors, (214), 202 states have internal predecessors, (214), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-30 10:45:13,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 226 transitions. [2025-04-30 10:45:13,773 INFO L79 Accepts]: Start accepts. Automaton has 211 states and 226 transitions. Word has length 7 [2025-04-30 10:45:13,773 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:45:13,773 INFO L485 AbstractCegarLoop]: Abstraction has 211 states and 226 transitions. [2025-04-30 10:45:13,773 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:45:13,773 INFO L278 IsEmpty]: Start isEmpty. Operand 211 states and 226 transitions. [2025-04-30 10:45:13,773 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-30 10:45:13,773 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:45:13,773 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:45:13,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-30 10:45:13,978 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:45:13,978 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2025-04-30 10:45:13,978 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:45:13,979 INFO L85 PathProgramCache]: Analyzing trace with hash 474613509, now seen corresponding path program 1 times [2025-04-30 10:45:13,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:45:13,979 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384627863] [2025-04-30 10:45:13,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:45:13,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:45:13,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-30 10:45:14,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-30 10:45:14,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:45:14,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-30 10:45:14,014 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [48731569] [2025-04-30 10:45:14,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:45:14,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:45:14,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:45:14,020 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:45:14,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-30 10:45:14,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-30 10:45:14,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-30 10:45:14,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:45:14,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:45:14,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-30 10:45:14,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:45:14,140 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:14,158 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:45:14,158 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:45:14,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:45:14,158 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384627863] [2025-04-30 10:45:14,158 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-30 10:45:14,159 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48731569] [2025-04-30 10:45:14,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [48731569] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:45:14,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:45:14,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:45:14,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980299228] [2025-04-30 10:45:14,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:45:14,159 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:45:14,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:45:14,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:45:14,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:45:14,160 INFO L87 Difference]: Start difference. First operand 211 states and 226 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:45:14,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:45:14,278 INFO L93 Difference]: Finished difference Result 220 states and 235 transitions. [2025-04-30 10:45:14,279 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:45:14,279 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2025-04-30 10:45:14,279 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:45:14,280 INFO L225 Difference]: With dead ends: 220 [2025-04-30 10:45:14,280 INFO L226 Difference]: Without dead ends: 220 [2025-04-30 10:45:14,281 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 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:14,281 INFO L437 NwaCegarLoop]: 217 mSDtfsCounter, 11 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:45:14,282 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 565 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:45:14,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-04-30 10:45:14,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2025-04-30 10:45:14,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 125 states have (on average 1.784) internal successors, (223), 210 states have internal predecessors, (223), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-30 10:45:14,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 235 transitions. [2025-04-30 10:45:14,295 INFO L79 Accepts]: Start accepts. Automaton has 220 states and 235 transitions. Word has length 19 [2025-04-30 10:45:14,295 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:45:14,295 INFO L485 AbstractCegarLoop]: Abstraction has 220 states and 235 transitions. [2025-04-30 10:45:14,295 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:45:14,296 INFO L278 IsEmpty]: Start isEmpty. Operand 220 states and 235 transitions. [2025-04-30 10:45:14,296 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-04-30 10:45:14,296 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:45:14,296 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:45:14,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-30 10:45:14,497 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-04-30 10:45:14,497 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2025-04-30 10:45:14,498 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:45:14,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1968006449, now seen corresponding path program 1 times [2025-04-30 10:45:14,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:45:14,498 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977780567] [2025-04-30 10:45:14,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:45:14,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:45:14,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-04-30 10:45:14,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-04-30 10:45:14,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:45:14,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-30 10:45:14,569 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [504331962] [2025-04-30 10:45:14,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:45:14,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:45:14,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:45:14,572 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:45:14,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-30 10:45:14,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-04-30 10:45:14,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-04-30 10:45:14,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:45:14,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:45:14,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-30 10:45:14,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:45:14,751 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2025-04-30 10:45:14,805 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:14,862 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-30 10:45:14,862 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:45:14,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:45:14,862 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977780567] [2025-04-30 10:45:14,862 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-30 10:45:14,862 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504331962] [2025-04-30 10:45:14,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [504331962] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:45:14,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:45:14,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:45:14,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715958366] [2025-04-30 10:45:14,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:45:14,863 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:45:14,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:45:14,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:45:14,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:45:14,863 INFO L87 Difference]: Start difference. First operand 220 states and 235 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2025-04-30 10:45:14,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:45:14,984 INFO L93 Difference]: Finished difference Result 238 states and 253 transitions. [2025-04-30 10:45:14,984 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:45:14,984 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 66 [2025-04-30 10:45:14,984 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:45:14,985 INFO L225 Difference]: With dead ends: 238 [2025-04-30 10:45:14,985 INFO L226 Difference]: Without dead ends: 223 [2025-04-30 10:45:14,985 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:45:14,986 INFO L437 NwaCegarLoop]: 212 mSDtfsCounter, 3 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:45:14,988 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 765 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:45:14,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-04-30 10:45:14,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2025-04-30 10:45:14,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 128 states have (on average 1.765625) internal successors, (226), 213 states have internal predecessors, (226), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-30 10:45:14,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 238 transitions. [2025-04-30 10:45:14,996 INFO L79 Accepts]: Start accepts. Automaton has 223 states and 238 transitions. Word has length 66 [2025-04-30 10:45:14,996 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:45:14,996 INFO L485 AbstractCegarLoop]: Abstraction has 223 states and 238 transitions. [2025-04-30 10:45:14,996 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2025-04-30 10:45:14,996 INFO L278 IsEmpty]: Start isEmpty. Operand 223 states and 238 transitions. [2025-04-30 10:45:14,997 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-04-30 10:45:14,997 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:45:14,997 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:45:15,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-30 10:45:15,198 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:45:15,198 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2025-04-30 10:45:15,198 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:45:15,198 INFO L85 PathProgramCache]: Analyzing trace with hash -2027590653, now seen corresponding path program 1 times [2025-04-30 10:45:15,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:45:15,198 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566887867] [2025-04-30 10:45:15,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:45:15,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:45:15,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-04-30 10:45:15,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-04-30 10:45:15,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:45:15,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-30 10:45:15,409 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1695299304] [2025-04-30 10:45:15,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:45:15,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:45:15,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:45:15,411 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:45:15,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-30 10:45:15,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-04-30 10:45:15,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-04-30 10:45:15,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:45:15,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:45:15,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-30 10:45:15,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:45:15,637 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-30 10:45:15,663 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:15,723 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 58 proven. 9 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-04-30 10:45:15,723 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:45:15,912 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 59 proven. 1 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-04-30 10:45:15,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:45:15,913 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566887867] [2025-04-30 10:45:15,913 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-30 10:45:15,913 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695299304] [2025-04-30 10:45:15,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695299304] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:45:15,913 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:45:15,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2025-04-30 10:45:15,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230624017] [2025-04-30 10:45:15,914 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:45:15,914 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-30 10:45:15,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:45:15,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-30 10:45:15,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:45:15,915 INFO L87 Difference]: Start difference. First operand 223 states and 238 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2025-04-30 10:45:16,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:45:16,260 INFO L93 Difference]: Finished difference Result 248 states and 264 transitions. [2025-04-30 10:45:16,260 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-30 10:45:16,260 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 71 [2025-04-30 10:45:16,260 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:45:16,261 INFO L225 Difference]: With dead ends: 248 [2025-04-30 10:45:16,261 INFO L226 Difference]: Without dead ends: 228 [2025-04-30 10:45:16,262 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2025-04-30 10:45:16,262 INFO L437 NwaCegarLoop]: 209 mSDtfsCounter, 22 mSDsluCounter, 1290 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 1499 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:45:16,262 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 1499 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:45:16,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-04-30 10:45:16,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2025-04-30 10:45:16,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 133 states have (on average 1.736842105263158) internal successors, (231), 218 states have internal predecessors, (231), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-30 10:45:16,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 243 transitions. [2025-04-30 10:45:16,270 INFO L79 Accepts]: Start accepts. Automaton has 228 states and 243 transitions. Word has length 71 [2025-04-30 10:45:16,271 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:45:16,271 INFO L485 AbstractCegarLoop]: Abstraction has 228 states and 243 transitions. [2025-04-30 10:45:16,271 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2025-04-30 10:45:16,271 INFO L278 IsEmpty]: Start isEmpty. Operand 228 states and 243 transitions. [2025-04-30 10:45:16,272 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-04-30 10:45:16,272 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:45:16,272 INFO L218 NwaCegarLoop]: trace histogram [18, 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:16,279 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:16,472 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:16,473 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2025-04-30 10:45:16,473 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:45:16,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1880460047, now seen corresponding path program 2 times [2025-04-30 10:45:16,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:45:16,473 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460979173] [2025-04-30 10:45:16,473 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:45:16,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:45:16,503 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 84 statements into 2 equivalence classes. [2025-04-30 10:45:16,654 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 84 of 84 statements. [2025-04-30 10:45:16,654 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:45:16,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-30 10:45:16,661 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [279265256] [2025-04-30 10:45:16,661 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:45:16,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:45:16,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:45:16,665 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:16,668 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:16,771 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 84 statements into 2 equivalence classes. [2025-04-30 10:45:16,952 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 84 of 84 statements. [2025-04-30 10:45:16,952 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:45:16,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:45:16,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 786 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-30 10:45:16,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:45:16,978 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-30 10:45:17,001 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:17,076 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 95 proven. 3 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2025-04-30 10:45:17,077 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:45:17,268 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 15 proven. 91 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-04-30 10:45:17,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:45:17,268 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460979173] [2025-04-30 10:45:17,268 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-30 10:45:17,268 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279265256] [2025-04-30 10:45:17,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [279265256] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:45:17,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:45:17,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2025-04-30 10:45:17,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265498563] [2025-04-30 10:45:17,268 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:45:17,268 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-30 10:45:17,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:45:17,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-30 10:45:17,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-04-30 10:45:17,269 INFO L87 Difference]: Start difference. First operand 228 states and 243 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2025-04-30 10:45:17,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:45:17,624 INFO L93 Difference]: Finished difference Result 248 states and 265 transitions. [2025-04-30 10:45:17,624 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-30 10:45:17,624 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 84 [2025-04-30 10:45:17,624 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:45:17,625 INFO L225 Difference]: With dead ends: 248 [2025-04-30 10:45:17,625 INFO L226 Difference]: Without dead ends: 233 [2025-04-30 10:45:17,626 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=150, Invalid=312, Unknown=0, NotChecked=0, Total=462 [2025-04-30 10:45:17,626 INFO L437 NwaCegarLoop]: 207 mSDtfsCounter, 23 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 952 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:45:17,626 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 952 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:45:17,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-04-30 10:45:17,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2025-04-30 10:45:17,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 138 states have (on average 1.710144927536232) internal successors, (236), 223 states have internal predecessors, (236), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-30 10:45:17,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 248 transitions. [2025-04-30 10:45:17,630 INFO L79 Accepts]: Start accepts. Automaton has 233 states and 248 transitions. Word has length 84 [2025-04-30 10:45:17,630 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:45:17,630 INFO L485 AbstractCegarLoop]: Abstraction has 233 states and 248 transitions. [2025-04-30 10:45:17,631 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2025-04-30 10:45:17,631 INFO L278 IsEmpty]: Start isEmpty. Operand 233 states and 248 transitions. [2025-04-30 10:45:17,631 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-04-30 10:45:17,631 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:45:17,632 INFO L218 NwaCegarLoop]: trace histogram [22, 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,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-30 10:45:17,832 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:17,833 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2025-04-30 10:45:17,833 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:45:17,833 INFO L85 PathProgramCache]: Analyzing trace with hash -2047012239, now seen corresponding path program 3 times [2025-04-30 10:45:17,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:45:17,833 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259396165] [2025-04-30 10:45:17,833 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:45:17,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:45:17,858 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 88 statements into 12 equivalence classes. [2025-04-30 10:45:18,050 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) and asserted 88 of 88 statements. [2025-04-30 10:45:18,051 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2025-04-30 10:45:18,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-30 10:45:18,056 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1414856325] [2025-04-30 10:45:18,056 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:45:18,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:45:18,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:45:18,058 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:18,059 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:18,166 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 88 statements into 12 equivalence classes. [2025-04-30 10:45:18,180 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 88 statements. [2025-04-30 10:45:18,180 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-30 10:45:18,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:45:18,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-30 10:45:18,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:45:18,198 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:18,209 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 431 trivial. 0 not checked. [2025-04-30 10:45:18,209 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:45:18,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:45:18,209 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259396165] [2025-04-30 10:45:18,209 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-30 10:45:18,209 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414856325] [2025-04-30 10:45:18,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1414856325] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:45:18,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:45:18,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:45:18,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636548465] [2025-04-30 10:45:18,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:45:18,210 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:45:18,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:45:18,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:45:18,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:45:18,211 INFO L87 Difference]: Start difference. First operand 233 states and 248 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,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:45:18,300 INFO L93 Difference]: Finished difference Result 232 states and 247 transitions. [2025-04-30 10:45:18,300 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:45:18,300 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 88 [2025-04-30 10:45:18,301 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:45:18,301 INFO L225 Difference]: With dead ends: 232 [2025-04-30 10:45:18,301 INFO L226 Difference]: Without dead ends: 232 [2025-04-30 10:45:18,302 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 85 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,302 INFO L437 NwaCegarLoop]: 219 mSDtfsCounter, 11 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 572 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,302 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 572 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,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-04-30 10:45:18,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2025-04-30 10:45:18,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 138 states have (on average 1.7028985507246377) internal successors, (235), 222 states have internal predecessors, (235), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-30 10:45:18,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 247 transitions. [2025-04-30 10:45:18,307 INFO L79 Accepts]: Start accepts. Automaton has 232 states and 247 transitions. Word has length 88 [2025-04-30 10:45:18,307 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:45:18,307 INFO L485 AbstractCegarLoop]: Abstraction has 232 states and 247 transitions. [2025-04-30 10:45:18,307 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,307 INFO L278 IsEmpty]: Start isEmpty. Operand 232 states and 247 transitions. [2025-04-30 10:45:18,308 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-04-30 10:45:18,308 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:45:18,308 INFO L218 NwaCegarLoop]: trace histogram [25, 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,314 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:18,508 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:18,508 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2025-04-30 10:45:18,509 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:45:18,509 INFO L85 PathProgramCache]: Analyzing trace with hash -102465510, now seen corresponding path program 1 times [2025-04-30 10:45:18,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:45:18,509 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306906528] [2025-04-30 10:45:18,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:45:18,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:45:18,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-04-30 10:45:18,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-04-30 10:45:18,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:45:18,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:45:19,242 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 259 proven. 27 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2025-04-30 10:45:19,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:45:19,242 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306906528] [2025-04-30 10:45:19,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306906528] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:45:19,242 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621251416] [2025-04-30 10:45:19,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:45:19,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:45:19,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:45:19,244 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:19,246 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:19,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-04-30 10:45:19,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-04-30 10:45:19,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:45:19,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:45:19,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 920 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-04-30 10:45:19,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:45:19,532 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,560 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-30 10:45:19,560 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,570 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 259 proven. 1 refuted. 0 times theorem prover too weak. 299 trivial. 26 not checked. [2025-04-30 10:45:19,570 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:45:19,736 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-30 10:45:19,736 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,751 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 259 proven. 27 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2025-04-30 10:45:19,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621251416] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:45:19,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:45:19,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 15 [2025-04-30 10:45:19,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583018113] [2025-04-30 10:45:19,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:45:19,752 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-30 10:45:19,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:45:19,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-30 10:45:19,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=173, Unknown=1, NotChecked=26, Total=240 [2025-04-30 10:45:19,752 INFO L87 Difference]: Start difference. First operand 232 states and 247 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,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:45:20,201 INFO L93 Difference]: Finished difference Result 228 states and 243 transitions. [2025-04-30 10:45:20,201 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:45:20,201 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 98 [2025-04-30 10:45:20,202 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:45:20,203 INFO L225 Difference]: With dead ends: 228 [2025-04-30 10:45:20,203 INFO L226 Difference]: Without dead ends: 228 [2025-04-30 10:45:20,203 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 188 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=278, Unknown=1, NotChecked=34, Total=380 [2025-04-30 10:45:20,203 INFO L437 NwaCegarLoop]: 189 mSDtfsCounter, 23 mSDsluCounter, 1093 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1282 SdHoareTripleChecker+Invalid, 1022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 204 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-30 10:45:20,203 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 1282 Invalid, 1022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 795 Invalid, 0 Unknown, 204 Unchecked, 0.4s Time] [2025-04-30 10:45:20,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-04-30 10:45:20,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2025-04-30 10:45:20,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 138 states have (on average 1.673913043478261) internal successors, (231), 218 states have internal predecessors, (231), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-30 10:45:20,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 243 transitions. [2025-04-30 10:45:20,207 INFO L79 Accepts]: Start accepts. Automaton has 228 states and 243 transitions. Word has length 98 [2025-04-30 10:45:20,207 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:45:20,208 INFO L485 AbstractCegarLoop]: Abstraction has 228 states and 243 transitions. [2025-04-30 10:45:20,208 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,208 INFO L278 IsEmpty]: Start isEmpty. Operand 228 states and 243 transitions. [2025-04-30 10:45:20,208 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-04-30 10:45:20,208 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:45:20,209 INFO L218 NwaCegarLoop]: trace histogram [25, 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,217 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:20,409 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:20,409 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2025-04-30 10:45:20,409 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:45:20,410 INFO L85 PathProgramCache]: Analyzing trace with hash -102465509, now seen corresponding path program 1 times [2025-04-30 10:45:20,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:45:20,410 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949253766] [2025-04-30 10:45:20,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:45:20,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:45:20,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-04-30 10:45:20,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-04-30 10:45:20,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:45:20,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-30 10:45:20,529 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [321730775] [2025-04-30 10:45:20,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:45:20,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:45:20,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:45:20,531 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:20,533 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:20,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-04-30 10:45:21,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-04-30 10:45:21,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:45:21,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:45:21,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 920 conjuncts, 87 conjuncts are in the unsatisfiable core [2025-04-30 10:45:21,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:45:21,045 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-30 10:45:22,336 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 238 proven. 124 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2025-04-30 10:45:22,336 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:45:22,896 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 143 proven. 6 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2025-04-30 10:45:22,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:45:22,896 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949253766] [2025-04-30 10:45:22,896 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-30 10:45:22,896 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321730775] [2025-04-30 10:45:22,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321730775] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:45:22,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:45:22,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 8] total 31 [2025-04-30 10:45:22,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320844477] [2025-04-30 10:45:22,896 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:45:22,897 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-30 10:45:22,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:45:22,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-30 10:45:22,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=829, Unknown=0, NotChecked=0, Total=930 [2025-04-30 10:45:22,898 INFO L87 Difference]: Start difference. First operand 228 states and 243 transitions. Second operand has 31 states, 30 states have (on average 2.066666666666667) internal successors, (62), 28 states have internal predecessors, (62), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) [2025-04-30 10:45:27,026 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-04-30 10:45:31,398 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:35,560 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-04-30 10:45:39,719 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-04-30 10:45:45,077 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:49,361 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:53,524 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:57,772 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:46:00,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:46:00,788 INFO L93 Difference]: Finished difference Result 242 states and 260 transitions. [2025-04-30 10:46:00,788 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-30 10:46:00,788 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.066666666666667) internal successors, (62), 28 states have internal predecessors, (62), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) Word has length 98 [2025-04-30 10:46:00,789 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:46:00,789 INFO L225 Difference]: With dead ends: 242 [2025-04-30 10:46:00,790 INFO L226 Difference]: Without dead ends: 232 [2025-04-30 10:46:00,791 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=404, Invalid=2458, Unknown=0, NotChecked=0, Total=2862 [2025-04-30 10:46:00,791 INFO L437 NwaCegarLoop]: 190 mSDtfsCounter, 81 mSDsluCounter, 2627 mSDsCounter, 0 mSdLazyCounter, 1716 mSolverCounterSat, 32 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 2817 SdHoareTripleChecker+Invalid, 1756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1716 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:46:00,791 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 2817 Invalid, 1756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1716 Invalid, 8 Unknown, 0 Unchecked, 34.1s Time] [2025-04-30 10:46:00,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-04-30 10:46:00,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2025-04-30 10:46:00,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 143 states have (on average 1.6433566433566433) internal successors, (235), 222 states have internal predecessors, (235), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-30 10:46:00,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 247 transitions. [2025-04-30 10:46:00,796 INFO L79 Accepts]: Start accepts. Automaton has 232 states and 247 transitions. Word has length 98 [2025-04-30 10:46:00,796 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:46:00,797 INFO L485 AbstractCegarLoop]: Abstraction has 232 states and 247 transitions. [2025-04-30 10:46:00,797 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.066666666666667) internal successors, (62), 28 states have internal predecessors, (62), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) [2025-04-30 10:46:00,797 INFO L278 IsEmpty]: Start isEmpty. Operand 232 states and 247 transitions. [2025-04-30 10:46:00,799 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-04-30 10:46:00,800 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:46:00,800 INFO L218 NwaCegarLoop]: trace histogram [30, 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:46:00,814 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:46:01,000 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:46:01,000 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2025-04-30 10:46:01,001 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:01,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1253809281, now seen corresponding path program 2 times [2025-04-30 10:46:01,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:46:01,001 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248545921] [2025-04-30 10:46:01,001 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:46:01,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:46:01,027 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 103 statements into 2 equivalence classes. [2025-04-30 10:46:01,112 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 103 of 103 statements. [2025-04-30 10:46:01,112 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:46:01,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-30 10:46:01,119 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2145313843] [2025-04-30 10:46:01,119 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:46:01,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:46:01,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:46:01,121 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:46:01,123 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:46:01,286 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 103 statements into 2 equivalence classes. [2025-04-30 10:46:01,796 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 103 of 103 statements. [2025-04-30 10:46:01,796 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:46:01,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:01,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 995 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-04-30 10:46:01,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:46:01,818 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:46:02,017 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:46:02,083 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:46:02,083 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:46:02,089 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:46:02,089 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-30 10:46:02,103 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 369 proven. 0 refuted. 0 times theorem prover too weak. 329 trivial. 52 not checked. [2025-04-30 10:46:02,103 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:46:02,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:46:02,177 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248545921] [2025-04-30 10:46:02,177 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-30 10:46:02,177 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145313843] [2025-04-30 10:46:02,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145313843] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:46:02,177 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:46:02,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2025-04-30 10:46:02,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569273544] [2025-04-30 10:46:02,177 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-04-30 10:46:02,177 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-30 10:46:02,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:46:02,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-30 10:46:02,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=153, Unknown=1, NotChecked=24, Total=210 [2025-04-30 10:46:02,178 INFO L87 Difference]: Start difference. First operand 232 states and 247 transitions. Second operand has 13 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-04-30 10:46:02,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:46:02,902 INFO L93 Difference]: Finished difference Result 229 states and 244 transitions. [2025-04-30 10:46:02,902 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-30 10:46:02,903 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 103 [2025-04-30 10:46:02,903 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:46:02,904 INFO L225 Difference]: With dead ends: 229 [2025-04-30 10:46:02,904 INFO L226 Difference]: Without dead ends: 229 [2025-04-30 10:46:02,904 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=328, Unknown=1, NotChecked=36, Total=420 [2025-04-30 10:46:02,904 INFO L437 NwaCegarLoop]: 180 mSDtfsCounter, 31 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 1051 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 991 SdHoareTripleChecker+Invalid, 1259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 199 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-30 10:46:02,905 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 991 Invalid, 1259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1051 Invalid, 0 Unknown, 199 Unchecked, 0.6s Time] [2025-04-30 10:46:02,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2025-04-30 10:46:02,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2025-04-30 10:46:02,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 143 states have (on average 1.6223776223776223) internal successors, (232), 219 states have internal predecessors, (232), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-30 10:46:02,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 244 transitions. [2025-04-30 10:46:02,908 INFO L79 Accepts]: Start accepts. Automaton has 229 states and 244 transitions. Word has length 103 [2025-04-30 10:46:02,908 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:46:02,909 INFO L485 AbstractCegarLoop]: Abstraction has 229 states and 244 transitions. [2025-04-30 10:46:02,909 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-04-30 10:46:02,909 INFO L278 IsEmpty]: Start isEmpty. Operand 229 states and 244 transitions. [2025-04-30 10:46:02,909 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-04-30 10:46:02,909 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:46:02,909 INFO L218 NwaCegarLoop]: trace histogram [30, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:46:02,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-30 10:46:03,109 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:46:03,110 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2025-04-30 10:46:03,110 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:03,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1098280096, now seen corresponding path program 1 times [2025-04-30 10:46:03,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:46:03,110 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385961035] [2025-04-30 10:46:03,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:03,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:46:03,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-04-30 10:46:03,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-04-30 10:46:03,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:03,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:03,579 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 472 trivial. 0 not checked. [2025-04-30 10:46:03,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:46:03,580 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385961035] [2025-04-30 10:46:03,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385961035] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:46:03,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:46:03,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:46:03,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759762468] [2025-04-30 10:46:03,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:46:03,580 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:46:03,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:46:03,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:46:03,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:46:03,581 INFO L87 Difference]: Start difference. First operand 229 states and 244 transitions. Second operand has 9 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2025-04-30 10:46:03,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:46:03,937 INFO L93 Difference]: Finished difference Result 228 states and 243 transitions. [2025-04-30 10:46:03,937 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:46:03,937 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 106 [2025-04-30 10:46:03,937 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:46:03,938 INFO L225 Difference]: With dead ends: 228 [2025-04-30 10:46:03,938 INFO L226 Difference]: Without dead ends: 228 [2025-04-30 10:46:03,939 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:46:03,939 INFO L437 NwaCegarLoop]: 192 mSDtfsCounter, 9 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:46:03,939 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1000 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-30 10:46:03,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-04-30 10:46:03,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2025-04-30 10:46:03,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 143 states have (on average 1.6153846153846154) internal successors, (231), 218 states have internal predecessors, (231), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-30 10:46:03,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 243 transitions. [2025-04-30 10:46:03,943 INFO L79 Accepts]: Start accepts. Automaton has 228 states and 243 transitions. Word has length 106 [2025-04-30 10:46:03,943 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:46:03,943 INFO L485 AbstractCegarLoop]: Abstraction has 228 states and 243 transitions. [2025-04-30 10:46:03,943 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2025-04-30 10:46:03,943 INFO L278 IsEmpty]: Start isEmpty. Operand 228 states and 243 transitions. [2025-04-30 10:46:03,943 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-04-30 10:46:03,943 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:46:03,943 INFO L218 NwaCegarLoop]: trace histogram [30, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:46:03,944 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-30 10:46:03,944 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2025-04-30 10:46:03,944 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:03,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1098280097, now seen corresponding path program 1 times [2025-04-30 10:46:03,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:46:03,944 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250957372] [2025-04-30 10:46:03,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:03,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:46:03,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-04-30 10:46:04,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-04-30 10:46:04,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:04,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:05,495 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 369 proven. 62 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2025-04-30 10:46:05,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:46:05,495 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250957372] [2025-04-30 10:46:05,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250957372] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:46:05,495 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733991384] [2025-04-30 10:46:05,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:05,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:46:05,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:46:05,497 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:46:05,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-30 10:46:05,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-04-30 10:46:06,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-04-30 10:46:06,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:06,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:06,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 1020 conjuncts, 75 conjuncts are in the unsatisfiable core [2025-04-30 10:46:06,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:46:06,283 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 Killed by 15