./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_linked_list_begin_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_begin_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 157f0d22bcc200e95b6696425fc806db58856d3eb89fc5de304f6d82594c0bb3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:57:09,509 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:57:09,567 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-04 02:57:09,572 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:57:09,573 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:57:09,592 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:57:09,593 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:57:09,593 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:57:09,594 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:57:09,594 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:57:09,594 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:57:09,595 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:57:09,595 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:57:09,595 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:57:09,595 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:57:09,595 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:57:09,596 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:57:09,596 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:57:09,596 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:57:09,596 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:57:09,596 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:57:09,596 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:57:09,596 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:57:09,596 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:57:09,596 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:57:09,596 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:57:09,596 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:57:09,596 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:57:09,596 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:57:09,596 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:57:09,596 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:57:09,596 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:57:09,596 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:57:09,596 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:57:09,597 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:57:09,597 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:57:09,597 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:57:09,597 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:57:09,597 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:57:09,597 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:57:09,597 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 -> 157f0d22bcc200e95b6696425fc806db58856d3eb89fc5de304f6d82594c0bb3 [2025-03-04 02:57:09,790 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:57:09,796 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:57:09,797 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:57:09,798 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:57:09,798 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:57:09,799 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_begin_harness.i [2025-03-04 02:57:10,922 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d3a4ee91/186d4d10eceb4849b0ca6e4c5c66f738/FLAG3d52eb946 [2025-03-04 02:57:11,375 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:57:11,376 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_begin_harness.i [2025-03-04 02:57:11,403 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d3a4ee91/186d4d10eceb4849b0ca6e4c5c66f738/FLAG3d52eb946 [2025-03-04 02:57:11,486 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d3a4ee91/186d4d10eceb4849b0ca6e4c5c66f738 [2025-03-04 02:57:11,488 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:57:11,489 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:57:11,489 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:57:11,489 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:57:11,492 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:57:11,493 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:57:11" (1/1) ... [2025-03-04 02:57:11,493 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e050db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:57:11, skipping insertion in model container [2025-03-04 02:57:11,493 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:57:11" (1/1) ... [2025-03-04 02:57:11,546 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:57:11,746 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_begin_harness.i[4495,4508] [2025-03-04 02:57:11,752 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_begin_harness.i[4555,4568] [2025-03-04 02:57:12,286 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:12,286 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:12,287 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:12,287 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:12,288 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:12,300 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:12,301 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:12,302 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:12,303 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:12,304 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:12,304 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:12,305 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:12,305 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:12,643 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_begin_harness.i[150472,150485] [2025-03-04 02:57:12,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:57:12,657 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:57:12,666 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_begin_harness.i[4495,4508] [2025-03-04 02:57:12,667 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_begin_harness.i[4555,4568] [2025-03-04 02:57:12,724 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:12,725 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:12,726 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:12,727 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:12,727 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:12,733 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:12,734 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:12,735 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:12,735 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:12,735 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:12,736 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:12,736 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:12,736 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:12,823 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_begin_harness.i[150472,150485] [2025-03-04 02:57:12,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:57:12,952 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:57:12,953 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:57:12 WrapperNode [2025-03-04 02:57:12,953 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:57:12,954 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:57:12,954 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:57:12,954 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:57:12,958 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:57:12" (1/1) ... [2025-03-04 02:57:13,007 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:57:12" (1/1) ... [2025-03-04 02:57:13,040 INFO L138 Inliner]: procedures = 668, calls = 1039, calls flagged for inlining = 53, calls inlined = 6, statements flattened = 137 [2025-03-04 02:57:13,040 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:57:13,041 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:57:13,041 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:57:13,041 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:57:13,047 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:57:12" (1/1) ... [2025-03-04 02:57:13,047 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:57:12" (1/1) ... [2025-03-04 02:57:13,050 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:57:12" (1/1) ... [2025-03-04 02:57:13,065 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [2, 5, 17]. 71 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 6 writes are split as follows [0, 0, 6]. [2025-03-04 02:57:13,065 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:57:12" (1/1) ... [2025-03-04 02:57:13,065 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:57:12" (1/1) ... [2025-03-04 02:57:13,080 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:57:12" (1/1) ... [2025-03-04 02:57:13,081 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:57:12" (1/1) ... [2025-03-04 02:57:13,083 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:57:12" (1/1) ... [2025-03-04 02:57:13,087 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:57:12" (1/1) ... [2025-03-04 02:57:13,093 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:57:13,094 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:57:13,094 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:57:13,094 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:57:13,094 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:57:12" (1/1) ... [2025-03-04 02:57:13,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:57:13,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:57:13,124 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:57:13,129 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:57:13,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 02:57:13,145 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 02:57:13,145 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 02:57:13,145 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2025-03-04 02:57:13,145 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2025-03-04 02:57:13,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 02:57:13,145 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2025-03-04 02:57:13,145 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2025-03-04 02:57:13,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:57:13,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 02:57:13,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 02:57:13,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 02:57:13,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:57:13,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:57:13,145 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 02:57:13,145 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 02:57:13,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 02:57:13,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 02:57:13,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 02:57:13,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 02:57:13,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 02:57:13,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 02:57:13,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 02:57:13,146 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2025-03-04 02:57:13,146 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2025-03-04 02:57:13,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:57:13,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:57:13,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 02:57:13,315 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:57:13,316 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:57:13,351 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:57:13,358 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: havoc #t~nondet9; [2025-03-04 02:57:13,522 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4700: havoc #t~ret311#1; [2025-03-04 02:57:13,543 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2025-03-04 02:57:13,544 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:57:13,550 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:57:13,550 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:57:13,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:57:13 BoogieIcfgContainer [2025-03-04 02:57:13,551 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:57:13,553 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:57:13,553 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:57:13,556 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:57:13,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:57:11" (1/3) ... [2025-03-04 02:57:13,557 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@371fbd30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:57:13, skipping insertion in model container [2025-03-04 02:57:13,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:57:12" (2/3) ... [2025-03-04 02:57:13,557 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@371fbd30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:57:13, skipping insertion in model container [2025-03-04 02:57:13,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:57:13" (3/3) ... [2025-03-04 02:57:13,558 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_linked_list_begin_harness.i [2025-03-04 02:57:13,569 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:57:13,570 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_linked_list_begin_harness.i that has 6 procedures, 68 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-04 02:57:13,605 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:57:13,613 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;@61058cb5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:57:13,614 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 02:57:13,617 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 48 states have (on average 1.3125) internal successors, (63), 49 states have internal predecessors, (63), 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:57:13,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 02:57:13,623 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:57:13,623 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:57:13,624 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:57:13,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:57:13,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1751692032, now seen corresponding path program 1 times [2025-03-04 02:57:13,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:57:13,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656118324] [2025-03-04 02:57:13,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:13,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:57:13,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 02:57:13,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 02:57:13,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:13,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:13,905 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:57:13,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:57:13,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656118324] [2025-03-04 02:57:13,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656118324] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:57:13,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812898547] [2025-03-04 02:57:13,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:13,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:57:13,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:57:13,910 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:57:13,911 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:57:14,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 02:57:14,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 02:57:14,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:14,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:14,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 02:57:14,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:57:14,094 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:57:14,094 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:57:14,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812898547] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:57:14,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:57:14,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 02:57:14,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256408358] [2025-03-04 02:57:14,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:57:14,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 02:57:14,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:57:14,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 02:57:14,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 02:57:14,113 INFO L87 Difference]: Start difference. First operand has 68 states, 48 states have (on average 1.3125) internal successors, (63), 49 states have internal predecessors, (63), 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:57:14,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:57:14,134 INFO L93 Difference]: Finished difference Result 128 states and 176 transitions. [2025-03-04 02:57:14,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 02:57:14,135 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:57:14,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:57:14,139 INFO L225 Difference]: With dead ends: 128 [2025-03-04 02:57:14,140 INFO L226 Difference]: Without dead ends: 63 [2025-03-04 02:57:14,142 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:57:14,144 INFO L435 NwaCegarLoop]: 87 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, 87 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:57:14,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 02:57:14,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-04 02:57:14,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-03-04 02:57:14,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 45 states have internal predecessors, (57), 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:57:14,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 82 transitions. [2025-03-04 02:57:14,169 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 82 transitions. Word has length 70 [2025-03-04 02:57:14,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:57:14,170 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 82 transitions. [2025-03-04 02:57:14,170 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:57:14,170 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 82 transitions. [2025-03-04 02:57:14,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 02:57:14,172 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:57:14,172 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:57:14,178 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:57:14,376 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:57:14,376 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:57:14,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:57:14,377 INFO L85 PathProgramCache]: Analyzing trace with hash -2037040671, now seen corresponding path program 1 times [2025-03-04 02:57:14,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:57:14,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375822122] [2025-03-04 02:57:14,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:14,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:57:14,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 02:57:14,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 02:57:14,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:14,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:14,999 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:57:15,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:57:15,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375822122] [2025-03-04 02:57:15,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375822122] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:57:15,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558868919] [2025-03-04 02:57:15,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:15,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:57:15,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:57:15,003 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:57:15,004 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:57:15,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 02:57:15,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 02:57:15,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:15,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:15,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-03-04 02:57:15,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:57:15,276 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 7 [2025-03-04 02:57:15,285 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 02:57:15,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:57:15,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:57:15,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:57:15,364 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 37 treesize of output 32 [2025-03-04 02:57:15,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:57:15,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:57:15,380 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2025-03-04 02:57:15,984 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:57:15,987 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:57:15,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558868919] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:57:15,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:57:15,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2025-03-04 02:57:15,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497222556] [2025-03-04 02:57:15,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:57:15,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:57:15,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:57:15,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:57:15,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-04 02:57:15,990 INFO L87 Difference]: Start difference. First operand 63 states and 82 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:57:16,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:57:16,465 INFO L93 Difference]: Finished difference Result 174 states and 234 transitions. [2025-03-04 02:57:16,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:57:16,465 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:57:16,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:57:16,468 INFO L225 Difference]: With dead ends: 174 [2025-03-04 02:57:16,468 INFO L226 Difference]: Without dead ends: 123 [2025-03-04 02:57:16,469 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:57:16,469 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 72 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 02:57:16,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 326 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 02:57:16,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-04 02:57:16,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2025-03-04 02:57:16,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 84 states have (on average 1.3214285714285714) internal successors, (111), 87 states have internal predecessors, (111), 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:57:16,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 159 transitions. [2025-03-04 02:57:16,486 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 159 transitions. Word has length 70 [2025-03-04 02:57:16,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:57:16,486 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 159 transitions. [2025-03-04 02:57:16,486 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:57:16,486 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 159 transitions. [2025-03-04 02:57:16,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 02:57:16,489 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:57:16,489 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:57:16,498 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:57:16,690 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:57:16,690 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:57:16,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:57:16,691 INFO L85 PathProgramCache]: Analyzing trace with hash -66101214, now seen corresponding path program 1 times [2025-03-04 02:57:16,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:57:16,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687499676] [2025-03-04 02:57:16,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:16,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:57:16,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 02:57:16,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 02:57:16,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:16,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:16,988 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-04 02:57:16,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:57:16,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687499676] [2025-03-04 02:57:16,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687499676] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:57:16,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556886484] [2025-03-04 02:57:16,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:16,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:57:16,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:57:16,991 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:57:16,994 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:57:17,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 02:57:17,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 02:57:17,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:17,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:17,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-03-04 02:57:17,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:57:17,174 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 7 [2025-03-04 02:57:17,182 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 02:57:17,214 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2025-03-04 02:57:17,220 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 33 treesize of output 28 [2025-03-04 02:57:18,174 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:57:18,175 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:57:18,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556886484] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:57:18,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:57:18,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2025-03-04 02:57:18,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477371466] [2025-03-04 02:57:18,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:57:18,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:57:18,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:57:18,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:57:18,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-04 02:57:18,177 INFO L87 Difference]: Start difference. First operand 119 states and 159 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:57:18,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:57:18,652 INFO L93 Difference]: Finished difference Result 175 states and 232 transitions. [2025-03-04 02:57:18,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:57:18,653 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:57:18,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:57:18,654 INFO L225 Difference]: With dead ends: 175 [2025-03-04 02:57:18,654 INFO L226 Difference]: Without dead ends: 120 [2025-03-04 02:57:18,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 55 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2025-03-04 02:57:18,655 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 49 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 02:57:18,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 442 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 02:57:18,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-04 02:57:18,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 116. [2025-03-04 02:57:18,667 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:57:18,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 154 transitions. [2025-03-04 02:57:18,668 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 154 transitions. Word has length 70 [2025-03-04 02:57:18,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:57:18,669 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 154 transitions. [2025-03-04 02:57:18,669 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:57:18,669 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 154 transitions. [2025-03-04 02:57:18,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 02:57:18,671 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:57:18,671 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:57:18,680 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:57:18,873 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:57:18,873 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:57:18,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:57:18,874 INFO L85 PathProgramCache]: Analyzing trace with hash -2128292222, now seen corresponding path program 1 times [2025-03-04 02:57:18,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:57:18,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085757552] [2025-03-04 02:57:18,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:18,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:57:18,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 02:57:18,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 02:57:18,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:18,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:19,120 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:57:19,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:57:19,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085757552] [2025-03-04 02:57:19,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085757552] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:57:19,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993441320] [2025-03-04 02:57:19,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:19,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:57:19,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:57:19,123 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:57:19,125 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:57:19,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 02:57:19,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 02:57:19,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:19,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:19,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-04 02:57:19,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:57:19,324 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 24 treesize of output 32 [2025-03-04 02:57:19,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2025-03-04 02:57:19,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 18 [2025-03-04 02:57:19,343 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2025-03-04 02:57:19,346 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 02:57:19,365 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2025-03-04 02:57:19,366 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 18 treesize of output 7 [2025-03-04 02:57:20,518 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:57:20,519 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:57:20,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993441320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:57:20,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:57:20,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [6] total 16 [2025-03-04 02:57:20,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360082003] [2025-03-04 02:57:20,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:57:20,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 02:57:20,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:57:20,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 02:57:20,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2025-03-04 02:57:20,520 INFO L87 Difference]: Start difference. First operand 116 states and 154 transitions. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 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 02:57:24,526 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 02:57:28,567 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 02:57:32,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 02:57:36,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 02:57:40,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 02:57:41,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:57:41,237 INFO L93 Difference]: Finished difference Result 187 states and 256 transitions. [2025-03-04 02:57:41,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 02:57:41,238 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 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 02:57:41,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:57:41,239 INFO L225 Difference]: With dead ends: 187 [2025-03-04 02:57:41,239 INFO L226 Difference]: Without dead ends: 122 [2025-03-04 02:57:41,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 54 SyntacticMatches, 8 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=109, Invalid=541, Unknown=0, NotChecked=0, Total=650 [2025-03-04 02:57:41,241 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 218 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 58 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.5s IncrementalHoareTripleChecker+Time [2025-03-04 02:57:41,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 414 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 273 Invalid, 5 Unknown, 0 Unchecked, 20.5s Time] [2025-03-04 02:57:41,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-04 02:57:41,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 118. [2025-03-04 02:57:41,256 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 02:57:41,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 156 transitions. [2025-03-04 02:57:41,257 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 156 transitions. Word has length 70 [2025-03-04 02:57:41,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:57:41,257 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 156 transitions. [2025-03-04 02:57:41,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 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 02:57:41,258 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 156 transitions. [2025-03-04 02:57:41,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 02:57:41,258 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:57:41,258 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:57:41,266 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:57:41,459 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:57:41,459 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:57:41,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:57:41,459 INFO L85 PathProgramCache]: Analyzing trace with hash 373280483, now seen corresponding path program 1 times [2025-03-04 02:57:41,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:57:41,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496631941] [2025-03-04 02:57:41,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:41,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:57:41,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 02:57:41,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 02:57:41,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:41,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:41,685 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:57:41,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:57:41,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496631941] [2025-03-04 02:57:41,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496631941] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:57:41,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641982017] [2025-03-04 02:57:41,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:41,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:57:41,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:57:41,688 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:57:41,689 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:57:41,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 02:57:41,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 02:57:41,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:41,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:41,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-04 02:57:41,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:57:41,831 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 24 treesize of output 9 [2025-03-04 02:57:41,842 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:57:41,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:57:41,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:57:41,872 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2025-03-04 02:57:41,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:57:41,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:57:41,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:57:41,891 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:57:42,271 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:57:42,271 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:57:42,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641982017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:57:42,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:57:42,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2025-03-04 02:57:42,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845650407] [2025-03-04 02:57:42,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:57:42,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:57:42,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:57:42,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:57:42,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-04 02:57:42,272 INFO L87 Difference]: Start difference. First operand 118 states and 156 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 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:57:42,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:57:42,872 INFO L93 Difference]: Finished difference Result 194 states and 264 transitions. [2025-03-04 02:57:42,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 02:57:42,872 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 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:57:42,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:57:42,874 INFO L225 Difference]: With dead ends: 194 [2025-03-04 02:57:42,874 INFO L226 Difference]: Without dead ends: 140 [2025-03-04 02:57:42,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2025-03-04 02:57:42,875 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 85 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 02:57:42,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 505 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 02:57:42,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-03-04 02:57:42,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 134. [2025-03-04 02:57:42,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 98 states have (on average 1.336734693877551) internal successors, (131), 101 states have internal predecessors, (131), 25 states have call successors, (25), 9 states have call predecessors, (25), 10 states have return successors, (25), 23 states have call predecessors, (25), 23 states have call successors, (25) [2025-03-04 02:57:42,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 181 transitions. [2025-03-04 02:57:42,896 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 181 transitions. Word has length 70 [2025-03-04 02:57:42,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:57:42,896 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 181 transitions. [2025-03-04 02:57:42,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 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:57:42,896 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 181 transitions. [2025-03-04 02:57:42,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 02:57:42,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:57:42,897 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:57:42,905 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 02:57:43,098 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 02:57:43,099 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:57:43,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:57:43,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1506471076, now seen corresponding path program 1 times [2025-03-04 02:57:43,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:57:43,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211190196] [2025-03-04 02:57:43,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:43,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:57:43,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 02:57:43,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 02:57:43,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:43,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:43,500 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 02:57:43,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:57:43,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211190196] [2025-03-04 02:57:43,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211190196] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:57:43,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144312929] [2025-03-04 02:57:43,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:43,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:57:43,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:57:43,503 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 02:57:43,504 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 02:57:43,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 02:57:43,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 02:57:43,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:43,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:43,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-04 02:57:43,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:57:43,718 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 7 [2025-03-04 02:57:48,003 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-04 02:57:48,003 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 22 treesize of output 10 [2025-03-04 02:57:48,005 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:57:48,005 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:57:48,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144312929] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:57:48,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:57:48,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 18 [2025-03-04 02:57:48,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284337078] [2025-03-04 02:57:48,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:57:48,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:57:48,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:57:48,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:57:48,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2025-03-04 02:57:48,006 INFO L87 Difference]: Start difference. First operand 134 states and 181 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 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:57:52,012 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 02:57:56,055 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 02:58:00,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 02:58:04,121 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 02:58:08,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 02:58:08,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:58:08,600 INFO L93 Difference]: Finished difference Result 232 states and 322 transitions. [2025-03-04 02:58:08,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 02:58:08,601 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 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:58:08,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:58:08,602 INFO L225 Difference]: With dead ends: 232 [2025-03-04 02:58:08,602 INFO L226 Difference]: Without dead ends: 162 [2025-03-04 02:58:08,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=114, Invalid=588, Unknown=0, NotChecked=0, Total=702 [2025-03-04 02:58:08,603 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 225 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 57 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.4s IncrementalHoareTripleChecker+Time [2025-03-04 02:58:08,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 385 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 247 Invalid, 5 Unknown, 0 Unchecked, 20.4s Time] [2025-03-04 02:58:08,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-03-04 02:58:08,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 140. [2025-03-04 02:58:08,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 104 states have (on average 1.3365384615384615) internal successors, (139), 107 states have internal predecessors, (139), 25 states have call successors, (25), 9 states have call predecessors, (25), 10 states have return successors, (25), 23 states have call predecessors, (25), 23 states have call successors, (25) [2025-03-04 02:58:08,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 189 transitions. [2025-03-04 02:58:08,619 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 189 transitions. Word has length 70 [2025-03-04 02:58:08,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:58:08,620 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 189 transitions. [2025-03-04 02:58:08,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 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:58:08,620 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 189 transitions. [2025-03-04 02:58:08,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 02:58:08,621 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:58:08,621 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 02:58:08,630 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 02:58:08,821 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 02:58:08,821 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:58:08,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:58:08,822 INFO L85 PathProgramCache]: Analyzing trace with hash -419062235, now seen corresponding path program 1 times [2025-03-04 02:58:08,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:58:08,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518712503] [2025-03-04 02:58:08,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:58:08,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:58:08,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 02:58:08,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 02:58:08,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:58:08,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:08,927 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 02:58:08,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:58:08,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518712503] [2025-03-04 02:58:08,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518712503] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:58:08,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78116654] [2025-03-04 02:58:08,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:58:08,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:58:08,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:58:08,929 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 02:58:08,931 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 02:58:09,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 02:58:09,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 02:58:09,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:58:09,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:09,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 02:58:09,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:58:09,097 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:58:09,098 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:58:09,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [78116654] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:58:09,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:58:09,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2025-03-04 02:58:09,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505158512] [2025-03-04 02:58:09,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:58:09,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:58:09,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:58:09,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:58:09,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:58:09,100 INFO L87 Difference]: Start difference. First operand 140 states and 189 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 02:58:09,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:58:09,195 INFO L93 Difference]: Finished difference Result 310 states and 432 transitions. [2025-03-04 02:58:09,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:58:09,196 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 02:58:09,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:58:09,198 INFO L225 Difference]: With dead ends: 310 [2025-03-04 02:58:09,198 INFO L226 Difference]: Without dead ends: 185 [2025-03-04 02:58:09,199 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 02:58:09,200 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 104 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 02:58:09,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 228 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 02:58:09,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-03-04 02:58:09,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 151. [2025-03-04 02:58:09,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 113 states have (on average 1.3539823008849559) internal successors, (153), 117 states have internal predecessors, (153), 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 02:58:09,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 207 transitions. [2025-03-04 02:58:09,218 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 207 transitions. Word has length 70 [2025-03-04 02:58:09,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:58:09,218 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 207 transitions. [2025-03-04 02:58:09,218 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 02:58:09,218 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 207 transitions. [2025-03-04 02:58:09,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-04 02:58:09,219 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:58:09,219 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] [2025-03-04 02:58:09,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 02:58:09,419 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 02:58:09,420 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:58:09,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:58:09,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1231577962, now seen corresponding path program 1 times [2025-03-04 02:58:09,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:58:09,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000681451] [2025-03-04 02:58:09,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:58:09,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:58:09,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 02:58:09,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 02:58:09,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:58:09,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:09,542 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 02:58:09,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:58:09,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000681451] [2025-03-04 02:58:09,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000681451] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:58:09,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105837751] [2025-03-04 02:58:09,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:58:09,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:58:09,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:58:09,544 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 02:58:09,546 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 02:58:09,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 02:58:09,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 02:58:09,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:58:09,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:09,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 02:58:09,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:58:09,722 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 02:58:09,722 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:58:09,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105837751] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:58:09,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:58:09,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2025-03-04 02:58:09,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912948972] [2025-03-04 02:58:09,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:58:09,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:58:09,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:58:09,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:58:09,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-04 02:58:09,723 INFO L87 Difference]: Start difference. First operand 151 states and 207 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 02:58:09,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:58:09,869 INFO L93 Difference]: Finished difference Result 313 states and 433 transitions. [2025-03-04 02:58:09,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:58:09,869 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 02:58:09,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:58:09,871 INFO L225 Difference]: With dead ends: 313 [2025-03-04 02:58:09,871 INFO L226 Difference]: Without dead ends: 177 [2025-03-04 02:58:09,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2025-03-04 02:58:09,872 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 94 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 02:58:09,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 254 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 02:58:09,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-03-04 02:58:09,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 151. [2025-03-04 02:58:09,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 113 states have (on average 1.3539823008849559) internal successors, (153), 117 states have internal predecessors, (153), 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 02:58:09,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 207 transitions. [2025-03-04 02:58:09,892 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 207 transitions. Word has length 71 [2025-03-04 02:58:09,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:58:09,892 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 207 transitions. [2025-03-04 02:58:09,893 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 02:58:09,893 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 207 transitions. [2025-03-04 02:58:09,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-04 02:58:09,893 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:58:09,893 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 02:58:09,900 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 02:58:10,094 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 02:58:10,094 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:58:10,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:58:10,095 INFO L85 PathProgramCache]: Analyzing trace with hash -2011864026, now seen corresponding path program 1 times [2025-03-04 02:58:10,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:58:10,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940376524] [2025-03-04 02:58:10,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:58:10,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:58:10,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 02:58:10,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 02:58:10,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:58:10,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:10,256 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-04 02:58:10,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:58:10,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940376524] [2025-03-04 02:58:10,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940376524] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:58:10,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460935985] [2025-03-04 02:58:10,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:58:10,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:58:10,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:58:10,258 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 02:58:10,259 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 02:58:10,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 02:58:10,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 02:58:10,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:58:10,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:10,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-04 02:58:10,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:58:10,440 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 24 treesize of output 9 [2025-03-04 02:58:10,452 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:58:10,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:58:10,487 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 0 case distinctions, treesize of input 26 treesize of output 28 [2025-03-04 02:58:10,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:58:10,491 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 18 treesize of output 13 [2025-03-04 02:58:10,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:58:10,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:58:10,498 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 02:58:10,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:58:10,502 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 02:58:10,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:58:10,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 52 [2025-03-04 02:58:10,551 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2025-03-04 02:58:10,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:58:10,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:58:10,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:58:10,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:58:10,574 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 93 treesize of output 35 [2025-03-04 02:58:11,190 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 32 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 02:58:11,191 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:58:11,583 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:58:11,583 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 92 treesize of output 96 [2025-03-04 02:58:11,591 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:58:11,591 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 02:58:11,604 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:58:11,638 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse2 (+ |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset| 16))) (and (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| 1)) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_subst_1 Int)) (or (forall ((v_ArrVal_663 Int) (v_ArrVal_661 (Array Int Int)) (v_ArrVal_655 Int)) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#2.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_ArrVal_655)))) (store (store .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| v_ArrVal_661) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select (store .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| v_arrayElimArr_5) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_663))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse2) 0)) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_5 v_subst_1))))))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| 1)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_subst_2 Int)) (= (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#2.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_16| v_arrayElimArr_6))) (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_2))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse2) 0)))))) is different from false [2025-03-04 02:58:11,654 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 02:58:11,655 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 02:58:11,707 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2025-03-04 02:58:11,707 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 02:58:11,720 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:58:11,720 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 226 treesize of output 226 [2025-03-04 02:58:11,733 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:58:11,733 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 193 treesize of output 194 [2025-03-04 02:58:11,740 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 183 treesize of output 179 [2025-03-04 02:58:11,749 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 02:58:11,750 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 02:58:11,806 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2025-03-04 02:58:11,807 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 377 treesize of output 364 [2025-03-04 02:58:11,825 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:58:11,825 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 318 treesize of output 314 [2025-03-04 02:58:11,838 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 267 treesize of output 255 [2025-03-04 02:58:12,373 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 02:58:12,491 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:58:12,523 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 02:58:12,523 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 02:58:12,535 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:58:12,535 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 92 treesize of output 102 [2025-03-04 02:58:12,597 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:58:12,597 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 39 treesize of output 39 [2025-03-04 02:58:12,648 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 26 trivial. 1 not checked. [2025-03-04 02:58:12,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460935985] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:58:12,648 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:58:12,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 9] total 21 [2025-03-04 02:58:12,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988476541] [2025-03-04 02:58:12,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:58:12,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 02:58:12,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:58:12,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 02:58:12,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=309, Unknown=20, NotChecked=36, Total=420 [2025-03-04 02:58:12,650 INFO L87 Difference]: Start difference. First operand 151 states and 207 transitions. Second operand has 21 states, 20 states have (on average 4.1) internal successors, (82), 19 states have internal predecessors, (82), 7 states have call successors, (21), 3 states have call predecessors, (21), 6 states have return successors, (20), 5 states have call predecessors, (20), 7 states have call successors, (20) [2025-03-04 02:58:14,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:58:14,314 INFO L93 Difference]: Finished difference Result 366 states and 520 transitions. [2025-03-04 02:58:14,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 02:58:14,318 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 4.1) internal successors, (82), 19 states have internal predecessors, (82), 7 states have call successors, (21), 3 states have call predecessors, (21), 6 states have return successors, (20), 5 states have call predecessors, (20), 7 states have call successors, (20) Word has length 71 [2025-03-04 02:58:14,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:58:14,321 INFO L225 Difference]: With dead ends: 366 [2025-03-04 02:58:14,322 INFO L226 Difference]: Without dead ends: 209 [2025-03-04 02:58:14,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 127 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=133, Invalid=775, Unknown=26, NotChecked=58, Total=992 [2025-03-04 02:58:14,324 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 60 mSDsluCounter, 861 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 10 mSolverCounterUnsat, 95 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 95 IncrementalHoareTripleChecker+Unknown, 143 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-04 02:58:14,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 962 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 607 Invalid, 95 Unknown, 143 Unchecked, 1.1s Time] [2025-03-04 02:58:14,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-03-04 02:58:14,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 185. [2025-03-04 02:58:14,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 141 states have (on average 1.3546099290780143) internal successors, (191), 148 states have internal predecessors, (191), 27 states have call successors, (27), 11 states have call predecessors, (27), 16 states have return successors, (33), 25 states have call predecessors, (33), 25 states have call successors, (33) [2025-03-04 02:58:14,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 251 transitions. [2025-03-04 02:58:14,349 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 251 transitions. Word has length 71 [2025-03-04 02:58:14,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:58:14,349 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 251 transitions. [2025-03-04 02:58:14,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 4.1) internal successors, (82), 19 states have internal predecessors, (82), 7 states have call successors, (21), 3 states have call predecessors, (21), 6 states have return successors, (20), 5 states have call predecessors, (20), 7 states have call successors, (20) [2025-03-04 02:58:14,349 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 251 transitions. [2025-03-04 02:58:14,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-04 02:58:14,350 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:58:14,350 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] [2025-03-04 02:58:14,357 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 02:58:14,550 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 02:58:14,550 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:58:14,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:58:14,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1501802700, now seen corresponding path program 1 times [2025-03-04 02:58:14,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:58:14,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483821996] [2025-03-04 02:58:14,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:58:14,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:58:14,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 02:58:14,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 02:58:14,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:58:14,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:14,710 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 02:58:14,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:58:14,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483821996] [2025-03-04 02:58:14,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483821996] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:58:14,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601541536] [2025-03-04 02:58:14,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:58:14,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:58:14,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:58:14,713 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 02:58:14,714 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 02:58:14,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 02:58:14,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 02:58:14,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:58:14,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:14,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 02:58:14,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:58:14,917 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:58:14,917 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:58:14,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601541536] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:58:14,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:58:14,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2025-03-04 02:58:14,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919855503] [2025-03-04 02:58:14,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:58:14,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:58:14,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:58:14,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:58:14,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2025-03-04 02:58:14,918 INFO L87 Difference]: Start difference. First operand 185 states and 251 transitions. Second operand has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 3 states have call successors, (8), 2 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:58:15,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:58:15,069 INFO L93 Difference]: Finished difference Result 340 states and 455 transitions. [2025-03-04 02:58:15,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:58:15,072 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 3 states have call successors, (8), 2 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 72 [2025-03-04 02:58:15,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:58:15,073 INFO L225 Difference]: With dead ends: 340 [2025-03-04 02:58:15,073 INFO L226 Difference]: Without dead ends: 197 [2025-03-04 02:58:15,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2025-03-04 02:58:15,074 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 94 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 02:58:15,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 303 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 02:58:15,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-03-04 02:58:15,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 185. [2025-03-04 02:58:15,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 141 states have (on average 1.326241134751773) internal successors, (187), 148 states have internal predecessors, (187), 27 states have call successors, (27), 11 states have call predecessors, (27), 16 states have return successors, (33), 25 states have call predecessors, (33), 25 states have call successors, (33) [2025-03-04 02:58:15,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 247 transitions. [2025-03-04 02:58:15,101 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 247 transitions. Word has length 72 [2025-03-04 02:58:15,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:58:15,101 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 247 transitions. [2025-03-04 02:58:15,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 3 states have call successors, (8), 2 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:58:15,101 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 247 transitions. [2025-03-04 02:58:15,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-04 02:58:15,102 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:58:15,102 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] [2025-03-04 02:58:15,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 02:58:15,302 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 02:58:15,302 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:58:15,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:58:15,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1729986996, now seen corresponding path program 1 times [2025-03-04 02:58:15,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:58:15,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075515291] [2025-03-04 02:58:15,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:58:15,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:58:15,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-04 02:58:15,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-04 02:58:15,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:58:15,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:15,476 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 02:58:15,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:58:15,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075515291] [2025-03-04 02:58:15,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075515291] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:58:15,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011136531] [2025-03-04 02:58:15,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:58:15,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:58:15,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:58:15,479 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 02:58:15,481 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 02:58:15,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-04 02:58:15,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-04 02:58:15,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:58:15,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:15,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 02:58:15,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:58:15,715 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:58:15,715 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:58:15,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011136531] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:58:15,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:58:15,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2025-03-04 02:58:15,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979547919] [2025-03-04 02:58:15,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:58:15,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:58:15,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:58:15,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:58:15,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2025-03-04 02:58:15,720 INFO L87 Difference]: Start difference. First operand 185 states and 247 transitions. Second operand has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (8), 2 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:58:15,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:58:15,900 INFO L93 Difference]: Finished difference Result 385 states and 523 transitions. [2025-03-04 02:58:15,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:58:15,900 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (8), 2 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 74 [2025-03-04 02:58:15,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:58:15,901 INFO L225 Difference]: With dead ends: 385 [2025-03-04 02:58:15,901 INFO L226 Difference]: Without dead ends: 222 [2025-03-04 02:58:15,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=522, Unknown=0, NotChecked=0, Total=600 [2025-03-04 02:58:15,902 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 108 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 02:58:15,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 338 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 02:58:15,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-03-04 02:58:15,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 190. [2025-03-04 02:58:15,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 146 states have (on average 1.3150684931506849) internal successors, (192), 153 states have internal predecessors, (192), 27 states have call successors, (27), 11 states have call predecessors, (27), 16 states have return successors, (33), 25 states have call predecessors, (33), 25 states have call successors, (33) [2025-03-04 02:58:15,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 252 transitions. [2025-03-04 02:58:15,920 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 252 transitions. Word has length 74 [2025-03-04 02:58:15,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:58:15,921 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 252 transitions. [2025-03-04 02:58:15,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (8), 2 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:58:15,921 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 252 transitions. [2025-03-04 02:58:15,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-04 02:58:15,933 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:58:15,933 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] [2025-03-04 02:58:15,939 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 02:58:16,133 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 02:58:16,133 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:58:16,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:58:16,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1024782788, now seen corresponding path program 1 times [2025-03-04 02:58:16,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:58:16,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196153796] [2025-03-04 02:58:16,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:58:16,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:58:16,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-04 02:58:16,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-04 02:58:16,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:58:16,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:16,269 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 02:58:16,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:58:16,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196153796] [2025-03-04 02:58:16,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196153796] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:58:16,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223545090] [2025-03-04 02:58:16,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:58:16,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:58:16,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:58:16,272 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 02:58:16,272 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 02:58:16,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-04 02:58:16,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-04 02:58:16,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:58:16,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:16,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 02:58:16,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:58:16,437 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 02:58:16,438 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:58:16,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223545090] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:58:16,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:58:16,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-03-04 02:58:16,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966628954] [2025-03-04 02:58:16,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:58:16,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:58:16,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:58:16,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:58:16,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:58:16,439 INFO L87 Difference]: Start difference. First operand 190 states and 252 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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:58:16,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:58:16,462 INFO L93 Difference]: Finished difference Result 361 states and 498 transitions. [2025-03-04 02:58:16,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:58:16,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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 75 [2025-03-04 02:58:16,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:58:16,464 INFO L225 Difference]: With dead ends: 361 [2025-03-04 02:58:16,464 INFO L226 Difference]: Without dead ends: 210 [2025-03-04 02:58:16,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:58:16,465 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 2 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 02:58:16,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 151 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 02:58:16,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-03-04 02:58:16,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 195. [2025-03-04 02:58:16,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 151 states have (on average 1.304635761589404) internal successors, (197), 158 states have internal predecessors, (197), 27 states have call successors, (27), 11 states have call predecessors, (27), 16 states have return successors, (33), 25 states have call predecessors, (33), 25 states have call successors, (33) [2025-03-04 02:58:16,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 257 transitions. [2025-03-04 02:58:16,484 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 257 transitions. Word has length 75 [2025-03-04 02:58:16,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:58:16,484 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 257 transitions. [2025-03-04 02:58:16,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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:58:16,484 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 257 transitions. [2025-03-04 02:58:16,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-04 02:58:16,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:58:16,485 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 02:58:16,493 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 02:58:16,690 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 02:58:16,690 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:58:16,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:58:16,690 INFO L85 PathProgramCache]: Analyzing trace with hash -2112188675, now seen corresponding path program 1 times [2025-03-04 02:58:16,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:58:16,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456587816] [2025-03-04 02:58:16,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:58:16,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:58:16,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-04 02:58:16,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-04 02:58:16,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:58:16,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:16,851 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 02:58:16,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:58:16,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456587816] [2025-03-04 02:58:16,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456587816] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:58:16,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525492645] [2025-03-04 02:58:16,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:58:16,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:58:16,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:58:16,853 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 02:58:16,854 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 02:58:16,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-04 02:58:17,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-04 02:58:17,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:58:17,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:17,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 85 conjuncts are in the unsatisfiable core [2025-03-04 02:58:17,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:58:17,058 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 02:58:17,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:58:17,061 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 02:58:17,069 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 02:58:17,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:58:17,072 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 02:58:17,103 INFO L349 Elim1Store]: treesize reduction 60, result has 7.7 percent of original size [2025-03-04 02:58:17,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 137 treesize of output 126 [2025-03-04 02:58:17,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:58:17,113 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 123 treesize of output 11 [2025-03-04 02:58:17,117 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2025-03-04 02:58:20,182 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 40 proven. 6 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:58:20,182 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:58:21,578 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:58:21,578 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 180 treesize of output 141 [2025-03-04 02:58:21,587 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:58:21,588 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 176 treesize of output 169 [2025-03-04 02:58:21,609 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:58:21,610 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 541 treesize of output 481 [2025-03-04 02:58:21,650 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:58:21,651 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 995 treesize of output 959 [2025-03-04 02:58:21,675 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 687 treesize of output 683 [2025-03-04 02:58:21,693 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:58:21,694 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 683 treesize of output 684 [2025-03-04 02:58:21,728 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:58:21,729 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 808 treesize of output 822 [2025-03-04 02:58:21,743 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 815 treesize of output 807 [2025-03-04 02:58:21,779 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:58:21,780 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 807 treesize of output 801 [2025-03-04 02:58:22,201 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:58:22,227 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:58:22,227 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 238 treesize of output 238 [2025-03-04 02:58:22,403 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:58:22,415 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 02:58:22,505 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 02:58:22,552 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 02:58:22,558 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 02:58:22,568 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 02:58:22,627 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:58:22,627 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 223 treesize of output 195 [2025-03-04 02:58:23,075 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 02:58:23,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525492645] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:58:23,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:58:23,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 24, 20] total 46 [2025-03-04 02:58:23,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154522124] [2025-03-04 02:58:23,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:58:23,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-04 02:58:23,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:58:23,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-04 02:58:23,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1886, Unknown=43, NotChecked=0, Total=2070 [2025-03-04 02:58:23,077 INFO L87 Difference]: Start difference. First operand 195 states and 257 transitions. Second operand has 46 states, 42 states have (on average 3.357142857142857) internal successors, (141), 40 states have internal predecessors, (141), 13 states have call successors, (23), 5 states have call predecessors, (23), 11 states have return successors, (22), 10 states have call predecessors, (22), 13 states have call successors, (22) [2025-03-04 02:58:33,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:58:33,795 INFO L93 Difference]: Finished difference Result 695 states and 1042 transitions. [2025-03-04 02:58:33,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2025-03-04 02:58:33,796 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 42 states have (on average 3.357142857142857) internal successors, (141), 40 states have internal predecessors, (141), 13 states have call successors, (23), 5 states have call predecessors, (23), 11 states have return successors, (22), 10 states have call predecessors, (22), 13 states have call successors, (22) Word has length 83 [2025-03-04 02:58:33,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:58:33,807 INFO L225 Difference]: With dead ends: 695 [2025-03-04 02:58:33,807 INFO L226 Difference]: Without dead ends: 525 [2025-03-04 02:58:33,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1674 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=662, Invalid=8479, Unknown=171, NotChecked=0, Total=9312 [2025-03-04 02:58:33,817 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 386 mSDsluCounter, 2614 mSDsCounter, 0 mSdLazyCounter, 3512 mSolverCounterSat, 114 mSolverCounterUnsat, 442 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 2747 SdHoareTripleChecker+Invalid, 4068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 3512 IncrementalHoareTripleChecker+Invalid, 442 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2025-03-04 02:58:33,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 2747 Invalid, 4068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 3512 Invalid, 442 Unknown, 0 Unchecked, 5.8s Time] [2025-03-04 02:58:33,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2025-03-04 02:58:33,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 366. [2025-03-04 02:58:33,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 287 states have (on average 1.3379790940766552) internal successors, (384), 305 states have internal predecessors, (384), 50 states have call successors, (50), 16 states have call predecessors, (50), 28 states have return successors, (86), 44 states have call predecessors, (86), 48 states have call successors, (86) [2025-03-04 02:58:33,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 520 transitions. [2025-03-04 02:58:33,885 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 520 transitions. Word has length 83 [2025-03-04 02:58:33,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:58:33,885 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 520 transitions. [2025-03-04 02:58:33,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 42 states have (on average 3.357142857142857) internal successors, (141), 40 states have internal predecessors, (141), 13 states have call successors, (23), 5 states have call predecessors, (23), 11 states have return successors, (22), 10 states have call predecessors, (22), 13 states have call successors, (22) [2025-03-04 02:58:33,885 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 520 transitions. [2025-03-04 02:58:33,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-04 02:58:33,891 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:58:33,892 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-04 02:58:33,902 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 02:58:34,092 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 02:58:34,093 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:58:34,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:58:34,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1765186403, now seen corresponding path program 1 times [2025-03-04 02:58:34,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:58:34,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598284001] [2025-03-04 02:58:34,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:58:34,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:58:34,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 02:58:34,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 02:58:34,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:58:34,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:34,761 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-04 02:58:34,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:58:34,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598284001] [2025-03-04 02:58:34,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598284001] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:58:34,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584941053] [2025-03-04 02:58:34,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:58:34,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:58:34,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:58:34,766 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 02:58:34,767 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 02:58:34,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 02:58:34,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 02:58:34,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:58:34,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:34,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-04 02:58:34,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:58:35,015 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:58:35,050 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 24 treesize of output 9 [2025-03-04 02:58:35,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:58:35,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:58:35,085 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2025-03-04 02:58:35,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:58:35,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:58:35,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:58:35,107 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:58:36,342 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 02:58:36,343 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:58:36,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1584941053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:58:36,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:58:36,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [7] total 16 [2025-03-04 02:58:36,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943220931] [2025-03-04 02:58:36,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:58:36,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:58:36,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:58:36,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:58:36,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2025-03-04 02:58:36,344 INFO L87 Difference]: Start difference. First operand 366 states and 520 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-04 02:58:37,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:58:37,080 INFO L93 Difference]: Finished difference Result 461 states and 641 transitions. [2025-03-04 02:58:37,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 02:58:37,080 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 94 [2025-03-04 02:58:37,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:58:37,083 INFO L225 Difference]: With dead ends: 461 [2025-03-04 02:58:37,083 INFO L226 Difference]: Without dead ends: 370 [2025-03-04 02:58:37,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 78 SyntacticMatches, 8 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2025-03-04 02:58:37,087 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 50 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 02:58:37,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 741 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 02:58:37,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-03-04 02:58:37,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 368. [2025-03-04 02:58:37,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 289 states have (on average 1.3321799307958477) internal successors, (385), 307 states have internal predecessors, (385), 50 states have call successors, (50), 16 states have call predecessors, (50), 28 states have return successors, (86), 44 states have call predecessors, (86), 48 states have call successors, (86) [2025-03-04 02:58:37,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 521 transitions. [2025-03-04 02:58:37,143 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 521 transitions. Word has length 94 [2025-03-04 02:58:37,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:58:37,144 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 521 transitions. [2025-03-04 02:58:37,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-04 02:58:37,144 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 521 transitions. [2025-03-04 02:58:37,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-04 02:58:37,146 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:58:37,147 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 02:58:37,155 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 02:58:37,352 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 02:58:37,352 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:58:37,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:58:37,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1471783396, now seen corresponding path program 1 times [2025-03-04 02:58:37,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:58:37,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754044466] [2025-03-04 02:58:37,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:58:37,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:58:37,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 02:58:37,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 02:58:37,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:58:37,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:37,995 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 10 proven. 31 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-04 02:58:37,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:58:37,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754044466] [2025-03-04 02:58:37,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754044466] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:58:37,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033031178] [2025-03-04 02:58:37,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:58:37,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:58:37,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:58:37,997 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 02:58:38,003 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 02:58:38,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 02:58:38,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 02:58:38,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:58:38,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:38,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 83 conjuncts are in the unsatisfiable core [2025-03-04 02:58:38,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:58:38,248 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 7 [2025-03-04 02:58:39,317 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 27 proven. 14 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-04 02:58:39,318 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:58:39,745 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2025-03-04 02:58:39,745 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 86 treesize of output 93 [2025-03-04 02:58:39,759 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:58:39,759 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 93 treesize of output 109 [2025-03-04 02:58:39,763 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 62 treesize of output 60 [2025-03-04 02:58:39,809 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:58:39,820 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:58:39,821 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 92 treesize of output 92 [2025-03-04 02:58:39,879 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:58:39,884 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:58:40,001 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-04 02:58:40,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033031178] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:58:40,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:58:40,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15, 18] total 39 [2025-03-04 02:58:40,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425030081] [2025-03-04 02:58:40,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:58:40,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:58:40,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:58:40,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:58:40,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1364, Unknown=0, NotChecked=0, Total=1482 [2025-03-04 02:58:40,003 INFO L87 Difference]: Start difference. First operand 368 states and 521 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-04 02:58:40,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:58:40,441 INFO L93 Difference]: Finished difference Result 825 states and 1232 transitions. [2025-03-04 02:58:40,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:58:40,441 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 94 [2025-03-04 02:58:40,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:58:40,445 INFO L225 Difference]: With dead ends: 825 [2025-03-04 02:58:40,445 INFO L226 Difference]: Without dead ends: 485 [2025-03-04 02:58:40,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 157 SyntacticMatches, 8 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=143, Invalid=1749, Unknown=0, NotChecked=0, Total=1892 [2025-03-04 02:58:40,450 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 52 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 02:58:40,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 460 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 02:58:40,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2025-03-04 02:58:40,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 484. [2025-03-04 02:58:40,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 373 states have (on average 1.32171581769437) internal successors, (493), 402 states have internal predecessors, (493), 73 states have call successors, (73), 16 states have call predecessors, (73), 37 states have return successors, (154), 65 states have call predecessors, (154), 71 states have call successors, (154) [2025-03-04 02:58:40,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 720 transitions. [2025-03-04 02:58:40,505 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 720 transitions. Word has length 94 [2025-03-04 02:58:40,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:58:40,506 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 720 transitions. [2025-03-04 02:58:40,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-04 02:58:40,506 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 720 transitions. [2025-03-04 02:58:40,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-04 02:58:40,508 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:58:40,509 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1] [2025-03-04 02:58:40,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-04 02:58:40,713 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 02:58:40,713 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:58:40,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:58:40,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1315632091, now seen corresponding path program 1 times [2025-03-04 02:58:40,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:58:40,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304020369] [2025-03-04 02:58:40,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:58:40,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:58:40,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 02:58:40,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 02:58:40,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:58:40,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:40,906 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 02:58:40,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:58:40,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304020369] [2025-03-04 02:58:40,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304020369] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:58:40,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932395885] [2025-03-04 02:58:40,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:58:40,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:58:40,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:58:40,909 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 02:58:40,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process