./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_linked_list_init_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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_init_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c37a0beecaaffccfccd39c8b76dad022f083d470c5665e9f01bdfeab207ad41e --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 07:16:03,440 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 07:16:03,502 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-17 07:16:03,508 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 07:16:03,510 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 07:16:03,531 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 07:16:03,532 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 07:16:03,532 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 07:16:03,532 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 07:16:03,532 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 07:16:03,533 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 07:16:03,533 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 07:16:03,533 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 07:16:03,533 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 07:16:03,533 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 07:16:03,534 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 07:16:03,534 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 07:16:03,534 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 07:16:03,534 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 07:16:03,534 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 07:16:03,534 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 07:16:03,534 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 07:16:03,534 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 07:16:03,534 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 07:16:03,535 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 07:16:03,535 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 07:16:03,535 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 07:16:03,535 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 07:16:03,535 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 07:16:03,535 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 07:16:03,535 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 07:16:03,535 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 07:16:03,535 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 07:16:03,536 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 07:16:03,536 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 07:16:03,536 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 07:16:03,536 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 07:16:03,536 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 07:16:03,536 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 07:16:03,536 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 07:16:03,536 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 -> c37a0beecaaffccfccd39c8b76dad022f083d470c5665e9f01bdfeab207ad41e [2025-03-17 07:16:03,782 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 07:16:03,791 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 07:16:03,794 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 07:16:03,795 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 07:16:03,795 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 07:16:03,797 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_init_harness.i [2025-03-17 07:16:05,020 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a305d379a/bd1d12f7b1a14f0fbbcec5f75beac93d/FLAG8d9f7b1bf [2025-03-17 07:16:05,411 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 07:16:05,414 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_init_harness.i [2025-03-17 07:16:05,442 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a305d379a/bd1d12f7b1a14f0fbbcec5f75beac93d/FLAG8d9f7b1bf [2025-03-17 07:16:05,572 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a305d379a/bd1d12f7b1a14f0fbbcec5f75beac93d [2025-03-17 07:16:05,574 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 07:16:05,575 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 07:16:05,576 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 07:16:05,576 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 07:16:05,579 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 07:16:05,580 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:16:05" (1/1) ... [2025-03-17 07:16:05,582 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43ccf8b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:16:05, skipping insertion in model container [2025-03-17 07:16:05,582 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:16:05" (1/1) ... [2025-03-17 07:16:05,639 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 07:16:05,821 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_init_harness.i[4494,4507] [2025-03-17 07:16:05,827 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_init_harness.i[4554,4567] [2025-03-17 07:16:06,259 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:06,260 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:06,261 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:06,262 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:06,263 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:06,275 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:06,276 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:06,277 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:06,277 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:06,278 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:06,279 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:06,279 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:06,280 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:06,642 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_init_harness.i[150277,150290] [2025-03-17 07:16:06,643 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 07:16:06,654 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 07:16:06,664 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_init_harness.i[4494,4507] [2025-03-17 07:16:06,666 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_init_harness.i[4554,4567] [2025-03-17 07:16:06,718 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:06,718 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:06,718 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:06,718 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:06,719 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:06,728 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:06,728 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:06,732 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:06,732 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:06,733 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:06,734 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:06,734 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:06,735 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:06,818 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_init_harness.i[150277,150290] [2025-03-17 07:16:06,818 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 07:16:06,955 INFO L204 MainTranslator]: Completed translation [2025-03-17 07:16:06,956 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:16:06 WrapperNode [2025-03-17 07:16:06,956 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 07:16:06,957 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 07:16:06,957 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 07:16:06,957 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 07:16:06,961 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:16:06" (1/1) ... [2025-03-17 07:16:07,022 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:16:06" (1/1) ... [2025-03-17 07:16:07,051 INFO L138 Inliner]: procedures = 668, calls = 1034, calls flagged for inlining = 51, calls inlined = 4, statements flattened = 89 [2025-03-17 07:16:07,051 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 07:16:07,052 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 07:16:07,052 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 07:16:07,052 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 07:16:07,059 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:16:06" (1/1) ... [2025-03-17 07:16:07,060 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:16:06" (1/1) ... [2025-03-17 07:16:07,065 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:16:06" (1/1) ... [2025-03-17 07:16:07,081 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 5, 13]. 65 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 4 writes are split as follows [0, 0, 4]. [2025-03-17 07:16:07,082 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:16:06" (1/1) ... [2025-03-17 07:16:07,082 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:16:06" (1/1) ... [2025-03-17 07:16:07,095 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:16:06" (1/1) ... [2025-03-17 07:16:07,098 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:16:06" (1/1) ... [2025-03-17 07:16:07,100 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:16:06" (1/1) ... [2025-03-17 07:16:07,105 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:16:06" (1/1) ... [2025-03-17 07:16:07,109 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 07:16:07,113 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 07:16:07,114 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 07:16:07,114 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 07:16:07,115 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:16:06" (1/1) ... [2025-03-17 07:16:07,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 07:16:07,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 07:16:07,143 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-17 07:16:07,145 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-17 07:16:07,161 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_init [2025-03-17 07:16:07,161 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_init [2025-03-17 07:16:07,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 07:16:07,161 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-17 07:16:07,161 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-17 07:16:07,161 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2025-03-17 07:16:07,162 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2025-03-17 07:16:07,162 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2025-03-17 07:16:07,162 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2025-03-17 07:16:07,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 07:16:07,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 07:16:07,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 07:16:07,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 07:16:07,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 07:16:07,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 07:16:07,162 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_empty [2025-03-17 07:16:07,162 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_empty [2025-03-17 07:16:07,162 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 07:16:07,162 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 07:16:07,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 07:16:07,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 07:16:07,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 07:16:07,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 07:16:07,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-17 07:16:07,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-17 07:16:07,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-17 07:16:07,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 07:16:07,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 07:16:07,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 07:16:07,349 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 07:16:07,350 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 07:16:07,401 INFO L1322 $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-17 07:16:07,503 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4700: havoc #t~ret311#1; [2025-03-17 07:16:07,515 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4685: havoc #t~mem302.base, #t~mem302.offset; [2025-03-17 07:16:07,565 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2025-03-17 07:16:07,566 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 07:16:07,573 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 07:16:07,574 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 07:16:07,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:16:07 BoogieIcfgContainer [2025-03-17 07:16:07,574 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 07:16:07,576 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 07:16:07,576 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 07:16:07,580 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 07:16:07,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 07:16:05" (1/3) ... [2025-03-17 07:16:07,581 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@263ea5c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:16:07, skipping insertion in model container [2025-03-17 07:16:07,581 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:16:06" (2/3) ... [2025-03-17 07:16:07,582 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@263ea5c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:16:07, skipping insertion in model container [2025-03-17 07:16:07,582 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:16:07" (3/3) ... [2025-03-17 07:16:07,583 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_linked_list_init_harness.i [2025-03-17 07:16:07,597 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 07:16:07,598 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_linked_list_init_harness.i that has 7 procedures, 59 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 07:16:07,644 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 07:16:07,656 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;@4a5af161, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 07:16:07,656 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 07:16:07,660 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 42 states have internal predecessors, (55), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 07:16:07,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-17 07:16:07,667 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:16:07,668 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 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-17 07:16:07,668 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:16:07,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:16:07,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1488711331, now seen corresponding path program 1 times [2025-03-17 07:16:07,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:16:07,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987444718] [2025-03-17 07:16:07,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:16:07,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:16:07,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 07:16:07,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 07:16:07,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:16:07,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:16:07,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 07:16:07,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:16:07,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987444718] [2025-03-17 07:16:07,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987444718] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:16:07,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:16:07,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 07:16:07,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247621465] [2025-03-17 07:16:07,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:16:07,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 07:16:07,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:16:07,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 07:16:07,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 07:16:07,973 INFO L87 Difference]: Start difference. First operand has 59 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 42 states have internal predecessors, (55), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 07:16:07,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:16:07,993 INFO L93 Difference]: Finished difference Result 114 states and 151 transitions. [2025-03-17 07:16:07,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 07:16:07,995 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2025-03-17 07:16:07,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:16:08,000 INFO L225 Difference]: With dead ends: 114 [2025-03-17 07:16:08,001 INFO L226 Difference]: Without dead ends: 56 [2025-03-17 07:16:08,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 07:16:08,006 INFO L435 NwaCegarLoop]: 73 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, 73 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-17 07:16:08,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 07:16:08,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-17 07:16:08,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-03-17 07:16:08,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 40 states have internal predecessors, (51), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 07:16:08,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2025-03-17 07:16:08,041 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 26 [2025-03-17 07:16:08,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:16:08,041 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2025-03-17 07:16:08,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 07:16:08,041 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2025-03-17 07:16:08,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-17 07:16:08,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:16:08,042 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 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-17 07:16:08,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 07:16:08,043 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:16:08,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:16:08,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1700062244, now seen corresponding path program 1 times [2025-03-17 07:16:08,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:16:08,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145454762] [2025-03-17 07:16:08,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:16:08,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:16:08,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 07:16:08,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 07:16:08,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:16:08,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:16:08,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 07:16:08,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:16:08,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145454762] [2025-03-17 07:16:08,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145454762] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:16:08,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:16:08,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 07:16:08,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492853112] [2025-03-17 07:16:08,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:16:08,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 07:16:08,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:16:08,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 07:16:08,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 07:16:08,255 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 07:16:08,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:16:08,286 INFO L93 Difference]: Finished difference Result 109 states and 138 transitions. [2025-03-17 07:16:08,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 07:16:08,287 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2025-03-17 07:16:08,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:16:08,288 INFO L225 Difference]: With dead ends: 109 [2025-03-17 07:16:08,289 INFO L226 Difference]: Without dead ends: 59 [2025-03-17 07:16:08,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 07:16:08,291 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 1 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 07:16:08,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 193 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 07:16:08,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-17 07:16:08,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2025-03-17 07:16:08,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 42 states have internal predecessors, (53), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 07:16:08,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2025-03-17 07:16:08,300 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 26 [2025-03-17 07:16:08,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:16:08,301 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2025-03-17 07:16:08,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 07:16:08,302 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2025-03-17 07:16:08,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-17 07:16:08,303 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:16:08,303 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 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-17 07:16:08,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 07:16:08,303 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:16:08,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:16:08,304 INFO L85 PathProgramCache]: Analyzing trace with hash -96889115, now seen corresponding path program 1 times [2025-03-17 07:16:08,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:16:08,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736519529] [2025-03-17 07:16:08,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:16:08,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:16:08,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 07:16:08,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 07:16:08,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:16:08,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:16:08,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 07:16:08,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:16:08,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736519529] [2025-03-17 07:16:08,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736519529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:16:08,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:16:08,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 07:16:08,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601846270] [2025-03-17 07:16:08,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:16:08,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 07:16:08,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:16:08,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 07:16:08,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 07:16:08,441 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 07:16:08,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:16:08,471 INFO L93 Difference]: Finished difference Result 113 states and 143 transitions. [2025-03-17 07:16:08,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 07:16:08,472 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2025-03-17 07:16:08,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:16:08,473 INFO L225 Difference]: With dead ends: 113 [2025-03-17 07:16:08,473 INFO L226 Difference]: Without dead ends: 61 [2025-03-17 07:16:08,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 07:16:08,474 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 1 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 07:16:08,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 195 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 07:16:08,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-17 07:16:08,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-03-17 07:16:08,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 45 states have internal predecessors, (56), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 07:16:08,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2025-03-17 07:16:08,482 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 26 [2025-03-17 07:16:08,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:16:08,482 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2025-03-17 07:16:08,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 07:16:08,483 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2025-03-17 07:16:08,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-17 07:16:08,484 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:16:08,484 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 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-17 07:16:08,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 07:16:08,484 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:16:08,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:16:08,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1904343578, now seen corresponding path program 1 times [2025-03-17 07:16:08,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:16:08,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47818409] [2025-03-17 07:16:08,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:16:08,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:16:08,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 07:16:08,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 07:16:08,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:16:08,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:16:09,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 07:16:09,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:16:09,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47818409] [2025-03-17 07:16:09,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47818409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:16:09,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:16:09,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 07:16:09,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508951974] [2025-03-17 07:16:09,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:16:09,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 07:16:09,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:16:09,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 07:16:09,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-17 07:16:09,036 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 07:16:09,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:16:09,222 INFO L93 Difference]: Finished difference Result 126 states and 154 transitions. [2025-03-17 07:16:09,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 07:16:09,222 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2025-03-17 07:16:09,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:16:09,224 INFO L225 Difference]: With dead ends: 126 [2025-03-17 07:16:09,224 INFO L226 Difference]: Without dead ends: 71 [2025-03-17 07:16:09,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-17 07:16:09,225 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 9 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 07:16:09,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 409 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 07:16:09,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-17 07:16:09,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-03-17 07:16:09,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 55 states have internal predecessors, (66), 10 states have call successors, (10), 6 states have call predecessors, (10), 7 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2025-03-17 07:16:09,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 86 transitions. [2025-03-17 07:16:09,233 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 86 transitions. Word has length 26 [2025-03-17 07:16:09,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:16:09,234 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 86 transitions. [2025-03-17 07:16:09,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 07:16:09,234 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 86 transitions. [2025-03-17 07:16:09,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-17 07:16:09,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:16:09,234 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 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-17 07:16:09,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 07:16:09,235 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:16:09,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:16:09,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1993465251, now seen corresponding path program 1 times [2025-03-17 07:16:09,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:16:09,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204877613] [2025-03-17 07:16:09,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:16:09,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:16:09,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 07:16:09,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 07:16:09,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:16:09,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:16:09,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 07:16:09,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:16:09,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204877613] [2025-03-17 07:16:09,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204877613] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:16:09,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:16:09,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 07:16:09,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002578119] [2025-03-17 07:16:09,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:16:09,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 07:16:09,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:16:09,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 07:16:09,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 07:16:09,859 INFO L87 Difference]: Start difference. First operand 71 states and 86 transitions. Second operand has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 07:16:09,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:16:09,997 INFO L93 Difference]: Finished difference Result 141 states and 171 transitions. [2025-03-17 07:16:09,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 07:16:09,997 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2025-03-17 07:16:09,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:16:09,998 INFO L225 Difference]: With dead ends: 141 [2025-03-17 07:16:09,998 INFO L226 Difference]: Without dead ends: 76 [2025-03-17 07:16:09,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-03-17 07:16:09,999 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 16 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 07:16:09,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 371 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 07:16:10,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-17 07:16:10,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 71. [2025-03-17 07:16:10,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 55 states have internal predecessors, (66), 10 states have call successors, (10), 6 states have call predecessors, (10), 7 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2025-03-17 07:16:10,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 86 transitions. [2025-03-17 07:16:10,008 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 86 transitions. Word has length 26 [2025-03-17 07:16:10,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:16:10,008 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 86 transitions. [2025-03-17 07:16:10,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 07:16:10,008 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 86 transitions. [2025-03-17 07:16:10,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-17 07:16:10,009 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:16:10,009 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 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-17 07:16:10,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 07:16:10,009 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:16:10,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:16:10,010 INFO L85 PathProgramCache]: Analyzing trace with hash 186010788, now seen corresponding path program 1 times [2025-03-17 07:16:10,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:16:10,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133643741] [2025-03-17 07:16:10,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:16:10,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:16:10,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 07:16:10,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 07:16:10,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:16:10,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:16:10,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 07:16:10,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:16:10,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133643741] [2025-03-17 07:16:10,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133643741] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:16:10,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:16:10,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 07:16:10,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787799049] [2025-03-17 07:16:10,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:16:10,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 07:16:10,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:16:10,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 07:16:10,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-17 07:16:10,414 INFO L87 Difference]: Start difference. First operand 71 states and 86 transitions. Second operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 07:16:10,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:16:10,636 INFO L93 Difference]: Finished difference Result 154 states and 187 transitions. [2025-03-17 07:16:10,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 07:16:10,637 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2025-03-17 07:16:10,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:16:10,638 INFO L225 Difference]: With dead ends: 154 [2025-03-17 07:16:10,639 INFO L226 Difference]: Without dead ends: 89 [2025-03-17 07:16:10,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2025-03-17 07:16:10,640 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 18 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 07:16:10,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 473 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 07:16:10,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-17 07:16:10,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 75. [2025-03-17 07:16:10,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 57 states have (on average 1.263157894736842) internal successors, (72), 59 states have internal predecessors, (72), 10 states have call successors, (10), 6 states have call predecessors, (10), 7 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2025-03-17 07:16:10,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 92 transitions. [2025-03-17 07:16:10,650 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 92 transitions. Word has length 26 [2025-03-17 07:16:10,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:16:10,651 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 92 transitions. [2025-03-17 07:16:10,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 07:16:10,652 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 92 transitions. [2025-03-17 07:16:10,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-17 07:16:10,653 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:16:10,653 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 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-17 07:16:10,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 07:16:10,654 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:16:10,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:16:10,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1610940571, now seen corresponding path program 1 times [2025-03-17 07:16:10,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:16:10,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097780178] [2025-03-17 07:16:10,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:16:10,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:16:10,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 07:16:10,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 07:16:10,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:16:10,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:16:11,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 07:16:11,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:16:11,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097780178] [2025-03-17 07:16:11,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097780178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:16:11,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:16:11,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 07:16:11,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204040592] [2025-03-17 07:16:11,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:16:11,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 07:16:11,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:16:11,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 07:16:11,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-17 07:16:11,154 INFO L87 Difference]: Start difference. First operand 75 states and 92 transitions. Second operand has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 07:16:11,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:16:11,332 INFO L93 Difference]: Finished difference Result 152 states and 186 transitions. [2025-03-17 07:16:11,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 07:16:11,333 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2025-03-17 07:16:11,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:16:11,334 INFO L225 Difference]: With dead ends: 152 [2025-03-17 07:16:11,334 INFO L226 Difference]: Without dead ends: 83 [2025-03-17 07:16:11,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-03-17 07:16:11,335 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 23 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 07:16:11,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 378 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 07:16:11,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-17 07:16:11,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 75. [2025-03-17 07:16:11,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 57 states have (on average 1.263157894736842) internal successors, (72), 59 states have internal predecessors, (72), 10 states have call successors, (10), 6 states have call predecessors, (10), 7 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2025-03-17 07:16:11,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 92 transitions. [2025-03-17 07:16:11,347 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 92 transitions. Word has length 26 [2025-03-17 07:16:11,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:16:11,347 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 92 transitions. [2025-03-17 07:16:11,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 07:16:11,347 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 92 transitions. [2025-03-17 07:16:11,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-17 07:16:11,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:16:11,348 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 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-17 07:16:11,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 07:16:11,348 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:16:11,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:16:11,348 INFO L85 PathProgramCache]: Analyzing trace with hash -396791769, now seen corresponding path program 1 times [2025-03-17 07:16:11,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:16:11,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544010130] [2025-03-17 07:16:11,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:16:11,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:16:11,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 07:16:11,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 07:16:11,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:16:11,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:16:11,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 07:16:11,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:16:11,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544010130] [2025-03-17 07:16:11,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544010130] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:16:11,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:16:11,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 07:16:11,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785350576] [2025-03-17 07:16:11,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:16:11,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 07:16:11,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:16:11,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 07:16:11,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 07:16:11,453 INFO L87 Difference]: Start difference. First operand 75 states and 92 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 07:16:11,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:16:11,511 INFO L93 Difference]: Finished difference Result 160 states and 199 transitions. [2025-03-17 07:16:11,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 07:16:11,511 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2025-03-17 07:16:11,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:16:11,512 INFO L225 Difference]: With dead ends: 160 [2025-03-17 07:16:11,512 INFO L226 Difference]: Without dead ends: 63 [2025-03-17 07:16:11,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-17 07:16:11,513 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 36 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 07:16:11,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 389 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 07:16:11,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-17 07:16:11,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-03-17 07:16:11,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 47 states have internal predecessors, (56), 10 states have call successors, (10), 6 states have call predecessors, (10), 7 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2025-03-17 07:16:11,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 76 transitions. [2025-03-17 07:16:11,519 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 76 transitions. Word has length 26 [2025-03-17 07:16:11,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:16:11,519 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 76 transitions. [2025-03-17 07:16:11,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 07:16:11,520 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2025-03-17 07:16:11,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-17 07:16:11,520 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:16:11,520 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 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-17 07:16:11,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 07:16:11,520 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:16:11,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:16:11,521 INFO L85 PathProgramCache]: Analyzing trace with hash 39989676, now seen corresponding path program 1 times [2025-03-17 07:16:11,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:16:11,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415043147] [2025-03-17 07:16:11,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:16:11,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:16:11,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 07:16:11,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 07:16:11,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:16:11,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:16:11,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 07:16:11,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:16:11,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415043147] [2025-03-17 07:16:11,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415043147] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:16:11,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:16:11,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 07:16:11,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933525505] [2025-03-17 07:16:11,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:16:11,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 07:16:11,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:16:11,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 07:16:11,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 07:16:11,636 INFO L87 Difference]: Start difference. First operand 63 states and 76 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 07:16:11,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:16:11,713 INFO L93 Difference]: Finished difference Result 125 states and 150 transitions. [2025-03-17 07:16:11,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 07:16:11,713 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2025-03-17 07:16:11,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:16:11,714 INFO L225 Difference]: With dead ends: 125 [2025-03-17 07:16:11,714 INFO L226 Difference]: Without dead ends: 65 [2025-03-17 07:16:11,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 07:16:11,715 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 21 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 07:16:11,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 359 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 07:16:11,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-17 07:16:11,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2025-03-17 07:16:11,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 47 states have internal predecessors, (55), 10 states have call successors, (10), 6 states have call predecessors, (10), 7 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2025-03-17 07:16:11,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2025-03-17 07:16:11,720 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 27 [2025-03-17 07:16:11,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:16:11,720 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2025-03-17 07:16:11,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 07:16:11,720 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2025-03-17 07:16:11,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-17 07:16:11,721 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:16:11,721 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 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-17 07:16:11,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 07:16:11,721 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:16:11,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:16:11,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1195428564, now seen corresponding path program 1 times [2025-03-17 07:16:11,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:16:11,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826912820] [2025-03-17 07:16:11,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:16:11,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:16:11,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 07:16:11,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 07:16:11,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:16:11,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:16:11,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 07:16:11,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:16:11,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826912820] [2025-03-17 07:16:11,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826912820] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:16:11,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:16:11,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 07:16:11,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948836365] [2025-03-17 07:16:11,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:16:11,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 07:16:11,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:16:11,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 07:16:11,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-17 07:16:11,857 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 07:16:11,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:16:11,988 INFO L93 Difference]: Finished difference Result 131 states and 158 transitions. [2025-03-17 07:16:11,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 07:16:11,989 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2025-03-17 07:16:11,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:16:11,989 INFO L225 Difference]: With dead ends: 131 [2025-03-17 07:16:11,990 INFO L226 Difference]: Without dead ends: 70 [2025-03-17 07:16:11,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-17 07:16:11,990 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 30 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 07:16:11,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 388 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 07:16:11,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-17 07:16:11,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 64. [2025-03-17 07:16:11,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 48 states have internal predecessors, (56), 10 states have call successors, (10), 6 states have call predecessors, (10), 7 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2025-03-17 07:16:11,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2025-03-17 07:16:11,996 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 76 transitions. Word has length 29 [2025-03-17 07:16:11,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:16:11,997 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 76 transitions. [2025-03-17 07:16:11,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 07:16:11,997 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 76 transitions. [2025-03-17 07:16:11,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-17 07:16:11,997 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:16:11,998 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 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-17 07:16:11,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 07:16:11,998 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:16:11,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:16:11,998 INFO L85 PathProgramCache]: Analyzing trace with hash -232577682, now seen corresponding path program 1 times [2025-03-17 07:16:11,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:16:11,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711697932] [2025-03-17 07:16:11,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:16:11,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:16:12,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 07:16:12,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 07:16:12,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:16:12,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:16:12,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 07:16:12,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:16:12,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711697932] [2025-03-17 07:16:12,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711697932] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:16:12,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:16:12,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 07:16:12,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291601655] [2025-03-17 07:16:12,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:16:12,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 07:16:12,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:16:12,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 07:16:12,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 07:16:12,151 INFO L87 Difference]: Start difference. First operand 64 states and 76 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 07:16:12,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:16:12,258 INFO L93 Difference]: Finished difference Result 132 states and 158 transitions. [2025-03-17 07:16:12,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 07:16:12,259 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2025-03-17 07:16:12,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:16:12,259 INFO L225 Difference]: With dead ends: 132 [2025-03-17 07:16:12,259 INFO L226 Difference]: Without dead ends: 70 [2025-03-17 07:16:12,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-17 07:16:12,260 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 27 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 07:16:12,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 402 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 07:16:12,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-17 07:16:12,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2025-03-17 07:16:12,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 49 states have internal predecessors, (57), 10 states have call successors, (10), 6 states have call predecessors, (10), 7 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2025-03-17 07:16:12,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2025-03-17 07:16:12,266 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 77 transitions. Word has length 30 [2025-03-17 07:16:12,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:16:12,266 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 77 transitions. [2025-03-17 07:16:12,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 07:16:12,266 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 77 transitions. [2025-03-17 07:16:12,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-17 07:16:12,267 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:16:12,267 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 07:16:12,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 07:16:12,267 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:16:12,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:16:12,267 INFO L85 PathProgramCache]: Analyzing trace with hash 233273325, now seen corresponding path program 1 times [2025-03-17 07:16:12,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:16:12,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477333318] [2025-03-17 07:16:12,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:16:12,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:16:12,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 07:16:12,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 07:16:12,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:16:12,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:16:13,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 07:16:13,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:16:13,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477333318] [2025-03-17 07:16:13,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477333318] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:16:13,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:16:13,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 07:16:13,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645813824] [2025-03-17 07:16:13,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:16:13,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 07:16:13,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:16:13,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 07:16:13,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2025-03-17 07:16:13,047 INFO L87 Difference]: Start difference. First operand 65 states and 77 transitions. Second operand has 14 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 07:16:13,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:16:13,375 INFO L93 Difference]: Finished difference Result 136 states and 163 transitions. [2025-03-17 07:16:13,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 07:16:13,376 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 38 [2025-03-17 07:16:13,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:16:13,376 INFO L225 Difference]: With dead ends: 136 [2025-03-17 07:16:13,376 INFO L226 Difference]: Without dead ends: 77 [2025-03-17 07:16:13,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2025-03-17 07:16:13,377 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 36 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 07:16:13,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 527 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 07:16:13,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-17 07:16:13,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2025-03-17 07:16:13,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 54 states have internal predecessors, (62), 11 states have call successors, (11), 6 states have call predecessors, (11), 8 states have return successors, (13), 10 states have call predecessors, (13), 10 states have call successors, (13) [2025-03-17 07:16:13,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 86 transitions. [2025-03-17 07:16:13,384 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 86 transitions. Word has length 38 [2025-03-17 07:16:13,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:16:13,384 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 86 transitions. [2025-03-17 07:16:13,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 07:16:13,384 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 86 transitions. [2025-03-17 07:16:13,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-17 07:16:13,384 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:16:13,384 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 07:16:13,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 07:16:13,385 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:16:13,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:16:13,385 INFO L85 PathProgramCache]: Analyzing trace with hash 362356044, now seen corresponding path program 1 times [2025-03-17 07:16:13,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:16:13,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673951331] [2025-03-17 07:16:13,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:16:13,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:16:13,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 07:16:13,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 07:16:13,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:16:13,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:16:13,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 07:16:13,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:16:13,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673951331] [2025-03-17 07:16:13,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673951331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:16:13,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:16:13,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 07:16:13,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716821153] [2025-03-17 07:16:13,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:16:13,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 07:16:13,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:16:13,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 07:16:13,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2025-03-17 07:16:13,710 INFO L87 Difference]: Start difference. First operand 71 states and 86 transitions. Second operand has 14 states, 12 states have (on average 2.5) internal successors, (30), 13 states have internal predecessors, (30), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 07:16:14,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:16:14,055 INFO L93 Difference]: Finished difference Result 159 states and 198 transitions. [2025-03-17 07:16:14,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 07:16:14,055 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.5) internal successors, (30), 13 states have internal predecessors, (30), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 38 [2025-03-17 07:16:14,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:16:14,056 INFO L225 Difference]: With dead ends: 159 [2025-03-17 07:16:14,056 INFO L226 Difference]: Without dead ends: 94 [2025-03-17 07:16:14,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2025-03-17 07:16:14,058 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 44 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 07:16:14,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 581 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 07:16:14,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-17 07:16:14,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 81. [2025-03-17 07:16:14,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 63 states have internal predecessors, (74), 12 states have call successors, (12), 6 states have call predecessors, (12), 9 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2025-03-17 07:16:14,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 104 transitions. [2025-03-17 07:16:14,070 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 104 transitions. Word has length 38 [2025-03-17 07:16:14,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:16:14,071 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 104 transitions. [2025-03-17 07:16:14,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.5) internal successors, (30), 13 states have internal predecessors, (30), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 07:16:14,071 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 104 transitions. [2025-03-17 07:16:14,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-17 07:16:14,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:16:14,073 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 07:16:14,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 07:16:14,074 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:16:14,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:16:14,074 INFO L85 PathProgramCache]: Analyzing trace with hash -143202581, now seen corresponding path program 1 times [2025-03-17 07:16:14,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:16:14,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900104453] [2025-03-17 07:16:14,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:16:14,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:16:14,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 07:16:14,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 07:16:14,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:16:14,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:16:14,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 07:16:14,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:16:14,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900104453] [2025-03-17 07:16:14,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900104453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:16:14,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:16:14,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 07:16:14,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45572924] [2025-03-17 07:16:14,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:16:14,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 07:16:14,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:16:14,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 07:16:14,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-17 07:16:14,233 INFO L87 Difference]: Start difference. First operand 81 states and 104 transitions. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 07:16:14,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:16:14,396 INFO L93 Difference]: Finished difference Result 181 states and 237 transitions. [2025-03-17 07:16:14,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 07:16:14,396 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2025-03-17 07:16:14,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:16:14,397 INFO L225 Difference]: With dead ends: 181 [2025-03-17 07:16:14,397 INFO L226 Difference]: Without dead ends: 92 [2025-03-17 07:16:14,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-03-17 07:16:14,398 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 34 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 07:16:14,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 572 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 07:16:14,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-17 07:16:14,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 81. [2025-03-17 07:16:14,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 63 states have internal predecessors, (74), 12 states have call successors, (12), 6 states have call predecessors, (12), 9 states have return successors, (17), 11 states have call predecessors, (17), 11 states have call successors, (17) [2025-03-17 07:16:14,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 103 transitions. [2025-03-17 07:16:14,410 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 103 transitions. Word has length 38 [2025-03-17 07:16:14,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:16:14,410 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 103 transitions. [2025-03-17 07:16:14,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 07:16:14,410 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 103 transitions. [2025-03-17 07:16:14,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-17 07:16:14,411 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:16:14,411 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 07:16:14,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 07:16:14,412 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:16:14,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:16:14,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1864394515, now seen corresponding path program 1 times [2025-03-17 07:16:14,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:16:14,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785140444] [2025-03-17 07:16:14,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:16:14,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:16:14,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 07:16:14,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 07:16:14,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:16:14,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:16:14,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 07:16:14,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:16:14,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785140444] [2025-03-17 07:16:14,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785140444] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 07:16:14,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582578288] [2025-03-17 07:16:14,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:16:14,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 07:16:14,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 07:16:14,706 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-17 07:16:14,711 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-17 07:16:14,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 07:16:14,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 07:16:14,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:16:14,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:16:14,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-17 07:16:14,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 07:16:14,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 29 [2025-03-17 07:16:15,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 07:16:15,526 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 07:16:15,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 07:16:15,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582578288] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 07:16:15,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 07:16:15,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 27 [2025-03-17 07:16:15,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300814329] [2025-03-17 07:16:15,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 07:16:15,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-17 07:16:15,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:16:15,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-17 07:16:15,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=620, Unknown=0, NotChecked=0, Total=702 [2025-03-17 07:16:15,831 INFO L87 Difference]: Start difference. First operand 81 states and 103 transitions. Second operand has 27 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 25 states have internal predecessors, (76), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 07:16:16,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:16:16,491 INFO L93 Difference]: Finished difference Result 186 states and 241 transitions. [2025-03-17 07:16:16,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 07:16:16,492 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 25 states have internal predecessors, (76), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) Word has length 40 [2025-03-17 07:16:16,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:16:16,494 INFO L225 Difference]: With dead ends: 186 [2025-03-17 07:16:16,494 INFO L226 Difference]: Without dead ends: 111 [2025-03-17 07:16:16,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=145, Invalid=977, Unknown=0, NotChecked=0, Total=1122 [2025-03-17 07:16:16,495 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 85 mSDsluCounter, 789 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 07:16:16,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 842 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 07:16:16,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-17 07:16:16,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 86. [2025-03-17 07:16:16,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 63 states have (on average 1.253968253968254) internal successors, (79), 67 states have internal predecessors, (79), 12 states have call successors, (12), 7 states have call predecessors, (12), 10 states have return successors, (17), 11 states have call predecessors, (17), 11 states have call successors, (17) [2025-03-17 07:16:16,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 108 transitions. [2025-03-17 07:16:16,512 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 108 transitions. Word has length 40 [2025-03-17 07:16:16,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:16:16,512 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 108 transitions. [2025-03-17 07:16:16,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 25 states have internal predecessors, (76), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 07:16:16,514 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2025-03-17 07:16:16,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-17 07:16:16,514 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:16:16,514 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-17 07:16:16,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 07:16:16,719 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,SelfDestructingSolverStorable14 [2025-03-17 07:16:16,719 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:16:16,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:16:16,720 INFO L85 PathProgramCache]: Analyzing trace with hash -969469681, now seen corresponding path program 1 times [2025-03-17 07:16:16,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:16:16,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098481881] [2025-03-17 07:16:16,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:16:16,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:16:16,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 07:16:16,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 07:16:16,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:16:16,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:16:16,941 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 07:16:16,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:16:16,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098481881] [2025-03-17 07:16:16,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098481881] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:16:16,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:16:16,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 07:16:16,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370005013] [2025-03-17 07:16:16,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:16:16,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 07:16:16,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:16:16,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 07:16:16,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 07:16:16,943 INFO L87 Difference]: Start difference. First operand 86 states and 108 transitions. Second operand has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 07:16:16,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:16:16,993 INFO L93 Difference]: Finished difference Result 102 states and 125 transitions. [2025-03-17 07:16:16,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 07:16:16,993 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2025-03-17 07:16:16,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:16:16,994 INFO L225 Difference]: With dead ends: 102 [2025-03-17 07:16:16,994 INFO L226 Difference]: Without dead ends: 100 [2025-03-17 07:16:16,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 07:16:16,995 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 3 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 07:16:16,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 454 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 07:16:16,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-17 07:16:17,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 95. [2025-03-17 07:16:17,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 69 states have (on average 1.2318840579710144) internal successors, (85), 74 states have internal predecessors, (85), 13 states have call successors, (13), 8 states have call predecessors, (13), 12 states have return successors, (20), 12 states have call predecessors, (20), 12 states have call successors, (20) [2025-03-17 07:16:17,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 118 transitions. [2025-03-17 07:16:17,006 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 118 transitions. Word has length 41 [2025-03-17 07:16:17,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:16:17,007 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 118 transitions. [2025-03-17 07:16:17,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 07:16:17,007 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 118 transitions. [2025-03-17 07:16:17,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-17 07:16:17,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:16:17,007 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 07:16:17,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 07:16:17,008 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:16:17,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:16:17,008 INFO L85 PathProgramCache]: Analyzing trace with hash 803877518, now seen corresponding path program 1 times [2025-03-17 07:16:17,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:16:17,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842880717] [2025-03-17 07:16:17,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:16:17,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:16:17,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 07:16:17,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 07:16:17,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:16:17,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:16:17,459 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 07:16:17,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:16:17,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842880717] [2025-03-17 07:16:17,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842880717] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 07:16:17,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658470805] [2025-03-17 07:16:17,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:16:17,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 07:16:17,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 07:16:17,462 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-17 07:16:17,463 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-17 07:16:17,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 07:16:17,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 07:16:17,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:16:17,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:16:17,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-17 07:16:17,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 07:16:17,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2025-03-17 07:16:17,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 29 [2025-03-17 07:16:18,617 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 07:16:18,618 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 07:16:18,972 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 07:16:18,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658470805] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 07:16:18,972 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 07:16:18,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 8] total 29 [2025-03-17 07:16:18,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116612602] [2025-03-17 07:16:18,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 07:16:18,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-17 07:16:18,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:16:18,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-17 07:16:18,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=722, Unknown=0, NotChecked=0, Total=812 [2025-03-17 07:16:18,974 INFO L87 Difference]: Start difference. First operand 95 states and 118 transitions. Second operand has 29 states, 25 states have (on average 3.56) internal successors, (89), 28 states have internal predecessors, (89), 13 states have call successors, (14), 4 states have call predecessors, (14), 6 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 07:16:19,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:16:19,980 INFO L93 Difference]: Finished difference Result 233 states and 310 transitions. [2025-03-17 07:16:19,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-17 07:16:19,980 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 25 states have (on average 3.56) internal successors, (89), 28 states have internal predecessors, (89), 13 states have call successors, (14), 4 states have call predecessors, (14), 6 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) Word has length 49 [2025-03-17 07:16:19,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:16:19,982 INFO L225 Difference]: With dead ends: 233 [2025-03-17 07:16:19,982 INFO L226 Difference]: Without dead ends: 148 [2025-03-17 07:16:19,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=190, Invalid=1370, Unknown=0, NotChecked=0, Total=1560 [2025-03-17 07:16:19,983 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 140 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 843 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 07:16:19,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 850 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 843 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 07:16:19,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-03-17 07:16:19,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 87. [2025-03-17 07:16:20,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 64 states have (on average 1.21875) internal successors, (78), 68 states have internal predecessors, (78), 11 states have call successors, (11), 8 states have call predecessors, (11), 11 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2025-03-17 07:16:20,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 103 transitions. [2025-03-17 07:16:20,001 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 103 transitions. Word has length 49 [2025-03-17 07:16:20,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:16:20,002 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 103 transitions. [2025-03-17 07:16:20,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 25 states have (on average 3.56) internal successors, (89), 28 states have internal predecessors, (89), 13 states have call successors, (14), 4 states have call predecessors, (14), 6 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 07:16:20,002 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 103 transitions. [2025-03-17 07:16:20,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-17 07:16:20,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:16:20,003 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-17 07:16:20,011 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-17 07:16:20,205 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,SelfDestructingSolverStorable16 [2025-03-17 07:16:20,205 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:16:20,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:16:20,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1842442400, now seen corresponding path program 1 times [2025-03-17 07:16:20,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:16:20,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882975289] [2025-03-17 07:16:20,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:16:20,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:16:20,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 07:16:20,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 07:16:20,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:16:20,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:16:20,644 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 07:16:20,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:16:20,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882975289] [2025-03-17 07:16:20,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882975289] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:16:20,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:16:20,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 07:16:20,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132163338] [2025-03-17 07:16:20,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:16:20,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 07:16:20,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:16:20,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 07:16:20,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-03-17 07:16:20,646 INFO L87 Difference]: Start difference. First operand 87 states and 103 transitions. Second operand has 12 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 6 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-17 07:16:20,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:16:20,802 INFO L93 Difference]: Finished difference Result 95 states and 110 transitions. [2025-03-17 07:16:20,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 07:16:20,802 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 6 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 57 [2025-03-17 07:16:20,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:16:20,803 INFO L225 Difference]: With dead ends: 95 [2025-03-17 07:16:20,803 INFO L226 Difference]: Without dead ends: 91 [2025-03-17 07:16:20,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2025-03-17 07:16:20,804 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 18 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 07:16:20,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 521 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 07:16:20,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-17 07:16:20,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2025-03-17 07:16:20,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 66 states have (on average 1.196969696969697) internal successors, (79), 69 states have internal predecessors, (79), 11 states have call successors, (11), 9 states have call predecessors, (11), 11 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2025-03-17 07:16:20,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 104 transitions. [2025-03-17 07:16:20,813 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 104 transitions. Word has length 57 [2025-03-17 07:16:20,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:16:20,813 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 104 transitions. [2025-03-17 07:16:20,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 6 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-17 07:16:20,813 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 104 transitions. [2025-03-17 07:16:20,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-17 07:16:20,813 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:16:20,814 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 07:16:20,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 07:16:20,814 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:16:20,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:16:20,814 INFO L85 PathProgramCache]: Analyzing trace with hash 760673651, now seen corresponding path program 1 times [2025-03-17 07:16:20,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:16:20,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166349775] [2025-03-17 07:16:20,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:16:20,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:16:20,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-17 07:16:20,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-17 07:16:20,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:16:20,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:16:21,122 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 07:16:21,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:16:21,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166349775] [2025-03-17 07:16:21,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166349775] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 07:16:21,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744354193] [2025-03-17 07:16:21,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:16:21,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 07:16:21,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 07:16:21,125 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-17 07:16:21,127 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-17 07:16:21,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-17 07:16:21,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-17 07:16:21,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:16:21,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:16:21,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-03-17 07:16:21,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 07:16:21,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 07:16:21,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 07:16:21,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 07:16:21,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2025-03-17 07:16:22,719 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 07:16:22,720 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 07:16:23,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 188 treesize of output 170 [2025-03-17 07:16:23,145 INFO L349 Elim1Store]: treesize reduction 90, result has 35.3 percent of original size [2025-03-17 07:16:23,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 66609 treesize of output 63519 [2025-03-17 07:16:24,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744354193] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 07:16:24,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 07:16:24,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 29 [2025-03-17 07:16:24,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655288730] [2025-03-17 07:16:24,385 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 07:16:24,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-17 07:16:24,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:16:24,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-17 07:16:24,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1411, Unknown=0, NotChecked=0, Total=1560 [2025-03-17 07:16:24,387 INFO L87 Difference]: Start difference. First operand 89 states and 104 transitions. Second operand has 29 states, 25 states have (on average 4.0) internal successors, (100), 26 states have internal predecessors, (100), 12 states have call successors, (17), 4 states have call predecessors, (17), 8 states have return successors, (17), 10 states have call predecessors, (17), 11 states have call successors, (17) [2025-03-17 07:16:25,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:16:25,821 INFO L93 Difference]: Finished difference Result 185 states and 223 transitions. [2025-03-17 07:16:25,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-17 07:16:25,822 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 25 states have (on average 4.0) internal successors, (100), 26 states have internal predecessors, (100), 12 states have call successors, (17), 4 states have call predecessors, (17), 8 states have return successors, (17), 10 states have call predecessors, (17), 11 states have call successors, (17) Word has length 78 [2025-03-17 07:16:25,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:16:25,823 INFO L225 Difference]: With dead ends: 185 [2025-03-17 07:16:25,823 INFO L226 Difference]: Without dead ends: 125 [2025-03-17 07:16:25,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 104 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 719 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=472, Invalid=2950, Unknown=0, NotChecked=0, Total=3422 [2025-03-17 07:16:25,824 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 217 mSDsluCounter, 1050 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 1122 SdHoareTripleChecker+Invalid, 1080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 07:16:25,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 1122 Invalid, 1080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1041 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 07:16:25,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-03-17 07:16:25,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 106. [2025-03-17 07:16:25,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 82 states have (on average 1.1219512195121952) internal successors, (92), 83 states have internal predecessors, (92), 12 states have call successors, (12), 11 states have call predecessors, (12), 11 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2025-03-17 07:16:25,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2025-03-17 07:16:25,837 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 78 [2025-03-17 07:16:25,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:16:25,837 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2025-03-17 07:16:25,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 25 states have (on average 4.0) internal successors, (100), 26 states have internal predecessors, (100), 12 states have call successors, (17), 4 states have call predecessors, (17), 8 states have return successors, (17), 10 states have call predecessors, (17), 11 states have call successors, (17) [2025-03-17 07:16:25,837 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2025-03-17 07:16:25,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-17 07:16:25,837 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:16:25,838 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 07:16:25,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 07:16:26,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 07:16:26,042 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:16:26,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:16:26,042 INFO L85 PathProgramCache]: Analyzing trace with hash 363515184, now seen corresponding path program 1 times [2025-03-17 07:16:26,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:16:26,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699281913] [2025-03-17 07:16:26,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:16:26,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:16:26,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-17 07:16:26,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-17 07:16:26,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:16:26,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:16:26,465 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-17 07:16:26,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:16:26,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699281913] [2025-03-17 07:16:26,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699281913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:16:26,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:16:26,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 07:16:26,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570766114] [2025-03-17 07:16:26,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:16:26,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 07:16:26,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:16:26,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 07:16:26,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-17 07:16:26,467 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand has 10 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 7 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2025-03-17 07:16:26,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:16:26,608 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2025-03-17 07:16:26,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 07:16:26,609 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 7 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) Word has length 78 [2025-03-17 07:16:26,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:16:26,610 INFO L225 Difference]: With dead ends: 116 [2025-03-17 07:16:26,610 INFO L226 Difference]: Without dead ends: 108 [2025-03-17 07:16:26,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-17 07:16:26,610 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 11 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 07:16:26,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 424 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 07:16:26,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-17 07:16:26,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2025-03-17 07:16:26,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 82 states have (on average 1.1097560975609757) internal successors, (91), 83 states have internal predecessors, (91), 12 states have call successors, (12), 11 states have call predecessors, (12), 11 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2025-03-17 07:16:26,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 115 transitions. [2025-03-17 07:16:26,624 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 115 transitions. Word has length 78 [2025-03-17 07:16:26,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:16:26,625 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 115 transitions. [2025-03-17 07:16:26,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 7 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2025-03-17 07:16:26,625 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 115 transitions. [2025-03-17 07:16:26,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-17 07:16:26,626 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:16:26,626 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 07:16:26,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 07:16:26,626 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:16:26,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:16:26,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1443939279, now seen corresponding path program 1 times [2025-03-17 07:16:26,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:16:26,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541869775] [2025-03-17 07:16:26,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:16:26,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:16:26,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-17 07:16:26,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-17 07:16:26,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:16:26,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:16:27,191 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-17 07:16:27,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:16:27,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541869775] [2025-03-17 07:16:27,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541869775] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 07:16:27,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691531996] [2025-03-17 07:16:27,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:16:27,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 07:16:27,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 07:16:27,211 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-17 07:16:27,212 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-17 07:16:27,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-17 07:16:27,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-17 07:16:27,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:16:27,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:16:27,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 70 conjuncts are in the unsatisfiable core [2025-03-17 07:16:27,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 07:16:27,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 07:16:27,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 07:16:27,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 07:16:27,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2025-03-17 07:16:27,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 07:16:27,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 07:16:27,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 07:16:27,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2025-03-17 07:16:28,276 INFO L349 Elim1Store]: treesize reduction 150, result has 30.9 percent of original size [2025-03-17 07:16:28,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 12 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 16 case distinctions, treesize of input 73 treesize of output 95 [2025-03-17 07:16:38,652 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 07:16:38,653 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 07:16:39,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1691531996] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 07:16:39,188 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 07:16:39,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 20] total 31 [2025-03-17 07:16:39,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994371594] [2025-03-17 07:16:39,189 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 07:16:39,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-17 07:16:39,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:16:39,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-17 07:16:39,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1344, Unknown=0, NotChecked=0, Total=1482 [2025-03-17 07:16:39,190 INFO L87 Difference]: Start difference. First operand 106 states and 115 transitions. Second operand has 31 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 28 states have internal predecessors, (96), 13 states have call successors, (18), 5 states have call predecessors, (18), 9 states have return successors, (17), 10 states have call predecessors, (17), 12 states have call successors, (17) [2025-03-17 07:16:44,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:16:44,772 INFO L93 Difference]: Finished difference Result 134 states and 149 transitions. [2025-03-17 07:16:44,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-17 07:16:44,773 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 28 states have internal predecessors, (96), 13 states have call successors, (18), 5 states have call predecessors, (18), 9 states have return successors, (17), 10 states have call predecessors, (17), 12 states have call successors, (17) Word has length 78 [2025-03-17 07:16:44,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:16:44,774 INFO L225 Difference]: With dead ends: 134 [2025-03-17 07:16:44,774 INFO L226 Difference]: Without dead ends: 125 [2025-03-17 07:16:44,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 96 SyntacticMatches, 5 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 859 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=378, Invalid=3162, Unknown=0, NotChecked=0, Total=3540 [2025-03-17 07:16:44,775 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 207 mSDsluCounter, 1050 mSDsCounter, 0 mSdLazyCounter, 1149 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 1115 SdHoareTripleChecker+Invalid, 1185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-17 07:16:44,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 1115 Invalid, 1185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1149 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-17 07:16:44,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-03-17 07:16:44,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 106. [2025-03-17 07:16:44,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 82 states have (on average 1.0975609756097562) internal successors, (90), 83 states have internal predecessors, (90), 12 states have call successors, (12), 11 states have call predecessors, (12), 11 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2025-03-17 07:16:44,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 114 transitions. [2025-03-17 07:16:44,799 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 114 transitions. Word has length 78 [2025-03-17 07:16:44,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:16:44,799 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 114 transitions. [2025-03-17 07:16:44,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 28 states have internal predecessors, (96), 13 states have call successors, (18), 5 states have call predecessors, (18), 9 states have return successors, (17), 10 states have call predecessors, (17), 12 states have call successors, (17) [2025-03-17 07:16:44,799 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2025-03-17 07:16:44,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-17 07:16:44,800 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:16:44,800 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 07:16:44,807 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 07:16:45,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 07:16:45,001 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:16:45,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:16:45,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1054076658, now seen corresponding path program 1 times [2025-03-17 07:16:45,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:16:45,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046174032] [2025-03-17 07:16:45,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:16:45,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:16:45,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-17 07:16:45,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-17 07:16:45,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:16:45,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:16:45,528 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-17 07:16:45,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:16:45,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046174032] [2025-03-17 07:16:45,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046174032] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 07:16:45,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478714908] [2025-03-17 07:16:45,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:16:45,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 07:16:45,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 07:16:45,530 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-17 07:16:45,532 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-17 07:16:45,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-17 07:16:45,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-17 07:16:45,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:16:45,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:16:45,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-17 07:16:45,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 07:16:45,670 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 32 treesize of output 26 [2025-03-17 07:16:45,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2025-03-17 07:16:46,731 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 07:16:46,731 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 07:16:46,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478714908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:16:46,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 07:16:46,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 21 [2025-03-17 07:16:46,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880277352] [2025-03-17 07:16:46,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:16:46,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 07:16:46,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:16:46,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 07:16:46,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2025-03-17 07:16:46,732 INFO L87 Difference]: Start difference. First operand 106 states and 114 transitions. Second operand has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 6 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-17 07:16:47,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:16:47,137 INFO L93 Difference]: Finished difference Result 113 states and 120 transitions. [2025-03-17 07:16:47,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 07:16:47,139 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 6 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 78 [2025-03-17 07:16:47,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:16:47,139 INFO L225 Difference]: With dead ends: 113 [2025-03-17 07:16:47,139 INFO L226 Difference]: Without dead ends: 102 [2025-03-17 07:16:47,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 65 SyntacticMatches, 8 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2025-03-17 07:16:47,142 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 21 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 07:16:47,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 320 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 07:16:47,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-17 07:16:47,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-03-17 07:16:47,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 78 states have (on average 1.0897435897435896) internal successors, (85), 79 states have internal predecessors, (85), 12 states have call successors, (12), 11 states have call predecessors, (12), 11 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2025-03-17 07:16:47,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2025-03-17 07:16:47,170 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 78 [2025-03-17 07:16:47,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:16:47,171 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2025-03-17 07:16:47,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 6 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-17 07:16:47,171 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2025-03-17 07:16:47,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-17 07:16:47,171 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:16:47,171 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 07:16:47,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 07:16:47,371 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,SelfDestructingSolverStorable21 [2025-03-17 07:16:47,372 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:16:47,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:16:47,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1393730566, now seen corresponding path program 1 times [2025-03-17 07:16:47,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:16:47,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845475248] [2025-03-17 07:16:47,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:16:47,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:16:47,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-17 07:16:47,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-17 07:16:47,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:16:47,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:16:48,472 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-17 07:16:48,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:16:48,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845475248] [2025-03-17 07:16:48,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845475248] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 07:16:48,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816337380] [2025-03-17 07:16:48,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:16:48,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 07:16:48,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 07:16:48,474 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-17 07:16:48,476 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-17 07:16:48,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-17 07:16:48,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-17 07:16:48,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:16:48,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:16:48,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 107 conjuncts are in the unsatisfiable core [2025-03-17 07:16:48,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 07:16:48,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 07:16:48,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 07:16:48,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 07:16:48,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2025-03-17 07:16:48,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 07:16:48,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 07:16:48,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 07:16:48,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2025-03-17 07:16:52,485 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 25 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 07:16:52,485 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 07:16:57,533 WARN L851 $PredicateComparison]: unable to prove that (or (and (forall ((|v_aws_linked_list_init_#in~list.base_BEFORE_CALL_31| Int) (|v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_31| Int)) (= |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_31| (select (select |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_31|) |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_31|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_31|) |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_31|) 8)))) (forall ((|v_aws_linked_list_init_#in~list.base_BEFORE_CALL_31| Int) (|v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_31| Int)) (= |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_31| (select (select |c_#memory_$Pointer$#2.offset| (select (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_31|) |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_31|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_31|) |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_31|) 8))))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_aws_linked_list_is_valid_#in~list#1.base|) |c_aws_linked_list_is_valid_#in~list#1.offset|) (+ 16 |c_aws_linked_list_is_valid_#in~list#1.offset|))) is different from false