./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_linked_list_end_harness_negated.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_end_harness_negated.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 d7b9ddf837d983b2f2db252b1327ae049806ab568e5bf2d0a60ffd182bd7d0fe --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:57:24,376 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:57:24,441 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:24,447 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:57:24,447 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:57:24,465 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:57:24,466 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:57:24,466 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:57:24,466 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:57:24,466 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:57:24,467 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:57:24,467 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:57:24,467 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:57:24,467 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:57:24,467 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:57:24,467 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:57:24,467 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:57:24,467 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:57:24,467 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:57:24,467 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:57:24,467 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:57:24,467 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:57:24,467 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:57:24,467 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:57:24,467 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:57:24,467 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:57:24,468 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:57:24,468 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:57:24,468 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:57:24,468 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:57:24,468 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:57:24,468 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:57:24,468 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:57:24,468 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:57:24,468 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:57:24,468 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:57:24,468 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:57:24,468 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:57:24,468 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:57:24,468 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:57:24,468 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 -> d7b9ddf837d983b2f2db252b1327ae049806ab568e5bf2d0a60ffd182bd7d0fe [2025-03-04 02:57:24,698 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:57:24,703 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:57:24,705 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:57:24,706 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:57:24,706 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:57:24,707 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_end_harness_negated.i [2025-03-04 02:57:25,848 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0666c638d/2a38c1d462804ff384877af931a6e2b7/FLAG715b05c61 [2025-03-04 02:57:26,209 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:57:26,210 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_end_harness_negated.i [2025-03-04 02:57:26,236 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0666c638d/2a38c1d462804ff384877af931a6e2b7/FLAG715b05c61 [2025-03-04 02:57:26,410 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0666c638d/2a38c1d462804ff384877af931a6e2b7 [2025-03-04 02:57:26,411 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:57:26,412 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:57:26,413 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:57:26,413 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:57:26,416 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:57:26,417 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:57:26" (1/1) ... [2025-03-04 02:57:26,418 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@454d7493 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:57:26, skipping insertion in model container [2025-03-04 02:57:26,418 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:57:26" (1/1) ... [2025-03-04 02:57:26,478 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:57:26,676 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_end_harness_negated.i[4493,4506] [2025-03-04 02:57:26,683 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_end_harness_negated.i[4553,4566] [2025-03-04 02:57:27,165 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:27,166 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:27,166 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:27,167 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:27,167 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:27,177 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:27,177 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:27,179 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:27,179 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:27,180 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:27,181 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:27,181 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:27,181 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:27,469 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_end_harness_negated.i[150674,150687] [2025-03-04 02:57:27,470 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:57:27,484 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:57:27,496 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_end_harness_negated.i[4493,4506] [2025-03-04 02:57:27,497 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_end_harness_negated.i[4553,4566] [2025-03-04 02:57:27,531 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:27,532 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:27,532 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:27,532 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:27,532 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:27,538 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:27,541 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:27,542 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:27,543 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:27,544 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:27,544 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:27,545 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:27,545 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:27,624 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_end_harness_negated.i[150674,150687] [2025-03-04 02:57:27,624 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:57:27,780 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:57:27,780 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:57:27 WrapperNode [2025-03-04 02:57:27,781 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:57:27,781 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:57:27,781 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:57:27,781 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:57:27,785 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:27" (1/1) ... [2025-03-04 02:57:27,819 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:27" (1/1) ... [2025-03-04 02:57:27,846 INFO L138 Inliner]: procedures = 668, calls = 1038, calls flagged for inlining = 53, calls inlined = 6, statements flattened = 131 [2025-03-04 02:57:27,847 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:57:27,848 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:57:27,848 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:57:27,848 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:57:27,854 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:27" (1/1) ... [2025-03-04 02:57:27,855 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:27" (1/1) ... [2025-03-04 02:57:27,857 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:27" (1/1) ... [2025-03-04 02:57:27,869 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 5, 14]. 67 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:27,869 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:27" (1/1) ... [2025-03-04 02:57:27,869 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:27" (1/1) ... [2025-03-04 02:57:27,876 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:27" (1/1) ... [2025-03-04 02:57:27,876 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:27" (1/1) ... [2025-03-04 02:57:27,878 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:27" (1/1) ... [2025-03-04 02:57:27,879 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:27" (1/1) ... [2025-03-04 02:57:27,881 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:57:27,885 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:57:27,885 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:57:27,885 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:57:27,886 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:57:27" (1/1) ... [2025-03-04 02:57:27,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:57:27,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:57:27,913 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:27,915 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:27,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 02:57:27,930 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 02:57:27,930 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 02:57:27,930 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2025-03-04 02:57:27,930 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2025-03-04 02:57:27,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 02:57:27,930 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2025-03-04 02:57:27,930 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2025-03-04 02:57:27,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:57:27,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 02:57:27,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 02:57:27,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 02:57:27,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:57:27,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:57:27,930 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 02:57:27,930 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 02:57:27,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 02:57:27,930 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 02:57:27,930 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 02:57:27,930 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 02:57:27,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 02:57:27,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 02:57:27,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 02:57:27,931 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2025-03-04 02:57:27,931 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2025-03-04 02:57:27,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:57:27,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:57:27,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 02:57:28,116 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:57:28,118 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:57:28,153 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:28,160 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: havoc #t~nondet9; [2025-03-04 02:57:28,281 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4700: havoc #t~ret311#1; [2025-03-04 02:57:28,305 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2025-03-04 02:57:28,305 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:57:28,314 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:57:28,314 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:57:28,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:57:28 BoogieIcfgContainer [2025-03-04 02:57:28,314 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:57:28,316 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:57:28,316 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:57:28,320 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:57:28,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:57:26" (1/3) ... [2025-03-04 02:57:28,320 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34a2daaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:57:28, skipping insertion in model container [2025-03-04 02:57:28,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:57:27" (2/3) ... [2025-03-04 02:57:28,321 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34a2daaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:57:28, skipping insertion in model container [2025-03-04 02:57:28,322 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:57:28" (3/3) ... [2025-03-04 02:57:28,322 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_linked_list_end_harness_negated.i [2025-03-04 02:57:28,332 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:57:28,333 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_linked_list_end_harness_negated.i that has 6 procedures, 67 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-04 02:57:28,370 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:57:28,377 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;@37fbf02b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:57:28,377 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 02:57:28,380 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 48 states have internal predecessors, (62), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 02:57:28,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 02:57:28,385 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:57:28,385 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:28,385 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:57:28,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:57:28,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1130872929, now seen corresponding path program 1 times [2025-03-04 02:57:28,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:57:28,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311721187] [2025-03-04 02:57:28,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:28,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:57:28,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 02:57:28,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 02:57:28,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:28,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:28,718 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:28,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:57:28,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311721187] [2025-03-04 02:57:28,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311721187] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:57:28,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294119500] [2025-03-04 02:57:28,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:28,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:57:28,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:57:28,725 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:28,730 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:28,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 02:57:28,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 02:57:28,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:28,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:28,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 02:57:28,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:57:28,936 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:28,936 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:57:28,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294119500] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:57:28,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:57:28,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 02:57:28,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409902574] [2025-03-04 02:57:28,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:57:28,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 02:57:28,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:57:28,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 02:57:28,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 02:57:28,958 INFO L87 Difference]: Start difference. First operand has 67 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 48 states have internal predecessors, (62), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 02:57:28,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:57:28,974 INFO L93 Difference]: Finished difference Result 126 states and 174 transitions. [2025-03-04 02:57:28,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 02:57:28,975 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:28,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:57:28,979 INFO L225 Difference]: With dead ends: 126 [2025-03-04 02:57:28,979 INFO L226 Difference]: Without dead ends: 62 [2025-03-04 02:57:28,981 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:28,984 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 02:57:28,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 02:57:28,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-04 02:57:29,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-03-04 02:57:29,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 43 states have (on average 1.302325581395349) internal successors, (56), 44 states have internal predecessors, (56), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 02:57:29,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 81 transitions. [2025-03-04 02:57:29,011 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 81 transitions. Word has length 70 [2025-03-04 02:57:29,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:57:29,012 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 81 transitions. [2025-03-04 02:57:29,012 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:29,012 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 81 transitions. [2025-03-04 02:57:29,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 02:57:29,015 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:57:29,015 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:29,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 02:57:29,215 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:29,216 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:57:29,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:57:29,216 INFO L85 PathProgramCache]: Analyzing trace with hash -624638336, now seen corresponding path program 1 times [2025-03-04 02:57:29,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:57:29,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508679249] [2025-03-04 02:57:29,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:29,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:57:29,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 02:57:29,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 02:57:29,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:29,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:29,755 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:29,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:57:29,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508679249] [2025-03-04 02:57:29,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508679249] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:57:29,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:57:29,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 02:57:29,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488536127] [2025-03-04 02:57:29,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:57:29,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:57:29,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:57:29,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:57:29,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:57:29,756 INFO L87 Difference]: Start difference. First operand 62 states and 81 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 4 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), 1 states have call successors, (7) [2025-03-04 02:57:29,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:57:29,809 INFO L93 Difference]: Finished difference Result 72 states and 94 transitions. [2025-03-04 02:57:29,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:57:29,809 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 4 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), 1 states have call successors, (7) Word has length 70 [2025-03-04 02:57:29,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:57:29,811 INFO L225 Difference]: With dead ends: 72 [2025-03-04 02:57:29,811 INFO L226 Difference]: Without dead ends: 70 [2025-03-04 02:57:29,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:57:29,812 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 3 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 02:57:29,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 382 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 02:57:29,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-04 02:57:29,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2025-03-04 02:57:29,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 49 states have internal predecessors, (60), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2025-03-04 02:57:29,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2025-03-04 02:57:29,820 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 91 transitions. Word has length 70 [2025-03-04 02:57:29,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:57:29,821 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 91 transitions. [2025-03-04 02:57:29,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 4 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), 1 states have call successors, (7) [2025-03-04 02:57:29,821 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 91 transitions. [2025-03-04 02:57:29,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-04 02:57:29,822 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:57:29,822 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, 1] [2025-03-04 02:57:29,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:57:29,823 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:57:29,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:57:29,823 INFO L85 PathProgramCache]: Analyzing trace with hash 511756480, now seen corresponding path program 1 times [2025-03-04 02:57:29,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:57:29,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503535245] [2025-03-04 02:57:29,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:29,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:57:29,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 02:57:29,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 02:57:29,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:29,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:30,034 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-04 02:57:30,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:57:30,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503535245] [2025-03-04 02:57:30,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503535245] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:57:30,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:57:30,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:57:30,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309654948] [2025-03-04 02:57:30,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:57:30,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:57:30,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:57:30,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:57:30,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:57:30,036 INFO L87 Difference]: Start difference. First operand 69 states and 91 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 02:57:30,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:57:30,140 INFO L93 Difference]: Finished difference Result 131 states and 174 transitions. [2025-03-04 02:57:30,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:57:30,140 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 71 [2025-03-04 02:57:30,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:57:30,141 INFO L225 Difference]: With dead ends: 131 [2025-03-04 02:57:30,143 INFO L226 Difference]: Without dead ends: 71 [2025-03-04 02:57:30,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:57:30,144 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 22 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 02:57:30,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 350 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 02:57:30,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-04 02:57:30,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2025-03-04 02:57:30,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 49 states have internal predecessors, (59), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2025-03-04 02:57:30,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 90 transitions. [2025-03-04 02:57:30,158 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 90 transitions. Word has length 71 [2025-03-04 02:57:30,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:57:30,159 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 90 transitions. [2025-03-04 02:57:30,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 02:57:30,159 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 90 transitions. [2025-03-04 02:57:30,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-04 02:57:30,160 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:57:30,160 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, 1, 1, 1] [2025-03-04 02:57:30,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:57:30,161 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:57:30,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:57:30,162 INFO L85 PathProgramCache]: Analyzing trace with hash 211973896, now seen corresponding path program 1 times [2025-03-04 02:57:30,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:57:30,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046659805] [2025-03-04 02:57:30,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:30,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:57:30,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-04 02:57:30,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 02:57:30,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:30,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:30,361 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-04 02:57:30,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:57:30,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046659805] [2025-03-04 02:57:30,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046659805] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:57:30,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:57:30,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 02:57:30,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315095699] [2025-03-04 02:57:30,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:57:30,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:57:30,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:57:30,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:57:30,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:57:30,362 INFO L87 Difference]: Start difference. First operand 69 states and 90 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 02:57:30,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:57:30,480 INFO L93 Difference]: Finished difference Result 137 states and 182 transitions. [2025-03-04 02:57:30,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:57:30,481 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 73 [2025-03-04 02:57:30,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:57:30,482 INFO L225 Difference]: With dead ends: 137 [2025-03-04 02:57:30,482 INFO L226 Difference]: Without dead ends: 76 [2025-03-04 02:57:30,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:57:30,483 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 31 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 02:57:30,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 395 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 02:57:30,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-04 02:57:30,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 70. [2025-03-04 02:57:30,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 48 states have (on average 1.25) internal successors, (60), 50 states have internal predecessors, (60), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2025-03-04 02:57:30,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 91 transitions. [2025-03-04 02:57:30,497 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 91 transitions. Word has length 73 [2025-03-04 02:57:30,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:57:30,497 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 91 transitions. [2025-03-04 02:57:30,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 02:57:30,497 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 91 transitions. [2025-03-04 02:57:30,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-04 02:57:30,499 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:57:30,499 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, 1, 1, 1, 1] [2025-03-04 02:57:30,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:57:30,499 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:57:30,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:57:30,502 INFO L85 PathProgramCache]: Analyzing trace with hash -626301941, now seen corresponding path program 1 times [2025-03-04 02:57:30,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:57:30,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760903581] [2025-03-04 02:57:30,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:30,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:57:30,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-04 02:57:30,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-04 02:57:30,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:30,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:30,746 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-04 02:57:30,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:57:30,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760903581] [2025-03-04 02:57:30,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760903581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:57:30,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:57:30,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 02:57:30,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102811392] [2025-03-04 02:57:30,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:57:30,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:57:30,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:57:30,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:57:30,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:57:30,749 INFO L87 Difference]: Start difference. First operand 70 states and 91 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 02:57:30,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:57:30,875 INFO L93 Difference]: Finished difference Result 138 states and 182 transitions. [2025-03-04 02:57:30,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:57:30,875 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 74 [2025-03-04 02:57:30,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:57:30,877 INFO L225 Difference]: With dead ends: 138 [2025-03-04 02:57:30,877 INFO L226 Difference]: Without dead ends: 76 [2025-03-04 02:57:30,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:57:30,878 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 28 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 02:57:30,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 402 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 02:57:30,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-04 02:57:30,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 71. [2025-03-04 02:57:30,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 51 states have internal predecessors, (61), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2025-03-04 02:57:30,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 92 transitions. [2025-03-04 02:57:30,889 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 92 transitions. Word has length 74 [2025-03-04 02:57:30,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:57:30,890 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 92 transitions. [2025-03-04 02:57:30,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 02:57:30,891 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 92 transitions. [2025-03-04 02:57:30,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-04 02:57:30,892 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:57:30,892 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:57:30,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 02:57:30,893 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:57:30,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:57:30,893 INFO L85 PathProgramCache]: Analyzing trace with hash -514954486, now seen corresponding path program 1 times [2025-03-04 02:57:30,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:57:30,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755128648] [2025-03-04 02:57:30,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:30,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:57:30,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-04 02:57:30,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 02:57:30,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:30,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:31,314 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-04 02:57:31,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:57:31,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755128648] [2025-03-04 02:57:31,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755128648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:57:31,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:57:31,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:57:31,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656740339] [2025-03-04 02:57:31,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:57:31,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:57:31,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:57:31,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:57:31,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:57:31,317 INFO L87 Difference]: Start difference. First operand 71 states and 92 transitions. Second operand has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-04 02:57:31,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:57:31,365 INFO L93 Difference]: Finished difference Result 82 states and 106 transitions. [2025-03-04 02:57:31,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:57:31,365 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 82 [2025-03-04 02:57:31,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:57:31,366 INFO L225 Difference]: With dead ends: 82 [2025-03-04 02:57:31,366 INFO L226 Difference]: Without dead ends: 80 [2025-03-04 02:57:31,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:57:31,368 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 3 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 02:57:31,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 446 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 02:57:31,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-04 02:57:31,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 72. [2025-03-04 02:57:31,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 50 states have (on average 1.24) internal successors, (62), 52 states have internal predecessors, (62), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2025-03-04 02:57:31,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 93 transitions. [2025-03-04 02:57:31,379 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 93 transitions. Word has length 82 [2025-03-04 02:57:31,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:57:31,379 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 93 transitions. [2025-03-04 02:57:31,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-04 02:57:31,382 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 93 transitions. [2025-03-04 02:57:31,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-04 02:57:31,382 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:57:31,382 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:57:31,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 02:57:31,382 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:57:31,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:57:31,383 INFO L85 PathProgramCache]: Analyzing trace with hash 497598162, now seen corresponding path program 1 times [2025-03-04 02:57:31,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:57:31,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929243597] [2025-03-04 02:57:31,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:31,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:57:31,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-04 02:57:31,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-04 02:57:31,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:31,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:31,639 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-04 02:57:31,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:57:31,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929243597] [2025-03-04 02:57:31,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929243597] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:57:31,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791266570] [2025-03-04 02:57:31,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:31,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:57:31,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:57:31,642 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:31,644 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:31,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-04 02:57:31,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-04 02:57:31,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:31,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:31,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-04 02:57:31,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:57:31,869 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:31,900 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:31,950 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:57:31,950 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 1 case distinctions, treesize of input 29 treesize of output 35 [2025-03-04 02:57:31,965 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 22 treesize of output 25 [2025-03-04 02:57:32,530 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 02:57:32,530 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:57:32,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791266570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:57:32,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:57:32,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2025-03-04 02:57:32,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738403002] [2025-03-04 02:57:32,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:57:32,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:57:32,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:57:32,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:57:32,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-04 02:57:32,532 INFO L87 Difference]: Start difference. First operand 72 states and 93 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-04 02:57:32,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:57:32,924 INFO L93 Difference]: Finished difference Result 201 states and 266 transitions. [2025-03-04 02:57:32,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:57:32,924 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 76 [2025-03-04 02:57:32,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:57:32,925 INFO L225 Difference]: With dead ends: 201 [2025-03-04 02:57:32,925 INFO L226 Difference]: Without dead ends: 141 [2025-03-04 02:57:32,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 70 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:32,926 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 48 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 02:57:32,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 432 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 02:57:32,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-04 02:57:32,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 137. [2025-03-04 02:57:32,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 96 states have (on average 1.2604166666666667) internal successors, (121), 101 states have internal predecessors, (121), 26 states have call successors, (26), 11 states have call predecessors, (26), 14 states have return successors, (34), 24 states have call predecessors, (34), 24 states have call successors, (34) [2025-03-04 02:57:32,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 181 transitions. [2025-03-04 02:57:32,949 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 181 transitions. Word has length 76 [2025-03-04 02:57:32,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:57:32,950 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 181 transitions. [2025-03-04 02:57:32,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-04 02:57:32,950 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 181 transitions. [2025-03-04 02:57:32,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-04 02:57:32,952 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:57:32,952 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:57:32,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 02:57:33,157 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,SelfDestructingSolverStorable6 [2025-03-04 02:57:33,157 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:57:33,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:57:33,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1427935149, now seen corresponding path program 1 times [2025-03-04 02:57:33,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:57:33,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286187630] [2025-03-04 02:57:33,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:33,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:57:33,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-04 02:57:33,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-04 02:57:33,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:33,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:33,393 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-04 02:57:33,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:57:33,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286187630] [2025-03-04 02:57:33,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286187630] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:57:33,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589868288] [2025-03-04 02:57:33,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:33,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:57:33,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:57:33,397 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:33,398 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:33,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-04 02:57:33,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-04 02:57:33,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:33,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:33,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-04 02:57:33,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:57:33,652 INFO L349 Elim1Store]: treesize reduction 50, result has 41.2 percent of original size [2025-03-04 02:57:33,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 104 [2025-03-04 02:57:33,659 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 11 [2025-03-04 02:57:33,671 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 02:57:33,671 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:33,687 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 55 treesize of output 26 [2025-03-04 02:57:33,956 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-04 02:57:33,956 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:33,960 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 02:57:33,960 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:57:33,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589868288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:57:33,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:57:33,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2025-03-04 02:57:33,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344132317] [2025-03-04 02:57:33,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:57:33,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:57:33,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:57:33,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:57:33,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-03-04 02:57:33,961 INFO L87 Difference]: Start difference. First operand 137 states and 181 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 10 states have internal predecessors, (44), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-04 02:57:37,972 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:42,033 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:46,102 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:50,122 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:54,129 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:54,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:57:54,576 INFO L93 Difference]: Finished difference Result 225 states and 305 transitions. [2025-03-04 02:57:54,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 02:57:54,576 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 10 states have internal predecessors, (44), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 76 [2025-03-04 02:57:54,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:57:54,577 INFO L225 Difference]: With dead ends: 225 [2025-03-04 02:57:54,577 INFO L226 Difference]: Without dead ends: 161 [2025-03-04 02:57:54,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2025-03-04 02:57:54,578 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 199 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 51 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.4s IncrementalHoareTripleChecker+Time [2025-03-04 02:57:54,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 465 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 286 Invalid, 5 Unknown, 0 Unchecked, 20.4s Time] [2025-03-04 02:57:54,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-03-04 02:57:54,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 152. [2025-03-04 02:57:54,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 109 states have (on average 1.275229357798165) internal successors, (139), 115 states have internal predecessors, (139), 27 states have call successors, (27), 11 states have call predecessors, (27), 15 states have return successors, (37), 25 states have call predecessors, (37), 25 states have call successors, (37) [2025-03-04 02:57:54,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 203 transitions. [2025-03-04 02:57:54,602 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 203 transitions. Word has length 76 [2025-03-04 02:57:54,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:57:54,603 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 203 transitions. [2025-03-04 02:57:54,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 10 states have internal predecessors, (44), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-04 02:57:54,603 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 203 transitions. [2025-03-04 02:57:54,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-04 02:57:54,605 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:57:54,605 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:57:54,612 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:54,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:57:54,806 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:57:54,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:57:54,806 INFO L85 PathProgramCache]: Analyzing trace with hash -734542444, now seen corresponding path program 1 times [2025-03-04 02:57:54,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:57:54,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625840035] [2025-03-04 02:57:54,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:54,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:57:54,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-04 02:57:54,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-04 02:57:54,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:54,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:54,991 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-04 02:57:54,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:57:54,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625840035] [2025-03-04 02:57:54,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625840035] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:57:54,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866934124] [2025-03-04 02:57:54,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:54,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:57:54,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:57:54,995 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:54,996 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:55,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-04 02:57:55,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-04 02:57:55,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:55,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:55,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-04 02:57:55,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:57:55,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 02:57:55,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 02:57:55,944 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 26 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 02:57:55,945 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:57:56,400 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 13 proven. 22 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 02:57:56,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866934124] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:57:56,400 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:57:56,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 15, 12] total 28 [2025-03-04 02:57:56,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12013792] [2025-03-04 02:57:56,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:57:56,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-04 02:57:56,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:57:56,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-04 02:57:56,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=668, Unknown=0, NotChecked=0, Total=756 [2025-03-04 02:57:56,402 INFO L87 Difference]: Start difference. First operand 152 states and 203 transitions. Second operand has 28 states, 27 states have (on average 3.7777777777777777) internal successors, (102), 25 states have internal predecessors, (102), 9 states have call successors, (21), 3 states have call predecessors, (21), 8 states have return successors, (21), 8 states have call predecessors, (21), 9 states have call successors, (21) [2025-03-04 02:58:00,450 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:04,481 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,502 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:09,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:58:09,679 INFO L93 Difference]: Finished difference Result 539 states and 788 transitions. [2025-03-04 02:58:09,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-04 02:58:09,679 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.7777777777777777) internal successors, (102), 25 states have internal predecessors, (102), 9 states have call successors, (21), 3 states have call predecessors, (21), 8 states have return successors, (21), 8 states have call predecessors, (21), 9 states have call successors, (21) Word has length 76 [2025-03-04 02:58:09,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:58:09,682 INFO L225 Difference]: With dead ends: 539 [2025-03-04 02:58:09,682 INFO L226 Difference]: Without dead ends: 400 [2025-03-04 02:58:09,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 129 SyntacticMatches, 6 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=298, Invalid=2152, Unknown=0, NotChecked=0, Total=2450 [2025-03-04 02:58:09,683 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 185 mSDsluCounter, 1424 mSDsCounter, 0 mSdLazyCounter, 1114 mSolverCounterSat, 91 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 1520 SdHoareTripleChecker+Invalid, 1208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1114 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.8s IncrementalHoareTripleChecker+Time [2025-03-04 02:58:09,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 1520 Invalid, 1208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1114 Invalid, 3 Unknown, 0 Unchecked, 12.8s Time] [2025-03-04 02:58:09,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2025-03-04 02:58:09,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 342. [2025-03-04 02:58:09,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 249 states have (on average 1.2730923694779117) internal successors, (317), 265 states have internal predecessors, (317), 55 states have call successors, (55), 23 states have call predecessors, (55), 37 states have return successors, (106), 53 states have call predecessors, (106), 51 states have call successors, (106) [2025-03-04 02:58:09,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 478 transitions. [2025-03-04 02:58:09,717 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 478 transitions. Word has length 76 [2025-03-04 02:58:09,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:58:09,718 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 478 transitions. [2025-03-04 02:58:09,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.7777777777777777) internal successors, (102), 25 states have internal predecessors, (102), 9 states have call successors, (21), 3 states have call predecessors, (21), 8 states have return successors, (21), 8 states have call predecessors, (21), 9 states have call successors, (21) [2025-03-04 02:58:09,718 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 478 transitions. [2025-03-04 02:58:09,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-04 02:58:09,719 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:58:09,719 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:58:09,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 02:58:09,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:58:09,924 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:58:09,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:58:09,924 INFO L85 PathProgramCache]: Analyzing trace with hash -521552676, now seen corresponding path program 1 times [2025-03-04 02:58:09,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:58:09,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153860490] [2025-03-04 02:58:09,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:58:09,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:58:09,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-04 02:58:09,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-04 02:58:09,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:58:09,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:10,095 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-04 02:58:10,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:58:10,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153860490] [2025-03-04 02:58:10,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153860490] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:58:10,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371996166] [2025-03-04 02:58:10,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:58:10,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:58:10,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:58:10,098 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:58:10,099 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:58:10,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-04 02:58:10,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-04 02:58:10,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:58:10,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:10,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-04 02:58:10,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:58:10,289 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,294 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,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:58:10,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:58:10,331 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 34 treesize of output 22 [2025-03-04 02:58:10,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:58:10,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:58:10,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:58:10,340 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 35 treesize of output 41 [2025-03-04 02:58:11,560 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-04 02:58:11,560 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:58:11,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371996166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:58:11,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:58:11,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2025-03-04 02:58:11,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858214497] [2025-03-04 02:58:11,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:58:11,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:58:11,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:58:11,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:58:11,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-04 02:58:11,561 INFO L87 Difference]: Start difference. First operand 342 states and 478 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 5 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-04 02:58:12,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:58:12,053 INFO L93 Difference]: Finished difference Result 523 states and 717 transitions. [2025-03-04 02:58:12,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:58:12,053 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 5 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 88 [2025-03-04 02:58:12,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:58:12,055 INFO L225 Difference]: With dead ends: 523 [2025-03-04 02:58:12,055 INFO L226 Difference]: Without dead ends: 342 [2025-03-04 02:58:12,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 73 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:58:12,057 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 31 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 02:58:12,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 447 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 02:58:12,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2025-03-04 02:58:12,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 336. [2025-03-04 02:58:12,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 245 states have (on average 1.2653061224489797) internal successors, (310), 259 states have internal predecessors, (310), 55 states have call successors, (55), 23 states have call predecessors, (55), 35 states have return successors, (101), 53 states have call predecessors, (101), 51 states have call successors, (101) [2025-03-04 02:58:12,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 466 transitions. [2025-03-04 02:58:12,094 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 466 transitions. Word has length 88 [2025-03-04 02:58:12,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:58:12,094 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 466 transitions. [2025-03-04 02:58:12,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 5 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-04 02:58:12,094 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 466 transitions. [2025-03-04 02:58:12,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-04 02:58:12,096 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:58:12,096 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:58:12,103 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:58:12,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-04 02:58:12,300 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:58:12,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:58:12,300 INFO L85 PathProgramCache]: Analyzing trace with hash 2011491132, now seen corresponding path program 1 times [2025-03-04 02:58:12,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:58:12,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200914253] [2025-03-04 02:58:12,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:58:12,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:58:12,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-04 02:58:12,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-04 02:58:12,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:58:12,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:12,530 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-04 02:58:12,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:58:12,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200914253] [2025-03-04 02:58:12,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200914253] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:58:12,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989343323] [2025-03-04 02:58:12,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:58:12,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:58:12,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:58:12,532 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:58:12,534 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:58:12,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-04 02:58:12,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-04 02:58:12,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:58:12,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:12,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-04 02:58:12,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:58:12,744 INFO L349 Elim1Store]: treesize reduction 50, result has 41.2 percent of original size [2025-03-04 02:58:12,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 104 [2025-03-04 02:58:12,750 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 11 [2025-03-04 02:58:12,759 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 02:58:12,759 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:58:12,774 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 02:58:12,774 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 9 [2025-03-04 02:58:12,775 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 9 treesize of output 7 [2025-03-04 02:58:13,179 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_18| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_18|) 24))) (and (<= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_18| .cse0) (exists ((v_DerPreprocessor_3 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| .cse0))) (= .cse1 (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_18| (store .cse1 24 .cse0)) .cse0)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_18|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_18| Int)) (and (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_18| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_18|) 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_18|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_19| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_19|) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_19|) 24) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_19|))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_19| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_19|) 24))) (and (<= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_19| .cse2) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_19|) (exists ((v_DerPreprocessor_3 (Array Int Int))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| .cse2))) (= (select (store (store |c_#memory_$Pointer$#2.base| .cse2 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_19| (store .cse3 24 .cse2)) .cse2) .cse3)))))))) is different from true [2025-03-04 02:58:14,006 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_end_~list#1.base|) 24))) (and (= |c_ULTIMATE.start_aws_linked_list_end_~list#1.offset| 0) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_18| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_18|) 24))) (and (<= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_18| .cse0) (exists ((v_DerPreprocessor_3 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| .cse0))) (= .cse1 (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_18| (store .cse1 24 .cse0)) .cse0)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_18|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_18| Int)) (and (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_18| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_18|) 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_18|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_10| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_10|) (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_10| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_10|) 24)))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_10| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_10|) 24))) (and (<= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_10| .cse2) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_10|) (exists ((v_DerPreprocessor_3 (Array Int Int))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| .cse2))) (= .cse3 (select (store (store |c_#memory_$Pointer$#2.base| .cse2 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_10| (store .cse3 24 .cse2)) .cse2)))))))) (<= 2 |c_ULTIMATE.start_aws_linked_list_end_~list#1.base|) (or (exists ((v_DerPreprocessor_3 (Array Int Int))) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| .cse5))) (= .cse4 (select (store (store |c_#memory_$Pointer$#2.base| .cse5 v_DerPreprocessor_3) |c_ULTIMATE.start_aws_linked_list_end_~list#1.base| (store .cse4 24 .cse5)) .cse5)))) (= .cse5 |c_ULTIMATE.start_aws_linked_list_end_~list#1.base|)) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_19| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_19|) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_19|) 24) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_19|))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_19| Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_19|) 24))) (and (<= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_19| .cse6) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_19|) (exists ((v_DerPreprocessor_3 (Array Int Int))) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| .cse6))) (= (select (store (store |c_#memory_$Pointer$#2.base| .cse6 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_19| (store .cse7 24 .cse6)) .cse6) .cse7))))))) (<= |c_ULTIMATE.start_aws_linked_list_end_~list#1.base| .cse5))) is different from true [2025-03-04 02:58:14,064 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_18| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_18|) 24))) (and (<= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_18| .cse0) (exists ((v_DerPreprocessor_3 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| .cse0))) (= .cse1 (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_18| (store .cse1 24 .cse0)) .cse0)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_18|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_18| Int)) (and (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_18| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_18|) 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_18|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_10| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_10|) (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_10| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_10|) 24)))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_10| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_10|) 24))) (and (<= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_10| .cse2) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_10|) (exists ((v_DerPreprocessor_3 (Array Int Int))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| .cse2))) (= .cse3 (select (store (store |c_#memory_$Pointer$#2.base| .cse2 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_10| (store .cse3 24 .cse2)) .cse2)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_19| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_19|) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_19|) 24) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_19|))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_19| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_19|) 24))) (and (<= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_19| .cse4) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_19|) (exists ((v_DerPreprocessor_3 (Array Int Int))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| .cse4))) (= (select (store (store |c_#memory_$Pointer$#2.base| .cse4 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_19| (store .cse5 24 .cse4)) .cse4) .cse5))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_11| Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_11|) 24))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_11|) (<= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_11| .cse6) (exists ((v_DerPreprocessor_3 (Array Int Int))) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| .cse6))) (= .cse7 (select (store (store |c_#memory_$Pointer$#2.base| .cse6 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_11| (store .cse7 24 .cse6)) .cse6))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_11| Int)) (and (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_11| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_11|) 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_11|))))) is different from true [2025-03-04 02:58:15,740 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 4 not checked. [2025-03-04 02:58:15,740 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:58:16,030 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:58:16,030 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 310 [2025-03-04 02:58:16,035 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 162 treesize of output 146 [2025-03-04 02:58:16,069 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 129 treesize of output 117 [2025-03-04 02:58:16,223 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 02:58:16,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989343323] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:58:16,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:58:16,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [7, 20] total 34 [2025-03-04 02:58:16,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893451485] [2025-03-04 02:58:16,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:58:16,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:58:16,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:58:16,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:58:16,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=788, Unknown=43, NotChecked=180, Total=1122 [2025-03-04 02:58:16,224 INFO L87 Difference]: Start difference. First operand 336 states and 466 transitions. Second operand has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-04 02:58:16,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:58:16,618 INFO L93 Difference]: Finished difference Result 466 states and 645 transitions. [2025-03-04 02:58:16,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:58:16,619 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 88 [2025-03-04 02:58:16,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:58:16,621 INFO L225 Difference]: With dead ends: 466 [2025-03-04 02:58:16,621 INFO L226 Difference]: Without dead ends: 344 [2025-03-04 02:58:16,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=157, Invalid=1290, Unknown=47, NotChecked=228, Total=1722 [2025-03-04 02:58:16,622 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 143 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 02:58:16,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 433 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 02:58:16,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2025-03-04 02:58:16,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 320. [2025-03-04 02:58:16,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 232 states have (on average 1.2586206896551724) internal successors, (292), 244 states have internal predecessors, (292), 54 states have call successors, (54), 23 states have call predecessors, (54), 33 states have return successors, (96), 52 states have call predecessors, (96), 50 states have call successors, (96) [2025-03-04 02:58:16,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 442 transitions. [2025-03-04 02:58:16,652 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 442 transitions. Word has length 88 [2025-03-04 02:58:16,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:58:16,652 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 442 transitions. [2025-03-04 02:58:16,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-04 02:58:16,652 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 442 transitions. [2025-03-04 02:58:16,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-04 02:58:16,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:58:16,654 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:58:16,660 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:16,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:58:16,854 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:58:16,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:58:16,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1020133788, now seen corresponding path program 1 times [2025-03-04 02:58:16,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:58:16,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018567528] [2025-03-04 02:58:16,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:58:16,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:58:16,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-04 02:58:16,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-04 02:58:16,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:58:16,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:17,049 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-04 02:58:17,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:58:17,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018567528] [2025-03-04 02:58:17,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018567528] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:58:17,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399342879] [2025-03-04 02:58:17,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:58:17,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:58:17,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:58:17,051 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:17,053 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:17,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-04 02:58:17,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-04 02:58:17,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:58:17,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:17,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-04 02:58:17,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:58:17,206 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:17,211 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:17,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:58:17,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:58:17,239 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 29 [2025-03-04 02:58:17,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:58:17,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:58:17,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:58:17,248 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 43 treesize of output 34 [2025-03-04 02:58:18,334 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-04 02:58:18,334 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:58:18,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399342879] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:58:18,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:58:18,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [7] total 16 [2025-03-04 02:58:18,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875031160] [2025-03-04 02:58:18,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:58:18,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:58:18,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:58:18,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:58:18,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2025-03-04 02:58:18,335 INFO L87 Difference]: Start difference. First operand 320 states and 442 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 5 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-04 02:58:18,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:58:18,970 INFO L93 Difference]: Finished difference Result 404 states and 543 transitions. [2025-03-04 02:58:18,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 02:58:18,970 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 5 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 88 [2025-03-04 02:58:18,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:58:18,972 INFO L225 Difference]: With dead ends: 404 [2025-03-04 02:58:18,972 INFO L226 Difference]: Without dead ends: 233 [2025-03-04 02:58:18,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 72 SyntacticMatches, 8 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2025-03-04 02:58:18,973 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 53 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 02:58:18,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 651 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 02:58:18,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-03-04 02:58:18,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 231. [2025-03-04 02:58:18,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 166 states have (on average 1.2530120481927711) internal successors, (208), 175 states have internal predecessors, (208), 40 states have call successors, (40), 17 states have call predecessors, (40), 24 states have return successors, (67), 38 states have call predecessors, (67), 37 states have call successors, (67) [2025-03-04 02:58:18,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 315 transitions. [2025-03-04 02:58:18,992 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 315 transitions. Word has length 88 [2025-03-04 02:58:18,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:58:18,993 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 315 transitions. [2025-03-04 02:58:18,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 5 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-04 02:58:18,993 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 315 transitions. [2025-03-04 02:58:18,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-04 02:58:18,997 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:58:18,998 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:58:19,008 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 02:58:19,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:58:19,198 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:58:19,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:58:19,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1808465916, now seen corresponding path program 1 times [2025-03-04 02:58:19,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:58:19,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370218240] [2025-03-04 02:58:19,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:58:19,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:58:19,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-04 02:58:19,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-04 02:58:19,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:58:19,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:19,717 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 02:58:19,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:58:19,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370218240] [2025-03-04 02:58:19,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370218240] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:58:19,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480489382] [2025-03-04 02:58:19,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:58:19,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:58:19,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:58:19,720 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:19,720 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:19,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-04 02:58:19,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-04 02:58:19,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:58:19,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:19,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-04 02:58:19,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:58:19,926 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:20,360 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-04 02:58:20,360 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:58:20,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [480489382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:58:20,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:58:20,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [15] total 24 [2025-03-04 02:58:20,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561263645] [2025-03-04 02:58:20,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:58:20,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:58:20,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:58:20,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:58:20,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2025-03-04 02:58:20,361 INFO L87 Difference]: Start difference. First operand 231 states and 315 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 5 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-04 02:58:20,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:58:20,735 INFO L93 Difference]: Finished difference Result 327 states and 445 transitions. [2025-03-04 02:58:20,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 02:58:20,736 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 5 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 88 [2025-03-04 02:58:20,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:58:20,737 INFO L225 Difference]: With dead ends: 327 [2025-03-04 02:58:20,738 INFO L226 Difference]: Without dead ends: 235 [2025-03-04 02:58:20,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 73 SyntacticMatches, 8 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=88, Invalid=668, Unknown=0, NotChecked=0, Total=756 [2025-03-04 02:58:20,739 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 54 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 02:58:20,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 653 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 02:58:20,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-03-04 02:58:20,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 233. [2025-03-04 02:58:20,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 168 states have (on average 1.25) internal successors, (210), 177 states have internal predecessors, (210), 40 states have call successors, (40), 17 states have call predecessors, (40), 24 states have return successors, (67), 38 states have call predecessors, (67), 37 states have call successors, (67) [2025-03-04 02:58:20,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 317 transitions. [2025-03-04 02:58:20,766 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 317 transitions. Word has length 88 [2025-03-04 02:58:20,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:58:20,766 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 317 transitions. [2025-03-04 02:58:20,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 5 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-04 02:58:20,766 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 317 transitions. [2025-03-04 02:58:20,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-04 02:58:20,767 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:58:20,767 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:58:20,774 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:20,967 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,SelfDestructingSolverStorable12 [2025-03-04 02:58:20,968 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:58:20,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:58:20,968 INFO L85 PathProgramCache]: Analyzing trace with hash -813570468, now seen corresponding path program 1 times [2025-03-04 02:58:20,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:58:20,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299164178] [2025-03-04 02:58:20,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:58:20,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:58:20,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-04 02:58:20,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-04 02:58:20,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:58:20,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:21,062 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 02:58:21,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:58:21,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299164178] [2025-03-04 02:58:21,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299164178] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:58:21,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390028865] [2025-03-04 02:58:21,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:58:21,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:58:21,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:58:21,064 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:21,065 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:21,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-04 02:58:21,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-04 02:58:21,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:58:21,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:21,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 02:58:21,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:58:21,277 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 02:58:21,277 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:58:21,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390028865] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:58:21,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:58:21,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2025-03-04 02:58:21,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428399681] [2025-03-04 02:58:21,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:58:21,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:58:21,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:58:21,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:58:21,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:58:21,279 INFO L87 Difference]: Start difference. First operand 233 states and 317 transitions. Second operand has 7 states, 6 states have (on average 10.833333333333334) internal successors, (65), 7 states have internal predecessors, (65), 4 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-04 02:58:21,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:58:21,392 INFO L93 Difference]: Finished difference Result 542 states and 757 transitions. [2025-03-04 02:58:21,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:58:21,393 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.833333333333334) internal successors, (65), 7 states have internal predecessors, (65), 4 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 88 [2025-03-04 02:58:21,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:58:21,394 INFO L225 Difference]: With dead ends: 542 [2025-03-04 02:58:21,394 INFO L226 Difference]: Without dead ends: 223 [2025-03-04 02:58:21,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-03-04 02:58:21,395 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 95 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 02:58:21,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 345 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 02:58:21,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-03-04 02:58:21,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2025-03-04 02:58:21,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 159 states have (on average 1.2138364779874213) internal successors, (193), 167 states have internal predecessors, (193), 40 states have call successors, (40), 17 states have call predecessors, (40), 23 states have return successors, (64), 38 states have call predecessors, (64), 37 states have call successors, (64) [2025-03-04 02:58:21,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 297 transitions. [2025-03-04 02:58:21,418 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 297 transitions. Word has length 88 [2025-03-04 02:58:21,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:58:21,419 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 297 transitions. [2025-03-04 02:58:21,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.833333333333334) internal successors, (65), 7 states have internal predecessors, (65), 4 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-04 02:58:21,419 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 297 transitions. [2025-03-04 02:58:21,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-04 02:58:21,421 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:58:21,421 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:58:21,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 02:58:21,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 02:58:21,622 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:58:21,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:58:21,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1049500798, now seen corresponding path program 1 times [2025-03-04 02:58:21,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:58:21,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322855638] [2025-03-04 02:58:21,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:58:21,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:58:21,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-04 02:58:21,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-04 02:58:21,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:58:21,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:21,860 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-04 02:58:21,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:58:21,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322855638] [2025-03-04 02:58:21,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322855638] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:58:21,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028781413] [2025-03-04 02:58:21,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:58:21,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:58:21,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:58:21,864 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:21,865 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:21,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-04 02:58:22,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-04 02:58:22,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:58:22,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:22,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-04 02:58:22,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:58:22,087 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:22,102 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:22,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:58:22,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:58:22,157 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:22,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:58:22,205 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 27 treesize of output 20 [2025-03-04 02:58:22,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:58:22,226 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:22,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:58:22,231 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:22,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:58:22,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:58:22,261 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 47 treesize of output 42 [2025-03-04 02:58:22,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2025-03-04 02:58:22,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:58:22,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:58:22,275 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 38 treesize of output 35 [2025-03-04 02:58:22,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 13 [2025-03-04 02:58:23,063 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 29 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-04 02:58:23,063 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:58:23,282 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_end_harness_~#list~0#1.offset| 16))) (and (forall ((v_ArrVal_885 (Array Int Int)) (v_ArrVal_886 Int)) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_885))) (store .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_886))) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_888 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_888))) (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 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|))) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) .cse2) 0)))) is different from false [2025-03-04 02:58:23,300 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_end_harness_~#list~0#1.offset| 16))) (and (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| Int)) (or (forall ((v_ArrVal_879 Int) (v_ArrVal_885 (Array Int Int)) (v_ArrVal_886 Int)) (= (select (select (let ((.cse0 (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| v_ArrVal_879)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| v_ArrVal_885))) (store .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_886))) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) .cse2) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| 1)))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| 1)) (forall ((v_ArrVal_884 Int) (v_ArrVal_888 (Array Int Int))) (= (select (select (let ((.cse3 (store (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_884)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| v_ArrVal_888))) (store .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20|))) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) .cse2) 0)))))) is different from false [2025-03-04 02:58:23,308 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 02:58:23,309 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 02:58:23,354 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2025-03-04 02:58:23,355 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 171 treesize of output 200 [2025-03-04 02:58:23,364 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 02:58:23,365 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 02:58:23,411 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2025-03-04 02:58:23,411 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 327 treesize of output 314 [2025-03-04 02:58:23,427 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:58:23,427 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 250 treesize of output 250 [2025-03-04 02:58:23,435 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 217 treesize of output 205 [2025-03-04 02:58:23,452 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:58:23,452 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 306 treesize of output 304 [2025-03-04 02:58:23,462 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 263 treesize of output 251 [2025-03-04 02:58:23,508 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:23,514 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:23,973 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:58:23,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 105 treesize of output 107 [2025-03-04 02:58:23,981 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:58:23,981 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 101 treesize of output 93 [2025-03-04 02:58:24,042 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 1 not checked. [2025-03-04 02:58:24,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028781413] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:58:24,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:58:24,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 10] total 24 [2025-03-04 02:58:24,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733662847] [2025-03-04 02:58:24,043 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:58:24,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 02:58:24,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:58:24,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 02:58:24,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=404, Unknown=2, NotChecked=82, Total=552 [2025-03-04 02:58:24,044 INFO L87 Difference]: Start difference. First operand 223 states and 297 transitions. Second operand has 24 states, 23 states have (on average 5.043478260869565) internal successors, (116), 23 states have internal predecessors, (116), 10 states have call successors, (26), 3 states have call predecessors, (26), 7 states have return successors, (25), 10 states have call predecessors, (25), 10 states have call successors, (25) [2025-03-04 02:58:24,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:58:24,950 INFO L93 Difference]: Finished difference Result 451 states and 600 transitions. [2025-03-04 02:58:24,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-04 02:58:24,950 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 5.043478260869565) internal successors, (116), 23 states have internal predecessors, (116), 10 states have call successors, (26), 3 states have call predecessors, (26), 7 states have return successors, (25), 10 states have call predecessors, (25), 10 states have call successors, (25) Word has length 89 [2025-03-04 02:58:24,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:58:24,952 INFO L225 Difference]: With dead ends: 451 [2025-03-04 02:58:24,952 INFO L226 Difference]: Without dead ends: 234 [2025-03-04 02:58:24,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 154 SyntacticMatches, 9 SemanticMatches, 36 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=152, Invalid=1114, Unknown=2, NotChecked=138, Total=1406 [2025-03-04 02:58:24,953 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 45 mSDsluCounter, 1098 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 1180 SdHoareTripleChecker+Invalid, 1095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 273 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 02:58:24,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 1180 Invalid, 1095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 771 Invalid, 0 Unknown, 273 Unchecked, 0.6s Time] [2025-03-04 02:58:24,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-03-04 02:58:24,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 226. [2025-03-04 02:58:24,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 163 states have (on average 1.2085889570552146) internal successors, (197), 169 states have internal predecessors, (197), 40 states have call successors, (40), 18 states have call predecessors, (40), 22 states have return successors, (54), 38 states have call predecessors, (54), 37 states have call successors, (54) [2025-03-04 02:58:24,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 291 transitions. [2025-03-04 02:58:24,980 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 291 transitions. Word has length 89 [2025-03-04 02:58:24,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:58:24,980 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 291 transitions. [2025-03-04 02:58:24,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 5.043478260869565) internal successors, (116), 23 states have internal predecessors, (116), 10 states have call successors, (26), 3 states have call predecessors, (26), 7 states have return successors, (25), 10 states have call predecessors, (25), 10 states have call successors, (25) [2025-03-04 02:58:24,980 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 291 transitions. [2025-03-04 02:58:24,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-04 02:58:24,981 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:58:24,981 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24,989 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:25,185 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,SelfDestructingSolverStorable14 [2025-03-04 02:58:25,185 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:58:25,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:58:25,185 INFO L85 PathProgramCache]: Analyzing trace with hash 2054043688, now seen corresponding path program 1 times [2025-03-04 02:58:25,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:58:25,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895973231] [2025-03-04 02:58:25,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:58:25,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:58:25,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 02:58:25,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 02:58:25,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:58:25,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:25,398 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-04 02:58:25,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:58:25,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895973231] [2025-03-04 02:58:25,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895973231] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:58:25,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425730946] [2025-03-04 02:58:25,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:58:25,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:58:25,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:58:25,400 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:25,402 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:25,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 02:58:25,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 02:58:25,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:58:25,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:25,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-03-04 02:58:25,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:58:25,651 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:25,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:58:25,655 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:25,660 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:25,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:58:25,663 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:25,702 INFO L349 Elim1Store]: treesize reduction 38, result has 22.4 percent of original size [2025-03-04 02:58:25,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 105 [2025-03-04 02:58:25,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:58:25,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:58:25,708 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 28 treesize of output 25 [2025-03-04 02:58:25,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2025-03-04 02:58:25,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 54 [2025-03-04 02:58:35,025 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2025-03-04 02:58:35,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 13 [2025-03-04 02:58:39,139 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_46| Int) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_46|))) (let ((.cse0 (select .cse1 0))) (and (<= (+ 2 .cse0) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_46|) (= .cse0 (select .cse1 24)) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| .cse0))) (= (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_DerPreprocessor_8) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_46| (store .cse2 24 .cse0)) .cse0) .cse2)))))) (exists ((v_DerPreprocessor_7 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_47| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_47|))) (let ((.cse3 (select .cse4 0))) (and (<= (+ .cse3 2) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_47|) (= .cse3 (select .cse4 24)) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| .cse3))) (= .cse5 (select (store (store |c_#memory_$Pointer$#2.base| .cse3 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_47| (store .cse5 24 .cse3)) .cse3))))))) (exists ((v_DerPreprocessor_5 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_29| Int)) (let ((.cse8 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_29|))) (let ((.cse6 (select .cse8 0))) (and (<= (+ 2 .cse6) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_29|) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| .cse6))) (= .cse7 (select (store (store |c_#memory_$Pointer$#2.base| .cse6 v_DerPreprocessor_5) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_29| (store .cse7 24 .cse6)) .cse6))) (= (select .cse8 24) .cse6))))) (exists ((v_DerPreprocessor_9 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_30| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_30|))) (let ((.cse10 (select .cse9 0))) (and (= (select .cse9 24) .cse10) (not (= .cse10 0)) (<= (+ .cse10 2) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_30|) (let ((.cse11 (select |c_#memory_$Pointer$#2.base| .cse10))) (= (select (store (store |c_#memory_$Pointer$#2.base| .cse10 v_DerPreprocessor_9) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_30| (store .cse11 24 .cse10)) .cse10) .cse11))))))) is different from true [2025-03-04 02:58:43,407 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_46| Int) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_46|))) (let ((.cse0 (select .cse1 0))) (and (<= (+ 2 .cse0) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_46|) (= .cse0 (select .cse1 24)) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| .cse0))) (= (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_DerPreprocessor_8) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_46| (store .cse2 24 .cse0)) .cse0) .cse2)))))) (exists ((v_DerPreprocessor_7 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_47| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_47|))) (let ((.cse3 (select .cse4 0))) (and (<= (+ .cse3 2) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_47|) (= .cse3 (select .cse4 24)) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| .cse3))) (= .cse5 (select (store (store |c_#memory_$Pointer$#2.base| .cse3 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_47| (store .cse5 24 .cse3)) .cse3))))))) (exists ((v_DerPreprocessor_10 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_30| Int)) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_30|))) (let ((.cse7 (select .cse6 0))) (and (= (select .cse6 24) .cse7) (not (= .cse7 0)) (let ((.cse8 (select |c_#memory_$Pointer$#2.base| .cse7))) (= (select (store (store |c_#memory_$Pointer$#2.base| .cse7 v_DerPreprocessor_10) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_30| (store .cse8 24 .cse7)) .cse7) .cse8)) (<= (+ .cse7 2) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_30|))))) (exists ((v_DerPreprocessor_5 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_29| Int)) (let ((.cse11 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_29|))) (let ((.cse9 (select .cse11 0))) (and (<= (+ 2 .cse9) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_29|) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| .cse9))) (= .cse10 (select (store (store |c_#memory_$Pointer$#2.base| .cse9 v_DerPreprocessor_5) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_29| (store .cse10 24 .cse9)) .cse9))) (= (select .cse11 24) .cse9))))) (exists ((v_DerPreprocessor_9 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_31| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_31|))) (let ((.cse12 (select .cse14 0))) (and (not (= .cse12 0)) (let ((.cse13 (select |c_#memory_$Pointer$#2.base| .cse12))) (= .cse13 (select (store (store |c_#memory_$Pointer$#2.base| .cse12 v_DerPreprocessor_9) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_31| (store .cse13 24 .cse12)) .cse12))) (<= (+ 2 .cse12) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_31|) (= (select .cse14 24) .cse12)))))) is different from true [2025-03-04 02:58:44,272 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 8 proven. 22 refuted. 11 times theorem prover too weak. 3 trivial. 6 not checked. [2025-03-04 02:58:44,272 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:58:44,884 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset| 24)) (.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24))) (and (or (forall ((v_ArrVal_1000 (Array Int Int)) (v_ArrVal_999 Int)) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_1000))) (store .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_999))) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset|) 0)) (forall ((v_ArrVal_997 (Array Int Int))) (not (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_997))) (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|))) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) .cse3) 0)))) (forall ((v_ArrVal_997 (Array Int Int))) (let ((.cse4 (select (let ((.cse5 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_997))) (store .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|))) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|))) (or (not (= (select .cse4 .cse3) 0)) (= (select .cse4 |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset|) 0)))))) is different from false [2025-03-04 02:58:44,894 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:58:44,894 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 165 treesize of output 126 [2025-03-04 02:58:44,902 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:58:44,902 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 161 treesize of output 154 [2025-03-04 02:58:44,917 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:58:44,917 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 625 treesize of output 559 [2025-03-04 02:58:44,940 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:58:44,940 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 830 treesize of output 836 [2025-03-04 02:58:44,952 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 673 treesize of output 665 [2025-03-04 02:58:44,964 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 683 treesize of output 667 [2025-03-04 02:58:44,979 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:58:44,979 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 709 treesize of output 685 [2025-03-04 02:58:45,235 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:45,255 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:58:45,255 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 274 treesize of output 274 [2025-03-04 02:58:45,504 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:45,522 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:45,608 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:58:45,608 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 37 treesize of output 31 [2025-03-04 02:58:45,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:58:45,621 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:45,624 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-04 02:58:45,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:58:45,679 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:58:45,680 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 185 treesize of output 161 [2025-03-04 02:58:46,042 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 1 not checked. [2025-03-04 02:58:46,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [425730946] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:58:46,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:58:46,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 24, 16] total 44 [2025-03-04 02:58:46,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296659279] [2025-03-04 02:58:46,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:58:46,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-04 02:58:46,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:58:46,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-04 02:58:46,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1484, Unknown=32, NotChecked=240, Total=1892 [2025-03-04 02:58:46,043 INFO L87 Difference]: Start difference. First operand 226 states and 291 transitions. Second operand has 44 states, 40 states have (on average 3.85) internal successors, (154), 39 states have internal predecessors, (154), 14 states have call successors, (27), 7 states have call predecessors, (27), 9 states have return successors, (26), 12 states have call predecessors, (26), 14 states have call successors, (26) [2025-03-04 02:58:50,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]