./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_linked_list_rend_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_linked_list_rend_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash ec13cd31cb83ba576938e580d51fea49ff46ac6b1d457f8e4c2fd8b2dcc85ee1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:59:44,100 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:59:44,144 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-04 02:59:44,151 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:59:44,151 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:59:44,166 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:59:44,167 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:59:44,167 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:59:44,167 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:59:44,168 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:59:44,168 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:59:44,168 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:59:44,168 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:59:44,168 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:59:44,168 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:59:44,168 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:59:44,168 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:59:44,168 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:59:44,169 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:59:44,169 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:59:44,169 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:59:44,169 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:59:44,169 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:59:44,169 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:59:44,169 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:59:44,169 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:59:44,169 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:59:44,169 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:59:44,169 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:59:44,169 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:59:44,170 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:59:44,170 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:59:44,170 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:59:44,170 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:59:44,170 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:59:44,170 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:59:44,170 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:59:44,170 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:59:44,170 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:59:44,170 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:59:44,170 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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ec13cd31cb83ba576938e580d51fea49ff46ac6b1d457f8e4c2fd8b2dcc85ee1 [2025-03-04 02:59:44,413 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:59:44,421 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:59:44,423 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:59:44,424 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:59:44,424 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:59:44,425 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_linked_list_rend_harness.i [2025-03-04 02:59:45,580 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e66f6360/5be87c8266b44a8391edc644d2a5224e/FLAG006728ab3 [2025-03-04 02:59:46,045 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:59:46,045 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_rend_harness.i [2025-03-04 02:59:46,069 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e66f6360/5be87c8266b44a8391edc644d2a5224e/FLAG006728ab3 [2025-03-04 02:59:46,081 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e66f6360/5be87c8266b44a8391edc644d2a5224e [2025-03-04 02:59:46,083 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:59:46,084 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:59:46,084 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:59:46,085 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:59:46,087 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:59:46,088 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:59:46" (1/1) ... [2025-03-04 02:59:46,088 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76b4c18d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:46, skipping insertion in model container [2025-03-04 02:59:46,088 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:59:46" (1/1) ... [2025-03-04 02:59:46,142 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:59:46,318 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_rend_harness.i[4494,4507] [2025-03-04 02:59:46,324 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_rend_harness.i[4554,4567] [2025-03-04 02:59:46,721 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:46,722 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:46,723 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:46,724 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:46,725 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:46,735 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:46,735 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:46,736 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:46,737 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:46,738 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:46,738 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:46,739 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:46,739 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:47,018 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_rend_harness.i[150464,150477] [2025-03-04 02:59:47,018 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:59:47,034 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:59:47,045 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_rend_harness.i[4494,4507] [2025-03-04 02:59:47,045 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_rend_harness.i[4554,4567] [2025-03-04 02:59:47,076 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:47,076 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:47,076 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:47,077 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:47,077 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:47,083 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:47,083 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:47,084 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:47,084 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:47,085 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:47,085 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:47,085 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:47,085 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:47,150 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_rend_harness.i[150464,150477] [2025-03-04 02:59:47,150 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:59:47,272 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:59:47,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:47 WrapperNode [2025-03-04 02:59:47,273 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:59:47,274 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:59:47,274 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:59:47,274 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:59:47,278 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:47" (1/1) ... [2025-03-04 02:59:47,315 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:47" (1/1) ... [2025-03-04 02:59:47,341 INFO L138 Inliner]: procedures = 668, calls = 1038, calls flagged for inlining = 53, calls inlined = 6, statements flattened = 131 [2025-03-04 02:59:47,342 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:59:47,342 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:59:47,342 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:59:47,342 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:59:47,348 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:47" (1/1) ... [2025-03-04 02:59:47,348 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:47" (1/1) ... [2025-03-04 02:59:47,351 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:47" (1/1) ... [2025-03-04 02:59:47,365 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 14, 5]. 67 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 0, 5]. The 6 writes are split as follows [0, 6, 0]. [2025-03-04 02:59:47,366 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:47" (1/1) ... [2025-03-04 02:59:47,366 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:47" (1/1) ... [2025-03-04 02:59:47,372 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:47" (1/1) ... [2025-03-04 02:59:47,373 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:47" (1/1) ... [2025-03-04 02:59:47,375 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:47" (1/1) ... [2025-03-04 02:59:47,376 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:47" (1/1) ... [2025-03-04 02:59:47,381 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:59:47,382 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:59:47,382 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:59:47,382 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:59:47,383 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:47" (1/1) ... [2025-03-04 02:59:47,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:59:47,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:59:47,407 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 02:59:47,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 02:59:47,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 02:59:47,423 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 02:59:47,423 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 02:59:47,423 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2025-03-04 02:59:47,423 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2025-03-04 02:59:47,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 02:59:47,423 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2025-03-04 02:59:47,423 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2025-03-04 02:59:47,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:59:47,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 02:59:47,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 02:59:47,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 02:59:47,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:59:47,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:59:47,424 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 02:59:47,424 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 02:59:47,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 02:59:47,424 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 02:59:47,424 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 02:59:47,424 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 02:59:47,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 02:59:47,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 02:59:47,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 02:59:47,424 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2025-03-04 02:59:47,424 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2025-03-04 02:59:47,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:59:47,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:59:47,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 02:59:47,603 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:59:47,605 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:59:47,646 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4718: havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; [2025-03-04 02:59:47,654 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: havoc #t~nondet9; [2025-03-04 02:59:47,805 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4700: havoc #t~ret311#1; [2025-03-04 02:59:47,824 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2025-03-04 02:59:47,828 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:59:47,834 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:59:47,834 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:59:47,835 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:59:47 BoogieIcfgContainer [2025-03-04 02:59:47,835 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:59:47,836 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:59:47,836 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:59:47,839 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:59:47,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:59:46" (1/3) ... [2025-03-04 02:59:47,840 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e8cc9a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:59:47, skipping insertion in model container [2025-03-04 02:59:47,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:47" (2/3) ... [2025-03-04 02:59:47,840 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e8cc9a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:59:47, skipping insertion in model container [2025-03-04 02:59:47,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:59:47" (3/3) ... [2025-03-04 02:59:47,841 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_linked_list_rend_harness.i [2025-03-04 02:59:47,850 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:59:47,852 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_linked_list_rend_harness.i that has 6 procedures, 67 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-04 02:59:47,893 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:59:47,903 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@3194d031, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:59:47,903 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 02:59:47,906 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 48 states have internal predecessors, (62), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 02:59:47,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 02:59:47,913 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:59:47,914 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:59:47,914 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:59:47,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:59:47,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1130872929, now seen corresponding path program 1 times [2025-03-04 02:59:47,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:59:47,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484425103] [2025-03-04 02:59:47,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:59:47,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:59:48,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 02:59:48,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 02:59:48,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:59:48,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:59:48,210 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-04 02:59:48,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:59:48,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484425103] [2025-03-04 02:59:48,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484425103] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:59:48,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116444443] [2025-03-04 02:59:48,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:59:48,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:59:48,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:59:48,214 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:59:48,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 02:59:48,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 02:59:48,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 02:59:48,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:59:48,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:59:48,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 02:59:48,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:59:48,363 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-04 02:59:48,364 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:59:48,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116444443] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:59:48,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:59:48,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 02:59:48,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427860364] [2025-03-04 02:59:48,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:59:48,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 02:59:48,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:59:48,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 02:59:48,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 02:59:48,380 INFO L87 Difference]: Start difference. First operand has 67 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 48 states have internal predecessors, (62), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 02:59:48,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:59:48,398 INFO L93 Difference]: Finished difference Result 126 states and 174 transitions. [2025-03-04 02:59:48,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 02:59:48,399 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2025-03-04 02:59:48,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:59:48,403 INFO L225 Difference]: With dead ends: 126 [2025-03-04 02:59:48,403 INFO L226 Difference]: Without dead ends: 62 [2025-03-04 02:59:48,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 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-03-04 02:59:48,407 INFO L435 NwaCegarLoop]: 86 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, 86 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-03-04 02:59:48,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 02:59:48,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-04 02:59:48,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-03-04 02:59:48,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 43 states have (on average 1.302325581395349) internal successors, (56), 44 states have internal predecessors, (56), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 02:59:48,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 81 transitions. [2025-03-04 02:59:48,435 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 81 transitions. Word has length 70 [2025-03-04 02:59:48,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:59:48,435 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 81 transitions. [2025-03-04 02:59:48,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 02:59:48,436 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 81 transitions. [2025-03-04 02:59:48,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 02:59:48,438 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:59:48,438 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:59:48,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 02:59:48,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 02:59:48,639 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:59:48,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:59:48,640 INFO L85 PathProgramCache]: Analyzing trace with hash -624638336, now seen corresponding path program 1 times [2025-03-04 02:59:48,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:59:48,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568503117] [2025-03-04 02:59:48,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:59:48,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:59:48,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 02:59:48,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 02:59:48,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:59:48,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:59:49,215 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-04 02:59:49,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:59:49,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568503117] [2025-03-04 02:59:49,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568503117] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:59:49,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967768982] [2025-03-04 02:59:49,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:59:49,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:59:49,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:59:49,218 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:59:49,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 02:59:49,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 02:59:49,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 02:59:49,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:59:49,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:59:49,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-04 02:59:49,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:59:49,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2025-03-04 02:59:49,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2025-03-04 02:59:49,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:59:49,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:59:49,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:59:49,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 47 [2025-03-04 02:59:49,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:59:49,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:59:49,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:59:49,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 25 [2025-03-04 02:59:50,201 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 02:59:50,203 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:59:50,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967768982] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:59:50,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:59:50,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2025-03-04 02:59:50,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374208147] [2025-03-04 02:59:50,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:59:50,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:59:50,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:59:50,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:59:50,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-04 02:59:50,205 INFO L87 Difference]: Start difference. First operand 62 states and 81 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-04 02:59:50,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:59:50,692 INFO L93 Difference]: Finished difference Result 171 states and 231 transitions. [2025-03-04 02:59:50,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:59:50,693 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 70 [2025-03-04 02:59:50,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:59:50,699 INFO L225 Difference]: With dead ends: 171 [2025-03-04 02:59:50,699 INFO L226 Difference]: Without dead ends: 121 [2025-03-04 02:59:50,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-03-04 02:59:50,700 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 49 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 02:59:50,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 439 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 02:59:50,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-04 02:59:50,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 117. [2025-03-04 02:59:50,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 82 states have (on average 1.329268292682927) internal successors, (109), 85 states have internal predecessors, (109), 24 states have call successors, (24), 9 states have call predecessors, (24), 10 states have return successors, (24), 22 states have call predecessors, (24), 22 states have call successors, (24) [2025-03-04 02:59:50,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 157 transitions. [2025-03-04 02:59:50,731 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 157 transitions. Word has length 70 [2025-03-04 02:59:50,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:59:50,732 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 157 transitions. [2025-03-04 02:59:50,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-04 02:59:50,732 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 157 transitions. [2025-03-04 02:59:50,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 02:59:50,734 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:59:50,734 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:59:50,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 02:59:50,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-04 02:59:50,936 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:59:50,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:59:50,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1346301121, now seen corresponding path program 1 times [2025-03-04 02:59:50,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:59:50,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175476551] [2025-03-04 02:59:50,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:59:50,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:59:50,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 02:59:50,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 02:59:50,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:59:50,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:59:51,207 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-04 02:59:51,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:59:51,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175476551] [2025-03-04 02:59:51,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175476551] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:59:51,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209138891] [2025-03-04 02:59:51,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:59:51,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:59:51,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:59:51,210 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:59:51,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 02:59:51,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 02:59:51,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 02:59:51,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:59:51,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:59:51,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-04 02:59:51,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:59:51,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2025-03-04 02:59:51,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2025-03-04 02:59:51,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:59:51,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:59:51,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:59:51,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 25 [2025-03-04 02:59:51,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:59:51,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:59:51,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:59:51,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 47 [2025-03-04 02:59:52,706 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 02:59:52,707 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:59:52,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1209138891] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:59:52,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:59:52,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2025-03-04 02:59:52,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074105926] [2025-03-04 02:59:52,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:59:52,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:59:52,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:59:52,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:59:52,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-04 02:59:52,708 INFO L87 Difference]: Start difference. First operand 117 states and 157 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-04 02:59:53,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:59:53,166 INFO L93 Difference]: Finished difference Result 172 states and 229 transitions. [2025-03-04 02:59:53,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:59:53,166 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 70 [2025-03-04 02:59:53,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:59:53,167 INFO L225 Difference]: With dead ends: 172 [2025-03-04 02:59:53,167 INFO L226 Difference]: Without dead ends: 118 [2025-03-04 02:59:53,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 55 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2025-03-04 02:59:53,168 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 58 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 02:59:53,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 411 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 02:59:53,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-04 02:59:53,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 114. [2025-03-04 02:59:53,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 80 states have (on average 1.325) internal successors, (106), 82 states have internal predecessors, (106), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 02:59:53,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 152 transitions. [2025-03-04 02:59:53,182 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 152 transitions. Word has length 70 [2025-03-04 02:59:53,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:59:53,182 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 152 transitions. [2025-03-04 02:59:53,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-04 02:59:53,182 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 152 transitions. [2025-03-04 02:59:53,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 02:59:53,184 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:59:53,184 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:59:53,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 02:59:53,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:59:53,385 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:59:53,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:59:53,385 INFO L85 PathProgramCache]: Analyzing trace with hash -715889887, now seen corresponding path program 1 times [2025-03-04 02:59:53,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:59:53,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584684389] [2025-03-04 02:59:53,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:59:53,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:59:53,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 02:59:53,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 02:59:53,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:59:53,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:59:53,610 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-04 02:59:53,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:59:53,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584684389] [2025-03-04 02:59:53,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584684389] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:59:53,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647326132] [2025-03-04 02:59:53,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:59:53,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:59:53,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:59:53,613 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:59:53,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 02:59:53,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 02:59:53,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 02:59:53,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:59:53,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:59:53,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-04 02:59:53,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:59:53,798 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2025-03-04 02:59:53,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 17 [2025-03-04 02:59:53,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2025-03-04 02:59:53,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 53 [2025-03-04 02:59:53,909 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (let ((.cse0 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse0)) (.cse3 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_10| 24))) (let ((.cse1 (select .cse2 .cse3))) (and (<= .cse0 .cse1) (<= 2 .cse0) (not (= .cse1 .cse0)) (= .cse2 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_1) .cse1 v_arrayElimArr_2) .cse0) .cse3 .cse1))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10|))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10|) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_10| Int)) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10| (select .cse4 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_10| 24)))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10| (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))))))) is different from true [2025-03-04 02:59:54,217 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11| (select .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (= (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_11| 24)) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11|)))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (let ((.cse2 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse4 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_11| 24))) (let ((.cse1 (select .cse3 .cse4))) (and (not (= .cse1 .cse2)) (<= 2 .cse2) (<= .cse2 .cse1) (= .cse3 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse2 v_DerPreprocessor_1) .cse1 v_arrayElimArr_2) .cse2) .cse4 .cse1)))))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (let ((.cse5 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse7 (select |c_#memory_$Pointer$#1.base| .cse5)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_10| 24))) (let ((.cse6 (select .cse7 .cse8))) (and (<= .cse5 .cse6) (<= 2 .cse5) (not (= .cse6 .cse5)) (= .cse7 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse5 v_DerPreprocessor_1) .cse6 v_arrayElimArr_2) .cse5) .cse8 .cse6))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10|))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10|) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_10| Int)) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10| (select .cse9 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_10| 24)))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10| (select .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|)))))))) is different from true [2025-03-04 02:59:54,607 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= (select .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4|)) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_4| Int)) (= (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_4| 24)) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4|)))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int) (|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_4| Int)) (let ((.cse1 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse3 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_4| 24))) (let ((.cse2 (select .cse4 .cse3))) (and (not (= .cse1 .cse2)) (<= 2 .cse1) (<= .cse1 .cse2) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse1 v_DerPreprocessor_1) .cse2 v_arrayElimArr_2) .cse1) .cse3 .cse2) .cse4))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11| (select .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (= (select .cse5 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_11| 24)) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11|)))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (let ((.cse7 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse7)) (.cse9 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_11| 24))) (let ((.cse6 (select .cse8 .cse9))) (and (not (= .cse6 .cse7)) (<= 2 .cse7) (<= .cse7 .cse6) (= .cse8 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse7 v_DerPreprocessor_1) .cse6 v_arrayElimArr_2) .cse7) .cse9 .cse6)))))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (let ((.cse10 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse12 (select |c_#memory_$Pointer$#1.base| .cse10)) (.cse13 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_10| 24))) (let ((.cse11 (select .cse12 .cse13))) (and (<= .cse10 .cse11) (<= 2 .cse10) (not (= .cse11 .cse10)) (= .cse12 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse10 v_DerPreprocessor_1) .cse11 v_arrayElimArr_2) .cse10) .cse13 .cse11))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10|))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10|) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_10| Int)) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10| (select .cse14 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_10| 24)))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10| (select .cse14 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|)))))))) is different from true [2025-03-04 02:59:55,365 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= (select .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4|)) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_4| Int)) (= (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_4| 24)) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4|)))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int) (|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_4| Int)) (let ((.cse1 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse3 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_4| 24))) (let ((.cse2 (select .cse4 .cse3))) (and (not (= .cse1 .cse2)) (<= 2 .cse1) (<= .cse1 .cse2) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse1 v_DerPreprocessor_1) .cse2 v_arrayElimArr_2) .cse1) .cse3 .cse2) .cse4))))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (let ((.cse6 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse6)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_5| 24))) (let ((.cse7 (select .cse5 .cse8))) (and (= .cse5 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse6 v_DerPreprocessor_1) .cse7 v_arrayElimArr_2) .cse6) .cse8 .cse7)) (<= .cse6 .cse7) (<= 2 .cse6) (not (= .cse6 .cse7))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_5| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_5|))) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_5| Int)) (= (select .cse9 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_5| 24)) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_5|)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= (select .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_5|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_5|))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (let ((.cse10 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11| (select .cse10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (= (select .cse10 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_11| 24)) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11|)))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (let ((.cse12 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse13 (select |c_#memory_$Pointer$#1.base| .cse12)) (.cse14 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_11| 24))) (let ((.cse11 (select .cse13 .cse14))) (and (not (= .cse11 .cse12)) (<= 2 .cse12) (<= .cse12 .cse11) (= .cse13 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse12 v_DerPreprocessor_1) .cse11 v_arrayElimArr_2) .cse12) .cse14 .cse11)))))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (let ((.cse15 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse17 (select |c_#memory_$Pointer$#1.base| .cse15)) (.cse18 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_10| 24))) (let ((.cse16 (select .cse17 .cse18))) (and (<= .cse15 .cse16) (<= 2 .cse15) (not (= .cse16 .cse15)) (= .cse17 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse15 v_DerPreprocessor_1) .cse16 v_arrayElimArr_2) .cse15) .cse18 .cse16))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse19 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10|))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10|) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_10| Int)) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10| (select .cse19 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_10| 24)))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10| (select .cse19 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|)))))))) is different from true [2025-03-04 02:59:55,926 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= (select .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4|)) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_4| Int)) (= (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_4| 24)) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4|)))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int) (|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_4| Int)) (let ((.cse1 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse3 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_4| 24))) (let ((.cse2 (select .cse4 .cse3))) (and (not (= .cse1 .cse2)) (<= 2 .cse1) (<= .cse1 .cse2) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse1 v_DerPreprocessor_1) .cse2 v_arrayElimArr_2) .cse1) .cse3 .cse2) .cse4))))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (let ((.cse6 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse6)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_5| 24))) (let ((.cse7 (select .cse5 .cse8))) (and (= .cse5 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse6 v_DerPreprocessor_1) .cse7 v_arrayElimArr_2) .cse6) .cse8 .cse7)) (<= .cse6 .cse7) (<= 2 .cse6) (not (= .cse6 .cse7))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_5| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_5|))) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_5| Int)) (= (select .cse9 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_5| 24)) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_5|)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= (select .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_5|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_5|))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (let ((.cse10 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse13 (select |c_#memory_$Pointer$#1.base| .cse10)) (.cse12 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_6| 24))) (let ((.cse11 (select .cse13 .cse12))) (and (<= .cse10 .cse11) (not (= .cse10 .cse11)) (<= 2 .cse10) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse10 v_DerPreprocessor_1) .cse11 v_arrayElimArr_2) .cse10) .cse12 .cse11) .cse13)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_6| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_6|))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_6|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= (select .cse14 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_6|)) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_6| Int)) (= (select .cse14 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_6| 24)) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_6|)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (let ((.cse15 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11| (select .cse15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (= (select .cse15 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_11| 24)) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11|)))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (let ((.cse17 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse18 (select |c_#memory_$Pointer$#1.base| .cse17)) (.cse19 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_11| 24))) (let ((.cse16 (select .cse18 .cse19))) (and (not (= .cse16 .cse17)) (<= 2 .cse17) (<= .cse17 .cse16) (= .cse18 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse17 v_DerPreprocessor_1) .cse16 v_arrayElimArr_2) .cse17) .cse19 .cse16)))))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (let ((.cse20 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse22 (select |c_#memory_$Pointer$#1.base| .cse20)) (.cse23 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_10| 24))) (let ((.cse21 (select .cse22 .cse23))) (and (<= .cse20 .cse21) (<= 2 .cse20) (not (= .cse21 .cse20)) (= .cse22 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse20 v_DerPreprocessor_1) .cse21 v_arrayElimArr_2) .cse20) .cse23 .cse21))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse24 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10|))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10|) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_10| Int)) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10| (select .cse24 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_10| 24)))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10| (select .cse24 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|)))))))) is different from true [2025-03-04 02:59:56,015 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= (select .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4|)) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_4| Int)) (= (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_4| 24)) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4|)))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int) (|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_4| Int)) (let ((.cse1 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse3 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_4| 24))) (let ((.cse2 (select .cse4 .cse3))) (and (not (= .cse1 .cse2)) (<= 2 .cse1) (<= .cse1 .cse2) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse1 v_DerPreprocessor_1) .cse2 v_arrayElimArr_2) .cse1) .cse3 .cse2) .cse4))))))) (= |c_aws_linked_list_is_valid_~list#1.offset| |c_aws_linked_list_is_valid_#in~list#1.offset|) (= |c_aws_linked_list_is_valid_~list#1.base| |c_aws_linked_list_is_valid_#in~list#1.base|) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (let ((.cse6 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse6)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_5| 24))) (let ((.cse7 (select .cse5 .cse8))) (and (= .cse5 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse6 v_DerPreprocessor_1) .cse7 v_arrayElimArr_2) .cse6) .cse8 .cse7)) (<= .cse6 .cse7) (<= 2 .cse6) (not (= .cse6 .cse7))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_5| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_5|))) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_5| Int)) (= (select .cse9 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_5| 24)) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_5|)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= (select .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_5|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_5|))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (let ((.cse10 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse13 (select |c_#memory_$Pointer$#1.base| .cse10)) (.cse12 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_6| 24))) (let ((.cse11 (select .cse13 .cse12))) (and (<= .cse10 .cse11) (not (= .cse10 .cse11)) (<= 2 .cse10) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse10 v_DerPreprocessor_1) .cse11 v_arrayElimArr_2) .cse10) .cse12 .cse11) .cse13)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_6| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_6|))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_6|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= (select .cse14 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_6|)) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_6| Int)) (= (select .cse14 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_6| 24)) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_6|)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (let ((.cse15 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11| (select .cse15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (= (select .cse15 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_11| 24)) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11|)))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (let ((.cse17 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse18 (select |c_#memory_$Pointer$#1.base| .cse17)) (.cse19 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_11| 24))) (let ((.cse16 (select .cse18 .cse19))) (and (not (= .cse16 .cse17)) (<= 2 .cse17) (<= .cse17 .cse16) (= .cse18 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse17 v_DerPreprocessor_1) .cse16 v_arrayElimArr_2) .cse17) .cse19 .cse16)))))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (let ((.cse20 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse22 (select |c_#memory_$Pointer$#1.base| .cse20)) (.cse23 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_10| 24))) (let ((.cse21 (select .cse22 .cse23))) (and (<= .cse20 .cse21) (<= 2 .cse20) (not (= .cse21 .cse20)) (= .cse22 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse20 v_DerPreprocessor_1) .cse21 v_arrayElimArr_2) .cse20) .cse23 .cse21))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse24 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10|))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10|) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_10| Int)) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10| (select .cse24 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_10| 24)))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10| (select .cse24 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|)))))))) is different from true [2025-03-04 02:59:56,441 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= (select .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4|)) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_4| Int)) (= (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_4| 24)) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4|)))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int) (|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_4| Int)) (let ((.cse1 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse3 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_4| 24))) (let ((.cse2 (select .cse4 .cse3))) (and (not (= .cse1 .cse2)) (<= 2 .cse1) (<= .cse1 .cse2) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse1 v_DerPreprocessor_1) .cse2 v_arrayElimArr_2) .cse1) .cse3 .cse2) .cse4))))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (let ((.cse6 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse6)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_5| 24))) (let ((.cse7 (select .cse5 .cse8))) (and (= .cse5 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse6 v_DerPreprocessor_1) .cse7 v_arrayElimArr_2) .cse6) .cse8 .cse7)) (<= .cse6 .cse7) (<= 2 .cse6) (not (= .cse6 .cse7))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_5| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_5|))) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_5| Int)) (= (select .cse9 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_5| 24)) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_5|)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= (select .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_5|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_5|))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (let ((.cse10 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse13 (select |c_#memory_$Pointer$#1.base| .cse10)) (.cse12 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_6| 24))) (let ((.cse11 (select .cse13 .cse12))) (and (<= .cse10 .cse11) (not (= .cse10 .cse11)) (<= 2 .cse10) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse10 v_DerPreprocessor_1) .cse11 v_arrayElimArr_2) .cse10) .cse12 .cse11) .cse13)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_6| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_6|))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_6|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= (select .cse14 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_6|)) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_6| Int)) (= (select .cse14 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_6| 24)) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_6|)))))) (or |c_aws_linked_list_is_valid_#t~short308#1| (< (select (select |c_#memory_$Pointer$#1.base| |c_aws_linked_list_is_valid_#in~list#1.base|) (+ |c_aws_linked_list_is_valid_#in~list#1.offset| 24)) 1)) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (let ((.cse15 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11| (select .cse15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (= (select .cse15 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_11| 24)) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11|)))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (let ((.cse17 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse18 (select |c_#memory_$Pointer$#1.base| .cse17)) (.cse19 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_11| 24))) (let ((.cse16 (select .cse18 .cse19))) (and (not (= .cse16 .cse17)) (<= 2 .cse17) (<= .cse17 .cse16) (= .cse18 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse17 v_DerPreprocessor_1) .cse16 v_arrayElimArr_2) .cse17) .cse19 .cse16)))))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (let ((.cse20 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse22 (select |c_#memory_$Pointer$#1.base| .cse20)) (.cse23 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_10| 24))) (let ((.cse21 (select .cse22 .cse23))) (and (<= .cse20 .cse21) (<= 2 .cse20) (not (= .cse21 .cse20)) (= .cse22 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse20 v_DerPreprocessor_1) .cse21 v_arrayElimArr_2) .cse20) .cse23 .cse21))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse24 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10|))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10|) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_10| Int)) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10| (select .cse24 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_10| 24)))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10| (select .cse24 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|)))))))) is different from true [2025-03-04 02:59:56,515 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= (select .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4|)) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_4| Int)) (= (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_4| 24)) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4|)))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int) (|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_4| Int)) (let ((.cse1 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse3 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_4| 24))) (let ((.cse2 (select .cse4 .cse3))) (and (not (= .cse1 .cse2)) (<= 2 .cse1) (<= .cse1 .cse2) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse1 v_DerPreprocessor_1) .cse2 v_arrayElimArr_2) .cse1) .cse3 .cse2) .cse4))))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (let ((.cse6 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse6)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_5| 24))) (let ((.cse7 (select .cse5 .cse8))) (and (= .cse5 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse6 v_DerPreprocessor_1) .cse7 v_arrayElimArr_2) .cse6) .cse8 .cse7)) (<= .cse6 .cse7) (<= 2 .cse6) (not (= .cse6 .cse7))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_5| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_5|))) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_5| Int)) (= (select .cse9 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_5| 24)) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_5|)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= (select .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_5|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_5|))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (let ((.cse10 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse13 (select |c_#memory_$Pointer$#1.base| .cse10)) (.cse12 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_6| 24))) (let ((.cse11 (select .cse13 .cse12))) (and (<= .cse10 .cse11) (not (= .cse10 .cse11)) (<= 2 .cse10) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse10 v_DerPreprocessor_1) .cse11 v_arrayElimArr_2) .cse10) .cse12 .cse11) .cse13)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_6| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_6|))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_6|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= (select .cse14 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_6|)) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_6| Int)) (= (select .cse14 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_6| 24)) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_6|)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (let ((.cse15 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11| (select .cse15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (= (select .cse15 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_11| 24)) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11|)))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (let ((.cse17 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse18 (select |c_#memory_$Pointer$#1.base| .cse17)) (.cse19 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_11| 24))) (let ((.cse16 (select .cse18 .cse19))) (and (not (= .cse16 .cse17)) (<= 2 .cse17) (<= .cse17 .cse16) (= .cse18 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse17 v_DerPreprocessor_1) .cse16 v_arrayElimArr_2) .cse17) .cse19 .cse16)))))))) (or (< (select (select |c_#memory_$Pointer$#1.base| |c_aws_linked_list_is_valid_#in~list#1.base|) (+ |c_aws_linked_list_is_valid_#in~list#1.offset| 24)) 1) |c_aws_linked_list_is_valid_#t~short310#1|) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (let ((.cse20 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse22 (select |c_#memory_$Pointer$#1.base| .cse20)) (.cse23 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_10| 24))) (let ((.cse21 (select .cse22 .cse23))) (and (<= .cse20 .cse21) (<= 2 .cse20) (not (= .cse21 .cse20)) (= .cse22 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse20 v_DerPreprocessor_1) .cse21 v_arrayElimArr_2) .cse20) .cse23 .cse21))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse24 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10|))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10|) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_10| Int)) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10| (select .cse24 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_10| 24)))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10| (select .cse24 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|)))))))) is different from true [2025-03-04 02:59:56,592 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= (select .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4|)) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_4| Int)) (= (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_4| 24)) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4|)))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int) (|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_4| Int)) (let ((.cse1 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse3 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_4| 24))) (let ((.cse2 (select .cse4 .cse3))) (and (not (= .cse1 .cse2)) (<= 2 .cse1) (<= .cse1 .cse2) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse1 v_DerPreprocessor_1) .cse2 v_arrayElimArr_2) .cse1) .cse3 .cse2) .cse4))))))) (<= (select (select |c_#memory_$Pointer$#1.base| |c_aws_linked_list_is_valid_#in~list#1.base|) (+ |c_aws_linked_list_is_valid_#in~list#1.offset| 24)) 0) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (let ((.cse6 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse6)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_5| 24))) (let ((.cse7 (select .cse5 .cse8))) (and (= .cse5 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse6 v_DerPreprocessor_1) .cse7 v_arrayElimArr_2) .cse6) .cse8 .cse7)) (<= .cse6 .cse7) (<= 2 .cse6) (not (= .cse6 .cse7))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_5| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_5|))) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_5| Int)) (= (select .cse9 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_5| 24)) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_5|)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= (select .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_5|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_5|))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (let ((.cse10 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse13 (select |c_#memory_$Pointer$#1.base| .cse10)) (.cse12 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_6| 24))) (let ((.cse11 (select .cse13 .cse12))) (and (<= .cse10 .cse11) (not (= .cse10 .cse11)) (<= 2 .cse10) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse10 v_DerPreprocessor_1) .cse11 v_arrayElimArr_2) .cse10) .cse12 .cse11) .cse13)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_6| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_6|))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_6|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= (select .cse14 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_6|)) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_6| Int)) (= (select .cse14 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_6| 24)) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_6|)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (let ((.cse15 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11| (select .cse15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (= (select .cse15 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_11| 24)) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11|)))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (let ((.cse17 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse18 (select |c_#memory_$Pointer$#1.base| .cse17)) (.cse19 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_11| 24))) (let ((.cse16 (select .cse18 .cse19))) (and (not (= .cse16 .cse17)) (<= 2 .cse17) (<= .cse17 .cse16) (= .cse18 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse17 v_DerPreprocessor_1) .cse16 v_arrayElimArr_2) .cse17) .cse19 .cse16)))))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (let ((.cse20 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse22 (select |c_#memory_$Pointer$#1.base| .cse20)) (.cse23 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_10| 24))) (let ((.cse21 (select .cse22 .cse23))) (and (<= .cse20 .cse21) (<= 2 .cse20) (not (= .cse21 .cse20)) (= .cse22 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse20 v_DerPreprocessor_1) .cse21 v_arrayElimArr_2) .cse20) .cse23 .cse21))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse24 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10|))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10|) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_10| Int)) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10| (select .cse24 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_10| 24)))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10| (select .cse24 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|)))))))) is different from true [2025-03-04 02:59:56,842 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 40 not checked. [2025-03-04 02:59:56,842 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:59:57,091 INFO L349 Elim1Store]: treesize reduction 19, result has 62.0 percent of original size [2025-03-04 02:59:57,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 190 treesize of output 176 [2025-03-04 02:59:57,110 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:59:57,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 89 [2025-03-04 02:59:57,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2025-03-04 02:59:57,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-03-04 02:59:57,169 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:59:57,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2025-03-04 02:59:57,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-04 02:59:57,224 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:59:57,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 103 treesize of output 139 [2025-03-04 02:59:57,365 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-04 02:59:57,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647326132] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:59:57,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:59:57,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [6, 20] total 33 [2025-03-04 02:59:57,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846967567] [2025-03-04 02:59:57,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:59:57,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:59:57,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:59:57,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:59:57,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=473, Unknown=32, NotChecked=468, Total=1056 [2025-03-04 02:59:57,368 INFO L87 Difference]: Start difference. First operand 114 states and 152 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-04 02:59:57,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:59:57,737 INFO L93 Difference]: Finished difference Result 195 states and 275 transitions. [2025-03-04 02:59:57,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:59:57,738 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 70 [2025-03-04 02:59:57,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:59:57,740 INFO L225 Difference]: With dead ends: 195 [2025-03-04 02:59:57,740 INFO L226 Difference]: Without dead ends: 133 [2025-03-04 02:59:57,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=129, Invalid=867, Unknown=32, NotChecked=612, Total=1640 [2025-03-04 02:59:57,742 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 160 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 02:59:57,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 423 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 02:59:57,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-03-04 02:59:57,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 116. [2025-03-04 02:59:57,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 82 states have (on average 1.3170731707317074) internal successors, (108), 84 states have internal predecessors, (108), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 02:59:57,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 154 transitions. [2025-03-04 02:59:57,757 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 154 transitions. Word has length 70 [2025-03-04 02:59:57,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:59:57,757 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 154 transitions. [2025-03-04 02:59:57,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-04 02:59:57,758 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 154 transitions. [2025-03-04 02:59:57,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 02:59:57,759 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:59:57,759 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:59:57,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 02:59:57,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:59:57,960 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:59:57,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:59:57,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1785682818, now seen corresponding path program 1 times [2025-03-04 02:59:57,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:59:57,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125279568] [2025-03-04 02:59:57,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:59:57,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:59:57,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 02:59:57,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 02:59:57,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:59:57,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:59:58,190 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-04 02:59:58,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:59:58,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125279568] [2025-03-04 02:59:58,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125279568] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:59:58,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176265376] [2025-03-04 02:59:58,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:59:58,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:59:58,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:59:58,193 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-03-04 02:59:58,194 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-03-04 02:59:58,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 02:59:58,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 02:59:58,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:59:58,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:59:58,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-04 02:59:58,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:59:58,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2025-03-04 02:59:58,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2025-03-04 02:59:58,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:59:58,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:59:58,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:59:58,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 47 [2025-03-04 02:59:58,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:59:58,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:59:58,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:59:58,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 25 [2025-03-04 02:59:59,482 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 02:59:59,483 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:59:59,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176265376] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:59:59,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:59:59,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2025-03-04 02:59:59,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367044587] [2025-03-04 02:59:59,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:59:59,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:59:59,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:59:59,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:59:59,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-03-04 02:59:59,484 INFO L87 Difference]: Start difference. First operand 116 states and 154 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-04 03:00:00,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:00:00,000 INFO L93 Difference]: Finished difference Result 191 states and 261 transitions. [2025-03-04 03:00:00,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 03:00:00,001 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 70 [2025-03-04 03:00:00,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:00:00,002 INFO L225 Difference]: With dead ends: 191 [2025-03-04 03:00:00,002 INFO L226 Difference]: Without dead ends: 122 [2025-03-04 03:00:00,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 54 SyntacticMatches, 8 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2025-03-04 03:00:00,003 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 75 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 03:00:00,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 481 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 03:00:00,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-04 03:00:00,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 118. [2025-03-04 03:00:00,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 84 states have (on average 1.3095238095238095) internal successors, (110), 86 states have internal predecessors, (110), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 03:00:00,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 156 transitions. [2025-03-04 03:00:00,023 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 156 transitions. Word has length 70 [2025-03-04 03:00:00,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:00:00,023 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 156 transitions. [2025-03-04 03:00:00,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-04 03:00:00,023 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 156 transitions. [2025-03-04 03:00:00,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 03:00:00,026 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:00:00,026 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:00:00,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 03:00:00,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:00:00,227 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:00:00,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:00:00,227 INFO L85 PathProgramCache]: Analyzing trace with hash 615366563, now seen corresponding path program 1 times [2025-03-04 03:00:00,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:00:00,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641927425] [2025-03-04 03:00:00,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:00,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:00:00,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 03:00:00,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 03:00:00,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:00,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:00,558 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-04 03:00:00,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:00:00,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641927425] [2025-03-04 03:00:00,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641927425] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:00:00,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565024031] [2025-03-04 03:00:00,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:00,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:00:00,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:00:00,561 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-03-04 03:00:00,562 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-03-04 03:00:00,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 03:00:00,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 03:00:00,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:00,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:00,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-04 03:00:00,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:00:00,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:00,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2025-03-04 03:00:01,170 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 03:00:01,171 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:00:01,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565024031] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:00:01,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:00:01,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 18 [2025-03-04 03:00:01,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290669260] [2025-03-04 03:00:01,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:00:01,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 03:00:01,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:00:01,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 03:00:01,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2025-03-04 03:00:01,172 INFO L87 Difference]: Start difference. First operand 118 states and 156 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-04 03:00:01,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:00:01,532 INFO L93 Difference]: Finished difference Result 199 states and 270 transitions. [2025-03-04 03:00:01,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 03:00:01,532 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 70 [2025-03-04 03:00:01,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:00:01,533 INFO L225 Difference]: With dead ends: 199 [2025-03-04 03:00:01,533 INFO L226 Difference]: Without dead ends: 124 [2025-03-04 03:00:01,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 54 SyntacticMatches, 8 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2025-03-04 03:00:01,534 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 78 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 03:00:01,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 552 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 03:00:01,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-03-04 03:00:01,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 120. [2025-03-04 03:00:01,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 86 states have (on average 1.302325581395349) internal successors, (112), 88 states have internal predecessors, (112), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 03:00:01,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 158 transitions. [2025-03-04 03:00:01,544 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 158 transitions. Word has length 70 [2025-03-04 03:00:01,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:00:01,545 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 158 transitions. [2025-03-04 03:00:01,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-04 03:00:01,545 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 158 transitions. [2025-03-04 03:00:01,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 03:00:01,545 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:00:01,545 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:00:01,552 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-03-04 03:00:01,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:00:01,750 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:00:01,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:00:01,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1222877060, now seen corresponding path program 1 times [2025-03-04 03:00:01,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:00:01,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523834033] [2025-03-04 03:00:01,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:01,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:00:01,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 03:00:01,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 03:00:01,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:01,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:01,825 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-04 03:00:01,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:00:01,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523834033] [2025-03-04 03:00:01,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523834033] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:00:01,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049964901] [2025-03-04 03:00:01,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:01,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:00:01,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:00:01,829 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-03-04 03:00:01,831 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-03-04 03:00:01,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 03:00:01,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 03:00:01,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:01,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:01,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 03:00:01,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:00:01,983 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 03:00:01,983 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:00:01,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049964901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:00:01,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:00:01,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2025-03-04 03:00:01,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516307444] [2025-03-04 03:00:01,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:00:01,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 03:00:01,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:00:01,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 03:00:01,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 03:00:01,984 INFO L87 Difference]: Start difference. First operand 120 states and 158 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 03:00:02,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:00:02,075 INFO L93 Difference]: Finished difference Result 256 states and 347 transitions. [2025-03-04 03:00:02,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 03:00:02,075 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2025-03-04 03:00:02,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:00:02,076 INFO L225 Difference]: With dead ends: 256 [2025-03-04 03:00:02,076 INFO L226 Difference]: Without dead ends: 151 [2025-03-04 03:00:02,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-04 03:00:02,077 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 94 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:00:02,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 277 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 03:00:02,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-03-04 03:00:02,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2025-03-04 03:00:02,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 113 states have (on average 1.336283185840708) internal successors, (151), 117 states have internal predecessors, (151), 26 states have call successors, (26), 9 states have call predecessors, (26), 11 states have return successors, (28), 24 states have call predecessors, (28), 24 states have call successors, (28) [2025-03-04 03:00:02,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 205 transitions. [2025-03-04 03:00:02,099 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 205 transitions. Word has length 70 [2025-03-04 03:00:02,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:00:02,099 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 205 transitions. [2025-03-04 03:00:02,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 03:00:02,099 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 205 transitions. [2025-03-04 03:00:02,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-04 03:00:02,100 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:00:02,100 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:00:02,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 03:00:02,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:00:02,301 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:00:02,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:00:02,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1427380182, now seen corresponding path program 1 times [2025-03-04 03:00:02,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:00:02,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558424882] [2025-03-04 03:00:02,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:02,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:00:02,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 03:00:02,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 03:00:02,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:02,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:02,386 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-04 03:00:02,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:00:02,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558424882] [2025-03-04 03:00:02,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558424882] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:00:02,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608931693] [2025-03-04 03:00:02,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:02,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:00:02,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:00:02,388 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-03-04 03:00:02,390 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-03-04 03:00:02,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 03:00:02,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 03:00:02,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:02,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:02,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 03:00:02,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:00:02,574 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 03:00:02,574 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:00:02,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608931693] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:00:02,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:00:02,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2025-03-04 03:00:02,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823219016] [2025-03-04 03:00:02,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:00:02,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 03:00:02,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:00:02,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 03:00:02,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-04 03:00:02,575 INFO L87 Difference]: Start difference. First operand 151 states and 205 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 03:00:02,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:00:02,730 INFO L93 Difference]: Finished difference Result 313 states and 429 transitions. [2025-03-04 03:00:02,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 03:00:02,730 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 71 [2025-03-04 03:00:02,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:00:02,732 INFO L225 Difference]: With dead ends: 313 [2025-03-04 03:00:02,734 INFO L226 Difference]: Without dead ends: 177 [2025-03-04 03:00:02,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2025-03-04 03:00:02,735 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 92 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:00:02,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 254 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 03:00:02,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-03-04 03:00:02,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 151. [2025-03-04 03:00:02,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 113 states have (on average 1.336283185840708) internal successors, (151), 117 states have internal predecessors, (151), 26 states have call successors, (26), 9 states have call predecessors, (26), 11 states have return successors, (28), 24 states have call predecessors, (28), 24 states have call successors, (28) [2025-03-04 03:00:02,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 205 transitions. [2025-03-04 03:00:02,761 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 205 transitions. Word has length 71 [2025-03-04 03:00:02,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:00:02,761 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 205 transitions. [2025-03-04 03:00:02,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 03:00:02,762 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 205 transitions. [2025-03-04 03:00:02,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-04 03:00:02,762 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:00:02,763 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:00:02,770 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-03-04 03:00:02,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-04 03:00:02,963 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:00:02,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:00:02,964 INFO L85 PathProgramCache]: Analyzing trace with hash 417557158, now seen corresponding path program 1 times [2025-03-04 03:00:02,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:00:02,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522291403] [2025-03-04 03:00:02,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:02,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:00:02,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 03:00:03,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 03:00:03,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:03,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:03,166 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-04 03:00:03,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:00:03,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522291403] [2025-03-04 03:00:03,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522291403] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:00:03,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151132079] [2025-03-04 03:00:03,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:03,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:00:03,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:00:03,169 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-03-04 03:00:03,170 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-03-04 03:00:03,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 03:00:03,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 03:00:03,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:03,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:03,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-04 03:00:03,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:00:03,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2025-03-04 03:00:03,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2025-03-04 03:00:03,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:03,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:03,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2025-03-04 03:00:03,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:03,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:03,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2025-03-04 03:00:03,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:03,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 25 [2025-03-04 03:00:03,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:03,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 25 [2025-03-04 03:00:03,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:03,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:03,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:03,463 INFO L349 Elim1Store]: treesize reduction 166, result has 19.0 percent of original size [2025-03-04 03:00:03,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 180 treesize of output 129 [2025-03-04 03:00:03,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:03,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:03,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:03,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:03,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 35 [2025-03-04 03:00:04,437 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 47 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 03:00:04,437 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 03:00:04,757 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:04,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 96 [2025-03-04 03:00:04,766 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:04,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2025-03-04 03:00:04,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-03-04 03:00:04,822 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse2 (+ 16 |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| 1)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_subst_2 Int)) (or (= 0 (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| v_arrayElimArr_6))) (store .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18|))) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse2)) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_6 v_subst_2))))))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| 1)) (forall ((v_arrayElimArr_7 (Array Int Int)) (v_subst_1 Int)) (= (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| 0)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| v_arrayElimArr_7))) (store .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_subst_1))) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse2) 0)))))) is different from false [2025-03-04 03:00:04,832 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 03:00:04,833 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 03:00:04,881 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2025-03-04 03:00:04,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 303 treesize of output 290 [2025-03-04 03:00:04,893 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:04,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 288 treesize of output 260 [2025-03-04 03:00:04,902 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 03:00:04,903 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 03:00:04,946 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2025-03-04 03:00:04,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 393 treesize of output 380 [2025-03-04 03:00:04,961 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:04,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 334 treesize of output 330 [2025-03-04 03:00:04,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 283 treesize of output 271 [2025-03-04 03:00:04,984 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:04,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 295 treesize of output 292 [2025-03-04 03:00:05,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-03-04 03:00:05,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-04 03:00:05,592 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 03:00:05,593 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 03:00:05,601 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:05,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 110 treesize of output 120 [2025-03-04 03:00:05,648 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 03:00:05,648 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 03:00:05,662 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:05,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 73 [2025-03-04 03:00:05,743 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 26 trivial. 1 not checked. [2025-03-04 03:00:05,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151132079] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 03:00:05,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 03:00:05,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 10] total 23 [2025-03-04 03:00:05,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775209547] [2025-03-04 03:00:05,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 03:00:05,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 03:00:05,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:00:05,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 03:00:05,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=401, Unknown=1, NotChecked=40, Total=506 [2025-03-04 03:00:05,744 INFO L87 Difference]: Start difference. First operand 151 states and 205 transitions. Second operand has 23 states, 20 states have (on average 4.85) internal successors, (97), 22 states have internal predecessors, (97), 9 states have call successors, (20), 3 states have call predecessors, (20), 7 states have return successors, (19), 7 states have call predecessors, (19), 9 states have call successors, (19) [2025-03-04 03:00:07,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:00:07,534 INFO L93 Difference]: Finished difference Result 316 states and 447 transitions. [2025-03-04 03:00:07,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-04 03:00:07,535 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 4.85) internal successors, (97), 22 states have internal predecessors, (97), 9 states have call successors, (20), 3 states have call predecessors, (20), 7 states have return successors, (19), 7 states have call predecessors, (19), 9 states have call successors, (19) Word has length 71 [2025-03-04 03:00:07,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:00:07,538 INFO L225 Difference]: With dead ends: 316 [2025-03-04 03:00:07,538 INFO L226 Difference]: Without dead ends: 235 [2025-03-04 03:00:07,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 121 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=165, Invalid=1170, Unknown=1, NotChecked=70, Total=1406 [2025-03-04 03:00:07,541 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 65 mSDsluCounter, 1567 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1678 SdHoareTripleChecker+Invalid, 1269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 146 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-04 03:00:07,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1678 Invalid, 1269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1081 Invalid, 0 Unknown, 146 Unchecked, 1.2s Time] [2025-03-04 03:00:07,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-03-04 03:00:07,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 227. [2025-03-04 03:00:07,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 170 states have (on average 1.3470588235294119) internal successors, (229), 178 states have internal predecessors, (229), 38 states have call successors, (38), 13 states have call predecessors, (38), 18 states have return successors, (47), 35 states have call predecessors, (47), 35 states have call successors, (47) [2025-03-04 03:00:07,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 314 transitions. [2025-03-04 03:00:07,595 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 314 transitions. Word has length 71 [2025-03-04 03:00:07,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:00:07,595 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 314 transitions. [2025-03-04 03:00:07,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 4.85) internal successors, (97), 22 states have internal predecessors, (97), 9 states have call successors, (20), 3 states have call predecessors, (20), 7 states have return successors, (19), 7 states have call predecessors, (19), 9 states have call successors, (19) [2025-03-04 03:00:07,596 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 314 transitions. [2025-03-04 03:00:07,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-04 03:00:07,597 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:00:07,597 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:00:07,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 03:00:07,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:00:07,798 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:00:07,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:00:07,798 INFO L85 PathProgramCache]: Analyzing trace with hash -144149154, now seen corresponding path program 1 times [2025-03-04 03:00:07,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:00:07,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076655961] [2025-03-04 03:00:07,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:07,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:00:07,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-04 03:00:07,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 03:00:07,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:07,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:07,876 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-04 03:00:07,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:00:07,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076655961] [2025-03-04 03:00:07,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076655961] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:00:07,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819503859] [2025-03-04 03:00:07,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:07,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:00:07,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:00:07,879 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-03-04 03:00:07,880 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-03-04 03:00:07,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-04 03:00:07,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 03:00:07,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:07,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:07,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 03:00:08,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:00:08,053 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 03:00:08,053 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:00:08,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819503859] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:00:08,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:00:08,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 13 [2025-03-04 03:00:08,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740294291] [2025-03-04 03:00:08,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:00:08,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 03:00:08,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:00:08,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 03:00:08,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-04 03:00:08,054 INFO L87 Difference]: Start difference. First operand 227 states and 314 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 03:00:08,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:00:08,221 INFO L93 Difference]: Finished difference Result 511 states and 717 transitions. [2025-03-04 03:00:08,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 03:00:08,222 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 73 [2025-03-04 03:00:08,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:00:08,223 INFO L225 Difference]: With dead ends: 511 [2025-03-04 03:00:08,223 INFO L226 Difference]: Without dead ends: 302 [2025-03-04 03:00:08,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2025-03-04 03:00:08,225 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 107 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:00:08,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 297 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 03:00:08,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2025-03-04 03:00:08,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 230. [2025-03-04 03:00:08,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 173 states have (on average 1.3583815028901733) internal successors, (235), 181 states have internal predecessors, (235), 38 states have call successors, (38), 13 states have call predecessors, (38), 18 states have return successors, (47), 35 states have call predecessors, (47), 35 states have call successors, (47) [2025-03-04 03:00:08,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 320 transitions. [2025-03-04 03:00:08,245 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 320 transitions. Word has length 73 [2025-03-04 03:00:08,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:00:08,245 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 320 transitions. [2025-03-04 03:00:08,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 03:00:08,245 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 320 transitions. [2025-03-04 03:00:08,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-04 03:00:08,246 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:00:08,246 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:00:08,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 03:00:08,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-04 03:00:08,451 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:00:08,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:00:08,451 INFO L85 PathProgramCache]: Analyzing trace with hash 859103947, now seen corresponding path program 1 times [2025-03-04 03:00:08,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:00:08,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640600917] [2025-03-04 03:00:08,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:08,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:00:08,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-04 03:00:08,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-04 03:00:08,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:08,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:08,559 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-04 03:00:08,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:00:08,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640600917] [2025-03-04 03:00:08,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640600917] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:00:08,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066833508] [2025-03-04 03:00:08,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:08,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:00:08,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:00:08,562 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 03:00:08,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 03:00:08,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-04 03:00:08,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-04 03:00:08,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:08,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:08,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 03:00:08,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:00:08,712 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-04 03:00:08,712 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:00:08,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066833508] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:00:08,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:00:08,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2025-03-04 03:00:08,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464042421] [2025-03-04 03:00:08,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:00:08,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:00:08,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:00:08,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:00:08,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 03:00:08,713 INFO L87 Difference]: Start difference. First operand 230 states and 320 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 03:00:08,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:00:08,743 INFO L93 Difference]: Finished difference Result 469 states and 681 transitions. [2025-03-04 03:00:08,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:00:08,744 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 74 [2025-03-04 03:00:08,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:00:08,745 INFO L225 Difference]: With dead ends: 469 [2025-03-04 03:00:08,745 INFO L226 Difference]: Without dead ends: 257 [2025-03-04 03:00:08,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 03:00:08,747 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 2 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 03:00:08,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 150 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 03:00:08,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-03-04 03:00:08,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 239. [2025-03-04 03:00:08,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 182 states have (on average 1.3571428571428572) internal successors, (247), 190 states have internal predecessors, (247), 38 states have call successors, (38), 13 states have call predecessors, (38), 18 states have return successors, (47), 35 states have call predecessors, (47), 35 states have call successors, (47) [2025-03-04 03:00:08,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 332 transitions. [2025-03-04 03:00:08,770 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 332 transitions. Word has length 74 [2025-03-04 03:00:08,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:00:08,770 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 332 transitions. [2025-03-04 03:00:08,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 03:00:08,771 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 332 transitions. [2025-03-04 03:00:08,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-04 03:00:08,772 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:00:08,772 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:00:08,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 03:00:08,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 03:00:08,973 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:00:08,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:00:08,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1840456310, now seen corresponding path program 1 times [2025-03-04 03:00:08,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:00:08,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027640324] [2025-03-04 03:00:08,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:08,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:00:08,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-04 03:00:08,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 03:00:08,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:08,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:09,063 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 03:00:09,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:00:09,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027640324] [2025-03-04 03:00:09,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027640324] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:00:09,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469404731] [2025-03-04 03:00:09,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:09,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:00:09,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:00:09,066 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 03:00:09,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 03:00:09,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-04 03:00:09,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 03:00:09,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:09,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:09,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 03:00:09,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:00:09,319 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 03:00:09,319 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:00:09,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469404731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:00:09,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:00:09,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2025-03-04 03:00:09,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141708143] [2025-03-04 03:00:09,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:00:09,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 03:00:09,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:00:09,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 03:00:09,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-04 03:00:09,321 INFO L87 Difference]: Start difference. First operand 239 states and 332 transitions. Second operand has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 7 states have internal predecessors, (62), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-04 03:00:09,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:00:09,417 INFO L93 Difference]: Finished difference Result 463 states and 634 transitions. [2025-03-04 03:00:09,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 03:00:09,418 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 7 states have internal predecessors, (62), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 82 [2025-03-04 03:00:09,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:00:09,420 INFO L225 Difference]: With dead ends: 463 [2025-03-04 03:00:09,420 INFO L226 Difference]: Without dead ends: 187 [2025-03-04 03:00:09,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-03-04 03:00:09,421 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 111 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:00:09,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 293 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 03:00:09,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-03-04 03:00:09,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2025-03-04 03:00:09,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 133 states have (on average 1.263157894736842) internal successors, (168), 141 states have internal predecessors, (168), 35 states have call successors, (35), 13 states have call predecessors, (35), 18 states have return successors, (44), 32 states have call predecessors, (44), 32 states have call successors, (44) [2025-03-04 03:00:09,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 247 transitions. [2025-03-04 03:00:09,446 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 247 transitions. Word has length 82 [2025-03-04 03:00:09,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:00:09,446 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 247 transitions. [2025-03-04 03:00:09,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 7 states have internal predecessors, (62), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-04 03:00:09,446 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 247 transitions. [2025-03-04 03:00:09,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-04 03:00:09,447 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:00:09,447 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:00:09,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-04 03:00:09,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-04 03:00:09,649 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:00:09,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:00:09,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1204331920, now seen corresponding path program 1 times [2025-03-04 03:00:09,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:00:09,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91890670] [2025-03-04 03:00:09,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:09,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:00:09,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-04 03:00:09,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-04 03:00:09,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:09,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:09,888 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-04 03:00:09,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:00:09,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91890670] [2025-03-04 03:00:09,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91890670] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:00:09,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852367961] [2025-03-04 03:00:09,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:09,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:00:09,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:00:09,891 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 03:00:09,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 03:00:10,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-04 03:00:10,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-04 03:00:10,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:10,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:10,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 102 conjuncts are in the unsatisfiable core [2025-03-04 03:00:10,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:00:10,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2025-03-04 03:00:10,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:10,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2025-03-04 03:00:10,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2025-03-04 03:00:10,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:10,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2025-03-04 03:00:10,156 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-03-04 03:00:10,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 65 [2025-03-04 03:00:10,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:10,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 18 [2025-03-04 03:00:11,375 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 24 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 03:00:11,376 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 03:00:11,845 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:11,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 84 [2025-03-04 03:00:11,851 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:11,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 124 treesize of output 100 [2025-03-04 03:00:11,868 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:11,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 690 treesize of output 616 [2025-03-04 03:00:11,882 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:11,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 603 treesize of output 579 [2025-03-04 03:00:11,917 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:11,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 525 treesize of output 537 [2025-03-04 03:00:11,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 501 treesize of output 493 [2025-03-04 03:00:12,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-03-04 03:00:12,507 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:12,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 208 treesize of output 206 [2025-03-04 03:00:12,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-03-04 03:00:12,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-04 03:00:12,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-03-04 03:00:12,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-03-04 03:00:12,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-03-04 03:00:13,050 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:13,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 278 treesize of output 246 [2025-03-04 03:00:13,545 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 03:00:13,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852367961] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 03:00:13,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 03:00:13,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 18, 14] total 35 [2025-03-04 03:00:13,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961941796] [2025-03-04 03:00:13,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 03:00:13,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-04 03:00:13,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:00:13,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-04 03:00:13,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1072, Unknown=0, NotChecked=0, Total=1190 [2025-03-04 03:00:13,547 INFO L87 Difference]: Start difference. First operand 187 states and 247 transitions. Second operand has 35 states, 34 states have (on average 3.4411764705882355) internal successors, (117), 34 states have internal predecessors, (117), 10 states have call successors, (24), 3 states have call predecessors, (24), 6 states have return successors, (23), 10 states have call predecessors, (23), 10 states have call successors, (23) [2025-03-04 03:00:15,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:00:15,760 INFO L93 Difference]: Finished difference Result 463 states and 642 transitions. [2025-03-04 03:00:15,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-03-04 03:00:15,760 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 3.4411764705882355) internal successors, (117), 34 states have internal predecessors, (117), 10 states have call successors, (24), 3 states have call predecessors, (24), 6 states have return successors, (23), 10 states have call predecessors, (23), 10 states have call successors, (23) Word has length 83 [2025-03-04 03:00:15,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:00:15,762 INFO L225 Difference]: With dead ends: 463 [2025-03-04 03:00:15,762 INFO L226 Difference]: Without dead ends: 237 [2025-03-04 03:00:15,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 133 SyntacticMatches, 8 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 953 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=510, Invalid=4046, Unknown=0, NotChecked=0, Total=4556 [2025-03-04 03:00:15,764 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 211 mSDsluCounter, 1521 mSDsCounter, 0 mSdLazyCounter, 1700 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 1620 SdHoareTripleChecker+Invalid, 1772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-04 03:00:15,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 1620 Invalid, 1772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1700 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-04 03:00:15,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-03-04 03:00:15,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 200. [2025-03-04 03:00:15,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 145 states have (on average 1.2551724137931035) internal successors, (182), 154 states have internal predecessors, (182), 35 states have call successors, (35), 13 states have call predecessors, (35), 19 states have return successors, (47), 32 states have call predecessors, (47), 32 states have call successors, (47) [2025-03-04 03:00:15,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 264 transitions. [2025-03-04 03:00:15,785 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 264 transitions. Word has length 83 [2025-03-04 03:00:15,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:00:15,785 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 264 transitions. [2025-03-04 03:00:15,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 3.4411764705882355) internal successors, (117), 34 states have internal predecessors, (117), 10 states have call successors, (24), 3 states have call predecessors, (24), 6 states have return successors, (23), 10 states have call predecessors, (23), 10 states have call successors, (23) [2025-03-04 03:00:15,786 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 264 transitions. [2025-03-04 03:00:15,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-04 03:00:15,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:00:15,787 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:00:15,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-04 03:00:15,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 03:00:15,991 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:00:15,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:00:15,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1202640566, now seen corresponding path program 1 times [2025-03-04 03:00:15,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:00:15,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412624368] [2025-03-04 03:00:15,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:15,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:00:16,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-04 03:00:16,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 03:00:16,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:16,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:16,217 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-04 03:00:16,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:00:16,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412624368] [2025-03-04 03:00:16,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412624368] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:00:16,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928612605] [2025-03-04 03:00:16,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:16,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:00:16,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:00:16,220 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 03:00:16,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 03:00:16,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-04 03:00:16,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 03:00:16,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:16,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:16,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-03-04 03:00:16,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:00:16,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 03:00:16,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 03:00:16,910 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 22 proven. 20 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 03:00:16,910 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 03:00:17,305 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 11 proven. 21 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 03:00:17,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1928612605] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 03:00:17,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 03:00:17,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 16, 13] total 32 [2025-03-04 03:00:17,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558583661] [2025-03-04 03:00:17,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 03:00:17,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-04 03:00:17,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:00:17,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-04 03:00:17,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=894, Unknown=0, NotChecked=0, Total=992 [2025-03-04 03:00:17,307 INFO L87 Difference]: Start difference. First operand 200 states and 264 transitions. Second operand has 32 states, 32 states have (on average 3.96875) internal successors, (127), 30 states have internal predecessors, (127), 11 states have call successors, (22), 3 states have call predecessors, (22), 6 states have return successors, (22), 10 states have call predecessors, (22), 11 states have call successors, (22) [2025-03-04 03:00:18,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:00:18,773 INFO L93 Difference]: Finished difference Result 737 states and 1065 transitions. [2025-03-04 03:00:18,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-04 03:00:18,774 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.96875) internal successors, (127), 30 states have internal predecessors, (127), 11 states have call successors, (22), 3 states have call predecessors, (22), 6 states have return successors, (22), 10 states have call predecessors, (22), 11 states have call successors, (22) Word has length 85 [2025-03-04 03:00:18,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:00:18,777 INFO L225 Difference]: With dead ends: 737 [2025-03-04 03:00:18,777 INFO L226 Difference]: Without dead ends: 549 [2025-03-04 03:00:18,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 148 SyntacticMatches, 6 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 835 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=497, Invalid=3663, Unknown=0, NotChecked=0, Total=4160 [2025-03-04 03:00:18,779 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 314 mSDsluCounter, 1299 mSDsCounter, 0 mSdLazyCounter, 1473 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 1403 SdHoareTripleChecker+Invalid, 1596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 1473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 03:00:18,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 1403 Invalid, 1596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1473 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 03:00:18,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2025-03-04 03:00:18,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 454. [2025-03-04 03:00:18,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 340 states have (on average 1.261764705882353) internal successors, (429), 353 states have internal predecessors, (429), 78 states have call successors, (78), 25 states have call predecessors, (78), 35 states have return successors, (106), 75 states have call predecessors, (106), 73 states have call successors, (106) [2025-03-04 03:00:18,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 613 transitions. [2025-03-04 03:00:18,826 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 613 transitions. Word has length 85 [2025-03-04 03:00:18,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:00:18,826 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 613 transitions. [2025-03-04 03:00:18,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.96875) internal successors, (127), 30 states have internal predecessors, (127), 11 states have call successors, (22), 3 states have call predecessors, (22), 6 states have return successors, (22), 10 states have call predecessors, (22), 11 states have call successors, (22) [2025-03-04 03:00:18,826 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 613 transitions. [2025-03-04 03:00:18,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-04 03:00:18,828 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:00:18,828 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:00:18,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-04 03:00:19,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:00:19,031 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:00:19,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:00:19,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1989162679, now seen corresponding path program 1 times [2025-03-04 03:00:19,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:00:19,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548420161] [2025-03-04 03:00:19,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:19,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:00:19,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-04 03:00:19,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 03:00:19,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:19,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:19,082 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-04 03:00:19,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:00:19,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548420161] [2025-03-04 03:00:19,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548420161] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:00:19,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471735154] [2025-03-04 03:00:19,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:19,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:00:19,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:00:19,085 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 03:00:19,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 03:00:19,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-04 03:00:19,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 03:00:19,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:19,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:19,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 03:00:19,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:00:19,257 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-04 03:00:19,257 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:00:19,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471735154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:00:19,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:00:19,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2025-03-04 03:00:19,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172015150] [2025-03-04 03:00:19,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:00:19,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 03:00:19,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:00:19,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 03:00:19,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 03:00:19,259 INFO L87 Difference]: Start difference. First operand 454 states and 613 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 03:00:19,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:00:19,326 INFO L93 Difference]: Finished difference Result 832 states and 1168 transitions. [2025-03-04 03:00:19,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 03:00:19,326 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 85 [2025-03-04 03:00:19,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:00:19,328 INFO L225 Difference]: With dead ends: 832 [2025-03-04 03:00:19,328 INFO L226 Difference]: Without dead ends: 454 [2025-03-04 03:00:19,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 03:00:19,331 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 03:00:19,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 228 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 03:00:19,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2025-03-04 03:00:19,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 454. [2025-03-04 03:00:19,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 340 states have (on average 1.2441176470588236) internal successors, (423), 353 states have internal predecessors, (423), 78 states have call successors, (78), 25 states have call predecessors, (78), 35 states have return successors, (106), 75 states have call predecessors, (106), 73 states have call successors, (106) [2025-03-04 03:00:19,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 607 transitions. [2025-03-04 03:00:19,375 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 607 transitions. Word has length 85 [2025-03-04 03:00:19,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:00:19,375 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 607 transitions. [2025-03-04 03:00:19,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 03:00:19,375 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 607 transitions. [2025-03-04 03:00:19,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-04 03:00:19,376 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:00:19,377 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:00:19,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-04 03:00:19,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 03:00:19,581 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:00:19,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:00:19,581 INFO L85 PathProgramCache]: Analyzing trace with hash -5170856, now seen corresponding path program 1 times [2025-03-04 03:00:19,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:00:19,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117997316] [2025-03-04 03:00:19,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:19,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:00:19,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-04 03:00:19,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 03:00:19,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:19,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:19,643 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-04 03:00:19,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:00:19,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117997316] [2025-03-04 03:00:19,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117997316] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:00:19,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648799236] [2025-03-04 03:00:19,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:19,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:00:19,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:00:19,646 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 03:00:19,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 03:00:19,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-04 03:00:19,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 03:00:19,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:19,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:19,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 03:00:19,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:00:19,817 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 03:00:19,817 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:00:19,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648799236] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:00:19,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:00:19,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2025-03-04 03:00:19,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573120196] [2025-03-04 03:00:19,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:00:19,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 03:00:19,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:00:19,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 03:00:19,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 03:00:19,819 INFO L87 Difference]: Start difference. First operand 454 states and 607 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 03:00:19,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:00:19,851 INFO L93 Difference]: Finished difference Result 590 states and 812 transitions. [2025-03-04 03:00:19,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 03:00:19,851 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 85 [2025-03-04 03:00:19,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:00:19,853 INFO L225 Difference]: With dead ends: 590 [2025-03-04 03:00:19,853 INFO L226 Difference]: Without dead ends: 212 [2025-03-04 03:00:19,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 03:00:19,854 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 1 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 03:00:19,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 226 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 03:00:19,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-03-04 03:00:19,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 206. [2025-03-04 03:00:19,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 148 states have (on average 1.2094594594594594) internal successors, (179), 157 states have internal predecessors, (179), 38 states have call successors, (38), 13 states have call predecessors, (38), 19 states have return successors, (50), 35 states have call predecessors, (50), 35 states have call successors, (50) [2025-03-04 03:00:19,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 267 transitions. [2025-03-04 03:00:19,890 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 267 transitions. Word has length 85 [2025-03-04 03:00:19,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:00:19,891 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 267 transitions. [2025-03-04 03:00:19,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 03:00:19,891 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 267 transitions. [2025-03-04 03:00:19,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-04 03:00:19,892 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:00:19,892 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:00:19,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-04 03:00:20,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 03:00:20,093 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:00:20,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:00:20,094 INFO L85 PathProgramCache]: Analyzing trace with hash -2043913485, now seen corresponding path program 1 times [2025-03-04 03:00:20,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:00:20,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129824407] [2025-03-04 03:00:20,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:20,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:00:20,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 03:00:20,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 03:00:20,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:20,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:20,641 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-04 03:00:20,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:00:20,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129824407] [2025-03-04 03:00:20,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129824407] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:00:20,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209463146] [2025-03-04 03:00:20,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:20,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:00:20,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:00:20,644 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 03:00:20,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 03:00:20,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 03:00:20,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 03:00:20,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:20,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:20,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 80 conjuncts are in the unsatisfiable core [2025-03-04 03:00:20,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:00:20,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2025-03-04 03:00:20,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:20,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2025-03-04 03:00:20,917 INFO L349 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2025-03-04 03:00:20,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 43 [2025-03-04 03:00:20,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:20,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 1 [2025-03-04 03:00:21,317 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 30 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 03:00:21,317 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 03:00:21,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 60 [2025-03-04 03:00:21,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2025-03-04 03:00:21,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2025-03-04 03:00:21,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2025-03-04 03:00:21,675 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:21,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 39 [2025-03-04 03:00:21,690 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:21,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 208 treesize of output 202 [2025-03-04 03:00:21,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 280 treesize of output 272 [2025-03-04 03:00:21,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-03-04 03:00:21,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2025-03-04 03:00:21,806 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-04 03:00:21,814 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:21,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 67 [2025-03-04 03:00:21,923 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-04 03:00:21,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209463146] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 03:00:21,923 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 03:00:21,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 11] total 32 [2025-03-04 03:00:21,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151550394] [2025-03-04 03:00:21,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 03:00:21,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-04 03:00:21,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:00:21,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-04 03:00:21,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=884, Unknown=0, NotChecked=0, Total=992 [2025-03-04 03:00:21,924 INFO L87 Difference]: Start difference. First operand 206 states and 267 transitions. Second operand has 32 states, 32 states have (on average 3.78125) internal successors, (121), 32 states have internal predecessors, (121), 10 states have call successors, (21), 3 states have call predecessors, (21), 6 states have return successors, (20), 7 states have call predecessors, (20), 10 states have call successors, (20) [2025-03-04 03:00:23,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:00:23,313 INFO L93 Difference]: Finished difference Result 378 states and 499 transitions. [2025-03-04 03:00:23,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 03:00:23,313 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.78125) internal successors, (121), 32 states have internal predecessors, (121), 10 states have call successors, (21), 3 states have call predecessors, (21), 6 states have return successors, (20), 7 states have call predecessors, (20), 10 states have call successors, (20) Word has length 86 [2025-03-04 03:00:23,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:00:23,315 INFO L225 Difference]: With dead ends: 378 [2025-03-04 03:00:23,315 INFO L226 Difference]: Without dead ends: 248 [2025-03-04 03:00:23,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=185, Invalid=1455, Unknown=0, NotChecked=0, Total=1640 [2025-03-04 03:00:23,316 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 100 mSDsluCounter, 2158 mSDsCounter, 0 mSdLazyCounter, 1624 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 2277 SdHoareTripleChecker+Invalid, 1680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:00:23,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 2277 Invalid, 1680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1624 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-04 03:00:23,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-03-04 03:00:23,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 210. [2025-03-04 03:00:23,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 152 states have (on average 1.2171052631578947) internal successors, (185), 161 states have internal predecessors, (185), 38 states have call successors, (38), 13 states have call predecessors, (38), 19 states have return successors, (50), 35 states have call predecessors, (50), 35 states have call successors, (50) [2025-03-04 03:00:23,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 273 transitions. [2025-03-04 03:00:23,339 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 273 transitions. Word has length 86 [2025-03-04 03:00:23,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:00:23,339 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 273 transitions. [2025-03-04 03:00:23,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.78125) internal successors, (121), 32 states have internal predecessors, (121), 10 states have call successors, (21), 3 states have call predecessors, (21), 6 states have return successors, (20), 7 states have call predecessors, (20), 10 states have call successors, (20) [2025-03-04 03:00:23,339 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 273 transitions. [2025-03-04 03:00:23,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-04 03:00:23,340 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:00:23,340 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:00:23,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-04 03:00:23,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 03:00:23,540 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:00:23,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:00:23,541 INFO L85 PathProgramCache]: Analyzing trace with hash -23951039, now seen corresponding path program 1 times [2025-03-04 03:00:23,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:00:23,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558144914] [2025-03-04 03:00:23,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:23,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:00:23,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-04 03:00:23,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-04 03:00:23,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:23,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:23,628 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-04 03:00:23,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:00:23,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558144914] [2025-03-04 03:00:23,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558144914] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:00:23,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000340829] [2025-03-04 03:00:23,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:23,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:00:23,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:00:23,631 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 03:00:23,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 03:00:23,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-04 03:00:23,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-04 03:00:23,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:23,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:23,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 03:00:23,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:00:23,848 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 03:00:23,848 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:00:23,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000340829] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:00:23,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:00:23,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 13 [2025-03-04 03:00:23,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129505817] [2025-03-04 03:00:23,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:00:23,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 03:00:23,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:00:23,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 03:00:23,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-04 03:00:23,849 INFO L87 Difference]: Start difference. First operand 210 states and 273 transitions. Second operand has 8 states, 7 states have (on average 9.428571428571429) internal successors, (66), 8 states have internal predecessors, (66), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-04 03:00:23,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:00:23,993 INFO L93 Difference]: Finished difference Result 409 states and 522 transitions. [2025-03-04 03:00:23,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 03:00:23,994 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.428571428571429) internal successors, (66), 8 states have internal predecessors, (66), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 87 [2025-03-04 03:00:23,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:00:23,995 INFO L225 Difference]: With dead ends: 409 [2025-03-04 03:00:23,995 INFO L226 Difference]: Without dead ends: 217 [2025-03-04 03:00:23,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2025-03-04 03:00:23,996 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 92 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:00:23,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 305 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 03:00:23,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-03-04 03:00:24,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 207. [2025-03-04 03:00:24,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 150 states have (on average 1.2) internal successors, (180), 158 states have internal predecessors, (180), 38 states have call successors, (38), 13 states have call predecessors, (38), 18 states have return successors, (48), 35 states have call predecessors, (48), 35 states have call successors, (48) [2025-03-04 03:00:24,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 266 transitions. [2025-03-04 03:00:24,019 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 266 transitions. Word has length 87 [2025-03-04 03:00:24,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:00:24,019 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 266 transitions. [2025-03-04 03:00:24,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.428571428571429) internal successors, (66), 8 states have internal predecessors, (66), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-04 03:00:24,019 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 266 transitions. [2025-03-04 03:00:24,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-04 03:00:24,020 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:00:24,020 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:00:24,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-04 03:00:24,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 03:00:24,221 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:00:24,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:00:24,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1995915047, now seen corresponding path program 1 times [2025-03-04 03:00:24,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:00:24,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285412074] [2025-03-04 03:00:24,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:24,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:00:24,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-04 03:00:24,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-04 03:00:24,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:24,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:24,460 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-03-04 03:00:24,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:00:24,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285412074] [2025-03-04 03:00:24,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285412074] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:00:24,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571557268] [2025-03-04 03:00:24,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:24,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:00:24,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:00:24,462 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 03:00:24,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-04 03:00:24,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-04 03:00:24,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-04 03:00:24,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:24,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:24,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 03:00:24,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:00:24,669 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-04 03:00:24,669 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:00:24,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571557268] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:00:24,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:00:24,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2025-03-04 03:00:24,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248957134] [2025-03-04 03:00:24,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:00:24,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 03:00:24,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:00:24,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 03:00:24,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 03:00:24,670 INFO L87 Difference]: Start difference. First operand 207 states and 266 transitions. Second operand has 7 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-04 03:00:24,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:00:24,718 INFO L93 Difference]: Finished difference Result 375 states and 478 transitions. [2025-03-04 03:00:24,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 03:00:24,718 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 109 [2025-03-04 03:00:24,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:00:24,719 INFO L225 Difference]: With dead ends: 375 [2025-03-04 03:00:24,719 INFO L226 Difference]: Without dead ends: 207 [2025-03-04 03:00:24,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 03:00:24,720 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 03:00:24,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 428 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 03:00:24,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-03-04 03:00:24,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2025-03-04 03:00:24,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 150 states have (on average 1.2) internal successors, (180), 158 states have internal predecessors, (180), 38 states have call successors, (38), 13 states have call predecessors, (38), 18 states have return successors, (45), 35 states have call predecessors, (45), 35 states have call successors, (45) [2025-03-04 03:00:24,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 263 transitions. [2025-03-04 03:00:24,756 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 263 transitions. Word has length 109 [2025-03-04 03:00:24,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:00:24,756 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 263 transitions. [2025-03-04 03:00:24,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-04 03:00:24,757 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 263 transitions. [2025-03-04 03:00:24,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-04 03:00:24,757 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:00:24,758 INFO L218 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:00:24,766 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-04 03:00:24,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:00:24,962 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:00:24,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:00:24,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1650374650, now seen corresponding path program 2 times [2025-03-04 03:00:24,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:00:24,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554405685] [2025-03-04 03:00:24,963 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 03:00:24,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:00:24,983 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 112 statements into 2 equivalence classes. [2025-03-04 03:00:25,024 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 112 of 112 statements. [2025-03-04 03:00:25,024 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 03:00:25,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:26,307 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 18 proven. 32 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-04 03:00:26,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:00:26,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554405685] [2025-03-04 03:00:26,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554405685] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:00:26,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522524226] [2025-03-04 03:00:26,308 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 03:00:26,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:00:26,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:00:26,309 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 03:00:26,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-04 03:00:26,460 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 112 statements into 2 equivalence classes. [2025-03-04 03:00:26,505 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 112 of 112 statements. [2025-03-04 03:00:26,505 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 03:00:26,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:26,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 106 conjuncts are in the unsatisfiable core [2025-03-04 03:00:26,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:00:26,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2025-03-04 03:00:26,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2025-03-04 03:00:27,902 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-04 03:00:27,902 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:00:27,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522524226] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:00:27,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:00:27,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [20] total 34 [2025-03-04 03:00:27,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495050675] [2025-03-04 03:00:27,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:00:27,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 03:00:27,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:00:27,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 03:00:27,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1020, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 03:00:27,903 INFO L87 Difference]: Start difference. First operand 207 states and 263 transitions. Second operand has 20 states, 20 states have (on average 3.75) internal successors, (75), 19 states have internal predecessors, (75), 6 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-04 03:00:28,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:00:28,631 INFO L93 Difference]: Finished difference Result 266 states and 333 transitions. [2025-03-04 03:00:28,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 03:00:28,631 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.75) internal successors, (75), 19 states have internal predecessors, (75), 6 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) Word has length 112 [2025-03-04 03:00:28,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:00:28,633 INFO L225 Difference]: With dead ends: 266 [2025-03-04 03:00:28,633 INFO L226 Difference]: Without dead ends: 216 [2025-03-04 03:00:28,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 98 SyntacticMatches, 9 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=148, Invalid=1258, Unknown=0, NotChecked=0, Total=1406 [2025-03-04 03:00:28,634 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 51 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 03:00:28,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 586 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 03:00:28,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-03-04 03:00:28,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 211. [2025-03-04 03:00:28,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 153 states have (on average 1.196078431372549) internal successors, (183), 161 states have internal predecessors, (183), 38 states have call successors, (38), 13 states have call predecessors, (38), 19 states have return successors, (47), 36 states have call predecessors, (47), 35 states have call successors, (47) [2025-03-04 03:00:28,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 268 transitions. [2025-03-04 03:00:28,656 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 268 transitions. Word has length 112 [2025-03-04 03:00:28,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:00:28,656 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 268 transitions. [2025-03-04 03:00:28,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.75) internal successors, (75), 19 states have internal predecessors, (75), 6 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-04 03:00:28,656 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 268 transitions. [2025-03-04 03:00:28,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-04 03:00:28,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:00:28,657 INFO L218 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:00:28,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-04 03:00:28,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:00:28,858 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:00:28,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:00:28,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1521291931, now seen corresponding path program 1 times [2025-03-04 03:00:28,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:00:28,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419701097] [2025-03-04 03:00:28,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:28,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:00:28,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-04 03:00:28,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-04 03:00:28,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:28,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:29,291 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 30 proven. 34 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-04 03:00:29,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:00:29,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419701097] [2025-03-04 03:00:29,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419701097] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:00:29,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168927024] [2025-03-04 03:00:29,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:29,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:00:29,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:00:29,293 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 03:00:29,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-04 03:00:29,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-04 03:00:29,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-04 03:00:29,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:29,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:29,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 71 conjuncts are in the unsatisfiable core [2025-03-04 03:00:29,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:00:29,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-03-04 03:00:30,343 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 57 proven. 34 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 03:00:30,343 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 03:00:31,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 227 treesize of output 211 [2025-03-04 03:00:31,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2025-03-04 03:00:31,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 45 [2025-03-04 03:00:31,072 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 30 proven. 43 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-04 03:00:31,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168927024] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 03:00:31,072 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 03:00:31,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21, 20] total 51 [2025-03-04 03:00:31,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766524143] [2025-03-04 03:00:31,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 03:00:31,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-03-04 03:00:31,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:00:31,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-03-04 03:00:31,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=2374, Unknown=0, NotChecked=0, Total=2550 [2025-03-04 03:00:31,074 INFO L87 Difference]: Start difference. First operand 211 states and 268 transitions. Second operand has 51 states, 51 states have (on average 3.4901960784313726) internal successors, (178), 48 states have internal predecessors, (178), 20 states have call successors, (30), 3 states have call predecessors, (30), 11 states have return successors, (29), 18 states have call predecessors, (29), 19 states have call successors, (29) [2025-03-04 03:00:35,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 03:00:39,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 03:00:43,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 03:00:47,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 03:00:49,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:00:49,335 INFO L93 Difference]: Finished difference Result 485 states and 671 transitions. [2025-03-04 03:00:49,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-04 03:00:49,335 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 3.4901960784313726) internal successors, (178), 48 states have internal predecessors, (178), 20 states have call successors, (30), 3 states have call predecessors, (30), 11 states have return successors, (29), 18 states have call predecessors, (29), 19 states have call successors, (29) Word has length 112 [2025-03-04 03:00:49,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:00:49,338 INFO L225 Difference]: With dead ends: 485 [2025-03-04 03:00:49,338 INFO L226 Difference]: Without dead ends: 404 [2025-03-04 03:00:49,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 204 SyntacticMatches, 7 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1353 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=688, Invalid=6118, Unknown=0, NotChecked=0, Total=6806 [2025-03-04 03:00:49,340 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 365 mSDsluCounter, 1923 mSDsCounter, 0 mSdLazyCounter, 2532 mSolverCounterSat, 145 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 2011 SdHoareTripleChecker+Invalid, 2681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 2532 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.3s IncrementalHoareTripleChecker+Time [2025-03-04 03:00:49,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 2011 Invalid, 2681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 2532 Invalid, 4 Unknown, 0 Unchecked, 17.3s Time] [2025-03-04 03:00:49,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2025-03-04 03:00:49,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 292. [2025-03-04 03:00:49,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 213 states have (on average 1.1971830985915493) internal successors, (255), 225 states have internal predecessors, (255), 49 states have call successors, (49), 17 states have call predecessors, (49), 29 states have return successors, (70), 49 states have call predecessors, (70), 45 states have call successors, (70) [2025-03-04 03:00:49,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 374 transitions. [2025-03-04 03:00:49,376 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 374 transitions. Word has length 112 [2025-03-04 03:00:49,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:00:49,376 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 374 transitions. [2025-03-04 03:00:49,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 3.4901960784313726) internal successors, (178), 48 states have internal predecessors, (178), 20 states have call successors, (30), 3 states have call predecessors, (30), 11 states have return successors, (29), 18 states have call predecessors, (29), 19 states have call successors, (29) [2025-03-04 03:00:49,377 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 374 transitions. [2025-03-04 03:00:49,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-04 03:00:49,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:00:49,378 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:00:49,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-03-04 03:00:49,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:00:49,578 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:00:49,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:00:49,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1802865345, now seen corresponding path program 1 times [2025-03-04 03:00:49,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:00:49,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040401928] [2025-03-04 03:00:49,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:49,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:00:49,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 03:00:49,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 03:00:49,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:49,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:49,794 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-04 03:00:49,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:00:49,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040401928] [2025-03-04 03:00:49,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040401928] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:00:49,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909934595] [2025-03-04 03:00:49,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:49,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:00:49,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:00:49,797 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 03:00:49,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-04 03:00:49,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 03:00:50,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 03:00:50,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:50,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:50,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 03:00:50,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:00:50,063 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-04 03:00:50,063 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:00:50,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909934595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:00:50,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:00:50,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2025-03-04 03:00:50,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791731035] [2025-03-04 03:00:50,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:00:50,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 03:00:50,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:00:50,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 03:00:50,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2025-03-04 03:00:50,064 INFO L87 Difference]: Start difference. First operand 292 states and 374 transitions. Second operand has 8 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 4 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-04 03:00:50,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:00:50,128 INFO L93 Difference]: Finished difference Result 523 states and 674 transitions. [2025-03-04 03:00:50,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 03:00:50,132 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 4 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 111 [2025-03-04 03:00:50,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:00:50,134 INFO L225 Difference]: With dead ends: 523 [2025-03-04 03:00:50,134 INFO L226 Difference]: Without dead ends: 308 [2025-03-04 03:00:50,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2025-03-04 03:00:50,135 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 1 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 03:00:50,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 511 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 03:00:50,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-03-04 03:00:50,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 304. [2025-03-04 03:00:50,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 222 states have (on average 1.1891891891891893) internal successors, (264), 237 states have internal predecessors, (264), 49 states have call successors, (49), 17 states have call predecessors, (49), 32 states have return successors, (79), 49 states have call predecessors, (79), 45 states have call successors, (79) [2025-03-04 03:00:50,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 392 transitions. [2025-03-04 03:00:50,171 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 392 transitions. Word has length 111 [2025-03-04 03:00:50,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:00:50,171 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 392 transitions. [2025-03-04 03:00:50,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 4 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-04 03:00:50,172 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 392 transitions. [2025-03-04 03:00:50,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-04 03:00:50,173 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:00:50,173 INFO L218 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:00:50,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-03-04 03:00:50,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:00:50,373 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:00:50,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:00:50,374 INFO L85 PathProgramCache]: Analyzing trace with hash -2026850556, now seen corresponding path program 1 times [2025-03-04 03:00:50,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:00:50,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108147240] [2025-03-04 03:00:50,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:50,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:00:50,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-04 03:00:50,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-04 03:00:50,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:50,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:50,519 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-04 03:00:50,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:00:50,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108147240] [2025-03-04 03:00:50,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108147240] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:00:50,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:00:50,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 03:00:50,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666675033] [2025-03-04 03:00:50,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:00:50,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 03:00:50,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:00:50,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 03:00:50,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-04 03:00:50,520 INFO L87 Difference]: Start difference. First operand 304 states and 392 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 5 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-04 03:00:50,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:00:50,662 INFO L93 Difference]: Finished difference Result 704 states and 939 transitions. [2025-03-04 03:00:50,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 03:00:50,663 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 5 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) Word has length 112 [2025-03-04 03:00:50,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:00:50,665 INFO L225 Difference]: With dead ends: 704 [2025-03-04 03:00:50,665 INFO L226 Difference]: Without dead ends: 327 [2025-03-04 03:00:50,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-03-04 03:00:50,666 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 39 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:00:50,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 533 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 03:00:50,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2025-03-04 03:00:50,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 309. [2025-03-04 03:00:50,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 226 states have (on average 1.1858407079646018) internal successors, (268), 244 states have internal predecessors, (268), 49 states have call successors, (49), 17 states have call predecessors, (49), 33 states have return successors, (78), 47 states have call predecessors, (78), 45 states have call successors, (78) [2025-03-04 03:00:50,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 395 transitions. [2025-03-04 03:00:50,720 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 395 transitions. Word has length 112 [2025-03-04 03:00:50,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:00:50,721 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 395 transitions. [2025-03-04 03:00:50,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 5 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-04 03:00:50,721 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 395 transitions. [2025-03-04 03:00:50,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-04 03:00:50,722 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:00:50,723 INFO L218 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:00:50,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 03:00:50,723 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:00:50,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:00:50,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1763015206, now seen corresponding path program 2 times [2025-03-04 03:00:50,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:00:50,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122944263] [2025-03-04 03:00:50,727 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 03:00:50,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:00:50,744 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 112 statements into 2 equivalence classes. [2025-03-04 03:00:50,758 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 112 of 112 statements. [2025-03-04 03:00:50,759 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 03:00:50,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:51,273 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 35 proven. 13 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-04 03:00:51,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:00:51,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122944263] [2025-03-04 03:00:51,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122944263] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:00:51,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661079789] [2025-03-04 03:00:51,273 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 03:00:51,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:00:51,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:00:51,275 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 03:00:51,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-04 03:00:51,452 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 112 statements into 2 equivalence classes. [2025-03-04 03:00:51,501 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 112 of 112 statements. [2025-03-04 03:00:51,501 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 03:00:51,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:51,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-03-04 03:00:51,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:00:51,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2025-03-04 03:00:51,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:51,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2025-03-04 03:00:51,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:51,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 11 [2025-03-04 03:00:51,943 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 63 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 03:00:51,944 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 03:01:04,810 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:01:04,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 41 [2025-03-04 03:01:04,815 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:01:04,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2025-03-04 03:01:04,837 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:01:04,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 171 treesize of output 185 [2025-03-04 03:01:04,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 184 treesize of output 176 [2025-03-04 03:01:04,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-03-04 03:01:04,984 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:01:04,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 62 [2025-03-04 03:01:05,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2025-03-04 03:01:05,074 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:01:05,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 51 [2025-03-04 03:01:05,235 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 29 proven. 13 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-04 03:01:05,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661079789] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 03:01:05,235 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 03:01:05,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 12] total 36 [2025-03-04 03:01:05,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100308488] [2025-03-04 03:01:05,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 03:01:05,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-04 03:01:05,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:01:05,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-04 03:01:05,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1136, Unknown=3, NotChecked=0, Total=1260 [2025-03-04 03:01:05,238 INFO L87 Difference]: Start difference. First operand 309 states and 395 transitions. Second operand has 36 states, 32 states have (on average 4.875) internal successors, (156), 35 states have internal predecessors, (156), 15 states have call successors, (25), 3 states have call predecessors, (25), 6 states have return successors, (24), 12 states have call predecessors, (24), 15 states have call successors, (24) [2025-03-04 03:01:06,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:01:06,678 INFO L93 Difference]: Finished difference Result 505 states and 648 transitions. [2025-03-04 03:01:06,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 03:01:06,679 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 32 states have (on average 4.875) internal successors, (156), 35 states have internal predecessors, (156), 15 states have call successors, (25), 3 states have call predecessors, (25), 6 states have return successors, (24), 12 states have call predecessors, (24), 15 states have call successors, (24) Word has length 112 [2025-03-04 03:01:06,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:01:06,681 INFO L225 Difference]: With dead ends: 505 [2025-03-04 03:01:06,681 INFO L226 Difference]: Without dead ends: 351 [2025-03-04 03:01:06,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 205 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=199, Invalid=1778, Unknown=3, NotChecked=0, Total=1980 [2025-03-04 03:01:06,682 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 101 mSDsluCounter, 2013 mSDsCounter, 0 mSdLazyCounter, 1519 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 2127 SdHoareTripleChecker+Invalid, 1572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-04 03:01:06,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 2127 Invalid, 1572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1519 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-04 03:01:06,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2025-03-04 03:01:06,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 231. [2025-03-04 03:01:06,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 168 states have (on average 1.1726190476190477) internal successors, (197), 180 states have internal predecessors, (197), 37 states have call successors, (37), 14 states have call predecessors, (37), 25 states have return successors, (57), 36 states have call predecessors, (57), 34 states have call successors, (57) [2025-03-04 03:01:06,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 291 transitions. [2025-03-04 03:01:06,717 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 291 transitions. Word has length 112 [2025-03-04 03:01:06,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:01:06,717 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 291 transitions. [2025-03-04 03:01:06,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 32 states have (on average 4.875) internal successors, (156), 35 states have internal predecessors, (156), 15 states have call successors, (25), 3 states have call predecessors, (25), 6 states have return successors, (24), 12 states have call predecessors, (24), 15 states have call successors, (24) [2025-03-04 03:01:06,717 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 291 transitions. [2025-03-04 03:01:06,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-04 03:01:06,718 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:01:06,718 INFO L218 NwaCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:01:06,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-03-04 03:01:06,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:01:06,919 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:01:06,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:01:06,919 INFO L85 PathProgramCache]: Analyzing trace with hash -349193081, now seen corresponding path program 1 times [2025-03-04 03:01:06,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:01:06,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144482124] [2025-03-04 03:01:06,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:01:06,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:01:06,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 03:01:06,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 03:01:06,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:01:06,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:01:07,169 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2025-03-04 03:01:07,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:01:07,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144482124] [2025-03-04 03:01:07,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144482124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:01:07,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:01:07,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 03:01:07,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517493365] [2025-03-04 03:01:07,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:01:07,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 03:01:07,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:01:07,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 03:01:07,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 03:01:07,171 INFO L87 Difference]: Start difference. First operand 231 states and 291 transitions. Second operand has 8 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-04 03:01:07,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:01:07,250 INFO L93 Difference]: Finished difference Result 255 states and 319 transitions. [2025-03-04 03:01:07,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 03:01:07,251 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 115 [2025-03-04 03:01:07,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:01:07,253 INFO L225 Difference]: With dead ends: 255 [2025-03-04 03:01:07,253 INFO L226 Difference]: Without dead ends: 253 [2025-03-04 03:01:07,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 03:01:07,253 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 3 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 03:01:07,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 516 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 03:01:07,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-03-04 03:01:07,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 250. [2025-03-04 03:01:07,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 180 states have (on average 1.1611111111111112) internal successors, (209), 193 states have internal predecessors, (209), 40 states have call successors, (40), 17 states have call predecessors, (40), 29 states have return successors, (63), 39 states have call predecessors, (63), 37 states have call successors, (63) [2025-03-04 03:01:07,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 312 transitions. [2025-03-04 03:01:07,298 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 312 transitions. Word has length 115 [2025-03-04 03:01:07,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:01:07,298 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 312 transitions. [2025-03-04 03:01:07,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-04 03:01:07,298 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 312 transitions. [2025-03-04 03:01:07,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-04 03:01:07,299 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:01:07,299 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:01:07,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 03:01:07,300 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:01:07,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:01:07,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1175702207, now seen corresponding path program 2 times [2025-03-04 03:01:07,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:01:07,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387541385] [2025-03-04 03:01:07,300 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 03:01:07,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:01:07,320 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 122 statements into 2 equivalence classes. [2025-03-04 03:01:07,329 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 03:01:07,330 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 03:01:07,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:01:07,921 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-04 03:01:07,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:01:07,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387541385] [2025-03-04 03:01:07,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387541385] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:01:07,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935667025] [2025-03-04 03:01:07,921 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 03:01:07,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:01:07,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:01:07,923 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 03:01:07,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-04 03:01:08,103 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 122 statements into 2 equivalence classes. [2025-03-04 03:01:08,148 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 03:01:08,149 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 03:01:08,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:01:08,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-04 03:01:08,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:01:08,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2025-03-04 03:01:08,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2025-03-04 03:01:08,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:01:08,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:01:08,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 36 [2025-03-04 03:01:08,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:01:08,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:01:08,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 36 [2025-03-04 03:01:08,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:01:08,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 30 treesize of output 21 [2025-03-04 03:01:08,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:01:08,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 30 treesize of output 21 [2025-03-04 03:01:08,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:01:08,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:01:08,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:01:08,396 INFO L349 Elim1Store]: treesize reduction 132, result has 20.0 percent of original size [2025-03-04 03:01:08,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 158 treesize of output 109 [2025-03-04 03:01:08,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:01:08,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:01:08,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:01:08,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:01:08,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 31 [2025-03-04 03:01:11,328 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2025-03-04 03:01:11,328 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 03:01:11,913 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:01:11,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 96 [2025-03-04 03:01:11,922 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:01:11,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2025-03-04 03:01:11,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-03-04 03:01:12,025 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse2 (+ 8 |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_48| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_48| 1)) (forall ((v_arrayElimArr_22 (Array Int Int)) (v_subst_3 Int)) (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| 0)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_48| v_arrayElimArr_22))) (store .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_subst_3))) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse2) 0)))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_48| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_48| 1)) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_4 Int)) (or (= (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_48|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_48| v_arrayElimArr_21))) (store .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_48|))) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse2) 0) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_21 v_subst_4))))))))) is different from false [2025-03-04 03:01:12,037 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 03:01:12,038 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 03:01:12,096 INFO L349 Elim1Store]: treesize reduction 88, result has 44.7 percent of original size [2025-03-04 03:01:12,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 177 treesize of output 206 [2025-03-04 03:01:12,108 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:01:12,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 280 treesize of output 256 [2025-03-04 03:01:12,116 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 03:01:12,117 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 03:01:12,175 INFO L349 Elim1Store]: treesize reduction 88, result has 44.7 percent of original size [2025-03-04 03:01:12,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 389 treesize of output 376 [2025-03-04 03:01:12,196 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:01:12,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 330 treesize of output 326 [2025-03-04 03:01:12,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 279 treesize of output 267 [2025-03-04 03:01:12,224 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:01:12,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 291 treesize of output 288 [2025-03-04 03:01:12,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-03-04 03:01:12,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-03-04 03:01:12,680 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 03:01:12,681 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 03:01:12,697 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:01:12,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 109