./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_linked_list_back_harness_negated.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_linked_list_back_harness_negated.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash a846a77e79e267e728f6b3926ab21995aa009422ba7c404ee2d371931ead2c4d --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:56:56,038 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:56:56,090 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-04 02:56:56,098 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:56:56,099 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:56:56,121 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:56:56,122 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:56:56,122 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:56:56,122 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:56:56,122 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:56:56,123 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:56:56,123 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:56:56,123 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:56:56,123 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:56:56,123 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:56:56,123 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:56:56,124 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:56:56,124 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:56:56,124 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:56:56,124 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:56:56,124 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:56:56,124 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:56:56,124 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:56:56,124 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:56:56,124 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:56:56,124 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:56:56,124 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:56:56,124 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:56:56,124 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:56:56,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:56:56,124 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:56:56,124 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:56:56,124 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:56:56,125 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:56:56,125 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:56:56,125 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:56:56,125 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:56:56,125 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:56:56,125 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:56:56,125 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:56:56,125 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 -> a846a77e79e267e728f6b3926ab21995aa009422ba7c404ee2d371931ead2c4d [2025-03-04 02:56:56,359 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:56:56,369 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:56:56,371 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:56:56,373 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:56:56,374 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:56:56,375 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_back_harness_negated.i [2025-03-04 02:56:57,617 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34694109b/fae392563f934a48bd03e7909b304384/FLAG286e96fb6 [2025-03-04 02:56:58,111 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:56:58,112 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_back_harness_negated.i [2025-03-04 02:56:58,139 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34694109b/fae392563f934a48bd03e7909b304384/FLAG286e96fb6 [2025-03-04 02:56:58,154 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34694109b/fae392563f934a48bd03e7909b304384 [2025-03-04 02:56:58,156 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:56:58,158 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:56:58,159 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:56:58,159 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:56:58,162 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:56:58,163 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:56:58" (1/1) ... [2025-03-04 02:56:58,163 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b4ea05f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:56:58, skipping insertion in model container [2025-03-04 02:56:58,163 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:56:58" (1/1) ... [2025-03-04 02:56:58,211 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:56:58,443 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_back_harness_negated.i[4494,4507] [2025-03-04 02:56:58,451 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_back_harness_negated.i[4554,4567] [2025-03-04 02:56:59,106 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:59,107 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:59,107 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:59,108 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:59,109 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:59,117 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:59,117 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:59,118 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:59,119 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:59,125 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:59,127 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:59,127 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:59,127 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:59,463 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_back_harness_negated.i[150870,150883] [2025-03-04 02:56:59,464 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:56:59,486 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:56:59,496 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_back_harness_negated.i[4494,4507] [2025-03-04 02:56:59,496 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_back_harness_negated.i[4554,4567] [2025-03-04 02:56:59,542 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:59,544 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:59,544 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:59,545 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:59,545 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:59,555 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:59,557 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:59,558 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:59,559 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:59,560 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:59,561 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:59,561 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:59,561 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:59,646 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_back_harness_negated.i[150870,150883] [2025-03-04 02:56:59,648 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:56:59,784 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:56:59,785 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:56:59 WrapperNode [2025-03-04 02:56:59,785 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:56:59,786 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:56:59,786 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:56:59,786 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:56:59,791 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:56:59" (1/1) ... [2025-03-04 02:56:59,845 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:56:59" (1/1) ... [2025-03-04 02:56:59,882 INFO L138 Inliner]: procedures = 668, calls = 1043, calls flagged for inlining = 51, calls inlined = 5, statements flattened = 129 [2025-03-04 02:56:59,882 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:56:59,883 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:56:59,883 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:56:59,883 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:56:59,890 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:56:59" (1/1) ... [2025-03-04 02:56:59,890 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:56:59" (1/1) ... [2025-03-04 02:56:59,893 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:56:59" (1/1) ... [2025-03-04 02:56:59,915 INFO L175 MemorySlicer]: Split 27 memory accesses to 3 slices as follows [2, 5, 20]. 74 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 6 writes are split as follows [0, 0, 6]. [2025-03-04 02:56:59,915 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:56:59" (1/1) ... [2025-03-04 02:56:59,916 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:56:59" (1/1) ... [2025-03-04 02:56:59,929 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:56:59" (1/1) ... [2025-03-04 02:56:59,933 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:56:59" (1/1) ... [2025-03-04 02:56:59,936 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:56:59" (1/1) ... [2025-03-04 02:56:59,937 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:56:59" (1/1) ... [2025-03-04 02:56:59,940 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:56:59,941 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:56:59,941 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:56:59,941 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:56:59,943 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:56:59" (1/1) ... [2025-03-04 02:56:59,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:56:59,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:56:59,972 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 02:56:59,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 02:56:59,994 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_back [2025-03-04 02:56:59,996 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_back [2025-03-04 02:56:59,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 02:56:59,996 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 02:56:59,996 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 02:56:59,996 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2025-03-04 02:56:59,996 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2025-03-04 02:56:59,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 02:56:59,996 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2025-03-04 02:56:59,997 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2025-03-04 02:56:59,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:56:59,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 02:56:59,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 02:56:59,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 02:56:59,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:56:59,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:56:59,997 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_empty [2025-03-04 02:56:59,997 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_empty [2025-03-04 02:56:59,997 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 02:56:59,997 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 02:56:59,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 02:56:59,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 02:56:59,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 02:56:59,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 02:56:59,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 02:56:59,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 02:56:59,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 02:56:59,999 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2025-03-04 02:56:59,999 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2025-03-04 02:56:59,999 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2025-03-04 02:56:59,999 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2025-03-04 02:56:59,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:56:59,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:56:59,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 02:57:00,204 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:57:00,206 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:57:00,238 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4729: havoc #t~mem317.base, #t~mem317.offset;havoc #t~short318;havoc #t~mem319.base, #t~mem319.offset;havoc #t~mem320.base, #t~mem320.offset;havoc #t~short321; [2025-03-04 02:57:00,243 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: havoc #t~nondet9; [2025-03-04 02:57:00,288 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4718: havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; [2025-03-04 02:57:00,453 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4700: havoc #t~ret311#1; [2025-03-04 02:57:00,459 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4685: havoc #t~mem302.base, #t~mem302.offset; [2025-03-04 02:57:00,498 INFO L? ?]: Removed 60 outVars from TransFormulas that were not future-live. [2025-03-04 02:57:00,499 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:57:00,507 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:57:00,509 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:57:00,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:57:00 BoogieIcfgContainer [2025-03-04 02:57:00,510 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:57:00,512 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:57:00,513 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:57:00,516 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:57:00,516 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:56:58" (1/3) ... [2025-03-04 02:57:00,517 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@591c4440 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:57:00, skipping insertion in model container [2025-03-04 02:57:00,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:56:59" (2/3) ... [2025-03-04 02:57:00,518 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@591c4440 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:57:00, skipping insertion in model container [2025-03-04 02:57:00,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:57:00" (3/3) ... [2025-03-04 02:57:00,519 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_linked_list_back_harness_negated.i [2025-03-04 02:57:00,532 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:57:00,534 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_linked_list_back_harness_negated.i that has 9 procedures, 97 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-04 02:57:00,579 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:57:00,587 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;@1378640b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:57:00,591 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 02:57:00,595 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 63 states have (on average 1.2698412698412698) internal successors, (80), 64 states have internal predecessors, (80), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 02:57:00,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-04 02:57:00,603 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:57:00,604 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:57:00,604 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:57:00,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:57:00,611 INFO L85 PathProgramCache]: Analyzing trace with hash 2050953679, now seen corresponding path program 1 times [2025-03-04 02:57:00,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:57:00,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26475521] [2025-03-04 02:57:00,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:00,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:57:00,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-04 02:57:00,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 02:57:00,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:00,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:00,927 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-04 02:57:00,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:57:00,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26475521] [2025-03-04 02:57:00,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26475521] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:57:00,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769764472] [2025-03-04 02:57:00,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:00,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:57:00,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:57:00,935 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:57:00,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 02:57:01,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-04 02:57:01,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 02:57:01,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:01,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:01,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 02:57:01,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:57:01,136 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-04 02:57:01,136 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:57:01,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769764472] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:57:01,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:57:01,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 02:57:01,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370358879] [2025-03-04 02:57:01,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:57:01,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 02:57:01,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:57:01,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 02:57:01,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 02:57:01,161 INFO L87 Difference]: Start difference. First operand has 97 states, 63 states have (on average 1.2698412698412698) internal successors, (80), 64 states have internal predecessors, (80), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-04 02:57:01,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:57:01,183 INFO L93 Difference]: Finished difference Result 186 states and 262 transitions. [2025-03-04 02:57:01,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 02:57:01,185 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 85 [2025-03-04 02:57:01,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:57:01,190 INFO L225 Difference]: With dead ends: 186 [2025-03-04 02:57:01,190 INFO L226 Difference]: Without dead ends: 92 [2025-03-04 02:57:01,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 02:57:01,197 INFO L435 NwaCegarLoop]: 126 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, 126 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 02:57:01,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 02:57:01,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-04 02:57:01,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-03-04 02:57:01,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 60 states have internal predecessors, (74), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 02:57:01,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 121 transitions. [2025-03-04 02:57:01,230 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 121 transitions. Word has length 85 [2025-03-04 02:57:01,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:57:01,230 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 121 transitions. [2025-03-04 02:57:01,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-04 02:57:01,230 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 121 transitions. [2025-03-04 02:57:01,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-04 02:57:01,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:57:01,235 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:57:01,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 02:57:01,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 02:57:01,436 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:57:01,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:57:01,437 INFO L85 PathProgramCache]: Analyzing trace with hash -50099217, now seen corresponding path program 1 times [2025-03-04 02:57:01,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:57:01,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363011242] [2025-03-04 02:57:01,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:01,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:57:01,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-04 02:57:01,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 02:57:01,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:01,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:02,066 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-04 02:57:02,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:57:02,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363011242] [2025-03-04 02:57:02,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363011242] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:57:02,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:57:02,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 02:57:02,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673375165] [2025-03-04 02:57:02,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:57:02,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:57:02,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:57:02,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:57:02,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:57:02,068 INFO L87 Difference]: Start difference. First operand 92 states and 121 transitions. Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-04 02:57:02,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:57:02,132 INFO L93 Difference]: Finished difference Result 102 states and 133 transitions. [2025-03-04 02:57:02,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:57:02,132 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 85 [2025-03-04 02:57:02,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:57:02,134 INFO L225 Difference]: With dead ends: 102 [2025-03-04 02:57:02,134 INFO L226 Difference]: Without dead ends: 100 [2025-03-04 02:57:02,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:57:02,135 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 3 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 02:57:02,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 581 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 02:57:02,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-04 02:57:02,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2025-03-04 02:57:02,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 65 states have internal predecessors, (78), 25 states have call successors, (25), 9 states have call predecessors, (25), 10 states have return successors, (27), 24 states have call predecessors, (27), 24 states have call successors, (27) [2025-03-04 02:57:02,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 130 transitions. [2025-03-04 02:57:02,154 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 130 transitions. Word has length 85 [2025-03-04 02:57:02,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:57:02,154 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 130 transitions. [2025-03-04 02:57:02,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-04 02:57:02,156 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 130 transitions. [2025-03-04 02:57:02,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-04 02:57:02,158 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:57:02,158 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2025-03-04 02:57:02,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:57:02,158 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:57:02,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:57:02,159 INFO L85 PathProgramCache]: Analyzing trace with hash 999603210, now seen corresponding path program 1 times [2025-03-04 02:57:02,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:57:02,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804943952] [2025-03-04 02:57:02,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:02,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:57:02,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 02:57:02,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 02:57:02,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:02,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:02,580 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-04 02:57:02,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:57:02,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804943952] [2025-03-04 02:57:02,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804943952] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:57:02,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462297040] [2025-03-04 02:57:02,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:02,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:57:02,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:57:02,585 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:57:02,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 02:57:02,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 02:57:02,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 02:57:02,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:02,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:02,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 02:57:02,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:57:02,890 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-04 02:57:02,890 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:57:02,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462297040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:57:02,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:57:02,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2025-03-04 02:57:02,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203190560] [2025-03-04 02:57:02,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:57:02,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:57:02,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:57:02,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:57:02,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2025-03-04 02:57:02,894 INFO L87 Difference]: Start difference. First operand 99 states and 130 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-04 02:57:03,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:57:03,167 INFO L93 Difference]: Finished difference Result 186 states and 244 transitions. [2025-03-04 02:57:03,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:57:03,167 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 86 [2025-03-04 02:57:03,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:57:03,169 INFO L225 Difference]: With dead ends: 186 [2025-03-04 02:57:03,169 INFO L226 Difference]: Without dead ends: 101 [2025-03-04 02:57:03,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2025-03-04 02:57:03,171 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 131 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 02:57:03,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 560 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 02:57:03,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-04 02:57:03,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2025-03-04 02:57:03,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 63 states have (on average 1.2222222222222223) internal successors, (77), 65 states have internal predecessors, (77), 25 states have call successors, (25), 9 states have call predecessors, (25), 10 states have return successors, (27), 24 states have call predecessors, (27), 24 states have call successors, (27) [2025-03-04 02:57:03,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 129 transitions. [2025-03-04 02:57:03,190 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 129 transitions. Word has length 86 [2025-03-04 02:57:03,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:57:03,190 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 129 transitions. [2025-03-04 02:57:03,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-04 02:57:03,190 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 129 transitions. [2025-03-04 02:57:03,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-04 02:57:03,191 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:57:03,191 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2025-03-04 02:57:03,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 02:57:03,391 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,SelfDestructingSolverStorable2 [2025-03-04 02:57:03,392 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:57:03,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:57:03,392 INFO L85 PathProgramCache]: Analyzing trace with hash 600316658, now seen corresponding path program 1 times [2025-03-04 02:57:03,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:57:03,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665928586] [2025-03-04 02:57:03,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:03,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:57:03,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-04 02:57:03,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-04 02:57:03,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:03,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:03,762 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-04 02:57:03,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:57:03,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665928586] [2025-03-04 02:57:03,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665928586] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:57:03,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133587630] [2025-03-04 02:57:03,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:03,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:57:03,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:57:03,767 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:57:03,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 02:57:03,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-04 02:57:03,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-04 02:57:03,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:03,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:03,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 02:57:03,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:57:04,074 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-04 02:57:04,075 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:57:04,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133587630] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:57:04,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:57:04,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 20 [2025-03-04 02:57:04,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659333723] [2025-03-04 02:57:04,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:57:04,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:57:04,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:57:04,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:57:04,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2025-03-04 02:57:04,076 INFO L87 Difference]: Start difference. First operand 99 states and 129 transitions. Second operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-04 02:57:04,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:57:04,413 INFO L93 Difference]: Finished difference Result 192 states and 252 transitions. [2025-03-04 02:57:04,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:57:04,414 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 88 [2025-03-04 02:57:04,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:57:04,415 INFO L225 Difference]: With dead ends: 192 [2025-03-04 02:57:04,415 INFO L226 Difference]: Without dead ends: 106 [2025-03-04 02:57:04,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=673, Unknown=0, NotChecked=0, Total=756 [2025-03-04 02:57:04,416 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 145 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 02:57:04,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 623 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 02:57:04,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-04 02:57:04,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 100. [2025-03-04 02:57:04,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 64 states have (on average 1.21875) internal successors, (78), 66 states have internal predecessors, (78), 25 states have call successors, (25), 9 states have call predecessors, (25), 10 states have return successors, (27), 24 states have call predecessors, (27), 24 states have call successors, (27) [2025-03-04 02:57:04,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 130 transitions. [2025-03-04 02:57:04,431 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 130 transitions. Word has length 88 [2025-03-04 02:57:04,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:57:04,431 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 130 transitions. [2025-03-04 02:57:04,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-04 02:57:04,431 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 130 transitions. [2025-03-04 02:57:04,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-04 02:57:04,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:57:04,432 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2025-03-04 02:57:04,442 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-04 02:57:04,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:57:04,635 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:57:04,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:57:04,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1615574982, now seen corresponding path program 1 times [2025-03-04 02:57:04,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:57:04,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789837887] [2025-03-04 02:57:04,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:04,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:57:04,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-04 02:57:04,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-04 02:57:04,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:04,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:04,896 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-04 02:57:04,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:57:04,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789837887] [2025-03-04 02:57:04,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789837887] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:57:04,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:57:04,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:57:04,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482619395] [2025-03-04 02:57:04,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:57:04,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:57:04,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:57:04,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:57:04,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:57:04,898 INFO L87 Difference]: Start difference. First operand 100 states and 130 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-04 02:57:05,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:57:05,035 INFO L93 Difference]: Finished difference Result 193 states and 252 transitions. [2025-03-04 02:57:05,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:57:05,035 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 89 [2025-03-04 02:57:05,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:57:05,037 INFO L225 Difference]: With dead ends: 193 [2025-03-04 02:57:05,039 INFO L226 Difference]: Without dead ends: 106 [2025-03-04 02:57:05,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:57:05,040 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 36 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 02:57:05,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 761 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 02:57:05,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-04 02:57:05,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 101. [2025-03-04 02:57:05,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 67 states have internal predecessors, (79), 25 states have call successors, (25), 9 states have call predecessors, (25), 10 states have return successors, (27), 24 states have call predecessors, (27), 24 states have call successors, (27) [2025-03-04 02:57:05,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 131 transitions. [2025-03-04 02:57:05,053 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 131 transitions. Word has length 89 [2025-03-04 02:57:05,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:57:05,053 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 131 transitions. [2025-03-04 02:57:05,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-04 02:57:05,053 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 131 transitions. [2025-03-04 02:57:05,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-04 02:57:05,056 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:57:05,056 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 1, 1, 1, 1] [2025-03-04 02:57:05,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 02:57:05,057 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:57:05,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:57:05,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1822597752, now seen corresponding path program 1 times [2025-03-04 02:57:05,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:57:05,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803774254] [2025-03-04 02:57:05,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:05,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:57:05,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 02:57:05,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 02:57:05,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:05,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:05,835 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-04 02:57:05,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:57:05,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803774254] [2025-03-04 02:57:05,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803774254] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:57:05,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342952936] [2025-03-04 02:57:05,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:05,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:57:05,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:57:05,838 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:57:05,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 02:57:05,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 02:57:05,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 02:57:05,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:05,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:05,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-03-04 02:57:05,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:57:06,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2025-03-04 02:57:07,552 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-04 02:57:07,553 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:57:07,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342952936] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:57:07,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:57:07,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [15] total 29 [2025-03-04 02:57:07,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132431362] [2025-03-04 02:57:07,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:57:07,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 02:57:07,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:57:07,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 02:57:07,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=732, Unknown=0, NotChecked=0, Total=812 [2025-03-04 02:57:07,556 INFO L87 Difference]: Start difference. First operand 101 states and 131 transitions. Second operand has 16 states, 16 states have (on average 3.5) internal successors, (56), 15 states have internal predecessors, (56), 6 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2025-03-04 02:57:11,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 02:57:15,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 02:57:19,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 02:57:23,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 02:57:24,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:57:24,776 INFO L93 Difference]: Finished difference Result 302 states and 403 transitions. [2025-03-04 02:57:24,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 02:57:24,776 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 15 states have internal predecessors, (56), 6 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) Word has length 97 [2025-03-04 02:57:24,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:57:24,779 INFO L225 Difference]: With dead ends: 302 [2025-03-04 02:57:24,779 INFO L226 Difference]: Without dead ends: 206 [2025-03-04 02:57:24,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 73 SyntacticMatches, 12 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=131, Invalid=1129, Unknown=0, NotChecked=0, Total=1260 [2025-03-04 02:57:24,780 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 114 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 46 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.9s IncrementalHoareTripleChecker+Time [2025-03-04 02:57:24,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 747 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 759 Invalid, 4 Unknown, 0 Unchecked, 16.9s Time] [2025-03-04 02:57:24,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-03-04 02:57:24,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 197. [2025-03-04 02:57:24,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 127 states have (on average 1.2283464566929134) internal successors, (156), 133 states have internal predecessors, (156), 49 states have call successors, (49), 17 states have call predecessors, (49), 20 states have return successors, (56), 46 states have call predecessors, (56), 47 states have call successors, (56) [2025-03-04 02:57:24,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 261 transitions. [2025-03-04 02:57:24,803 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 261 transitions. Word has length 97 [2025-03-04 02:57:24,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:57:24,804 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 261 transitions. [2025-03-04 02:57:24,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 15 states have internal predecessors, (56), 6 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2025-03-04 02:57:24,804 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 261 transitions. [2025-03-04 02:57:24,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-04 02:57:24,807 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:57:24,808 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 1, 1, 1, 1] [2025-03-04 02:57:24,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 02:57:25,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:57:25,008 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:57:25,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:57:25,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1693515033, now seen corresponding path program 1 times [2025-03-04 02:57:25,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:57:25,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429186882] [2025-03-04 02:57:25,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:25,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:57:25,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 02:57:25,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 02:57:25,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:25,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:25,274 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-03-04 02:57:25,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:57:25,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429186882] [2025-03-04 02:57:25,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429186882] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:57:25,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588358115] [2025-03-04 02:57:25,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:25,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:57:25,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:57:25,277 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:57:25,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 02:57:25,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 02:57:25,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 02:57:25,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:25,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:25,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 02:57:25,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:57:25,604 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-04 02:57:25,604 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:57:25,803 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-03-04 02:57:25,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1588358115] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:57:25,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:57:25,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6, 14] total 21 [2025-03-04 02:57:25,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304367824] [2025-03-04 02:57:25,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:57:25,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:57:25,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:57:25,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:57:25,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2025-03-04 02:57:25,805 INFO L87 Difference]: Start difference. First operand 197 states and 261 transitions. Second operand has 7 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 02:57:25,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:57:25,873 INFO L93 Difference]: Finished difference Result 217 states and 286 transitions. [2025-03-04 02:57:25,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:57:25,874 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 97 [2025-03-04 02:57:25,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:57:25,875 INFO L225 Difference]: With dead ends: 217 [2025-03-04 02:57:25,875 INFO L226 Difference]: Without dead ends: 215 [2025-03-04 02:57:25,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2025-03-04 02:57:25,876 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 3 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 02:57:25,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 685 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 02:57:25,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-03-04 02:57:25,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 199. [2025-03-04 02:57:25,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 129 states have (on average 1.2248062015503876) internal successors, (158), 135 states have internal predecessors, (158), 49 states have call successors, (49), 17 states have call predecessors, (49), 20 states have return successors, (56), 46 states have call predecessors, (56), 47 states have call successors, (56) [2025-03-04 02:57:25,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 263 transitions. [2025-03-04 02:57:25,891 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 263 transitions. Word has length 97 [2025-03-04 02:57:25,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:57:25,892 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 263 transitions. [2025-03-04 02:57:25,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 02:57:25,892 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 263 transitions. [2025-03-04 02:57:25,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-04 02:57:25,893 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:57:25,893 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 1, 1, 1, 1, 1, 1] [2025-03-04 02:57:25,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 02:57:26,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:57:26,094 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:57:26,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:57:26,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1336620671, now seen corresponding path program 1 times [2025-03-04 02:57:26,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:57:26,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688744700] [2025-03-04 02:57:26,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:26,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:57:26,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 02:57:26,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 02:57:26,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:26,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:26,565 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-04 02:57:26,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:57:26,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688744700] [2025-03-04 02:57:26,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688744700] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:57:26,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844264360] [2025-03-04 02:57:26,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:26,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:57:26,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:57:26,568 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:57:26,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 02:57:26,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 02:57:26,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 02:57:26,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:26,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:26,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 02:57:26,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:57:26,834 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-04 02:57:26,834 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:57:26,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844264360] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:57:26,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:57:26,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 20 [2025-03-04 02:57:26,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131517768] [2025-03-04 02:57:26,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:57:26,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:57:26,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:57:26,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:57:26,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2025-03-04 02:57:26,835 INFO L87 Difference]: Start difference. First operand 199 states and 263 transitions. Second operand has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 7 states have internal predecessors, (47), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 02:57:26,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:57:26,928 INFO L93 Difference]: Finished difference Result 221 states and 290 transitions. [2025-03-04 02:57:26,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:57:26,928 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 7 states have internal predecessors, (47), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 99 [2025-03-04 02:57:26,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:57:26,930 INFO L225 Difference]: With dead ends: 221 [2025-03-04 02:57:26,930 INFO L226 Difference]: Without dead ends: 219 [2025-03-04 02:57:26,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=412, Unknown=0, NotChecked=0, Total=462 [2025-03-04 02:57:26,931 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 4 mSDsluCounter, 882 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 995 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 02:57:26,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 995 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 02:57:26,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-03-04 02:57:26,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 201. [2025-03-04 02:57:26,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 131 states have (on average 1.2213740458015268) internal successors, (160), 137 states have internal predecessors, (160), 49 states have call successors, (49), 17 states have call predecessors, (49), 20 states have return successors, (56), 46 states have call predecessors, (56), 47 states have call successors, (56) [2025-03-04 02:57:26,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 265 transitions. [2025-03-04 02:57:26,968 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 265 transitions. Word has length 99 [2025-03-04 02:57:26,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:57:26,969 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 265 transitions. [2025-03-04 02:57:26,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 7 states have internal predecessors, (47), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 02:57:26,969 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 265 transitions. [2025-03-04 02:57:26,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-04 02:57:26,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:57:26,970 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:57:26,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 02:57:27,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:57:27,170 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:57:27,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:57:27,171 INFO L85 PathProgramCache]: Analyzing trace with hash -264987059, now seen corresponding path program 1 times [2025-03-04 02:57:27,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:57:27,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286165888] [2025-03-04 02:57:27,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:27,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:57:27,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 02:57:27,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 02:57:27,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:27,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:27,350 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-03-04 02:57:27,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:57:27,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286165888] [2025-03-04 02:57:27,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286165888] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:57:27,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455215291] [2025-03-04 02:57:27,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:27,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:57:27,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:57:27,352 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:57:27,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 02:57:27,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 02:57:27,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 02:57:27,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:27,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:27,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 70 conjuncts are in the unsatisfiable core [2025-03-04 02:57:27,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:57:27,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2025-03-04 02:57:27,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2025-03-04 02:57:28,757 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 34 proven. 25 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-04 02:57:28,757 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:57:29,206 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 78 treesize of output 74 [2025-03-04 02:57:29,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:57:29,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:57:29,227 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 60 treesize of output 56 [2025-03-04 02:57:29,303 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-03-04 02:57:29,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455215291] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:57:29,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:57:29,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [6, 17] total 32 [2025-03-04 02:57:29,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068044993] [2025-03-04 02:57:29,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:57:29,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 02:57:29,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:57:29,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 02:57:29,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2025-03-04 02:57:29,305 INFO L87 Difference]: Start difference. First operand 201 states and 265 transitions. Second operand has 15 states, 13 states have (on average 4.0) internal successors, (52), 11 states have internal predecessors, (52), 8 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 8 states have call predecessors, (12), 7 states have call successors, (12) [2025-03-04 02:57:29,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:57:29,607 INFO L93 Difference]: Finished difference Result 241 states and 314 transitions. [2025-03-04 02:57:29,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 02:57:29,607 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.0) internal successors, (52), 11 states have internal predecessors, (52), 8 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 8 states have call predecessors, (12), 7 states have call successors, (12) Word has length 100 [2025-03-04 02:57:29,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:57:29,608 INFO L225 Difference]: With dead ends: 241 [2025-03-04 02:57:29,609 INFO L226 Difference]: Without dead ends: 104 [2025-03-04 02:57:29,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 166 SyntacticMatches, 8 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=100, Invalid=1022, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 02:57:29,610 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 4 mSDsluCounter, 1248 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1354 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 02:57:29,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1354 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 02:57:29,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-04 02:57:29,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-03-04 02:57:29,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 70 states have internal predecessors, (82), 25 states have call successors, (25), 9 states have call predecessors, (25), 10 states have return successors, (27), 24 states have call predecessors, (27), 24 states have call successors, (27) [2025-03-04 02:57:29,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 134 transitions. [2025-03-04 02:57:29,620 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 134 transitions. Word has length 100 [2025-03-04 02:57:29,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:57:29,620 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 134 transitions. [2025-03-04 02:57:29,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.0) internal successors, (52), 11 states have internal predecessors, (52), 8 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 8 states have call predecessors, (12), 7 states have call successors, (12) [2025-03-04 02:57:29,620 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 134 transitions. [2025-03-04 02:57:29,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-04 02:57:29,621 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:57:29,621 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:57:29,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 02:57:29,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:57:29,822 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:57:29,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:57:29,822 INFO L85 PathProgramCache]: Analyzing trace with hash 487537713, now seen corresponding path program 1 times [2025-03-04 02:57:29,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:57:29,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758271767] [2025-03-04 02:57:29,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:29,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:57:29,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 02:57:29,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 02:57:29,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:29,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:30,163 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-04 02:57:30,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:57:30,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758271767] [2025-03-04 02:57:30,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758271767] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:57:30,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82034462] [2025-03-04 02:57:30,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:30,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:57:30,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:57:30,166 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:57:30,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 02:57:30,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 02:57:30,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 02:57:30,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:30,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:30,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-04 02:57:30,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:57:30,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-03-04 02:57:30,664 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-04 02:57:30,665 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:57:31,189 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 103 treesize of output 95 [2025-03-04 02:57:31,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 95 [2025-03-04 02:57:31,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2025-03-04 02:57:31,301 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-04 02:57:31,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82034462] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:57:31,301 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:57:31,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 41 [2025-03-04 02:57:31,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000402897] [2025-03-04 02:57:31,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:57:31,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-04 02:57:31,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:57:31,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-04 02:57:31,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1521, Unknown=0, NotChecked=0, Total=1640 [2025-03-04 02:57:31,303 INFO L87 Difference]: Start difference. First operand 104 states and 134 transitions. Second operand has 41 states, 40 states have (on average 2.975) internal successors, (119), 35 states have internal predecessors, (119), 13 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (31), 13 states have call predecessors, (31), 12 states have call successors, (31) [2025-03-04 02:57:32,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:57:32,306 INFO L93 Difference]: Finished difference Result 231 states and 316 transitions. [2025-03-04 02:57:32,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 02:57:32,306 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.975) internal successors, (119), 35 states have internal predecessors, (119), 13 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (31), 13 states have call predecessors, (31), 12 states have call successors, (31) Word has length 101 [2025-03-04 02:57:32,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:57:32,308 INFO L225 Difference]: With dead ends: 231 [2025-03-04 02:57:32,308 INFO L226 Difference]: Without dead ends: 137 [2025-03-04 02:57:32,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 179 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=330, Invalid=3330, Unknown=0, NotChecked=0, Total=3660 [2025-03-04 02:57:32,309 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 368 mSDsluCounter, 1775 mSDsCounter, 0 mSdLazyCounter, 1255 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 1857 SdHoareTripleChecker+Invalid, 1441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 1255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 02:57:32,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 1857 Invalid, 1441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 1255 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 02:57:32,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-04 02:57:32,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 111. [2025-03-04 02:57:32,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 74 states have (on average 1.2297297297297298) internal successors, (91), 76 states have internal predecessors, (91), 25 states have call successors, (25), 9 states have call predecessors, (25), 11 states have return successors, (30), 25 states have call predecessors, (30), 24 states have call successors, (30) [2025-03-04 02:57:32,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 146 transitions. [2025-03-04 02:57:32,316 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 146 transitions. Word has length 101 [2025-03-04 02:57:32,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:57:32,316 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 146 transitions. [2025-03-04 02:57:32,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.975) internal successors, (119), 35 states have internal predecessors, (119), 13 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (31), 13 states have call predecessors, (31), 12 states have call successors, (31) [2025-03-04 02:57:32,316 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 146 transitions. [2025-03-04 02:57:32,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-04 02:57:32,317 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:57:32,317 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:57:32,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 02:57:32,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-04 02:57:32,518 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:57:32,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:57:32,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1020014096, now seen corresponding path program 1 times [2025-03-04 02:57:32,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:57:32,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463062264] [2025-03-04 02:57:32,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:32,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:57:32,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 02:57:32,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 02:57:32,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:32,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:32,683 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-03-04 02:57:32,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:57:32,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463062264] [2025-03-04 02:57:32,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463062264] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:57:32,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525972913] [2025-03-04 02:57:32,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:32,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:57:32,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:57:32,685 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:57:32,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 02:57:32,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 02:57:32,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 02:57:32,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:32,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:32,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 100 conjuncts are in the unsatisfiable core [2025-03-04 02:57:32,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:57:32,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 02:57:32,990 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 02:57:32,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 02:57:33,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:57:33,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2025-03-04 02:57:33,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2025-03-04 02:57:33,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 1 [2025-03-04 02:57:37,046 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_41| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_41| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_41|) 24))) (<= 2 |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_41|))) is different from true [2025-03-04 02:57:41,103 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_42| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_42|) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_42| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_42|) 24))))) is different from true [2025-03-04 02:57:45,169 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_36 Int)) (and (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_36 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_36) 24))) (<= 2 v_aws_linked_list_back_~list.base_BEFORE_CALL_36))) is different from true [2025-03-04 02:57:49,226 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_37 Int)) (and (<= 2 v_aws_linked_list_back_~list.base_BEFORE_CALL_37) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_37 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_37) 24))))) is different from true [2025-03-04 02:57:53,274 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_38 Int)) (and (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_38 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_38) 24))) (<= 2 v_aws_linked_list_back_~list.base_BEFORE_CALL_38))) is different from true [2025-03-04 02:58:01,416 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_39 Int)) (and (<= 2 v_aws_linked_list_back_~list.base_BEFORE_CALL_39) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_39 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_39) 24))))) is different from true [2025-03-04 02:58:05,454 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_40 Int)) (and (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_40 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_40) 24))) (<= 2 v_aws_linked_list_back_~list.base_BEFORE_CALL_40))) is different from true [2025-03-04 02:58:06,025 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 73 not checked. [2025-03-04 02:58:06,025 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:58:14,179 INFO L349 Elim1Store]: treesize reduction 58, result has 65.1 percent of original size [2025-03-04 02:58:14,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 3957 treesize of output 3773 [2025-03-04 02:58:14,238 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 3215 treesize of output 3083 [2025-03-04 02:58:14,326 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:58:14,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1424 treesize of output 1336 [2025-03-04 02:58:14,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 877 treesize of output 857 [2025-03-04 02:58:14,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 861 treesize of output 827 [2025-03-04 02:58:15,882 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:58:15,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 72 [2025-03-04 02:58:15,910 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-03-04 02:58:15,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 30 [2025-03-04 02:58:16,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525972913] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:58:16,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:58:16,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 29] total 34 [2025-03-04 02:58:16,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18685271] [2025-03-04 02:58:16,084 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 02:58:16,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-04 02:58:16,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:58:16,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-04 02:58:16,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1935, Unknown=9, NotChecked=658, Total=2756 [2025-03-04 02:58:16,086 INFO L87 Difference]: Start difference. First operand 111 states and 146 transitions. Second operand has 34 states, 32 states have (on average 3.84375) internal successors, (123), 30 states have internal predecessors, (123), 9 states have call successors, (26), 11 states have call predecessors, (26), 13 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2025-03-04 02:58:20,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 02:58:28,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]