./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_compare_lookup_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_compare_lookup_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 8ccdea72ddab462e9567b7f56695cddd8d47da872c9a3d4b09c71a162ef49999 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 12:51:59,320 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 12:51:59,380 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-24 12:51:59,386 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 12:51:59,387 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 12:51:59,406 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 12:51:59,408 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 12:51:59,409 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 12:51:59,409 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 12:51:59,410 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 12:51:59,410 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 12:51:59,410 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 12:51:59,411 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 12:51:59,412 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 12:51:59,413 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 12:51:59,413 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 12:51:59,413 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 12:51:59,414 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 12:51:59,414 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 12:51:59,414 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 12:51:59,414 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 12:51:59,415 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 12:51:59,417 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 12:51:59,418 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 12:51:59,418 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 12:51:59,418 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 12:51:59,418 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 12:51:59,418 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 12:51:59,419 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 12:51:59,419 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 12:51:59,419 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 12:51:59,419 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 12:51:59,419 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 12:51:59,419 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 12:51:59,420 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 12:51:59,420 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 12:51:59,420 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 12:51:59,420 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 12:51:59,420 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 12:51:59,421 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 8ccdea72ddab462e9567b7f56695cddd8d47da872c9a3d4b09c71a162ef49999 [2024-10-24 12:51:59,653 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 12:51:59,672 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 12:51:59,676 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 12:51:59,677 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 12:51:59,677 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 12:51:59,678 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_compare_lookup_harness.i [2024-10-24 12:52:00,985 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 12:52:01,375 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 12:52:01,376 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_compare_lookup_harness.i [2024-10-24 12:52:01,409 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b79f1065e/647bd94113f344c5b8ded8f3e20f021d/FLAG03ff147ee [2024-10-24 12:52:01,424 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b79f1065e/647bd94113f344c5b8ded8f3e20f021d [2024-10-24 12:52:01,426 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 12:52:01,428 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 12:52:01,430 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 12:52:01,430 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 12:52:01,434 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 12:52:01,435 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:52:01" (1/1) ... [2024-10-24 12:52:01,437 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3274533a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:52:01, skipping insertion in model container [2024-10-24 12:52:01,437 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:52:01" (1/1) ... [2024-10-24 12:52:01,520 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 12:52:01,764 WARN L248 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_byte_cursor_compare_lookup_harness.i[4504,4517] [2024-10-24 12:52:01,771 WARN L248 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_byte_cursor_compare_lookup_harness.i[4564,4577] [2024-10-24 12:52:02,358 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:52:02,359 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:52:02,359 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:52:02,360 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:52:02,361 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:52:02,380 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:52:02,382 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:52:02,385 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:52:02,386 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:52:02,763 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:52:02,764 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:52:02,807 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 12:52:02,837 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 12:52:02,847 WARN L248 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_byte_cursor_compare_lookup_harness.i[4504,4517] [2024-10-24 12:52:02,849 WARN L248 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_byte_cursor_compare_lookup_harness.i[4564,4577] [2024-10-24 12:52:02,891 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:52:02,891 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:52:02,891 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:52:02,892 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:52:02,892 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:52:02,896 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:52:02,899 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:52:02,900 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:52:02,904 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:52:03,124 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : "+r"(index)); [8277] [2024-10-24 12:52:03,126 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:52:03,126 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:52:03,137 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [8763-8774] [2024-10-24 12:52:03,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 12:52:03,341 INFO L204 MainTranslator]: Completed translation [2024-10-24 12:52:03,342 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:52:03 WrapperNode [2024-10-24 12:52:03,342 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 12:52:03,343 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 12:52:03,343 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 12:52:03,343 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 12:52:03,348 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:52:03" (1/1) ... [2024-10-24 12:52:03,416 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:52:03" (1/1) ... [2024-10-24 12:52:03,462 INFO L138 Inliner]: procedures = 680, calls = 2635, calls flagged for inlining = 58, calls inlined = 4, statements flattened = 832 [2024-10-24 12:52:03,463 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 12:52:03,463 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 12:52:03,464 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 12:52:03,464 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 12:52:03,472 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:52:03" (1/1) ... [2024-10-24 12:52:03,472 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:52:03" (1/1) ... [2024-10-24 12:52:03,478 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:52:03" (1/1) ... [2024-10-24 12:52:03,517 INFO L175 MemorySlicer]: Split 545 memory accesses to 8 slices as follows [2, 256, 236, 2, 6, 34, 4, 5]. 47 percent of accesses are in the largest equivalence class. The 503 initializations are split as follows [2, 256, 236, 0, 0, 4, 0, 5]. The 5 writes are split as follows [0, 0, 0, 0, 2, 3, 0, 0]. [2024-10-24 12:52:03,517 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:52:03" (1/1) ... [2024-10-24 12:52:03,517 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:52:03" (1/1) ... [2024-10-24 12:52:03,535 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:52:03" (1/1) ... [2024-10-24 12:52:03,538 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:52:03" (1/1) ... [2024-10-24 12:52:03,544 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:52:03" (1/1) ... [2024-10-24 12:52:03,547 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:52:03" (1/1) ... [2024-10-24 12:52:03,555 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 12:52:03,556 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 12:52:03,556 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 12:52:03,556 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 12:52:03,557 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:52:03" (1/1) ... [2024-10-24 12:52:03,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 12:52:03,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:52:03,581 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) [2024-10-24 12:52:03,583 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 [2024-10-24 12:52:03,619 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_is_valid [2024-10-24 12:52:03,620 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_is_valid [2024-10-24 12:52:03,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 12:52:03,620 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2024-10-24 12:52:03,620 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2024-10-24 12:52:03,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 12:52:03,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 12:52:03,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-24 12:52:03,622 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-24 12:52:03,622 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-24 12:52:03,622 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-24 12:52:03,622 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-24 12:52:03,622 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-24 12:52:03,622 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_is_bounded [2024-10-24 12:52:03,622 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_is_bounded [2024-10-24 12:52:03,622 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-24 12:52:03,622 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-24 12:52:03,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 12:52:03,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 12:52:03,622 INFO L130 BoogieDeclarations]: Found specification of procedure save_byte_from_array [2024-10-24 12:52:03,623 INFO L138 BoogieDeclarations]: Found implementation of procedure save_byte_from_array [2024-10-24 12:52:03,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-24 12:52:03,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-24 12:52:03,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-24 12:52:03,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-24 12:52:03,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-10-24 12:52:03,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-10-24 12:52:03,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-10-24 12:52:03,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-10-24 12:52:03,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 12:52:03,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 12:52:03,624 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2024-10-24 12:52:03,624 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2024-10-24 12:52:03,624 INFO L130 BoogieDeclarations]: Found specification of procedure assert_byte_from_buffer_matches [2024-10-24 12:52:03,624 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_byte_from_buffer_matches [2024-10-24 12:52:03,624 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 12:52:03,624 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 12:52:03,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-24 12:52:03,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-24 12:52:03,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-24 12:52:03,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-24 12:52:03,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-24 12:52:03,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-24 12:52:03,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-10-24 12:52:03,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-10-24 12:52:03,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-10-24 12:52:03,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-24 12:52:03,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-24 12:52:03,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-24 12:52:03,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-24 12:52:03,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-10-24 12:52:03,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-10-24 12:52:03,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-10-24 12:52:03,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2024-10-24 12:52:03,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 12:52:03,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 12:52:03,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-24 12:52:03,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-24 12:52:03,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-24 12:52:03,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-24 12:52:03,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-24 12:52:03,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-24 12:52:03,627 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_byte_cursor_has_allocated_buffer_member [2024-10-24 12:52:03,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_byte_cursor_has_allocated_buffer_member [2024-10-24 12:52:03,627 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_compare_lookup [2024-10-24 12:52:03,627 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_compare_lookup [2024-10-24 12:52:03,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 12:52:03,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 12:52:03,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-24 12:52:03,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-24 12:52:03,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-24 12:52:03,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-24 12:52:03,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-24 12:52:03,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-24 12:52:03,900 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 12:52:03,902 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 12:52:04,613 INFO L? ?]: Removed 78 outVars from TransFormulas that were not future-live. [2024-10-24 12:52:04,614 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 12:52:04,720 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 12:52:04,720 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 12:52:04,723 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:52:04 BoogieIcfgContainer [2024-10-24 12:52:04,723 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 12:52:04,725 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 12:52:04,725 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 12:52:04,728 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 12:52:04,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:52:01" (1/3) ... [2024-10-24 12:52:04,729 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f9a0258 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:52:04, skipping insertion in model container [2024-10-24 12:52:04,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:52:03" (2/3) ... [2024-10-24 12:52:04,729 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f9a0258 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:52:04, skipping insertion in model container [2024-10-24 12:52:04,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:52:04" (3/3) ... [2024-10-24 12:52:04,731 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_byte_cursor_compare_lookup_harness.i [2024-10-24 12:52:04,744 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 12:52:04,745 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 12:52:04,803 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 12:52:04,809 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;@68d2bdf0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 12:52:04,809 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 12:52:04,814 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 70 states have (on average 1.3) internal successors, (91), 71 states have internal predecessors, (91), 41 states have call successors, (41), 10 states have call predecessors, (41), 10 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2024-10-24 12:52:04,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-24 12:52:04,823 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:52:04,824 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 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] [2024-10-24 12:52:04,824 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:52:04,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:52:04,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1337947288, now seen corresponding path program 1 times [2024-10-24 12:52:04,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:52:04,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994890676] [2024-10-24 12:52:04,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:52:04,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:52:05,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:05,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:52:05,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:05,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-24 12:52:05,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:05,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 12:52:05,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:05,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:52:05,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:05,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 12:52:05,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:05,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 12:52:05,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:05,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 12:52:05,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:05,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 12:52:05,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:05,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 12:52:05,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:05,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 12:52:05,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:05,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 12:52:05,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:05,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 12:52:05,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:05,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 12:52:05,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:05,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 12:52:05,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:05,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 12:52:05,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:06,004 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-10-24 12:52:06,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:52:06,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994890676] [2024-10-24 12:52:06,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994890676] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 12:52:06,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142664775] [2024-10-24 12:52:06,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:52:06,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:52:06,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:52:06,009 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) [2024-10-24 12:52:06,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 12:52:06,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:06,487 INFO L255 TraceCheckSpWp]: Trace formula consists of 2626 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 12:52:06,496 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 12:52:06,622 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-24 12:52:06,623 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 12:52:06,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142664775] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:52:06,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 12:52:06,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2024-10-24 12:52:06,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066660757] [2024-10-24 12:52:06,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:52:06,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 12:52:06,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:52:06,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 12:52:06,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-24 12:52:06,655 INFO L87 Difference]: Start difference. First operand has 123 states, 70 states have (on average 1.3) internal successors, (91), 71 states have internal predecessors, (91), 41 states have call successors, (41), 10 states have call predecessors, (41), 10 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-24 12:52:06,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:52:06,984 INFO L93 Difference]: Finished difference Result 245 states and 379 transitions. [2024-10-24 12:52:06,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 12:52:06,986 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 86 [2024-10-24 12:52:06,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:52:06,996 INFO L225 Difference]: With dead ends: 245 [2024-10-24 12:52:06,996 INFO L226 Difference]: Without dead ends: 122 [2024-10-24 12:52:07,002 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-24 12:52:07,005 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 23 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 12:52:07,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 389 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 12:52:07,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-10-24 12:52:07,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-10-24 12:52:07,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 69 states have (on average 1.2463768115942029) internal successors, (86), 71 states have internal predecessors, (86), 41 states have call successors, (41), 10 states have call predecessors, (41), 11 states have return successors, (48), 40 states have call predecessors, (48), 40 states have call successors, (48) [2024-10-24 12:52:07,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 175 transitions. [2024-10-24 12:52:07,057 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 175 transitions. Word has length 86 [2024-10-24 12:52:07,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:52:07,057 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 175 transitions. [2024-10-24 12:52:07,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-24 12:52:07,058 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 175 transitions. [2024-10-24 12:52:07,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-24 12:52:07,061 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:52:07,061 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:52:07,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 12:52:07,262 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 [2024-10-24 12:52:07,262 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:52:07,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:52:07,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1267886531, now seen corresponding path program 1 times [2024-10-24 12:52:07,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:52:07,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127072325] [2024-10-24 12:52:07,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:52:07,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:52:07,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:07,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:52:07,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:07,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-24 12:52:07,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:07,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 12:52:07,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:07,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:52:07,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:07,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 12:52:07,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:07,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 12:52:07,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:07,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 12:52:07,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:07,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 12:52:07,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:07,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 12:52:07,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:07,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:52:07,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:08,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 12:52:08,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:08,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 12:52:08,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:08,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 12:52:08,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:08,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 12:52:08,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:08,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 12:52:08,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:08,042 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-10-24 12:52:08,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:52:08,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127072325] [2024-10-24 12:52:08,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127072325] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 12:52:08,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867544189] [2024-10-24 12:52:08,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:52:08,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:52:08,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:52:08,048 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) [2024-10-24 12:52:08,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 12:52:08,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:08,491 INFO L255 TraceCheckSpWp]: Trace formula consists of 2631 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 12:52:08,497 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 12:52:08,631 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-10-24 12:52:08,631 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 12:52:08,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867544189] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:52:08,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 12:52:08,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2024-10-24 12:52:08,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918203594] [2024-10-24 12:52:08,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:52:08,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 12:52:08,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:52:08,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 12:52:08,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-10-24 12:52:08,638 INFO L87 Difference]: Start difference. First operand 122 states and 175 transitions. Second operand has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 4 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-24 12:52:09,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:52:09,345 INFO L93 Difference]: Finished difference Result 200 states and 291 transitions. [2024-10-24 12:52:09,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 12:52:09,350 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 4 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 88 [2024-10-24 12:52:09,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:52:09,355 INFO L225 Difference]: With dead ends: 200 [2024-10-24 12:52:09,355 INFO L226 Difference]: Without dead ends: 122 [2024-10-24 12:52:09,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-10-24 12:52:09,358 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 53 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 12:52:09,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 612 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 12:52:09,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-10-24 12:52:09,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-10-24 12:52:09,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 69 states have (on average 1.2463768115942029) internal successors, (86), 71 states have internal predecessors, (86), 41 states have call successors, (41), 10 states have call predecessors, (41), 11 states have return successors, (45), 40 states have call predecessors, (45), 40 states have call successors, (45) [2024-10-24 12:52:09,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 172 transitions. [2024-10-24 12:52:09,384 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 172 transitions. Word has length 88 [2024-10-24 12:52:09,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:52:09,384 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 172 transitions. [2024-10-24 12:52:09,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 4 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-24 12:52:09,385 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 172 transitions. [2024-10-24 12:52:09,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-24 12:52:09,387 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:52:09,387 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:52:09,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 12:52:09,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-10-24 12:52:09,589 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:52:09,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:52:09,589 INFO L85 PathProgramCache]: Analyzing trace with hash -779271971, now seen corresponding path program 2 times [2024-10-24 12:52:09,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:52:09,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598904813] [2024-10-24 12:52:09,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:52:09,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:52:09,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:10,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:52:10,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:10,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-24 12:52:10,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:10,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 12:52:10,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:10,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:52:10,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:10,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 12:52:10,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:10,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 12:52:10,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:10,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 12:52:10,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:10,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 12:52:10,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:10,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 12:52:10,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:10,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:52:10,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:10,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 12:52:10,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:10,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 12:52:10,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:10,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:52:10,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:10,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:52:10,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:10,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 12:52:10,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:10,214 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-10-24 12:52:10,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:52:10,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598904813] [2024-10-24 12:52:10,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598904813] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 12:52:10,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930061632] [2024-10-24 12:52:10,215 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 12:52:10,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:52:10,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:52:10,217 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) [2024-10-24 12:52:10,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 12:52:10,556 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-24 12:52:10,556 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 12:52:10,565 INFO L255 TraceCheckSpWp]: Trace formula consists of 2309 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-24 12:52:10,568 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 12:52:10,638 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-10-24 12:52:10,639 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 12:52:10,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930061632] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:52:10,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 12:52:10,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2024-10-24 12:52:10,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266426193] [2024-10-24 12:52:10,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:52:10,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 12:52:10,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:52:10,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 12:52:10,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2024-10-24 12:52:10,643 INFO L87 Difference]: Start difference. First operand 122 states and 172 transitions. Second operand has 8 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 12:52:11,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:52:11,259 INFO L93 Difference]: Finished difference Result 133 states and 192 transitions. [2024-10-24 12:52:11,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 12:52:11,260 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 92 [2024-10-24 12:52:11,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:52:11,262 INFO L225 Difference]: With dead ends: 133 [2024-10-24 12:52:11,262 INFO L226 Difference]: Without dead ends: 131 [2024-10-24 12:52:11,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2024-10-24 12:52:11,263 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 3 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 12:52:11,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1120 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 12:52:11,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-24 12:52:11,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2024-10-24 12:52:11,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 74 states have (on average 1.2297297297297298) internal successors, (91), 77 states have internal predecessors, (91), 42 states have call successors, (42), 11 states have call predecessors, (42), 13 states have return successors, (56), 41 states have call predecessors, (56), 41 states have call successors, (56) [2024-10-24 12:52:11,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 189 transitions. [2024-10-24 12:52:11,273 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 189 transitions. Word has length 92 [2024-10-24 12:52:11,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:52:11,274 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 189 transitions. [2024-10-24 12:52:11,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 12:52:11,274 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 189 transitions. [2024-10-24 12:52:11,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-24 12:52:11,276 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:52:11,276 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:52:11,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-24 12:52:11,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:52:11,481 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:52:11,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:52:11,482 INFO L85 PathProgramCache]: Analyzing trace with hash 961975955, now seen corresponding path program 1 times [2024-10-24 12:52:11,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:52:11,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692152255] [2024-10-24 12:52:11,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:52:11,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:52:11,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:11,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:52:11,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:11,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-24 12:52:11,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:11,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 12:52:11,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:11,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:52:11,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:11,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 12:52:11,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:11,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 12:52:11,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:11,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 12:52:11,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:11,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 12:52:11,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:11,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 12:52:11,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:11,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:52:11,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:11,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 12:52:11,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:11,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 12:52:11,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:11,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:52:11,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:11,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:52:11,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:11,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 12:52:11,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:11,977 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-10-24 12:52:11,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:52:11,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692152255] [2024-10-24 12:52:11,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692152255] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 12:52:11,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735694874] [2024-10-24 12:52:11,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:52:11,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:52:11,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:52:11,981 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) [2024-10-24 12:52:11,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-24 12:52:12,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:12,355 INFO L255 TraceCheckSpWp]: Trace formula consists of 2650 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 12:52:12,358 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 12:52:12,439 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 12:52:12,439 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 12:52:12,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [735694874] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:52:12,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 12:52:12,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2024-10-24 12:52:12,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413462989] [2024-10-24 12:52:12,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:52:12,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 12:52:12,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:52:12,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 12:52:12,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-10-24 12:52:12,441 INFO L87 Difference]: Start difference. First operand 130 states and 189 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 6 states have internal predecessors, (42), 4 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-24 12:52:13,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:52:13,102 INFO L93 Difference]: Finished difference Result 259 states and 391 transitions. [2024-10-24 12:52:13,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 12:52:13,102 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 6 states have internal predecessors, (42), 4 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 92 [2024-10-24 12:52:13,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:52:13,104 INFO L225 Difference]: With dead ends: 259 [2024-10-24 12:52:13,104 INFO L226 Difference]: Without dead ends: 159 [2024-10-24 12:52:13,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-10-24 12:52:13,106 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 52 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 12:52:13,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 688 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 12:52:13,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-10-24 12:52:13,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2024-10-24 12:52:13,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 88 states have (on average 1.25) internal successors, (110), 91 states have internal predecessors, (110), 56 states have call successors, (56), 12 states have call predecessors, (56), 14 states have return successors, (74), 55 states have call predecessors, (74), 55 states have call successors, (74) [2024-10-24 12:52:13,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 240 transitions. [2024-10-24 12:52:13,126 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 240 transitions. Word has length 92 [2024-10-24 12:52:13,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:52:13,127 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 240 transitions. [2024-10-24 12:52:13,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 6 states have internal predecessors, (42), 4 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-24 12:52:13,127 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 240 transitions. [2024-10-24 12:52:13,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-24 12:52:13,132 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:52:13,132 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 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] [2024-10-24 12:52:13,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-24 12:52:13,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:52:13,333 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:52:13,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:52:13,333 INFO L85 PathProgramCache]: Analyzing trace with hash -288324210, now seen corresponding path program 1 times [2024-10-24 12:52:13,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:52:13,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092998953] [2024-10-24 12:52:13,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:52:13,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:52:13,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:14,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:52:14,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:14,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-24 12:52:14,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:14,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 12:52:14,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:14,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:52:14,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:14,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 12:52:14,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:14,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 12:52:14,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:14,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 12:52:14,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:14,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 12:52:14,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:14,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 12:52:14,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:14,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:52:14,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:14,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 12:52:14,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:14,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 12:52:14,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:14,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 12:52:14,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:14,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 12:52:14,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:14,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 12:52:14,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:14,258 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-10-24 12:52:14,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:52:14,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092998953] [2024-10-24 12:52:14,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092998953] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:52:14,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:52:14,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 12:52:14,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078671874] [2024-10-24 12:52:14,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:52:14,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 12:52:14,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:52:14,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 12:52:14,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-24 12:52:14,263 INFO L87 Difference]: Start difference. First operand 159 states and 240 transitions. Second operand has 10 states, 8 states have (on average 4.25) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (17), 4 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 12:52:16,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:52:16,559 INFO L93 Difference]: Finished difference Result 172 states and 255 transitions. [2024-10-24 12:52:16,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 12:52:16,559 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 4.25) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (17), 4 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 94 [2024-10-24 12:52:16,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:52:16,561 INFO L225 Difference]: With dead ends: 172 [2024-10-24 12:52:16,561 INFO L226 Difference]: Without dead ends: 170 [2024-10-24 12:52:16,562 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2024-10-24 12:52:16,562 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 129 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 1049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-24 12:52:16,563 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 370 Invalid, 1049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 921 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-24 12:52:16,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-10-24 12:52:16,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 165. [2024-10-24 12:52:16,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 91 states have (on average 1.2417582417582418) internal successors, (113), 94 states have internal predecessors, (113), 58 states have call successors, (58), 13 states have call predecessors, (58), 15 states have return successors, (76), 57 states have call predecessors, (76), 57 states have call successors, (76) [2024-10-24 12:52:16,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 247 transitions. [2024-10-24 12:52:16,596 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 247 transitions. Word has length 94 [2024-10-24 12:52:16,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:52:16,597 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 247 transitions. [2024-10-24 12:52:16,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 4.25) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (17), 4 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 12:52:16,597 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 247 transitions. [2024-10-24 12:52:16,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-24 12:52:16,598 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:52:16,598 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:52:16,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 12:52:16,598 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:52:16,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:52:16,599 INFO L85 PathProgramCache]: Analyzing trace with hash -4204784, now seen corresponding path program 1 times [2024-10-24 12:52:16,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:52:16,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536820250] [2024-10-24 12:52:16,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:52:16,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:52:16,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:18,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:52:18,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:18,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-24 12:52:18,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:18,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 12:52:18,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:18,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:52:18,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:18,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 12:52:18,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:18,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 12:52:18,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:18,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 12:52:18,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:18,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 12:52:18,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:18,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 12:52:18,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:18,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:52:18,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:18,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 12:52:18,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:18,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 12:52:18,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:18,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 12:52:18,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:18,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 12:52:18,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:18,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 12:52:18,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:18,571 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-24 12:52:18,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:52:18,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536820250] [2024-10-24 12:52:18,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536820250] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 12:52:18,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309991312] [2024-10-24 12:52:18,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:52:18,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:52:18,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:52:18,573 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) [2024-10-24 12:52:18,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-24 12:52:18,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:18,961 INFO L255 TraceCheckSpWp]: Trace formula consists of 2658 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-10-24 12:52:18,966 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 12:52:18,993 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 10 treesize of output 8 [2024-10-24 12:52:19,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-24 12:52:19,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2024-10-24 12:52:20,902 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 45 proven. 13 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 12:52:20,903 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 12:52:21,140 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_414 (Array Int Int)) (|ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#rhs~0#1.offset| Int)) (or (not (= v_ArrVal_414 (let ((.cse0 (+ |ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#rhs~0#1.offset| 8))) (store (store (select |c_#memory_int#5| |c_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#rhs~0#1.base|) |ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#rhs~0#1.offset| (select (select |c_#memory_int#5| |c_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#lhs~0#1.base|) |c_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#lhs~0#1.offset|)) .cse0 (select v_ArrVal_414 .cse0))))) (< (mod (select (select (store |c_#memory_int#5| |c_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#rhs~0#1.base| v_ArrVal_414) |c_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#lhs~0#1.base|) |c_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#lhs~0#1.offset|) 18446744073709551616) 1))) is different from false [2024-10-24 12:52:21,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309991312] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 12:52:21,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 12:52:21,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16] total 24 [2024-10-24 12:52:21,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855644731] [2024-10-24 12:52:21,152 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 12:52:21,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-24 12:52:21,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:52:21,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-24 12:52:21,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=661, Unknown=1, NotChecked=52, Total=812 [2024-10-24 12:52:21,154 INFO L87 Difference]: Start difference. First operand 165 states and 247 transitions. Second operand has 24 states, 23 states have (on average 3.6956521739130435) internal successors, (85), 21 states have internal predecessors, (85), 9 states have call successors, (33), 7 states have call predecessors, (33), 6 states have return successors, (30), 8 states have call predecessors, (30), 8 states have call successors, (30) [2024-10-24 12:52:29,576 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] [2024-10-24 12:52:33,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:52:33,619 INFO L93 Difference]: Finished difference Result 593 states and 923 transitions. [2024-10-24 12:52:33,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-10-24 12:52:33,620 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.6956521739130435) internal successors, (85), 21 states have internal predecessors, (85), 9 states have call successors, (33), 7 states have call predecessors, (33), 6 states have return successors, (30), 8 states have call predecessors, (30), 8 states have call successors, (30) Word has length 98 [2024-10-24 12:52:33,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:52:33,623 INFO L225 Difference]: With dead ends: 593 [2024-10-24 12:52:33,623 INFO L226 Difference]: Without dead ends: 468 [2024-10-24 12:52:33,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 180 SyntacticMatches, 21 SemanticMatches, 63 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1207 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=557, Invalid=3478, Unknown=1, NotChecked=124, Total=4160 [2024-10-24 12:52:33,626 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 529 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 2882 mSolverCounterSat, 536 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 3419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 536 IncrementalHoareTripleChecker+Valid, 2882 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2024-10-24 12:52:33,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 385 Invalid, 3419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [536 Valid, 2882 Invalid, 1 Unknown, 0 Unchecked, 10.2s Time] [2024-10-24 12:52:33,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2024-10-24 12:52:33,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 405. [2024-10-24 12:52:33,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 233 states have (on average 1.257510729613734) internal successors, (293), 237 states have internal predecessors, (293), 138 states have call successors, (138), 32 states have call predecessors, (138), 33 states have return successors, (176), 135 states have call predecessors, (176), 135 states have call successors, (176) [2024-10-24 12:52:33,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 607 transitions. [2024-10-24 12:52:33,671 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 607 transitions. Word has length 98 [2024-10-24 12:52:33,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:52:33,673 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 607 transitions. [2024-10-24 12:52:33,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.6956521739130435) internal successors, (85), 21 states have internal predecessors, (85), 9 states have call successors, (33), 7 states have call predecessors, (33), 6 states have return successors, (30), 8 states have call predecessors, (30), 8 states have call successors, (30) [2024-10-24 12:52:33,673 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 607 transitions. [2024-10-24 12:52:33,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 12:52:33,675 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:52:33,675 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1] [2024-10-24 12:52:33,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-24 12:52:33,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:52:33,880 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:52:33,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:52:33,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1069911465, now seen corresponding path program 1 times [2024-10-24 12:52:33,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:52:33,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758549663] [2024-10-24 12:52:33,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:52:33,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:52:33,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:34,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:52:34,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:34,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-24 12:52:34,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:34,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 12:52:34,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:34,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:52:34,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:34,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 12:52:34,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:34,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 12:52:34,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:34,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 12:52:34,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:34,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 12:52:34,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:34,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 12:52:34,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:34,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:52:34,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:34,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 12:52:34,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:34,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 12:52:34,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:34,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 12:52:34,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:34,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 12:52:34,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:34,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 12:52:34,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:34,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 12:52:34,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:34,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 12:52:34,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:34,576 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-10-24 12:52:34,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:52:34,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758549663] [2024-10-24 12:52:34,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758549663] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:52:34,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:52:34,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 12:52:34,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165288517] [2024-10-24 12:52:34,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:52:34,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 12:52:34,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:52:34,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 12:52:34,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-24 12:52:34,578 INFO L87 Difference]: Start difference. First operand 405 states and 607 transitions. Second operand has 10 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (19), 4 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 12:52:36,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:52:36,861 INFO L93 Difference]: Finished difference Result 431 states and 638 transitions. [2024-10-24 12:52:36,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 12:52:36,862 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (19), 4 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 107 [2024-10-24 12:52:36,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:52:36,865 INFO L225 Difference]: With dead ends: 431 [2024-10-24 12:52:36,865 INFO L226 Difference]: Without dead ends: 429 [2024-10-24 12:52:36,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2024-10-24 12:52:36,866 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 129 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 920 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 1046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-24 12:52:36,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 369 Invalid, 1046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 920 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-24 12:52:36,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2024-10-24 12:52:36,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 417. [2024-10-24 12:52:36,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 239 states have (on average 1.2510460251046025) internal successors, (299), 243 states have internal predecessors, (299), 142 states have call successors, (142), 34 states have call predecessors, (142), 35 states have return successors, (180), 139 states have call predecessors, (180), 139 states have call successors, (180) [2024-10-24 12:52:36,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 621 transitions. [2024-10-24 12:52:36,938 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 621 transitions. Word has length 107 [2024-10-24 12:52:36,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:52:36,938 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 621 transitions. [2024-10-24 12:52:36,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (19), 4 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 12:52:36,939 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 621 transitions. [2024-10-24 12:52:36,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 12:52:36,940 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:52:36,940 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1] [2024-10-24 12:52:36,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 12:52:36,941 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:52:36,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:52:36,941 INFO L85 PathProgramCache]: Analyzing trace with hash 532515668, now seen corresponding path program 1 times [2024-10-24 12:52:36,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:52:36,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788616950] [2024-10-24 12:52:36,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:52:36,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:52:37,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:37,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:52:37,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:37,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-24 12:52:37,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:37,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 12:52:37,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:37,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:52:37,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:37,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 12:52:37,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:37,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 12:52:37,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:37,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 12:52:37,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:37,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 12:52:37,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:37,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 12:52:37,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:37,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:52:37,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:37,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 12:52:37,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:37,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 12:52:37,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:37,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 12:52:37,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:37,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 12:52:37,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:37,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 12:52:37,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:37,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 12:52:37,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:37,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 12:52:37,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:37,643 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-10-24 12:52:37,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:52:37,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788616950] [2024-10-24 12:52:37,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788616950] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:52:37,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:52:37,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 12:52:37,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346050086] [2024-10-24 12:52:37,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:52:37,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 12:52:37,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:52:37,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 12:52:37,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-24 12:52:37,645 INFO L87 Difference]: Start difference. First operand 417 states and 621 transitions. Second operand has 10 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (19), 4 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 12:52:39,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:52:39,222 INFO L93 Difference]: Finished difference Result 449 states and 661 transitions. [2024-10-24 12:52:39,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 12:52:39,223 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (19), 4 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 107 [2024-10-24 12:52:39,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:52:39,225 INFO L225 Difference]: With dead ends: 449 [2024-10-24 12:52:39,226 INFO L226 Difference]: Without dead ends: 447 [2024-10-24 12:52:39,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2024-10-24 12:52:39,227 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 129 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 920 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 1046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-24 12:52:39,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 369 Invalid, 1046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 920 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-24 12:52:39,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2024-10-24 12:52:39,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 432. [2024-10-24 12:52:39,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 245 states have (on average 1.2448979591836735) internal successors, (305), 249 states have internal predecessors, (305), 149 states have call successors, (149), 36 states have call predecessors, (149), 37 states have return successors, (187), 146 states have call predecessors, (187), 146 states have call successors, (187) [2024-10-24 12:52:39,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 641 transitions. [2024-10-24 12:52:39,265 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 641 transitions. Word has length 107 [2024-10-24 12:52:39,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:52:39,265 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 641 transitions. [2024-10-24 12:52:39,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (19), 4 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 12:52:39,265 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 641 transitions. [2024-10-24 12:52:39,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-24 12:52:39,266 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:52:39,266 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:52:39,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 12:52:39,267 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:52:39,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:52:39,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1140163744, now seen corresponding path program 2 times [2024-10-24 12:52:39,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:52:39,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315268817] [2024-10-24 12:52:39,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:52:39,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:52:39,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:40,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:52:40,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:40,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-24 12:52:40,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:40,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 12:52:40,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:40,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:52:40,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:40,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 12:52:40,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:40,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 12:52:40,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:40,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 12:52:40,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:40,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 12:52:40,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:40,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 12:52:40,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:40,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 12:52:40,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:40,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 12:52:40,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:40,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 12:52:40,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:40,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 12:52:40,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:40,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 12:52:40,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:40,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 12:52:40,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:40,791 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-10-24 12:52:40,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:52:40,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315268817] [2024-10-24 12:52:40,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315268817] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 12:52:40,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778835524] [2024-10-24 12:52:40,791 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 12:52:40,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:52:40,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:52:40,793 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) [2024-10-24 12:52:40,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-24 12:52:41,185 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 12:52:41,186 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 12:52:41,199 INFO L255 TraceCheckSpWp]: Trace formula consists of 2682 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-10-24 12:52:41,205 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 12:52:41,212 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 10 treesize of output 8 [2024-10-24 12:52:41,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2024-10-24 12:52:45,301 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#rhs~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#lhs~0#1.base_BEFORE_CALL_31| Int)) (and (= (select (select |c_#memory_int#5| |v_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#lhs~0#1.base_BEFORE_CALL_31|) 0) (select (select |c_#memory_int#5| |v_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#rhs~0#1.base_BEFORE_CALL_25|) 0)) (not (= |v_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#lhs~0#1.base_BEFORE_CALL_31| |v_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#rhs~0#1.base_BEFORE_CALL_25|)))) is different from true [2024-10-24 12:52:49,385 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#rhs~0#1.base_BEFORE_CALL_26| Int) (|v_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#lhs~0#1.base_BEFORE_CALL_32| Int)) (and (= (select (select |c_#memory_int#5| |v_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#lhs~0#1.base_BEFORE_CALL_32|) 0) (select (select |c_#memory_int#5| |v_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#rhs~0#1.base_BEFORE_CALL_26|) 0)) (not (= |v_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#lhs~0#1.base_BEFORE_CALL_32| |v_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#rhs~0#1.base_BEFORE_CALL_26|)))) is different from true [2024-10-24 12:52:53,490 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_aws_byte_cursor_compare_lookup_~rhs.base_BEFORE_CALL_4 Int) (v_aws_byte_cursor_compare_lookup_~lhs.base_BEFORE_CALL_14 Int)) (and (not (= v_aws_byte_cursor_compare_lookup_~lhs.base_BEFORE_CALL_14 v_aws_byte_cursor_compare_lookup_~rhs.base_BEFORE_CALL_4)) (= (select (select |c_#memory_int#5| v_aws_byte_cursor_compare_lookup_~rhs.base_BEFORE_CALL_4) 0) (select (select |c_#memory_int#5| v_aws_byte_cursor_compare_lookup_~lhs.base_BEFORE_CALL_14) 0)))) is different from true [2024-10-24 12:52:57,562 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_aws_byte_cursor_compare_lookup_~rhs.base_BEFORE_CALL_5 Int) (v_aws_byte_cursor_compare_lookup_~lhs.base_BEFORE_CALL_15 Int)) (and (not (= v_aws_byte_cursor_compare_lookup_~lhs.base_BEFORE_CALL_15 v_aws_byte_cursor_compare_lookup_~rhs.base_BEFORE_CALL_5)) (= (select (select |c_#memory_int#5| v_aws_byte_cursor_compare_lookup_~lhs.base_BEFORE_CALL_15) 0) (select (select |c_#memory_int#5| v_aws_byte_cursor_compare_lookup_~rhs.base_BEFORE_CALL_5) 0)))) is different from true [2024-10-24 12:53:01,636 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_aws_byte_cursor_compare_lookup_~lhs.base_BEFORE_CALL_16 Int) (v_aws_byte_cursor_compare_lookup_~rhs.base_BEFORE_CALL_6 Int)) (and (not (= v_aws_byte_cursor_compare_lookup_~lhs.base_BEFORE_CALL_16 v_aws_byte_cursor_compare_lookup_~rhs.base_BEFORE_CALL_6)) (= (select (select |c_#memory_int#5| v_aws_byte_cursor_compare_lookup_~lhs.base_BEFORE_CALL_16) 0) (select (select |c_#memory_int#5| v_aws_byte_cursor_compare_lookup_~rhs.base_BEFORE_CALL_6) 0)))) is different from true [2024-10-24 12:53:02,633 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 52 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 29 not checked. [2024-10-24 12:53:02,633 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 12:53:07,309 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-24 12:53:07,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 46 [2024-10-24 12:53:07,335 INFO L349 Elim1Store]: treesize reduction 43, result has 23.2 percent of original size [2024-10-24 12:53:07,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 23 [2024-10-24 12:53:07,339 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 12:53:07,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2024-10-24 12:53:07,463 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 28 proven. 5 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-10-24 12:53:07,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778835524] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 12:53:07,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 12:53:07,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 20, 13] total 40 [2024-10-24 12:53:07,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906445548] [2024-10-24 12:53:07,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 12:53:07,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-10-24 12:53:07,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:53:07,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-10-24 12:53:07,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1089, Unknown=6, NotChecked=350, Total=1560 [2024-10-24 12:53:07,466 INFO L87 Difference]: Start difference. First operand 432 states and 641 transitions. Second operand has 40 states, 37 states have (on average 3.189189189189189) internal successors, (118), 34 states have internal predecessors, (118), 12 states have call successors, (47), 12 states have call predecessors, (47), 12 states have return successors, (43), 11 states have call predecessors, (43), 12 states have call successors, (43) [2024-10-24 12:53:14,225 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] [2024-10-24 12:53:18,446 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, 1] [2024-10-24 12:53:26,827 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, 1] [2024-10-24 12:53:30,841 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, 1]