./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_rend_harness_negated.i --full-output --preprocessor.use.memory.slicer true --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version abd6749d 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 ../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_rend_harness_negated.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash f24a61d23dc63fa137ac17d2eae1e2d1b68ccac0bb4c672bf225a31504faa393 --preprocessor.use.memory.slicer true --- Real Ultimate output --- This is Ultimate 0.2.3-?-abd6749-m [2023-11-23 07:31:38,891 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 07:31:38,971 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-23 07:31:38,976 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 07:31:38,977 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 07:31:38,998 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 07:31:38,999 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 07:31:38,999 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 07:31:39,000 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 07:31:39,003 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 07:31:39,003 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 07:31:39,004 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 07:31:39,004 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 07:31:39,005 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 07:31:39,005 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 07:31:39,005 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 07:31:39,006 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 07:31:39,006 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 07:31:39,006 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 07:31:39,006 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 07:31:39,006 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 07:31:39,007 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 07:31:39,007 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 07:31:39,007 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 07:31:39,008 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 07:31:39,008 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 07:31:39,008 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 07:31:39,008 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 07:31:39,008 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 07:31:39,009 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 07:31:39,009 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 07:31:39,009 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 07:31:39,010 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 07:31:39,010 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 07:31:39,010 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 07:31:39,010 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 07:31:39,010 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 07:31:39,010 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 07:31:39,011 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 07:31:39,011 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 -> f24a61d23dc63fa137ac17d2eae1e2d1b68ccac0bb4c672bf225a31504faa393 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> true [2023-11-23 07:31:39,217 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 07:31:39,236 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 07:31:39,238 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 07:31:39,239 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 07:31:39,239 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 07:31:39,241 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_rend_harness_negated.i [2023-11-23 07:31:40,290 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 07:31:40,677 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 07:31:40,677 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_rend_harness_negated.i [2023-11-23 07:31:40,704 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/663759011/802cc2e2fefb46dd8d75815adcb91063/FLAG105f9cd69 [2023-11-23 07:31:40,718 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/663759011/802cc2e2fefb46dd8d75815adcb91063 [2023-11-23 07:31:40,720 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 07:31:40,721 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 07:31:40,722 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 07:31:40,722 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 07:31:40,726 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 07:31:40,727 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:31:40" (1/1) ... [2023-11-23 07:31:40,729 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@408e2f6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:31:40, skipping insertion in model container [2023-11-23 07:31:40,729 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:31:40" (1/1) ... [2023-11-23 07:31:40,798 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 07:31:41,019 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_rend_harness_negated.i[4494,4507] [2023-11-23 07:31:41,030 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_rend_harness_negated.i[4554,4567] [2023-11-23 07:31:41,688 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:31:41,688 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:31:41,689 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:31:41,689 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:31:41,690 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:31:41,700 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:31:41,707 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:31:41,709 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:31:41,709 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:31:41,711 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:31:41,711 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:31:41,712 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:31:41,713 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:31:41,942 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 07:31:41,943 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 07:31:41,944 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 07:31:41,945 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 07:31:41,948 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 07:31:41,948 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 07:31:41,949 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 07:31:41,949 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 07:31:41,950 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 07:31:41,954 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 07:31:42,119 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 07:31:42,161 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 07:31:42,177 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_rend_harness_negated.i[4494,4507] [2023-11-23 07:31:42,179 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_rend_harness_negated.i[4554,4567] [2023-11-23 07:31:42,208 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:31:42,210 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:31:42,210 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:31:42,210 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:31:42,211 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:31:42,226 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:31:42,227 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:31:42,228 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:31:42,228 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:31:42,229 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:31:42,229 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:31:42,229 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:31:42,230 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:31:42,251 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 07:31:42,256 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 07:31:42,257 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 07:31:42,257 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 07:31:42,258 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 07:31:42,263 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 07:31:42,264 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 07:31:42,264 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 07:31:42,264 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 07:31:42,264 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 07:31:42,290 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 07:31:42,453 WARN L675 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:31:42,453 WARN L675 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:31:42,453 WARN L675 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:31:42,453 WARN L675 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:31:42,453 WARN L675 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:31:42,454 WARN L675 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:31:42,454 WARN L675 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:31:42,455 WARN L675 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:31:42,455 WARN L675 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:31:42,455 WARN L675 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:31:42,455 WARN L675 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:31:42,456 WARN L675 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:31:42,456 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:31:42,456 WARN L675 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:31:42,456 WARN L675 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:31:42,456 WARN L675 CHandler]: The function aws_array_list_ensure_capacity is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:31:42,463 INFO L206 MainTranslator]: Completed translation [2023-11-23 07:31:42,464 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:31:42 WrapperNode [2023-11-23 07:31:42,464 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 07:31:42,465 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 07:31:42,465 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 07:31:42,465 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 07:31:42,470 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:31:42" (1/1) ... [2023-11-23 07:31:42,523 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:31:42" (1/1) ... [2023-11-23 07:31:42,549 INFO L138 Inliner]: procedures = 678, calls = 1040, calls flagged for inlining = 52, calls inlined = 6, statements flattened = 135 [2023-11-23 07:31:42,550 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 07:31:42,551 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 07:31:42,551 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 07:31:42,551 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 07:31:42,562 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:31:42" (1/1) ... [2023-11-23 07:31:42,562 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:31:42" (1/1) ... [2023-11-23 07:31:42,565 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:31:42" (1/1) ... [2023-11-23 07:31:42,594 INFO L188 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 5, 14]. 67 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 6 writes are split as follows [0, 0, 6]. [2023-11-23 07:31:42,594 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:31:42" (1/1) ... [2023-11-23 07:31:42,595 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:31:42" (1/1) ... [2023-11-23 07:31:42,608 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:31:42" (1/1) ... [2023-11-23 07:31:42,619 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:31:42" (1/1) ... [2023-11-23 07:31:42,626 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:31:42" (1/1) ... [2023-11-23 07:31:42,633 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:31:42" (1/1) ... [2023-11-23 07:31:42,637 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 07:31:42,640 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 07:31:42,640 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 07:31:42,640 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 07:31:42,641 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:31:42" (1/1) ... [2023-11-23 07:31:42,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 07:31:42,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:31:42,685 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 07:31:42,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 07:31:42,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 07:31:42,727 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-23 07:31:42,727 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-23 07:31:42,727 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2023-11-23 07:31:42,727 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2023-11-23 07:31:42,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 07:31:42,727 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2023-11-23 07:31:42,727 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2023-11-23 07:31:42,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 07:31:42,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-23 07:31:42,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-23 07:31:42,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-23 07:31:42,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 07:31:42,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 07:31:42,728 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 07:31:42,728 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 07:31:42,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 07:31:42,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-23 07:31:42,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-23 07:31:42,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-23 07:31:42,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-23 07:31:42,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-23 07:31:42,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-23 07:31:42,729 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2023-11-23 07:31:42,729 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2023-11-23 07:31:42,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-23 07:31:42,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-23 07:31:42,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-23 07:31:42,893 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 07:31:42,895 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 07:31:43,058 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 07:31:43,114 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 07:31:43,115 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-23 07:31:43,115 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:31:43 BoogieIcfgContainer [2023-11-23 07:31:43,116 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 07:31:43,117 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 07:31:43,117 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 07:31:43,121 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 07:31:43,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 07:31:40" (1/3) ... [2023-11-23 07:31:43,122 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60dbb26d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 07:31:43, skipping insertion in model container [2023-11-23 07:31:43,122 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:31:42" (2/3) ... [2023-11-23 07:31:43,123 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60dbb26d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 07:31:43, skipping insertion in model container [2023-11-23 07:31:43,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:31:43" (3/3) ... [2023-11-23 07:31:43,125 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_rend_harness_negated.i [2023-11-23 07:31:43,139 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 07:31:43,139 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 07:31:43,176 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 07:31:43,181 INFO L357 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, mHoare=true, 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;@42c1febf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 07:31:43,182 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 07:31:43,187 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 39 states have (on average 1.435897435897436) internal successors, (56), 40 states have internal predecessors, (56), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-23 07:31:43,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-23 07:31:43,196 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:31:43,197 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:31:43,198 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:31:43,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:31:43,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1381970591, now seen corresponding path program 1 times [2023-11-23 07:31:43,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:31:43,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726420948] [2023-11-23 07:31:43,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:31:43,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:31:43,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:43,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:31:43,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:43,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:31:43,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:43,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:31:43,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:43,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 07:31:43,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:43,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 07:31:43,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:43,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:31:43,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:43,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 07:31:43,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:43,668 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-11-23 07:31:43,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:31:43,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726420948] [2023-11-23 07:31:43,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726420948] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:31:43,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:31:43,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 07:31:43,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379695519] [2023-11-23 07:31:43,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:31:43,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-23 07:31:43,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:31:43,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-23 07:31:43,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 07:31:43,711 INFO L87 Difference]: Start difference. First operand has 59 states, 39 states have (on average 1.435897435897436) internal successors, (56), 40 states have internal predecessors, (56), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 07:31:43,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:31:43,756 INFO L93 Difference]: Finished difference Result 112 states and 168 transitions. [2023-11-23 07:31:43,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 07:31:43,759 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2023-11-23 07:31:43,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:31:43,765 INFO L225 Difference]: With dead ends: 112 [2023-11-23 07:31:43,765 INFO L226 Difference]: Without dead ends: 57 [2023-11-23 07:31:43,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 07:31:43,779 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 07:31:43,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 07:31:43,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-23 07:31:43,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2023-11-23 07:31:43,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 39 states have internal predecessors, (51), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-23 07:31:43,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 76 transitions. [2023-11-23 07:31:43,810 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 76 transitions. Word has length 65 [2023-11-23 07:31:43,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:31:43,811 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 76 transitions. [2023-11-23 07:31:43,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 07:31:43,811 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 76 transitions. [2023-11-23 07:31:43,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-23 07:31:43,814 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:31:43,814 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:31:43,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 07:31:43,814 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:31:43,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:31:43,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1499718043, now seen corresponding path program 1 times [2023-11-23 07:31:43,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:31:43,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104304789] [2023-11-23 07:31:43,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:31:43,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:31:43,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:44,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:31:44,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:44,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:31:44,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:44,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:31:44,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:44,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 07:31:44,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:44,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 07:31:44,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:44,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:31:44,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:44,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 07:31:44,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:44,240 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-11-23 07:31:44,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:31:44,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104304789] [2023-11-23 07:31:44,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104304789] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:31:44,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970747851] [2023-11-23 07:31:44,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:31:44,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:31:44,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:31:44,243 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) [2023-11-23 07:31:44,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-23 07:31:44,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:44,414 INFO L262 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 52 conjunts are in the unsatisfiable core [2023-11-23 07:31:44,429 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:31:44,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2023-11-23 07:31:44,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2023-11-23 07:31:44,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:31:44,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:31:44,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:31:44,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 25 [2023-11-23 07:31:44,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:31:44,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:31:44,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2023-11-23 07:31:45,887 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-23 07:31:45,887 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:31:45,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1970747851] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:31:45,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:31:45,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2023-11-23 07:31:45,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962020251] [2023-11-23 07:31:45,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:31:45,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 07:31:45,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:31:45,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 07:31:45,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2023-11-23 07:31:45,890 INFO L87 Difference]: Start difference. First operand 57 states and 76 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-23 07:31:46,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:31:46,368 INFO L93 Difference]: Finished difference Result 157 states and 214 transitions. [2023-11-23 07:31:46,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 07:31:46,369 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2023-11-23 07:31:46,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:31:46,371 INFO L225 Difference]: With dead ends: 157 [2023-11-23 07:31:46,371 INFO L226 Difference]: Without dead ends: 108 [2023-11-23 07:31:46,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 63 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2023-11-23 07:31:46,372 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 63 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 07:31:46,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 330 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 07:31:46,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-11-23 07:31:46,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2023-11-23 07:31:46,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 72 states have (on average 1.3611111111111112) internal successors, (98), 74 states have internal predecessors, (98), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-23 07:31:46,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 144 transitions. [2023-11-23 07:31:46,394 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 144 transitions. Word has length 65 [2023-11-23 07:31:46,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:31:46,394 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 144 transitions. [2023-11-23 07:31:46,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-23 07:31:46,395 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 144 transitions. [2023-11-23 07:31:46,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-23 07:31:46,399 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:31:46,400 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:31:46,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-23 07:31:46,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:31:46,613 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:31:46,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:31:46,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1296976811, now seen corresponding path program 1 times [2023-11-23 07:31:46,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:31:46,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104692877] [2023-11-23 07:31:46,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:31:46,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:31:46,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:46,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:31:46,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:46,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:31:46,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:46,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:31:46,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:46,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 07:31:46,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:46,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 07:31:46,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:46,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:31:46,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:46,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 07:31:46,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:46,805 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-11-23 07:31:46,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:31:46,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104692877] [2023-11-23 07:31:46,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104692877] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:31:46,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473717182] [2023-11-23 07:31:46,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:31:46,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:31:46,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:31:46,807 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) [2023-11-23 07:31:46,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-23 07:31:46,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:46,928 INFO L262 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-23 07:31:46,938 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:31:47,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2023-11-23 07:31:47,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 53 [2023-11-23 07:31:47,041 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2023-11-23 07:31:47,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 17 [2023-11-23 07:31:47,098 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_7|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_18| Int)) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_7| (select .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_18|))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_7|) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_7| (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_7| 24))))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_18| Int)) (let ((.cse1 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_18|))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| .cse1)) (.cse4 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_7| 24))) (let ((.cse2 (select .cse3 .cse4))) (and (<= .cse1 .cse2) (= .cse3 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_1) .cse2 v_arrayElimArr_2) .cse1) .cse4 .cse2)) (<= 2 .cse1) (not (= .cse2 .cse1)))))))) is different from true [2023-11-23 07:31:47,378 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_8|))) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_8| Int)) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_8| (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_8| 24)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_8|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_18| Int)) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_8| (select .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_18|)))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_18| Int)) (let ((.cse1 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_18|))) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| .cse1)) (.cse3 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_8| 24))) (let ((.cse2 (select .cse4 .cse3))) (and (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_1) .cse2 v_arrayElimArr_2) .cse1) .cse3 .cse2) .cse4) (<= 2 .cse1) (<= .cse1 .cse2) (not (= .cse1 .cse2)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_7|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_18| Int)) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_7| (select .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_18|))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_7|) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_7| (select .cse5 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_7| 24))))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_18| Int)) (let ((.cse6 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_18|))) (let ((.cse8 (select |c_#memory_$Pointer$#2.base| .cse6)) (.cse9 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_7| 24))) (let ((.cse7 (select .cse8 .cse9))) (and (<= .cse6 .cse7) (= .cse8 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse6 v_DerPreprocessor_1) .cse7 v_arrayElimArr_2) .cse6) .cse9 .cse7)) (<= 2 .cse6) (not (= .cse7 .cse6))))))))) is different from true [2023-11-23 07:31:47,751 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_8|))) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_8| Int)) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_8| (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_8| 24)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_8|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_18| Int)) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_8| (select .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_18|)))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_18| Int)) (let ((.cse1 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_18|))) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| .cse1)) (.cse3 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_8| 24))) (let ((.cse2 (select .cse4 .cse3))) (and (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_1) .cse2 v_arrayElimArr_2) .cse1) .cse3 .cse2) .cse4) (<= 2 .cse1) (<= .cse1 .cse2) (not (= .cse1 .cse2)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_18| Int)) (= (select .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_18|) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4|)) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_4| Int)) (= (select .cse5 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_4| 24)) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4|)))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_18| Int) (|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_4| Int)) (let ((.cse6 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_18|))) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| .cse6)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_4| 24))) (let ((.cse7 (select .cse9 .cse8))) (and (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse6 v_DerPreprocessor_1) .cse7 v_arrayElimArr_2) .cse6) .cse8 .cse7) .cse9) (<= .cse6 .cse7) (<= 2 .cse6) (not (= .cse6 .cse7)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_7|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_18| Int)) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_7| (select .cse10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_18|))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_7|) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_7| (select .cse10 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_7| 24))))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_18| Int)) (let ((.cse11 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_18|))) (let ((.cse13 (select |c_#memory_$Pointer$#2.base| .cse11)) (.cse14 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_7| 24))) (let ((.cse12 (select .cse13 .cse14))) (and (<= .cse11 .cse12) (= .cse13 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse11 v_DerPreprocessor_1) .cse12 v_arrayElimArr_2) .cse11) .cse14 .cse12)) (<= 2 .cse11) (not (= .cse12 .cse11))))))))) is different from true [2023-11-23 07:31:48,181 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_8|))) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_8| Int)) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_8| (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_8| 24)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_8|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_18| Int)) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_8| (select .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_18|)))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_18| Int)) (let ((.cse1 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_18|))) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| .cse1)) (.cse3 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_8| 24))) (let ((.cse2 (select .cse4 .cse3))) (and (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_1) .cse2 v_arrayElimArr_2) .cse1) .cse3 .cse2) .cse4) (<= 2 .cse1) (<= .cse1 .cse2) (not (= .cse1 .cse2)))))))) (or |c_aws_linked_list_is_valid_#t~short310#1| (< (select (select |c_#memory_$Pointer$#2.base| |c_aws_linked_list_is_valid_#in~list#1.base|) (+ |c_aws_linked_list_is_valid_#in~list#1.offset| 24)) 1)) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_18| Int)) (= (select .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_18|) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4|)) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_4| Int)) (= (select .cse5 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_4| 24)) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4|)))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_18| Int) (|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_4| Int)) (let ((.cse6 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_18|))) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| .cse6)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_4| 24))) (let ((.cse7 (select .cse9 .cse8))) (and (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse6 v_DerPreprocessor_1) .cse7 v_arrayElimArr_2) .cse6) .cse8 .cse7) .cse9) (<= .cse6 .cse7) (<= 2 .cse6) (not (= .cse6 .cse7)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_7|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_18| Int)) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_7| (select .cse10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_18|))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_7|) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_7| (select .cse10 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_7| 24))))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_18| Int)) (let ((.cse11 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_18|))) (let ((.cse13 (select |c_#memory_$Pointer$#2.base| .cse11)) (.cse14 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_7| 24))) (let ((.cse12 (select .cse13 .cse14))) (and (<= .cse11 .cse12) (= .cse13 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse11 v_DerPreprocessor_1) .cse12 v_arrayElimArr_2) .cse11) .cse14 .cse12)) (<= 2 .cse11) (not (= .cse12 .cse11))))))))) is different from true [2023-11-23 07:31:48,624 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2023-11-23 07:31:48,624 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:31:48,877 INFO L349 Elim1Store]: treesize reduction 19, result has 62.0 percent of original size [2023-11-23 07:31:48,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 98 [2023-11-23 07:31:48,897 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:31:48,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 114 [2023-11-23 07:31:48,903 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 33 treesize of output 29 [2023-11-23 07:31:48,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-23 07:31:48,957 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:31:48,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2023-11-23 07:31:48,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-23 07:31:48,992 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:31:48,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 102 [2023-11-23 07:31:49,121 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-23 07:31:49,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473717182] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 07:31:49,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 07:31:49,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 15, 10] total 27 [2023-11-23 07:31:49,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927500341] [2023-11-23 07:31:49,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 07:31:49,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-23 07:31:49,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:31:49,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-23 07:31:49,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=420, Unknown=30, NotChecked=180, Total=702 [2023-11-23 07:31:49,125 INFO L87 Difference]: Start difference. First operand 106 states and 144 transitions. Second operand has 27 states, 22 states have (on average 3.9545454545454546) internal successors, (87), 23 states have internal predecessors, (87), 10 states have call successors, (20), 5 states have call predecessors, (20), 8 states have return successors, (19), 8 states have call predecessors, (19), 10 states have call successors, (19) [2023-11-23 07:31:49,322 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (< (select (select |c_#memory_$Pointer$#2.base| |c_aws_linked_list_is_valid_#in~list#1.base|) (+ |c_aws_linked_list_is_valid_#in~list#1.offset| 24)) 1))) (and (or |c_aws_linked_list_is_valid_#t~short310#1| .cse0) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_7|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_18| Int)) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_7| (select .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_18|))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_7|) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_7| (select .cse1 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_7| 24))))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_18| Int)) (let ((.cse2 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_18|))) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| .cse2)) (.cse5 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_7| 24))) (let ((.cse3 (select .cse4 .cse5))) (and (<= .cse2 .cse3) (= .cse4 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse2 v_DerPreprocessor_1) .cse3 v_arrayElimArr_2) .cse2) .cse5 .cse3)) (<= 2 .cse2) (not (= .cse3 .cse2)))))))) (or (< 0 (select (select |c_#memory_$Pointer$#2.base| |c_aws_linked_list_is_valid_~list#1.base|) (+ |c_aws_linked_list_is_valid_~list#1.offset| 24))) .cse0))) is different from true [2023-11-23 07:31:49,507 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_7|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_18| Int)) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_7| (select .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_18|))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_7|) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_7| (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_7| 24))))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_18| Int)) (let ((.cse1 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_18|))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| .cse1)) (.cse4 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_7| 24))) (let ((.cse2 (select .cse3 .cse4))) (and (<= .cse1 .cse2) (= .cse3 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_1) .cse2 v_arrayElimArr_2) .cse1) .cse4 .cse2)) (<= 2 .cse1) (not (= .cse2 .cse1)))))))) (< (select (select |c_#memory_$Pointer$#2.base| |c_aws_linked_list_is_valid_#in~list#1.base|) (+ |c_aws_linked_list_is_valid_#in~list#1.offset| 24)) 1)) is different from true [2023-11-23 07:31:49,546 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_aws_linked_list_is_valid_#res#1| 0) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_7|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_18| Int)) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_7| (select .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_18|))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_7|) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_7| (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_7| 24))))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_18| Int)) (let ((.cse1 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_18|))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| .cse1)) (.cse4 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_7| 24))) (let ((.cse2 (select .cse3 .cse4))) (and (<= .cse1 .cse2) (= .cse3 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_1) .cse2 v_arrayElimArr_2) .cse1) .cse4 .cse2)) (<= 2 .cse1) (not (= .cse2 .cse1)))))))) (< (select (select |c_#memory_$Pointer$#2.base| |c_aws_linked_list_is_valid_#in~list#1.base|) (+ |c_aws_linked_list_is_valid_#in~list#1.offset| 24)) 1)) is different from true [2023-11-23 07:31:52,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:31:52,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:31:52,382 INFO L93 Difference]: Finished difference Result 260 states and 375 transitions. [2023-11-23 07:31:52,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-23 07:31:52,383 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 22 states have (on average 3.9545454545454546) internal successors, (87), 23 states have internal predecessors, (87), 10 states have call successors, (20), 5 states have call predecessors, (20), 8 states have return successors, (19), 8 states have call predecessors, (19), 10 states have call successors, (19) Word has length 65 [2023-11-23 07:31:52,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:31:52,386 INFO L225 Difference]: With dead ends: 260 [2023-11-23 07:31:52,386 INFO L226 Difference]: Without dead ends: 147 [2023-11-23 07:31:52,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=151, Invalid=1077, Unknown=60, NotChecked=518, Total=1806 [2023-11-23 07:31:52,388 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 76 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 23 mSolverCounterUnsat, 63 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 1547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 63 IncrementalHoareTripleChecker+Unknown, 831 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-11-23 07:31:52,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 910 Invalid, 1547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 630 Invalid, 63 Unknown, 831 Unchecked, 2.7s Time] [2023-11-23 07:31:52,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2023-11-23 07:31:52,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 130. [2023-11-23 07:31:52,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 92 states have (on average 1.3695652173913044) internal successors, (126), 96 states have internal predecessors, (126), 25 states have call successors, (25), 10 states have call predecessors, (25), 12 states have return successors, (30), 23 states have call predecessors, (30), 23 states have call successors, (30) [2023-11-23 07:31:52,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 181 transitions. [2023-11-23 07:31:52,410 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 181 transitions. Word has length 65 [2023-11-23 07:31:52,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:31:52,411 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 181 transitions. [2023-11-23 07:31:52,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 22 states have (on average 3.9545454545454546) internal successors, (87), 23 states have internal predecessors, (87), 10 states have call successors, (20), 5 states have call predecessors, (20), 8 states have return successors, (19), 8 states have call predecessors, (19), 10 states have call successors, (19) [2023-11-23 07:31:52,411 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 181 transitions. [2023-11-23 07:31:52,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-23 07:31:52,413 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:31:52,413 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:31:52,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-23 07:31:52,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-11-23 07:31:52,626 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:31:52,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:31:52,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1034005873, now seen corresponding path program 1 times [2023-11-23 07:31:52,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:31:52,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7147663] [2023-11-23 07:31:52,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:31:52,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:31:52,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:52,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:31:52,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:52,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:31:52,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:52,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:31:52,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:52,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 07:31:52,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:52,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-23 07:31:52,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:52,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-23 07:31:52,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:52,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 07:31:52,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:52,828 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-23 07:31:52,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:31:52,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7147663] [2023-11-23 07:31:52,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7147663] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:31:52,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231849822] [2023-11-23 07:31:52,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:31:52,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:31:52,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:31:52,830 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) [2023-11-23 07:31:52,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-23 07:31:52,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:52,944 INFO L262 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-23 07:31:52,946 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:31:52,994 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 07:31:52,994 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:31:52,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231849822] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:31:52,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:31:52,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2023-11-23 07:31:52,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599975105] [2023-11-23 07:31:52,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:31:52,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 07:31:52,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:31:52,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 07:31:52,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-23 07:31:52,997 INFO L87 Difference]: Start difference. First operand 130 states and 181 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 07:31:53,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:31:53,112 INFO L93 Difference]: Finished difference Result 238 states and 332 transitions. [2023-11-23 07:31:53,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 07:31:53,113 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 67 [2023-11-23 07:31:53,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:31:53,114 INFO L225 Difference]: With dead ends: 238 [2023-11-23 07:31:53,114 INFO L226 Difference]: Without dead ends: 136 [2023-11-23 07:31:53,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2023-11-23 07:31:53,116 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 32 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 07:31:53,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 232 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 07:31:53,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-11-23 07:31:53,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2023-11-23 07:31:53,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 96 states have (on average 1.34375) internal successors, (129), 102 states have internal predecessors, (129), 25 states have call successors, (25), 10 states have call predecessors, (25), 14 states have return successors, (34), 23 states have call predecessors, (34), 23 states have call successors, (34) [2023-11-23 07:31:53,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 188 transitions. [2023-11-23 07:31:53,129 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 188 transitions. Word has length 67 [2023-11-23 07:31:53,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:31:53,129 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 188 transitions. [2023-11-23 07:31:53,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 07:31:53,129 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 188 transitions. [2023-11-23 07:31:53,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-11-23 07:31:53,130 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:31:53,130 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:31:53,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-23 07:31:53,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:31:53,342 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:31:53,343 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:31:53,343 INFO L85 PathProgramCache]: Analyzing trace with hash 346714876, now seen corresponding path program 1 times [2023-11-23 07:31:53,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:31:53,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298382823] [2023-11-23 07:31:53,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:31:53,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:31:53,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:53,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:31:53,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:53,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:31:53,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:53,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:31:53,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:53,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 07:31:53,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:53,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 07:31:53,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:53,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 07:31:53,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:53,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 07:31:53,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:53,503 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-11-23 07:31:53,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:31:53,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298382823] [2023-11-23 07:31:53,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298382823] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:31:53,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363529270] [2023-11-23 07:31:53,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:31:53,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:31:53,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:31:53,516 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) [2023-11-23 07:31:53,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-23 07:31:53,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:53,631 INFO L262 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-23 07:31:53,633 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:31:53,691 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 07:31:53,691 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:31:53,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363529270] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:31:53,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:31:53,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2023-11-23 07:31:53,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125817638] [2023-11-23 07:31:53,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:31:53,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 07:31:53,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:31:53,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 07:31:53,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-23 07:31:53,692 INFO L87 Difference]: Start difference. First operand 136 states and 188 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 07:31:53,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:31:53,828 INFO L93 Difference]: Finished difference Result 271 states and 380 transitions. [2023-11-23 07:31:53,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 07:31:53,829 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 69 [2023-11-23 07:31:53,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:31:53,830 INFO L225 Difference]: With dead ends: 271 [2023-11-23 07:31:53,830 INFO L226 Difference]: Without dead ends: 162 [2023-11-23 07:31:53,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2023-11-23 07:31:53,831 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 56 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 07:31:53,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 273 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 07:31:53,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-11-23 07:31:53,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 141. [2023-11-23 07:31:53,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 101 states have (on average 1.3465346534653466) internal successors, (136), 107 states have internal predecessors, (136), 25 states have call successors, (25), 10 states have call predecessors, (25), 14 states have return successors, (34), 23 states have call predecessors, (34), 23 states have call successors, (34) [2023-11-23 07:31:53,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 195 transitions. [2023-11-23 07:31:53,859 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 195 transitions. Word has length 69 [2023-11-23 07:31:53,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:31:53,859 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 195 transitions. [2023-11-23 07:31:53,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 07:31:53,860 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 195 transitions. [2023-11-23 07:31:53,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-23 07:31:53,860 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:31:53,860 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:31:53,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-23 07:31:54,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:31:54,073 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:31:54,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:31:54,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1578929266, now seen corresponding path program 1 times [2023-11-23 07:31:54,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:31:54,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148524368] [2023-11-23 07:31:54,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:31:54,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:31:54,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:54,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:31:54,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:54,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:31:54,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:54,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:31:54,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:54,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 07:31:54,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:54,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 07:31:54,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:54,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 07:31:54,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:54,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-23 07:31:54,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:54,272 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-11-23 07:31:54,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:31:54,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148524368] [2023-11-23 07:31:54,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148524368] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:31:54,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103868804] [2023-11-23 07:31:54,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:31:54,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:31:54,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:31:54,274 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) [2023-11-23 07:31:54,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-23 07:31:54,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:54,395 INFO L262 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-23 07:31:54,397 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:31:54,404 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-23 07:31:54,404 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:31:54,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103868804] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:31:54,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:31:54,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-11-23 07:31:54,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480396884] [2023-11-23 07:31:54,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:31:54,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 07:31:54,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:31:54,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 07:31:54,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-23 07:31:54,406 INFO L87 Difference]: Start difference. First operand 141 states and 195 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 07:31:54,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:31:54,463 INFO L93 Difference]: Finished difference Result 268 states and 380 transitions. [2023-11-23 07:31:54,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 07:31:54,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2023-11-23 07:31:54,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:31:54,464 INFO L225 Difference]: With dead ends: 268 [2023-11-23 07:31:54,464 INFO L226 Difference]: Without dead ends: 155 [2023-11-23 07:31:54,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-23 07:31:54,465 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 4 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 07:31:54,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 128 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 07:31:54,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2023-11-23 07:31:54,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 144. [2023-11-23 07:31:54,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 104 states have (on average 1.3365384615384615) internal successors, (139), 110 states have internal predecessors, (139), 25 states have call successors, (25), 10 states have call predecessors, (25), 14 states have return successors, (34), 23 states have call predecessors, (34), 23 states have call successors, (34) [2023-11-23 07:31:54,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 198 transitions. [2023-11-23 07:31:54,477 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 198 transitions. Word has length 70 [2023-11-23 07:31:54,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:31:54,478 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 198 transitions. [2023-11-23 07:31:54,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 07:31:54,478 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 198 transitions. [2023-11-23 07:31:54,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-11-23 07:31:54,478 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:31:54,478 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:31:54,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-23 07:31:54,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:31:54,690 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:31:54,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:31:54,691 INFO L85 PathProgramCache]: Analyzing trace with hash -2010628368, now seen corresponding path program 1 times [2023-11-23 07:31:54,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:31:54,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107767174] [2023-11-23 07:31:54,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:31:54,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:31:54,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:54,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:31:54,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:54,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:31:54,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:54,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:31:54,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:54,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:31:54,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:54,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 07:31:54,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:54,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:31:54,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:54,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 07:31:54,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:54,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-23 07:31:54,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:54,932 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-11-23 07:31:54,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:31:54,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107767174] [2023-11-23 07:31:54,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107767174] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:31:54,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010974352] [2023-11-23 07:31:54,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:31:54,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:31:54,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:31:54,934 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) [2023-11-23 07:31:54,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-23 07:31:55,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:55,072 INFO L262 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 53 conjunts are in the unsatisfiable core [2023-11-23 07:31:55,077 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:31:55,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2023-11-23 07:31:55,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2023-11-23 07:31:55,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:31:55,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:31:55,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:31:55,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 25 [2023-11-23 07:31:55,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:31:55,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:31:55,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2023-11-23 07:31:56,050 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 07:31:56,050 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:31:56,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010974352] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:31:56,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:31:56,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [7] total 16 [2023-11-23 07:31:56,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653001822] [2023-11-23 07:31:56,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:31:56,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-23 07:31:56,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:31:56,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-23 07:31:56,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2023-11-23 07:31:56,052 INFO L87 Difference]: Start difference. First operand 144 states and 198 transitions. Second operand has 11 states, 10 states have (on average 6.0) internal successors, (60), 11 states have internal predecessors, (60), 5 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2023-11-23 07:31:56,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:31:56,774 INFO L93 Difference]: Finished difference Result 230 states and 318 transitions. [2023-11-23 07:31:56,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-23 07:31:56,774 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.0) internal successors, (60), 11 states have internal predecessors, (60), 5 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) Word has length 77 [2023-11-23 07:31:56,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:31:56,775 INFO L225 Difference]: With dead ends: 230 [2023-11-23 07:31:56,775 INFO L226 Difference]: Without dead ends: 151 [2023-11-23 07:31:56,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 80 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2023-11-23 07:31:56,776 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 73 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-23 07:31:56,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 471 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-23 07:31:56,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-11-23 07:31:56,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 146. [2023-11-23 07:31:56,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 106 states have (on average 1.320754716981132) internal successors, (140), 112 states have internal predecessors, (140), 25 states have call successors, (25), 10 states have call predecessors, (25), 14 states have return successors, (34), 23 states have call predecessors, (34), 23 states have call successors, (34) [2023-11-23 07:31:56,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 199 transitions. [2023-11-23 07:31:56,787 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 199 transitions. Word has length 77 [2023-11-23 07:31:56,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:31:56,788 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 199 transitions. [2023-11-23 07:31:56,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.0) internal successors, (60), 11 states have internal predecessors, (60), 5 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2023-11-23 07:31:56,788 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 199 transitions. [2023-11-23 07:31:56,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-11-23 07:31:56,788 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:31:56,788 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:31:56,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-23 07:31:57,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:31:57,000 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:31:57,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:31:57,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1729830676, now seen corresponding path program 1 times [2023-11-23 07:31:57,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:31:57,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078825176] [2023-11-23 07:31:57,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:31:57,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:31:57,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:57,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:31:57,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:57,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:31:57,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:57,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:31:57,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:57,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:31:57,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:57,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 07:31:57,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:57,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:31:57,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:57,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 07:31:57,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:57,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-23 07:31:57,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:57,772 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-23 07:31:57,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:31:57,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078825176] [2023-11-23 07:31:57,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078825176] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:31:57,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742495934] [2023-11-23 07:31:57,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:31:57,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:31:57,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:31:57,773 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:31:57,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-23 07:31:57,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:57,912 INFO L262 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 44 conjunts are in the unsatisfiable core [2023-11-23 07:31:57,914 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:31:57,982 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 16 treesize of output 17 [2023-11-23 07:32:35,974 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_7| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_7|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_7| 24)) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_7|) (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_7|) (= (select .cse0 |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_7|) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_7|)))) is different from true [2023-11-23 07:33:22,544 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 22 not checked. [2023-11-23 07:33:22,545 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:33:27,094 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2023-11-23 07:33:27,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 88 [2023-11-23 07:33:27,107 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:33:27,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 104 [2023-11-23 07:33:27,115 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 29 treesize of output 27 [2023-11-23 07:33:27,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-23 07:33:27,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-23 07:33:27,193 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:33:27,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2023-11-23 07:33:27,210 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:33:27,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 89 [2023-11-23 07:33:29,376 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-23 07:33:29,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742495934] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-23 07:33:29,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-23 07:33:29,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15, 12] total 33 [2023-11-23 07:33:29,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224074208] [2023-11-23 07:33:29,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:33:29,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 07:33:29,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:33:29,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 07:33:29,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=885, Unknown=10, NotChecked=60, Total=1056 [2023-11-23 07:33:29,378 INFO L87 Difference]: Start difference. First operand 146 states and 199 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-23 07:33:36,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:33:36,054 INFO L93 Difference]: Finished difference Result 267 states and 375 transitions. [2023-11-23 07:33:36,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 07:33:36,054 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 77 [2023-11-23 07:33:36,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:33:36,055 INFO L225 Difference]: With dead ends: 267 [2023-11-23 07:33:36,055 INFO L226 Difference]: Without dead ends: 182 [2023-11-23 07:33:36,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 143 SyntacticMatches, 7 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 97.2s TimeCoverageRelationStatistics Valid=128, Invalid=1124, Unknown=12, NotChecked=68, Total=1332 [2023-11-23 07:33:36,057 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 91 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 07:33:36,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 366 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 07:33:36,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2023-11-23 07:33:36,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 148. [2023-11-23 07:33:36,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 108 states have (on average 1.3055555555555556) internal successors, (141), 114 states have internal predecessors, (141), 25 states have call successors, (25), 10 states have call predecessors, (25), 14 states have return successors, (34), 23 states have call predecessors, (34), 23 states have call successors, (34) [2023-11-23 07:33:36,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 200 transitions. [2023-11-23 07:33:36,068 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 200 transitions. Word has length 77 [2023-11-23 07:33:36,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:33:36,069 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 200 transitions. [2023-11-23 07:33:36,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-23 07:33:36,069 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 200 transitions. [2023-11-23 07:33:36,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-11-23 07:33:36,070 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:33:36,070 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:33:36,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-23 07:33:36,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:33:36,282 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:33:36,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:33:36,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1828778984, now seen corresponding path program 1 times [2023-11-23 07:33:36,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:33:36,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680000859] [2023-11-23 07:33:36,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:33:36,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:33:36,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:36,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:33:36,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:36,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:33:36,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:36,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:33:36,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:36,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:33:36,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:36,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 07:33:36,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:36,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:33:36,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:36,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 07:33:36,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:36,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-23 07:33:36,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:36,590 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 07:33:36,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:33:36,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680000859] [2023-11-23 07:33:36,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680000859] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:33:36,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288705427] [2023-11-23 07:33:36,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:33:36,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:33:36,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:33:36,592 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:33:36,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-23 07:33:36,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:36,740 INFO L262 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-23 07:33:36,743 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:33:36,806 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-23 07:33:36,806 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:33:36,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288705427] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:33:36,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:33:36,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2023-11-23 07:33:36,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80667728] [2023-11-23 07:33:36,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:33:36,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 07:33:36,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:33:36,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 07:33:36,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2023-11-23 07:33:36,811 INFO L87 Difference]: Start difference. First operand 148 states and 200 transitions. Second operand has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-23 07:33:36,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:33:36,884 INFO L93 Difference]: Finished difference Result 307 states and 425 transitions. [2023-11-23 07:33:36,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 07:33:36,885 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 77 [2023-11-23 07:33:36,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:33:36,887 INFO L225 Difference]: With dead ends: 307 [2023-11-23 07:33:36,887 INFO L226 Difference]: Without dead ends: 139 [2023-11-23 07:33:36,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2023-11-23 07:33:36,889 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 21 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 07:33:36,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 346 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 07:33:36,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2023-11-23 07:33:36,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2023-11-23 07:33:36,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 100 states have (on average 1.26) internal successors, (126), 105 states have internal predecessors, (126), 25 states have call successors, (25), 10 states have call predecessors, (25), 13 states have return successors, (30), 23 states have call predecessors, (30), 23 states have call successors, (30) [2023-11-23 07:33:36,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 181 transitions. [2023-11-23 07:33:36,902 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 181 transitions. Word has length 77 [2023-11-23 07:33:36,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:33:36,903 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 181 transitions. [2023-11-23 07:33:36,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-23 07:33:36,903 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 181 transitions. [2023-11-23 07:33:36,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-11-23 07:33:36,904 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:33:36,905 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:33:36,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-23 07:33:37,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-11-23 07:33:37,117 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:33:37,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:33:37,118 INFO L85 PathProgramCache]: Analyzing trace with hash -256953375, now seen corresponding path program 1 times [2023-11-23 07:33:37,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:33:37,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945091968] [2023-11-23 07:33:37,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:33:37,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:33:37,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:37,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:33:37,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:37,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:33:37,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:37,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:33:37,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:37,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:33:37,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:37,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 07:33:37,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:37,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-23 07:33:37,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:37,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 07:33:37,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:37,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 07:33:37,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:37,358 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-23 07:33:37,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:33:37,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945091968] [2023-11-23 07:33:37,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945091968] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:33:37,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920111466] [2023-11-23 07:33:37,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:33:37,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:33:37,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:33:37,360 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:33:37,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-23 07:33:37,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:37,521 INFO L262 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 60 conjunts are in the unsatisfiable core [2023-11-23 07:33:37,524 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:33:37,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2023-11-23 07:33:37,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2023-11-23 07:33:37,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:33:37,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:33:37,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2023-11-23 07:33:37,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:33:37,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-23 07:33:37,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:33:37,619 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 25 treesize of output 18 [2023-11-23 07:33:37,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:33:37,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2023-11-23 07:33:37,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:33:37,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:33:37,726 INFO L349 Elim1Store]: treesize reduction 124, result has 19.5 percent of original size [2023-11-23 07:33:37,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 113 treesize of output 75 [2023-11-23 07:33:37,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:33:37,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:33:37,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 42 [2023-11-23 07:33:37,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2023-11-23 07:33:38,906 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 44 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 07:33:38,906 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:33:39,141 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse2 (+ 16 |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset|))) (and (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int)) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)))) (store .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|))) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse2) 0)) (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int) (v_ArrVal_677 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_677))) (store .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset|))) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse2) 0)))) is different from false [2023-11-23 07:33:39,161 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:33:39,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2023-11-23 07:33:39,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-23 07:33:39,202 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse2 (+ 16 |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25| 1)) (forall ((v_ArrVal_677 (Array Int Int)) (v_ArrVal_672 Int) (v_subst_2 Int)) (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_672)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25| v_ArrVal_677))) (store .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_subst_2))) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse2) 0)))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25| 1)) (forall ((v_arrayElimArr_7 (Array Int Int)) (v_subst_1 Int)) (or (not (= (select v_arrayElimArr_7 v_subst_1) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)) (= (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25| v_arrayElimArr_7))) (store .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25|))) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse2) 0))))))) is different from false [2023-11-23 07:33:39,216 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:33:39,217 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:33:39,271 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2023-11-23 07:33:39,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 177 treesize of output 206 [2023-11-23 07:33:39,286 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:33:39,286 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:33:39,337 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2023-11-23 07:33:39,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 235 treesize of output 264 [2023-11-23 07:33:39,364 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:33:39,365 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 300 treesize of output 278 [2023-11-23 07:33:39,378 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:33:39,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 245 treesize of output 242 [2023-11-23 07:33:39,393 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:33:39,393 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 332 treesize of output 330 [2023-11-23 07:33:39,405 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 289 treesize of output 277 [2023-11-23 07:33:39,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-23 07:33:39,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-23 07:33:39,883 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:33:39,891 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:33:39,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 83 [2023-11-23 07:33:39,966 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 17 treesize of output 9 [2023-11-23 07:33:40,004 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 1 not checked. [2023-11-23 07:33:40,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920111466] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 07:33:40,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 07:33:40,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 10] total 24 [2023-11-23 07:33:40,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358806841] [2023-11-23 07:33:40,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 07:33:40,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-23 07:33:40,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:33:40,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-23 07:33:40,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=404, Unknown=2, NotChecked=82, Total=552 [2023-11-23 07:33:40,005 INFO L87 Difference]: Start difference. First operand 139 states and 181 transitions. Second operand has 24 states, 21 states have (on average 5.333333333333333) internal successors, (112), 23 states have internal predecessors, (112), 10 states have call successors, (22), 3 states have call predecessors, (22), 7 states have return successors, (21), 8 states have call predecessors, (21), 10 states have call successors, (21) [2023-11-23 07:33:41,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:33:41,848 INFO L93 Difference]: Finished difference Result 334 states and 449 transitions. [2023-11-23 07:33:41,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-23 07:33:41,849 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 5.333333333333333) internal successors, (112), 23 states have internal predecessors, (112), 10 states have call successors, (22), 3 states have call predecessors, (22), 7 states have return successors, (21), 8 states have call predecessors, (21), 10 states have call successors, (21) Word has length 78 [2023-11-23 07:33:41,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:33:41,850 INFO L225 Difference]: With dead ends: 334 [2023-11-23 07:33:41,850 INFO L226 Difference]: Without dead ends: 222 [2023-11-23 07:33:41,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 152 SyntacticMatches, 5 SemanticMatches, 41 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=191, Invalid=1455, Unknown=2, NotChecked=158, Total=1806 [2023-11-23 07:33:41,851 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 91 mSDsluCounter, 1013 mSDsCounter, 0 mSdLazyCounter, 1064 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 1471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 355 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-23 07:33:41,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 1098 Invalid, 1471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1064 Invalid, 0 Unknown, 355 Unchecked, 1.2s Time] [2023-11-23 07:33:41,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2023-11-23 07:33:41,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 198. [2023-11-23 07:33:41,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 142 states have (on average 1.267605633802817) internal successors, (180), 150 states have internal predecessors, (180), 36 states have call successors, (36), 14 states have call predecessors, (36), 19 states have return successors, (45), 33 states have call predecessors, (45), 33 states have call successors, (45) [2023-11-23 07:33:41,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 261 transitions. [2023-11-23 07:33:41,866 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 261 transitions. Word has length 78 [2023-11-23 07:33:41,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:33:41,867 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 261 transitions. [2023-11-23 07:33:41,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 5.333333333333333) internal successors, (112), 23 states have internal predecessors, (112), 10 states have call successors, (22), 3 states have call predecessors, (22), 7 states have return successors, (21), 8 states have call predecessors, (21), 10 states have call successors, (21) [2023-11-23 07:33:41,867 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 261 transitions. [2023-11-23 07:33:41,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-11-23 07:33:41,868 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:33:41,868 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:33:41,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-23 07:33:42,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-23 07:33:42,080 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:33:42,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:33:42,081 INFO L85 PathProgramCache]: Analyzing trace with hash 50653642, now seen corresponding path program 1 times [2023-11-23 07:33:42,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:33:42,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559626423] [2023-11-23 07:33:42,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:33:42,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:33:42,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:42,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:33:42,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:42,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:33:42,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:42,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:33:42,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:42,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:33:42,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:42,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 07:33:42,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:42,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 07:33:42,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:42,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 07:33:42,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:42,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 07:33:42,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:42,400 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-11-23 07:33:42,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:33:42,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559626423] [2023-11-23 07:33:42,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559626423] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:33:42,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608065544] [2023-11-23 07:33:42,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:33:42,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:33:42,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:33:42,402 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:33:42,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-23 07:33:42,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:42,567 INFO L262 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 66 conjunts are in the unsatisfiable core [2023-11-23 07:33:42,570 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:33:42,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-23 07:33:42,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-23 07:33:42,867 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 26 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-23 07:33:42,867 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:33:43,173 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2023-11-23 07:33:43,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608065544] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-23 07:33:43,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-23 07:33:43,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 14] total 24 [2023-11-23 07:33:43,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925247944] [2023-11-23 07:33:43,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:33:43,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 07:33:43,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:33:43,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 07:33:43,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=498, Unknown=0, NotChecked=0, Total=552 [2023-11-23 07:33:43,175 INFO L87 Difference]: Start difference. First operand 198 states and 261 transitions. Second operand has 6 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-23 07:33:43,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:33:43,246 INFO L93 Difference]: Finished difference Result 216 states and 284 transitions. [2023-11-23 07:33:43,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 07:33:43,246 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 80 [2023-11-23 07:33:43,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:33:43,247 INFO L225 Difference]: With dead ends: 216 [2023-11-23 07:33:43,248 INFO L226 Difference]: Without dead ends: 214 [2023-11-23 07:33:43,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=542, Unknown=0, NotChecked=0, Total=600 [2023-11-23 07:33:43,248 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 4 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 07:33:43,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 352 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 07:33:43,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2023-11-23 07:33:43,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 212. [2023-11-23 07:33:43,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 150 states have (on average 1.2533333333333334) internal successors, (188), 160 states have internal predecessors, (188), 38 states have call successors, (38), 16 states have call predecessors, (38), 23 states have return successors, (53), 35 states have call predecessors, (53), 35 states have call successors, (53) [2023-11-23 07:33:43,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 279 transitions. [2023-11-23 07:33:43,265 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 279 transitions. Word has length 80 [2023-11-23 07:33:43,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:33:43,266 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 279 transitions. [2023-11-23 07:33:43,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-23 07:33:43,266 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 279 transitions. [2023-11-23 07:33:43,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-11-23 07:33:43,267 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:33:43,267 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:33:43,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-23 07:33:43,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-23 07:33:43,479 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:33:43,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:33:43,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1424085000, now seen corresponding path program 1 times [2023-11-23 07:33:43,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:33:43,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571051763] [2023-11-23 07:33:43,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:33:43,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:33:43,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:43,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:33:43,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:43,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:33:43,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:43,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:33:43,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:43,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:33:43,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:43,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 07:33:43,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:43,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 07:33:43,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:43,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 07:33:43,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:43,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 07:33:43,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:43,793 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-11-23 07:33:43,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:33:43,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571051763] [2023-11-23 07:33:43,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571051763] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:33:43,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987513436] [2023-11-23 07:33:43,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:33:43,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:33:43,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:33:43,794 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:33:43,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-23 07:33:43,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:43,956 INFO L262 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-23 07:33:43,958 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:33:44,031 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-23 07:33:44,031 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:33:44,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [987513436] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:33:44,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:33:44,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2023-11-23 07:33:44,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549609612] [2023-11-23 07:33:44,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:33:44,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 07:33:44,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:33:44,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 07:33:44,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2023-11-23 07:33:44,032 INFO L87 Difference]: Start difference. First operand 212 states and 279 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-23 07:33:44,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:33:44,155 INFO L93 Difference]: Finished difference Result 388 states and 502 transitions. [2023-11-23 07:33:44,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 07:33:44,155 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 82 [2023-11-23 07:33:44,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:33:44,156 INFO L225 Difference]: With dead ends: 388 [2023-11-23 07:33:44,156 INFO L226 Difference]: Without dead ends: 212 [2023-11-23 07:33:44,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2023-11-23 07:33:44,157 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 31 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 07:33:44,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 275 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 07:33:44,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2023-11-23 07:33:44,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2023-11-23 07:33:44,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 150 states have (on average 1.2333333333333334) internal successors, (185), 160 states have internal predecessors, (185), 38 states have call successors, (38), 16 states have call predecessors, (38), 23 states have return successors, (53), 35 states have call predecessors, (53), 35 states have call successors, (53) [2023-11-23 07:33:44,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 276 transitions. [2023-11-23 07:33:44,174 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 276 transitions. Word has length 82 [2023-11-23 07:33:44,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:33:44,174 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 276 transitions. [2023-11-23 07:33:44,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-23 07:33:44,175 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 276 transitions. [2023-11-23 07:33:44,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-11-23 07:33:44,175 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:33:44,175 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:33:44,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-23 07:33:44,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-23 07:33:44,390 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:33:44,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:33:44,390 INFO L85 PathProgramCache]: Analyzing trace with hash -2003036939, now seen corresponding path program 2 times [2023-11-23 07:33:44,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:33:44,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692919749] [2023-11-23 07:33:44,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:33:44,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:33:44,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:44,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:33:44,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:44,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:33:44,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:44,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:33:44,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:44,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:33:44,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:44,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 07:33:44,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:44,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 07:33:44,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:44,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 07:33:44,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:44,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 07:33:44,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:44,683 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-11-23 07:33:44,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:33:44,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692919749] [2023-11-23 07:33:44,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692919749] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:33:44,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190356475] [2023-11-23 07:33:44,685 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-23 07:33:44,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:33:44,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:33:44,686 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:33:44,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-23 07:33:44,826 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-23 07:33:44,826 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 07:33:44,827 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-23 07:33:44,828 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:33:44,832 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-11-23 07:33:44,833 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:33:44,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190356475] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:33:44,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:33:44,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 8 [2023-11-23 07:33:44,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837995969] [2023-11-23 07:33:44,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:33:44,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 07:33:44,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:33:44,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 07:33:44,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-23 07:33:44,835 INFO L87 Difference]: Start difference. First operand 212 states and 276 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-23 07:33:44,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:33:44,866 INFO L93 Difference]: Finished difference Result 375 states and 483 transitions. [2023-11-23 07:33:44,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 07:33:44,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 84 [2023-11-23 07:33:44,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:33:44,868 INFO L225 Difference]: With dead ends: 375 [2023-11-23 07:33:44,868 INFO L226 Difference]: Without dead ends: 208 [2023-11-23 07:33:44,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-23 07:33:44,869 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 5 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 07:33:44,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 123 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 07:33:44,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2023-11-23 07:33:44,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 200. [2023-11-23 07:33:44,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 141 states have (on average 1.2269503546099292) internal successors, (173), 148 states have internal predecessors, (173), 38 states have call successors, (38), 16 states have call predecessors, (38), 20 states have return successors, (47), 35 states have call predecessors, (47), 35 states have call successors, (47) [2023-11-23 07:33:44,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 258 transitions. [2023-11-23 07:33:44,890 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 258 transitions. Word has length 84 [2023-11-23 07:33:44,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:33:44,890 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 258 transitions. [2023-11-23 07:33:44,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-23 07:33:44,891 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 258 transitions. [2023-11-23 07:33:44,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-23 07:33:44,893 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:33:44,893 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:33:44,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-23 07:33:45,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-23 07:33:45,107 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:33:45,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:33:45,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1240094549, now seen corresponding path program 1 times [2023-11-23 07:33:45,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:33:45,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181785465] [2023-11-23 07:33:45,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:33:45,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:33:45,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:45,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:33:45,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:45,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:33:45,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:45,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:33:45,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:45,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:33:45,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:45,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 07:33:45,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:45,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 07:33:45,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:45,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 07:33:45,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:45,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 07:33:45,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:45,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 07:33:45,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:45,428 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-11-23 07:33:45,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:33:45,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181785465] [2023-11-23 07:33:45,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181785465] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:33:45,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455395407] [2023-11-23 07:33:45,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:33:45,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:33:45,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:33:45,430 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:33:45,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-23 07:33:45,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:45,607 INFO L262 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 98 conjunts are in the unsatisfiable core [2023-11-23 07:33:45,610 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:33:45,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:33:45,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-23 07:33:45,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:33:45,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-23 07:33:45,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:33:45,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:33:45,797 INFO L349 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2023-11-23 07:33:45,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 174 treesize of output 110 [2023-11-23 07:33:45,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:33:45,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:33:45,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 25 [2023-11-23 07:33:46,671 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-23 07:33:46,671 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:33:46,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3006 treesize of output 2974 [2023-11-23 07:33:47,249 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-23 07:33:47,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455395407] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 07:33:47,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 07:33:47,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 11] total 28 [2023-11-23 07:33:47,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582312369] [2023-11-23 07:33:47,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 07:33:47,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-23 07:33:47,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:33:47,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-23 07:33:47,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=673, Unknown=0, NotChecked=0, Total=756 [2023-11-23 07:33:47,252 INFO L87 Difference]: Start difference. First operand 200 states and 258 transitions. Second operand has 28 states, 26 states have (on average 4.423076923076923) internal successors, (115), 28 states have internal predecessors, (115), 9 states have call successors, (23), 3 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 9 states have call successors, (22) [2023-11-23 07:33:49,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:33:49,330 INFO L93 Difference]: Finished difference Result 490 states and 674 transitions. [2023-11-23 07:33:49,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-11-23 07:33:49,330 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 4.423076923076923) internal successors, (115), 28 states have internal predecessors, (115), 9 states have call successors, (23), 3 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 9 states have call successors, (22) Word has length 86 [2023-11-23 07:33:49,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:33:49,332 INFO L225 Difference]: With dead ends: 490 [2023-11-23 07:33:49,332 INFO L226 Difference]: Without dead ends: 322 [2023-11-23 07:33:49,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=449, Invalid=2631, Unknown=0, NotChecked=0, Total=3080 [2023-11-23 07:33:49,334 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 458 mSDsluCounter, 921 mSDsCounter, 0 mSdLazyCounter, 1161 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 1238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-23 07:33:49,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 998 Invalid, 1238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1161 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-23 07:33:49,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2023-11-23 07:33:49,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 243. [2023-11-23 07:33:49,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 176 states have (on average 1.2556818181818181) internal successors, (221), 185 states have internal predecessors, (221), 44 states have call successors, (44), 16 states have call predecessors, (44), 22 states have return successors, (57), 41 states have call predecessors, (57), 41 states have call successors, (57) [2023-11-23 07:33:49,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 322 transitions. [2023-11-23 07:33:49,362 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 322 transitions. Word has length 86 [2023-11-23 07:33:49,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:33:49,362 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 322 transitions. [2023-11-23 07:33:49,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 4.423076923076923) internal successors, (115), 28 states have internal predecessors, (115), 9 states have call successors, (23), 3 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 9 states have call successors, (22) [2023-11-23 07:33:49,363 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 322 transitions. [2023-11-23 07:33:49,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-11-23 07:33:49,363 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:33:49,364 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:33:49,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-11-23 07:33:49,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-23 07:33:49,573 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:33:49,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:33:49,574 INFO L85 PathProgramCache]: Analyzing trace with hash 946571853, now seen corresponding path program 1 times [2023-11-23 07:33:49,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:33:49,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054046572] [2023-11-23 07:33:49,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:33:49,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:33:49,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:49,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:33:49,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:49,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:33:49,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:49,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:33:49,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:49,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:33:49,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:49,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 07:33:49,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:49,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 07:33:49,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:49,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-23 07:33:49,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:49,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-23 07:33:49,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:49,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-23 07:33:49,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:49,748 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-11-23 07:33:49,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:33:49,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054046572] [2023-11-23 07:33:49,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054046572] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:33:49,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419220941] [2023-11-23 07:33:49,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:33:49,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:33:49,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:33:49,750 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:33:49,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-23 07:33:49,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:49,935 INFO L262 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 71 conjunts are in the unsatisfiable core [2023-11-23 07:33:49,937 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:33:49,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-11-23 07:33:49,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:33:49,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-23 07:33:50,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:33:50,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:33:50,018 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 30 treesize of output 27 [2023-11-23 07:33:50,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 11 [2023-11-23 07:33:50,302 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 30 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-23 07:33:50,302 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:33:50,620 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:33:50,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 34 [2023-11-23 07:33:50,635 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:33:50,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 161 treesize of output 175 [2023-11-23 07:33:50,653 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 174 treesize of output 166 [2023-11-23 07:33:50,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-23 07:33:50,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-23 07:33:50,800 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:33:50,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2023-11-23 07:33:50,827 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:33:50,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 107 [2023-11-23 07:33:50,973 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-23 07:33:50,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419220941] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 07:33:50,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 07:33:50,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 12, 11] total 25 [2023-11-23 07:33:50,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240590649] [2023-11-23 07:33:50,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 07:33:50,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-23 07:33:50,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:33:50,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-23 07:33:50,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=509, Unknown=15, NotChecked=0, Total=600 [2023-11-23 07:33:50,975 INFO L87 Difference]: Start difference. First operand 243 states and 322 transitions. Second operand has 25 states, 22 states have (on average 5.318181818181818) internal successors, (117), 24 states have internal predecessors, (117), 9 states have call successors, (26), 3 states have call predecessors, (26), 7 states have return successors, (25), 7 states have call predecessors, (25), 9 states have call successors, (25) [2023-11-23 07:33:52,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:33:52,429 INFO L93 Difference]: Finished difference Result 439 states and 592 transitions. [2023-11-23 07:33:52,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-23 07:33:52,429 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 5.318181818181818) internal successors, (117), 24 states have internal predecessors, (117), 9 states have call successors, (26), 3 states have call predecessors, (26), 7 states have return successors, (25), 7 states have call predecessors, (25), 9 states have call successors, (25) Word has length 87 [2023-11-23 07:33:52,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:33:52,431 INFO L225 Difference]: With dead ends: 439 [2023-11-23 07:33:52,431 INFO L226 Difference]: Without dead ends: 283 [2023-11-23 07:33:52,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=208, Invalid=1334, Unknown=18, NotChecked=0, Total=1560 [2023-11-23 07:33:52,432 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 143 mSDsluCounter, 1200 mSDsCounter, 0 mSdLazyCounter, 1330 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 1287 SdHoareTripleChecker+Invalid, 1384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-23 07:33:52,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 1287 Invalid, 1384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1330 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-23 07:33:52,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2023-11-23 07:33:52,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 249. [2023-11-23 07:33:52,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 181 states have (on average 1.2596685082872927) internal successors, (228), 190 states have internal predecessors, (228), 44 states have call successors, (44), 17 states have call predecessors, (44), 23 states have return successors, (55), 41 states have call predecessors, (55), 41 states have call successors, (55) [2023-11-23 07:33:52,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 327 transitions. [2023-11-23 07:33:52,458 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 327 transitions. Word has length 87 [2023-11-23 07:33:52,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:33:52,458 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 327 transitions. [2023-11-23 07:33:52,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 5.318181818181818) internal successors, (117), 24 states have internal predecessors, (117), 9 states have call successors, (26), 3 states have call predecessors, (26), 7 states have return successors, (25), 7 states have call predecessors, (25), 9 states have call successors, (25) [2023-11-23 07:33:52,458 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 327 transitions. [2023-11-23 07:33:52,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-23 07:33:52,459 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:33:52,459 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:33:52,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-11-23 07:33:52,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:33:52,674 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:33:52,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:33:52,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1783701773, now seen corresponding path program 1 times [2023-11-23 07:33:52,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:33:52,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35441730] [2023-11-23 07:33:52,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:33:52,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:33:52,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:52,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:33:52,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:52,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:33:52,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:52,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:33:52,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:52,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:33:52,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:52,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 07:33:52,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:52,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 07:33:52,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:52,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:33:52,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:52,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-23 07:33:52,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:52,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 07:33:52,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:52,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:33:52,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:52,869 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-11-23 07:33:52,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:33:52,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35441730] [2023-11-23 07:33:52,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35441730] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:33:52,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734364681] [2023-11-23 07:33:52,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:33:52,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:33:52,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:33:52,870 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:33:52,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-23 07:33:53,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:53,059 INFO L262 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 117 conjunts are in the unsatisfiable core [2023-11-23 07:33:53,062 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:33:53,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2023-11-23 07:33:53,133 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 9 treesize of output 8 [2023-11-23 07:33:53,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-11-23 07:33:54,920 INFO L349 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2023-11-23 07:33:54,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 18 case distinctions, treesize of input 68 treesize of output 1 [2023-11-23 07:33:54,922 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 76 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 07:33:54,922 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:34:00,628 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:34:00,737 INFO L349 Elim1Store]: treesize reduction 223, result has 49.4 percent of original size [2023-11-23 07:34:00,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 11 case distinctions, treesize of input 4412 treesize of output 3330 [2023-11-23 07:34:00,993 INFO L349 Elim1Store]: treesize reduction 17, result has 86.4 percent of original size [2023-11-23 07:34:00,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 20279 treesize of output 18978 [2023-11-23 07:34:01,318 INFO L349 Elim1Store]: treesize reduction 24, result has 81.7 percent of original size [2023-11-23 07:34:01,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 2950 treesize of output 2807 [2023-11-23 07:34:01,596 INFO L349 Elim1Store]: treesize reduction 51, result has 68.3 percent of original size [2023-11-23 07:34:01,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 2210 treesize of output 2189 [2023-11-23 07:34:01,759 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:34:01,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 3203 treesize of output 3099 [2023-11-23 07:34:02,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-23 07:34:09,925 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-23 07:34:09,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 [2023-11-23 07:34:09,948 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:34:09,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 83 [2023-11-23 07:34:10,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-23 07:34:10,189 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-23 07:34:10,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-23 07:34:10,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-23 07:34:10,486 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-23 07:34:10,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2023-11-23 07:34:10,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-23 07:34:10,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-23 07:34:11,167 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:34:11,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 152 [2023-11-23 07:34:11,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:34:11,239 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:34:11,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 88 [2023-11-23 07:34:11,263 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:34:11,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 48 [2023-11-23 07:34:11,275 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:34:11,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 44 [2023-11-23 07:34:11,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:34:11,294 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-23 07:34:11,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 1 [2023-11-23 07:34:11,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:34:11,303 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 11 treesize of output 9 [2023-11-23 07:34:11,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:34:11,323 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-23 07:34:11,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 1 [2023-11-23 07:34:11,459 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 8 proven. 62 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-23 07:34:11,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734364681] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 07:34:11,459 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 07:34:11,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 27, 25] total 55 [2023-11-23 07:34:11,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286907353] [2023-11-23 07:34:11,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 07:34:11,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2023-11-23 07:34:11,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:34:11,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2023-11-23 07:34:11,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=2744, Unknown=2, NotChecked=0, Total=2970 [2023-11-23 07:34:11,461 INFO L87 Difference]: Start difference. First operand 249 states and 327 transitions. Second operand has 55 states, 46 states have (on average 3.5869565217391304) internal successors, (165), 47 states have internal predecessors, (165), 15 states have call successors, (27), 4 states have call predecessors, (27), 13 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) [2023-11-23 07:34:18,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:34:18,380 INFO L93 Difference]: Finished difference Result 540 states and 736 transitions. [2023-11-23 07:34:18,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-11-23 07:34:18,380 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 46 states have (on average 3.5869565217391304) internal successors, (165), 47 states have internal predecessors, (165), 15 states have call successors, (27), 4 states have call predecessors, (27), 13 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) Word has length 104 [2023-11-23 07:34:18,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:34:18,382 INFO L225 Difference]: With dead ends: 540 [2023-11-23 07:34:18,382 INFO L226 Difference]: Without dead ends: 347 [2023-11-23 07:34:18,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 189 SyntacticMatches, 1 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2690 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=1169, Invalid=9541, Unknown=2, NotChecked=0, Total=10712 [2023-11-23 07:34:18,385 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 430 mSDsluCounter, 1090 mSDsCounter, 0 mSdLazyCounter, 2314 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 1134 SdHoareTripleChecker+Invalid, 2485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 2314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-11-23 07:34:18,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 1134 Invalid, 2485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 2314 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-11-23 07:34:18,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2023-11-23 07:34:18,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 255. [2023-11-23 07:34:18,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 185 states have (on average 1.2540540540540541) internal successors, (232), 195 states have internal predecessors, (232), 44 states have call successors, (44), 17 states have call predecessors, (44), 25 states have return successors, (59), 42 states have call predecessors, (59), 41 states have call successors, (59) [2023-11-23 07:34:18,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 335 transitions. [2023-11-23 07:34:18,421 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 335 transitions. Word has length 104 [2023-11-23 07:34:18,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:34:18,422 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 335 transitions. [2023-11-23 07:34:18,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 46 states have (on average 3.5869565217391304) internal successors, (165), 47 states have internal predecessors, (165), 15 states have call successors, (27), 4 states have call predecessors, (27), 13 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) [2023-11-23 07:34:18,422 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 335 transitions. [2023-11-23 07:34:18,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-23 07:34:18,423 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:34:18,423 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:34:18,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-11-23 07:34:18,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-23 07:34:18,637 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:34:18,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:34:18,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1640410158, now seen corresponding path program 1 times [2023-11-23 07:34:18,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:34:18,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525360800] [2023-11-23 07:34:18,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:34:18,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:34:18,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:34:18,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:34:18,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:34:18,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:34:18,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:34:18,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:34:18,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:34:19,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:34:19,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:34:19,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 07:34:19,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:34:19,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 07:34:19,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:34:19,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:34:19,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:34:19,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 07:34:19,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:34:19,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-23 07:34:19,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:34:19,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:34:19,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:34:19,271 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 28 proven. 34 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-11-23 07:34:19,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:34:19,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525360800] [2023-11-23 07:34:19,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525360800] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:34:19,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542499741] [2023-11-23 07:34:19,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:34:19,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:34:19,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:34:19,273 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:34:19,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-23 07:34:19,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:34:19,472 INFO L262 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 57 conjunts are in the unsatisfiable core [2023-11-23 07:34:19,474 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:34:19,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:34:19,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2023-11-23 07:34:20,690 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2023-11-23 07:34:20,690 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:34:20,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542499741] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:34:20,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:34:20,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [17] total 30 [2023-11-23 07:34:20,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833553772] [2023-11-23 07:34:20,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:34:20,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-23 07:34:20,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:34:20,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-23 07:34:20,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=790, Unknown=0, NotChecked=0, Total=870 [2023-11-23 07:34:20,692 INFO L87 Difference]: Start difference. First operand 255 states and 335 transitions. Second operand has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 6 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2023-11-23 07:34:21,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:34:21,709 INFO L93 Difference]: Finished difference Result 345 states and 457 transitions. [2023-11-23 07:34:21,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-23 07:34:21,709 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 6 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) Word has length 107 [2023-11-23 07:34:21,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:34:21,710 INFO L225 Difference]: With dead ends: 345 [2023-11-23 07:34:21,710 INFO L226 Difference]: Without dead ends: 263 [2023-11-23 07:34:21,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 104 SyntacticMatches, 9 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=162, Invalid=1320, Unknown=0, NotChecked=0, Total=1482 [2023-11-23 07:34:21,711 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 69 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-23 07:34:21,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 507 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-23 07:34:21,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2023-11-23 07:34:21,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 259. [2023-11-23 07:34:21,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 188 states have (on average 1.2553191489361701) internal successors, (236), 199 states have internal predecessors, (236), 44 states have call successors, (44), 17 states have call predecessors, (44), 26 states have return successors, (61), 42 states have call predecessors, (61), 41 states have call successors, (61) [2023-11-23 07:34:21,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 341 transitions. [2023-11-23 07:34:21,747 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 341 transitions. Word has length 107 [2023-11-23 07:34:21,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:34:21,748 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 341 transitions. [2023-11-23 07:34:21,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 6 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2023-11-23 07:34:21,748 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 341 transitions. [2023-11-23 07:34:21,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-23 07:34:21,749 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:34:21,749 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:34:21,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-11-23 07:34:21,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-23 07:34:21,962 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:34:21,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:34:21,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1053604144, now seen corresponding path program 1 times [2023-11-23 07:34:21,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:34:21,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542363019] [2023-11-23 07:34:21,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:34:21,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:34:21,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:34:22,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:34:22,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:34:22,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:34:22,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:34:22,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:34:22,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:34:22,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:34:22,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:34:22,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 07:34:22,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:34:22,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 07:34:22,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:34:22,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:34:22,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:34:22,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 07:34:22,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:34:22,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-23 07:34:22,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:34:22,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:34:22,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:34:22,310 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 28 proven. 41 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-23 07:34:22,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:34:22,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542363019] [2023-11-23 07:34:22,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542363019] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:34:22,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100106805] [2023-11-23 07:34:22,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:34:22,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:34:22,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:34:22,312 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:34:22,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-11-23 07:34:22,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:34:22,514 INFO L262 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-23 07:34:22,516 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:34:22,643 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2023-11-23 07:34:22,643 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:34:22,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100106805] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:34:22,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:34:22,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 22 [2023-11-23 07:34:22,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224693082] [2023-11-23 07:34:22,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:34:22,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 07:34:22,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:34:22,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 07:34:22,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2023-11-23 07:34:22,644 INFO L87 Difference]: Start difference. First operand 259 states and 341 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 5 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2023-11-23 07:34:22,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:34:22,919 INFO L93 Difference]: Finished difference Result 565 states and 769 transitions. [2023-11-23 07:34:22,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-23 07:34:22,919 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 5 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) Word has length 107 [2023-11-23 07:34:22,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:34:22,920 INFO L225 Difference]: With dead ends: 565 [2023-11-23 07:34:22,921 INFO L226 Difference]: Without dead ends: 282 [2023-11-23 07:34:22,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=663, Unknown=0, NotChecked=0, Total=756 [2023-11-23 07:34:22,922 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 50 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 07:34:22,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 454 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 07:34:22,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2023-11-23 07:34:22,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 264. [2023-11-23 07:34:22,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 192 states have (on average 1.2552083333333333) internal successors, (241), 205 states have internal predecessors, (241), 44 states have call successors, (44), 17 states have call predecessors, (44), 27 states have return successors, (59), 41 states have call predecessors, (59), 41 states have call successors, (59) [2023-11-23 07:34:22,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 344 transitions. [2023-11-23 07:34:22,958 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 344 transitions. Word has length 107 [2023-11-23 07:34:22,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:34:22,959 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 344 transitions. [2023-11-23 07:34:22,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 5 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2023-11-23 07:34:22,959 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 344 transitions. [2023-11-23 07:34:22,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-23 07:34:22,960 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:34:22,960 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:34:22,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-11-23 07:34:23,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-23 07:34:23,165 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:34:23,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:34:23,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1255093782, now seen corresponding path program 1 times [2023-11-23 07:34:23,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:34:23,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81446744] [2023-11-23 07:34:23,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:34:23,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:34:23,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:34:23,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:34:23,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:34:23,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:34:23,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:34:23,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:34:23,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:34:23,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:34:23,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:34:23,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 07:34:23,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:34:23,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-23 07:34:23,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:34:23,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 07:34:23,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:34:23,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:34:23,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:34:23,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 07:34:23,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:34:23,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-23 07:34:23,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:34:23,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-23 07:34:23,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:34:23,528 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-11-23 07:34:23,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:34:23,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81446744] [2023-11-23 07:34:23,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81446744] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:34:23,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070330158] [2023-11-23 07:34:23,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:34:23,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:34:23,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:34:23,529 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:34:23,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-11-23 07:34:23,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:34:23,745 INFO L262 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-23 07:34:23,747 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:34:23,765 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-11-23 07:34:23,766 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:34:23,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070330158] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:34:23,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:34:23,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2023-11-23 07:34:23,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316797252] [2023-11-23 07:34:23,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:34:23,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 07:34:23,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:34:23,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 07:34:23,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-11-23 07:34:23,769 INFO L87 Difference]: Start difference. First operand 264 states and 344 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-23 07:34:23,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:34:23,844 INFO L93 Difference]: Finished difference Result 435 states and 594 transitions. [2023-11-23 07:34:23,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 07:34:23,844 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 110 [2023-11-23 07:34:23,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:34:23,845 INFO L225 Difference]: With dead ends: 435 [2023-11-23 07:34:23,846 INFO L226 Difference]: Without dead ends: 271 [2023-11-23 07:34:23,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-11-23 07:34:23,847 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 8 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 07:34:23,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 202 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 07:34:23,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2023-11-23 07:34:23,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 264. [2023-11-23 07:34:23,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 192 states have (on average 1.2447916666666667) internal successors, (239), 205 states have internal predecessors, (239), 44 states have call successors, (44), 17 states have call predecessors, (44), 27 states have return successors, (59), 41 states have call predecessors, (59), 41 states have call successors, (59) [2023-11-23 07:34:23,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 342 transitions. [2023-11-23 07:34:23,883 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 342 transitions. Word has length 110 [2023-11-23 07:34:23,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:34:23,884 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 342 transitions. [2023-11-23 07:34:23,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-23 07:34:23,884 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 342 transitions. [2023-11-23 07:34:23,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-23 07:34:23,885 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:34:23,885 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:34:23,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-11-23 07:34:24,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:34:24,095 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:34:24,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:34:24,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1100711468, now seen corresponding path program 1 times [2023-11-23 07:34:24,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:34:24,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057126779] [2023-11-23 07:34:24,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:34:24,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:34:24,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:34:24,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:34:24,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:34:24,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:34:24,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:34:24,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:34:24,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:34:24,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:34:24,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:34:24,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 07:34:24,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:34:24,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-23 07:34:24,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:34:24,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 07:34:24,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:34:24,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:34:24,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:34:24,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 07:34:24,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:34:24,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-23 07:34:24,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:34:24,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-23 07:34:24,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:34:24,429 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-11-23 07:34:24,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:34:24,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057126779] [2023-11-23 07:34:24,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057126779] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:34:24,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755521606] [2023-11-23 07:34:24,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:34:24,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:34:24,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:34:24,431 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:34:24,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-11-23 07:34:24,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:34:24,645 INFO L262 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-23 07:34:24,646 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:34:24,663 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-11-23 07:34:24,663 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:34:24,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755521606] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:34:24,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:34:24,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2023-11-23 07:34:24,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949291090] [2023-11-23 07:34:24,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:34:24,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 07:34:24,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:34:24,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 07:34:24,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-11-23 07:34:24,664 INFO L87 Difference]: Start difference. First operand 264 states and 342 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-23 07:34:24,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:34:24,723 INFO L93 Difference]: Finished difference Result 494 states and 661 transitions. [2023-11-23 07:34:24,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 07:34:24,723 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 110 [2023-11-23 07:34:24,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:34:24,724 INFO L225 Difference]: With dead ends: 494 [2023-11-23 07:34:24,724 INFO L226 Difference]: Without dead ends: 258 [2023-11-23 07:34:24,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-11-23 07:34:24,725 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 2 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 07:34:24,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 192 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 07:34:24,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2023-11-23 07:34:24,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 250. [2023-11-23 07:34:24,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 180 states have (on average 1.2055555555555555) internal successors, (217), 193 states have internal predecessors, (217), 42 states have call successors, (42), 17 states have call predecessors, (42), 27 states have return successors, (57), 39 states have call predecessors, (57), 39 states have call successors, (57) [2023-11-23 07:34:24,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 316 transitions. [2023-11-23 07:34:24,756 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 316 transitions. Word has length 110 [2023-11-23 07:34:24,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:34:24,756 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 316 transitions. [2023-11-23 07:34:24,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-23 07:34:24,757 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 316 transitions. [2023-11-23 07:34:24,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-23 07:34:24,757 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:34:24,758 INFO L195 NwaCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:34:24,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-11-23 07:34:24,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:34:24,971 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:34:24,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:34:24,971 INFO L85 PathProgramCache]: Analyzing trace with hash -404831273, now seen corresponding path program 1 times [2023-11-23 07:34:24,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:34:24,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447900415] [2023-11-23 07:34:24,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:34:24,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:34:25,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 07:34:25,034 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-23 07:34:25,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 07:34:25,114 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-23 07:34:25,115 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-23 07:34:25,116 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-23 07:34:25,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-23 07:34:25,119 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:34:25,122 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-23 07:34:25,163 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret554 could not be translated [2023-11-23 07:34:25,165 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2023-11-23 07:34:25,165 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated [2023-11-23 07:34:25,165 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated [2023-11-23 07:34:25,166 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem305 [2023-11-23 07:34:25,166 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem305 [2023-11-23 07:34:25,166 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated [2023-11-23 07:34:25,166 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated [2023-11-23 07:34:25,166 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated [2023-11-23 07:34:25,166 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem305 [2023-11-23 07:34:25,166 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem307 [2023-11-23 07:34:25,167 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated [2023-11-23 07:34:25,167 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated [2023-11-23 07:34:25,167 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem305 [2023-11-23 07:34:25,167 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem307 [2023-11-23 07:34:25,167 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short310 could not be translated [2023-11-23 07:34:25,167 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated [2023-11-23 07:34:25,168 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short310 could not be translated [2023-11-23 07:34:25,168 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated [2023-11-23 07:34:25,168 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem305 [2023-11-23 07:34:25,168 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated [2023-11-23 07:34:25,168 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem309 [2023-11-23 07:34:25,168 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem307 [2023-11-23 07:34:25,169 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem305 [2023-11-23 07:34:25,169 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated [2023-11-23 07:34:25,172 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short310 could not be translated [2023-11-23 07:34:25,173 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short312 could not be translated [2023-11-23 07:34:25,173 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem307 [2023-11-23 07:34:25,173 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem309 [2023-11-23 07:34:25,173 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated [2023-11-23 07:34:25,173 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem305 [2023-11-23 07:34:25,173 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated [2023-11-23 07:34:25,173 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short312 could not be translated [2023-11-23 07:34:25,173 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem309 [2023-11-23 07:34:25,173 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated [2023-11-23 07:34:25,174 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short310 could not be translated [2023-11-23 07:34:25,174 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem311 [2023-11-23 07:34:25,174 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem307 [2023-11-23 07:34:25,175 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short315 could not be translated [2023-11-23 07:34:25,175 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short315 could not be translated [2023-11-23 07:34:25,175 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem314 [2023-11-23 07:34:25,175 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short315 could not be translated [2023-11-23 07:34:25,175 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short318 could not be translated [2023-11-23 07:34:25,175 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem314 [2023-11-23 07:34:25,176 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short315 could not be translated [2023-11-23 07:34:25,176 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short318 could not be translated [2023-11-23 07:34:25,176 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem316 [2023-11-23 07:34:25,176 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem317 [2023-11-23 07:34:25,176 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem314 [2023-11-23 07:34:25,176 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret324 could not be translated [2023-11-23 07:34:25,178 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret683 could not be translated [2023-11-23 07:34:25,180 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret683 could not be translated [2023-11-23 07:34:25,180 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated [2023-11-23 07:34:25,180 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated [2023-11-23 07:34:25,181 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem305 [2023-11-23 07:34:25,181 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated [2023-11-23 07:34:25,181 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated [2023-11-23 07:34:25,181 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem305 [2023-11-23 07:34:25,182 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem307 [2023-11-23 07:34:25,183 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated [2023-11-23 07:34:25,183 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem305 [2023-11-23 07:34:25,183 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated [2023-11-23 07:34:25,183 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated [2023-11-23 07:34:25,183 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem307 [2023-11-23 07:34:25,183 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated [2023-11-23 07:34:25,183 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem305 [2023-11-23 07:34:25,183 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short310 could not be translated [2023-11-23 07:34:25,184 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem307 [2023-11-23 07:34:25,184 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated [2023-11-23 07:34:25,184 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated [2023-11-23 07:34:25,184 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem309 [2023-11-23 07:34:25,184 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short310 could not be translated [2023-11-23 07:34:25,184 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem305 [2023-11-23 07:34:25,184 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem307 [2023-11-23 07:34:25,184 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated [2023-11-23 07:34:25,184 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated [2023-11-23 07:34:25,184 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short310 could not be translated [2023-11-23 07:34:25,185 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem305 [2023-11-23 07:34:25,185 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short312 could not be translated [2023-11-23 07:34:25,185 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem309 [2023-11-23 07:34:25,185 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem307 [2023-11-23 07:34:25,185 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem305 [2023-11-23 07:34:25,185 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short310 could not be translated [2023-11-23 07:34:25,185 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem309 [2023-11-23 07:34:25,185 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem311 [2023-11-23 07:34:25,185 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short312 could not be translated [2023-11-23 07:34:25,186 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated [2023-11-23 07:34:25,186 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated [2023-11-23 07:34:25,186 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short315 could not be translated [2023-11-23 07:34:25,187 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short315 could not be translated [2023-11-23 07:34:25,187 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem314 [2023-11-23 07:34:25,187 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short315 could not be translated [2023-11-23 07:34:25,187 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short318 could not be translated [2023-11-23 07:34:25,187 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem314 [2023-11-23 07:34:25,187 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem316 [2023-11-23 07:34:25,187 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem314 [2023-11-23 07:34:25,187 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short315 could not be translated [2023-11-23 07:34:25,187 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short318 could not be translated [2023-11-23 07:34:25,188 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem317 [2023-11-23 07:34:25,188 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret324 could not be translated [2023-11-23 07:34:25,190 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret338 could not be translated [2023-11-23 07:34:25,190 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret338 could not be translated [2023-11-23 07:34:25,190 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated [2023-11-23 07:34:25,190 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated [2023-11-23 07:34:25,190 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem305 [2023-11-23 07:34:25,191 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated [2023-11-23 07:34:25,191 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated [2023-11-23 07:34:25,191 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem305 [2023-11-23 07:34:25,191 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated [2023-11-23 07:34:25,191 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem307 [2023-11-23 07:34:25,191 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated [2023-11-23 07:34:25,191 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem305 [2023-11-23 07:34:25,192 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated [2023-11-23 07:34:25,192 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short310 could not be translated [2023-11-23 07:34:25,192 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem307 [2023-11-23 07:34:25,192 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated [2023-11-23 07:34:25,192 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem305 [2023-11-23 07:34:25,192 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem309 [2023-11-23 07:34:25,192 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem307 [2023-11-23 07:34:25,192 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated [2023-11-23 07:34:25,192 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem305 [2023-11-23 07:34:25,192 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short310 could not be translated [2023-11-23 07:34:25,193 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated [2023-11-23 07:34:25,193 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem307 [2023-11-23 07:34:25,193 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem309 [2023-11-23 07:34:25,193 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short310 could not be translated [2023-11-23 07:34:25,193 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short312 could not be translated [2023-11-23 07:34:25,193 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem305 [2023-11-23 07:34:25,193 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated [2023-11-23 07:34:25,193 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated [2023-11-23 07:34:25,194 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem307 [2023-11-23 07:34:25,194 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem311 [2023-11-23 07:34:25,194 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem305 [2023-11-23 07:34:25,194 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem309 [2023-11-23 07:34:25,194 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short312 could not be translated [2023-11-23 07:34:25,194 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated [2023-11-23 07:34:25,194 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short310 could not be translated [2023-11-23 07:34:25,194 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated [2023-11-23 07:34:25,195 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short315 could not be translated [2023-11-23 07:34:25,195 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short315 could not be translated [2023-11-23 07:34:25,195 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem314 [2023-11-23 07:34:25,195 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short315 could not be translated [2023-11-23 07:34:25,195 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short318 could not be translated [2023-11-23 07:34:25,195 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem314 [2023-11-23 07:34:25,195 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem317 [2023-11-23 07:34:25,196 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short315 could not be translated [2023-11-23 07:34:25,196 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short318 could not be translated [2023-11-23 07:34:25,196 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem314 [2023-11-23 07:34:25,196 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem316 [2023-11-23 07:34:25,196 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret324 could not be translated [2023-11-23 07:34:25,196 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret339 could not be translated [2023-11-23 07:34:25,210 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 07:34:25 BoogieIcfgContainer [2023-11-23 07:34:25,210 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-23 07:34:25,211 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-23 07:34:25,211 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-23 07:34:25,211 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-23 07:34:25,211 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:31:43" (3/4) ... [2023-11-23 07:34:25,212 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-23 07:34:25,224 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret554 could not be translated [2023-11-23 07:34:25,224 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2023-11-23 07:34:25,225 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated [2023-11-23 07:34:25,225 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem305 [2023-11-23 07:34:25,225 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated [2023-11-23 07:34:25,226 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem305 [2023-11-23 07:34:25,226 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated [2023-11-23 07:34:25,226 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated [2023-11-23 07:34:25,226 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem307 [2023-11-23 07:34:25,226 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated [2023-11-23 07:34:25,226 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated [2023-11-23 07:34:25,227 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem305 [2023-11-23 07:34:25,227 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem307 [2023-11-23 07:34:25,227 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated [2023-11-23 07:34:25,227 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short310 could not be translated [2023-11-23 07:34:25,227 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem305 [2023-11-23 07:34:25,228 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated [2023-11-23 07:34:25,228 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated [2023-11-23 07:34:25,228 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated [2023-11-23 07:34:25,228 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem305 [2023-11-23 07:34:25,228 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem307 [2023-11-23 07:34:25,228 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem309 [2023-11-23 07:34:25,228 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short310 could not be translated [2023-11-23 07:34:25,228 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated [2023-11-23 07:34:25,228 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem307 [2023-11-23 07:34:25,228 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated [2023-11-23 07:34:25,229 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem309 [2023-11-23 07:34:25,229 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem305 [2023-11-23 07:34:25,229 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short312 could not be translated [2023-11-23 07:34:25,229 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short310 could not be translated [2023-11-23 07:34:25,229 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated [2023-11-23 07:34:25,229 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short312 could not be translated [2023-11-23 07:34:25,229 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short310 could not be translated [2023-11-23 07:34:25,229 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem307 [2023-11-23 07:34:25,229 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated [2023-11-23 07:34:25,229 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem309 [2023-11-23 07:34:25,230 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem311 [2023-11-23 07:34:25,230 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem305 [2023-11-23 07:34:25,230 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short315 could not be translated [2023-11-23 07:34:25,230 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short315 could not be translated [2023-11-23 07:34:25,230 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem314 [2023-11-23 07:34:25,230 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short315 could not be translated [2023-11-23 07:34:25,230 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short318 could not be translated [2023-11-23 07:34:25,230 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem314 [2023-11-23 07:34:25,231 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short315 could not be translated [2023-11-23 07:34:25,231 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short318 could not be translated [2023-11-23 07:34:25,231 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem316 [2023-11-23 07:34:25,231 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem317 [2023-11-23 07:34:25,231 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem314 [2023-11-23 07:34:25,231 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret324 could not be translated [2023-11-23 07:34:25,231 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret683 could not be translated [2023-11-23 07:34:25,233 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret683 could not be translated [2023-11-23 07:34:25,233 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated [2023-11-23 07:34:25,234 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem305 [2023-11-23 07:34:25,234 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated [2023-11-23 07:34:25,234 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem305 [2023-11-23 07:34:25,234 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated [2023-11-23 07:34:25,234 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated [2023-11-23 07:34:25,234 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated [2023-11-23 07:34:25,234 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem307 [2023-11-23 07:34:25,235 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated [2023-11-23 07:34:25,235 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem305 [2023-11-23 07:34:25,235 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem305 [2023-11-23 07:34:25,235 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short310 could not be translated [2023-11-23 07:34:25,235 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated [2023-11-23 07:34:25,235 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem307 [2023-11-23 07:34:25,235 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated [2023-11-23 07:34:25,235 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem309 [2023-11-23 07:34:25,235 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short310 could not be translated [2023-11-23 07:34:25,235 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated [2023-11-23 07:34:25,236 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem307 [2023-11-23 07:34:25,236 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated [2023-11-23 07:34:25,236 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem305 [2023-11-23 07:34:25,236 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem305 [2023-11-23 07:34:25,236 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem307 [2023-11-23 07:34:25,236 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem309 [2023-11-23 07:34:25,236 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated [2023-11-23 07:34:25,236 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short310 could not be translated [2023-11-23 07:34:25,236 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated [2023-11-23 07:34:25,237 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short312 could not be translated [2023-11-23 07:34:25,237 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem311 [2023-11-23 07:34:25,237 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short310 could not be translated [2023-11-23 07:34:25,237 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem309 [2023-11-23 07:34:25,237 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated [2023-11-23 07:34:25,237 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated [2023-11-23 07:34:25,237 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem305 [2023-11-23 07:34:25,237 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short312 could not be translated [2023-11-23 07:34:25,237 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem307 [2023-11-23 07:34:25,239 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short315 could not be translated [2023-11-23 07:34:25,239 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short315 could not be translated [2023-11-23 07:34:25,239 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem314 [2023-11-23 07:34:25,239 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem314 [2023-11-23 07:34:25,239 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short315 could not be translated [2023-11-23 07:34:25,239 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short318 could not be translated [2023-11-23 07:34:25,240 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem316 [2023-11-23 07:34:25,240 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short315 could not be translated [2023-11-23 07:34:25,240 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short318 could not be translated [2023-11-23 07:34:25,240 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem317 [2023-11-23 07:34:25,240 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem314 [2023-11-23 07:34:25,241 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret324 could not be translated [2023-11-23 07:34:25,241 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret338 could not be translated [2023-11-23 07:34:25,242 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret338 could not be translated [2023-11-23 07:34:25,242 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated [2023-11-23 07:34:25,242 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated [2023-11-23 07:34:25,242 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem305 [2023-11-23 07:34:25,243 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated [2023-11-23 07:34:25,243 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem305 [2023-11-23 07:34:25,243 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated [2023-11-23 07:34:25,243 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem307 [2023-11-23 07:34:25,243 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem305 [2023-11-23 07:34:25,243 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated [2023-11-23 07:34:25,243 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated [2023-11-23 07:34:25,243 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem305 [2023-11-23 07:34:25,243 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short310 could not be translated [2023-11-23 07:34:25,243 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated [2023-11-23 07:34:25,244 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem307 [2023-11-23 07:34:25,244 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated [2023-11-23 07:34:25,244 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem309 [2023-11-23 07:34:25,244 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short310 could not be translated [2023-11-23 07:34:25,244 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated [2023-11-23 07:34:25,244 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem305 [2023-11-23 07:34:25,244 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem307 [2023-11-23 07:34:25,244 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated [2023-11-23 07:34:25,244 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short310 could not be translated [2023-11-23 07:34:25,244 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated [2023-11-23 07:34:25,245 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem309 [2023-11-23 07:34:25,245 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short312 could not be translated [2023-11-23 07:34:25,245 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem305 [2023-11-23 07:34:25,245 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem307 [2023-11-23 07:34:25,246 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated [2023-11-23 07:34:25,246 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem305 [2023-11-23 07:34:25,246 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated [2023-11-23 07:34:25,246 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem311 [2023-11-23 07:34:25,246 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem309 [2023-11-23 07:34:25,246 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem307 [2023-11-23 07:34:25,246 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short310 could not be translated [2023-11-23 07:34:25,246 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated [2023-11-23 07:34:25,246 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short312 could not be translated [2023-11-23 07:34:25,246 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short315 could not be translated [2023-11-23 07:34:25,248 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short315 could not be translated [2023-11-23 07:34:25,248 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem314 [2023-11-23 07:34:25,248 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short315 could not be translated [2023-11-23 07:34:25,248 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short318 could not be translated [2023-11-23 07:34:25,248 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem314 [2023-11-23 07:34:25,248 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short315 could not be translated [2023-11-23 07:34:25,249 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem316 [2023-11-23 07:34:25,249 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short318 could not be translated [2023-11-23 07:34:25,249 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem314 [2023-11-23 07:34:25,249 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem317 [2023-11-23 07:34:25,249 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret324 could not be translated [2023-11-23 07:34:25,249 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret339 could not be translated [2023-11-23 07:34:25,281 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-11-23 07:34:25,287 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-23 07:34:25,288 INFO L158 Benchmark]: Toolchain (without parser) took 164566.34ms. Allocated memory was 163.6MB in the beginning and 983.6MB in the end (delta: 820.0MB). Free memory was 125.5MB in the beginning and 382.3MB in the end (delta: -256.8MB). Peak memory consumption was 563.6MB. Max. memory is 16.1GB. [2023-11-23 07:34:25,288 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 130.0MB. Free memory is still 91.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 07:34:25,288 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1742.34ms. Allocated memory was 163.6MB in the beginning and 234.9MB in the end (delta: 71.3MB). Free memory was 125.5MB in the beginning and 169.9MB in the end (delta: -44.4MB). Peak memory consumption was 80.8MB. Max. memory is 16.1GB. [2023-11-23 07:34:25,288 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.79ms. Allocated memory is still 234.9MB. Free memory was 169.9MB in the beginning and 164.6MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-23 07:34:25,289 INFO L158 Benchmark]: Boogie Preprocessor took 88.73ms. Allocated memory is still 234.9MB. Free memory was 164.6MB in the beginning and 160.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-23 07:34:25,289 INFO L158 Benchmark]: RCFGBuilder took 475.80ms. Allocated memory is still 234.9MB. Free memory was 160.4MB in the beginning and 134.2MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2023-11-23 07:34:25,289 INFO L158 Benchmark]: TraceAbstraction took 162092.86ms. Allocated memory was 234.9MB in the beginning and 983.6MB in the end (delta: 748.7MB). Free memory was 133.2MB in the beginning and 395.9MB in the end (delta: -262.7MB). Peak memory consumption was 484.9MB. Max. memory is 16.1GB. [2023-11-23 07:34:25,289 INFO L158 Benchmark]: Witness Printer took 76.59ms. Allocated memory is still 983.6MB. Free memory was 395.9MB in the beginning and 382.3MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-23 07:34:25,291 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 130.0MB. Free memory is still 91.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1742.34ms. Allocated memory was 163.6MB in the beginning and 234.9MB in the end (delta: 71.3MB). Free memory was 125.5MB in the beginning and 169.9MB in the end (delta: -44.4MB). Peak memory consumption was 80.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.79ms. Allocated memory is still 234.9MB. Free memory was 169.9MB in the beginning and 164.6MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 88.73ms. Allocated memory is still 234.9MB. Free memory was 164.6MB in the beginning and 160.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 475.80ms. Allocated memory is still 234.9MB. Free memory was 160.4MB in the beginning and 134.2MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 162092.86ms. Allocated memory was 234.9MB in the beginning and 983.6MB in the end (delta: 748.7MB). Free memory was 133.2MB in the beginning and 395.9MB in the end (delta: -262.7MB). Peak memory consumption was 484.9MB. Max. memory is 16.1GB. * Witness Printer took 76.59ms. Allocated memory is still 983.6MB. Free memory was 395.9MB in the beginning and 382.3MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret554 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem305 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem305 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem305 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem307 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem305 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem307 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short310 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short310 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem305 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem309 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem307 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem305 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short310 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short312 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem307 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem309 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem305 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short312 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem309 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short310 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem311 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem307 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short315 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short315 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem314 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short315 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short318 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem314 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short315 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short318 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem316 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem317 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem314 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret324 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret683 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret683 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem305 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem305 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem307 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem305 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem307 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem305 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short310 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem307 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem309 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short310 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem305 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem307 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short310 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem305 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short312 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem309 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem307 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem305 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short310 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem309 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem311 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short312 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short315 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short315 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem314 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short315 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short318 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem314 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem316 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem314 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short315 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short318 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem317 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret324 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret338 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret338 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem305 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem305 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem307 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem305 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short310 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem307 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem305 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem309 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem307 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem305 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short310 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem307 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem309 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short310 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short312 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem305 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem307 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem311 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem305 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem309 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short312 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short310 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short315 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short315 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem314 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short315 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short318 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem314 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem317 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short315 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short318 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem314 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem316 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret324 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret339 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret554 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem305 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem305 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem307 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem305 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem307 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short310 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem305 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem305 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem307 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem309 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short310 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem307 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem309 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem305 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short312 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short310 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short312 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short310 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem307 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem309 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem311 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem305 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short315 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short315 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem314 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short315 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short318 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem314 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short315 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short318 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem316 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem317 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem314 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret324 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret683 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret683 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem305 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem305 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem307 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem305 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem305 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short310 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem307 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem309 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short310 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem307 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem305 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem305 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem307 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem309 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short310 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short312 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem311 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short310 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem309 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem305 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short312 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem307 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short315 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short315 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem314 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem314 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short315 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short318 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem316 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short315 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short318 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem317 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem314 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret324 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret338 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret338 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem305 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem305 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem307 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem305 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem305 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short310 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem307 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem309 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short310 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem305 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem307 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short310 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem309 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short312 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem305 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem307 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem305 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short308 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem311 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem309 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem307 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short310 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short306 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short312 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short315 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short315 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem314 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short315 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short318 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem314 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short315 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem316 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short318 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem314 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem317 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret324 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret339 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 223]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L6901-L6906] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L6901-L6906] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L6901-L6906] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L6901-L6906] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L6901-L6906] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L6901-L6906] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L7326] static __thread int tl_last_error = 0; [L7360] CALL aws_linked_list_rend_harness() [L7344] struct aws_linked_list list; [L7346] CALL ensure_linked_list_is_allocated(&list, 20) [L6743] CALL, EXPR nondet_uint64_t() VAL [s_can_fail_allocator_static={4:0}, tl_last_error=0] [L266] return __VERIFIER_nondet_ulong(); [L6743] RET, EXPR nondet_uint64_t() VAL [\old(max_length)=20, list={6:0}, list={6:0}, max_length=20, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L6743] size_t length = nondet_uint64_t(); [L6744] CALL assume_abort_if_not(length <= max_length) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L6744] RET assume_abort_if_not(length <= max_length) VAL [\old(max_length)=20, length=0, list={6:0}, list={6:0}, max_length=20, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L6746-L6747] list->head.prev = ((void *)0) [L6749-L6750] list->tail.next = ((void *)0) [L6753] struct aws_linked_list_node *curr = &list->head; [L6755] size_t i = 0; VAL [\old(max_length)=20, curr={6:0}, i=0, length=0, list={6:0}, list={6:0}, max_length=20, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L6755] COND FALSE !(i < length) VAL [\old(max_length)=20, curr={6:0}, i=0, length=0, list={6:0}, list={6:0}, max_length=20, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L6764] curr->next = &list->tail [L6765] list->tail.prev = curr [L7346] RET ensure_linked_list_is_allocated(&list, 20) [L7349] CALL, EXPR aws_linked_list_is_valid(&list) VAL [s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694] EXPR list && list->head.next VAL [list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694] EXPR list && list->head.next [L4694] EXPR list->head.next [L4694] EXPR list && list->head.next VAL [list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4695] EXPR list && list->head.next && list->head.prev == ((void *)0) VAL [list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4695] EXPR list && list->head.next && list->head.prev == ((void *)0) [L4694] EXPR list->head.prev [L4694-L4695] EXPR list && list->head.next && list->head.prev == ((void *)0) VAL [list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4696] EXPR list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev VAL [list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4696] EXPR list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev [L4696] EXPR list->tail.prev [L4694-L4696] EXPR list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev VAL [list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4697] list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) VAL [list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4697] list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) [L4696] EXPR list->tail.next [L4694-L4697] list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) VAL [list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4697] COND TRUE list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) [L4700] CALL, EXPR aws_linked_list_is_valid_deep(list) [L4734] COND FALSE !(!list) [L4740] const struct aws_linked_list_node *temp = &list->head; [L4743-L4746] _Bool head_reaches_tail = 0 ; VAL [head_reaches_tail=0, list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, temp={6:0}, tl_last_error=0] [L4750] COND TRUE \read(*temp) VAL [head_reaches_tail=0, list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, temp={6:0}, tl_last_error=0] [L4751] COND FALSE !(temp == &list->tail) VAL [head_reaches_tail=0, list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, temp={6:0}, tl_last_error=0] [L4756] CALL, EXPR aws_linked_list_node_next_is_valid(temp) VAL [node={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next VAL [node={6:0}, node={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next [L4718] EXPR node->next [L4718] EXPR node && node->next VAL [node={6:0}, node={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next && node->next->prev == node VAL [node={6:0}, node={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next && node->next->prev == node [L4718] EXPR node->next [L4718] EXPR node->next->prev [L4718] EXPR node && node->next && node->next->prev == node VAL [node={6:0}, node={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] return node && node->next && node->next->prev == node; [L4756] RET, EXPR aws_linked_list_node_next_is_valid(temp) VAL [head_reaches_tail=0, list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, temp={6:0}, tl_last_error=0] [L4756] COND FALSE !(!aws_linked_list_node_next_is_valid(temp)) [L4762] EXPR temp->next [L4762] temp = temp->next [L4750] COND TRUE \read(*temp) VAL [head_reaches_tail=0, list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, temp={6:16}, tl_last_error=0] [L4751] COND TRUE temp == &list->tail [L4752-L4753] head_reaches_tail = 1 VAL [head_reaches_tail=1, list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, temp={6:16}, tl_last_error=0] [L4764] return head_reaches_tail; VAL [\result=1, head_reaches_tail=1, list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, temp={6:16}, tl_last_error=0] [L4700] RET, EXPR aws_linked_list_is_valid_deep(list) [L4700] return aws_linked_list_is_valid_deep(list); [L7349] RET, EXPR aws_linked_list_is_valid(&list) VAL [list={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L7349] CALL assume_abort_if_not(aws_linked_list_is_valid(&list)) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L7349] RET assume_abort_if_not(aws_linked_list_is_valid(&list)) VAL [list={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L7354] CALL aws_linked_list_rend(&list) [L4824] CALL, EXPR aws_linked_list_is_valid(list) VAL [s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694] EXPR list && list->head.next VAL [list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694] EXPR list && list->head.next [L4694] EXPR list->head.next [L4694] EXPR list && list->head.next VAL [list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4695] EXPR list && list->head.next && list->head.prev == ((void *)0) VAL [list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4695] EXPR list && list->head.next && list->head.prev == ((void *)0) [L4694] EXPR list->head.prev [L4694-L4695] EXPR list && list->head.next && list->head.prev == ((void *)0) VAL [list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4696] EXPR list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev VAL [list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4696] EXPR list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev [L4696] EXPR list->tail.prev [L4694-L4696] EXPR list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev VAL [list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4697] list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) VAL [list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4697] list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) [L4696] EXPR list->tail.next [L4694-L4697] list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) VAL [list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4697] COND TRUE list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) [L4700] CALL, EXPR aws_linked_list_is_valid_deep(list) [L4734] COND FALSE !(!list) [L4740] const struct aws_linked_list_node *temp = &list->head; [L4743-L4746] _Bool head_reaches_tail = 0 ; VAL [head_reaches_tail=0, list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, temp={6:0}, tl_last_error=0] [L4750] COND TRUE \read(*temp) VAL [head_reaches_tail=0, list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, temp={6:0}, tl_last_error=0] [L4751] COND FALSE !(temp == &list->tail) VAL [head_reaches_tail=0, list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, temp={6:0}, tl_last_error=0] [L4756] CALL, EXPR aws_linked_list_node_next_is_valid(temp) VAL [node={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next VAL [node={6:0}, node={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next [L4718] EXPR node->next [L4718] EXPR node && node->next VAL [node={6:0}, node={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next && node->next->prev == node VAL [node={6:0}, node={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next && node->next->prev == node [L4718] EXPR node->next [L4718] EXPR node->next->prev [L4718] EXPR node && node->next && node->next->prev == node VAL [node={6:0}, node={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] return node && node->next && node->next->prev == node; [L4756] RET, EXPR aws_linked_list_node_next_is_valid(temp) VAL [head_reaches_tail=0, list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, temp={6:0}, tl_last_error=0] [L4756] COND FALSE !(!aws_linked_list_node_next_is_valid(temp)) [L4762] EXPR temp->next [L4762] temp = temp->next [L4750] COND TRUE \read(*temp) VAL [head_reaches_tail=0, list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, temp={6:16}, tl_last_error=0] [L4751] COND TRUE temp == &list->tail [L4752-L4753] head_reaches_tail = 1 VAL [head_reaches_tail=1, list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, temp={6:16}, tl_last_error=0] [L4764] return head_reaches_tail; VAL [\result=1, head_reaches_tail=1, list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, temp={6:16}, tl_last_error=0] [L4700] RET, EXPR aws_linked_list_is_valid_deep(list) [L4700] return aws_linked_list_is_valid_deep(list); [L4824] RET, EXPR aws_linked_list_is_valid(list) VAL [list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4824] CALL assume_abort_if_not((aws_linked_list_is_valid(list))) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4824] RET assume_abort_if_not((aws_linked_list_is_valid(list))) VAL [list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4825] const struct aws_linked_list_node *rval = &list->head; VAL [list={6:0}, list={6:0}, rval={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4826] CALL, EXPR aws_linked_list_is_valid(list) VAL [s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694] EXPR list && list->head.next VAL [list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694] EXPR list && list->head.next [L4694] EXPR list->head.next [L4694] EXPR list && list->head.next VAL [list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4695] EXPR list && list->head.next && list->head.prev == ((void *)0) VAL [list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4695] EXPR list && list->head.next && list->head.prev == ((void *)0) [L4694] EXPR list->head.prev [L4694-L4695] EXPR list && list->head.next && list->head.prev == ((void *)0) VAL [list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4696] EXPR list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev VAL [list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4696] EXPR list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev [L4696] EXPR list->tail.prev [L4694-L4696] EXPR list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev VAL [list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4697] list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) VAL [list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4697] list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) [L4696] EXPR list->tail.next [L4694-L4697] list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) VAL [list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4697] COND TRUE list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) [L4700] CALL, EXPR aws_linked_list_is_valid_deep(list) [L4734] COND FALSE !(!list) [L4740] const struct aws_linked_list_node *temp = &list->head; [L4743-L4746] _Bool head_reaches_tail = 0 ; VAL [head_reaches_tail=0, list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, temp={6:0}, tl_last_error=0] [L4750] COND TRUE \read(*temp) VAL [head_reaches_tail=0, list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, temp={6:0}, tl_last_error=0] [L4751] COND FALSE !(temp == &list->tail) VAL [head_reaches_tail=0, list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, temp={6:0}, tl_last_error=0] [L4756] CALL, EXPR aws_linked_list_node_next_is_valid(temp) VAL [node={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next VAL [node={6:0}, node={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next [L4718] EXPR node->next [L4718] EXPR node && node->next VAL [node={6:0}, node={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next && node->next->prev == node VAL [node={6:0}, node={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next && node->next->prev == node [L4718] EXPR node->next [L4718] EXPR node->next->prev [L4718] EXPR node && node->next && node->next->prev == node VAL [node={6:0}, node={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] return node && node->next && node->next->prev == node; [L4756] RET, EXPR aws_linked_list_node_next_is_valid(temp) VAL [head_reaches_tail=0, list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, temp={6:0}, tl_last_error=0] [L4756] COND FALSE !(!aws_linked_list_node_next_is_valid(temp)) [L4762] EXPR temp->next [L4762] temp = temp->next [L4750] COND TRUE \read(*temp) VAL [head_reaches_tail=0, list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, temp={6:16}, tl_last_error=0] [L4751] COND TRUE temp == &list->tail [L4752-L4753] head_reaches_tail = 1 VAL [head_reaches_tail=1, list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, temp={6:16}, tl_last_error=0] [L4764] return head_reaches_tail; VAL [\result=1, head_reaches_tail=1, list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, temp={6:16}, tl_last_error=0] [L4700] RET, EXPR aws_linked_list_is_valid_deep(list) [L4700] return aws_linked_list_is_valid_deep(list); [L4826] RET, EXPR aws_linked_list_is_valid(list) VAL [list={6:0}, list={6:0}, rval={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4826] CALL __VERIFIER_assert(!((aws_linked_list_is_valid(list)))) VAL [\old(cond)=0, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L223] COND TRUE !cond VAL [\old(cond)=0, cond=0, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L223] reach_error() VAL [\old(cond)=0, cond=0, s_can_fail_allocator_static={4:0}, tl_last_error=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 59 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 162.0s, OverallIterations: 21, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 25.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 63 mSolverCounterUnknown, 1810 SdHoareTripleChecker+Valid, 10.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1707 mSDsluCounter, 9749 SdHoareTripleChecker+Invalid, 10.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1186 IncrementalHoareTripleChecker+Unchecked, 8416 mSDsCounter, 513 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8811 IncrementalHoareTripleChecker+Invalid, 10573 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 513 mSolverCounterUnsat, 1333 mSDtfsCounter, 8811 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2841 GetRequests, 2298 SyntacticMatches, 34 SemanticMatches, 509 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 4715 ImplicationChecksByTransitivity, 115.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=264occurred in iteration=18, InterpolantAutomatonStates: 300, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 20 MinimizatonAttempts, 366 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 127.8s InterpolantComputationTime, 3379 NumberOfCodeBlocks, 3326 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 3800 ConstructedInterpolants, 409 QuantifiedInterpolants, 36855 SizeOfPredicates, 218 NumberOfNonLiveVariables, 7582 ConjunctsInSsa, 713 ConjunctsInUnsatCore, 46 InterpolantComputations, 15 PerfectInterpolantSequences, 2145/2630 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-23 07:34:25,533 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-11-23 07:34:25,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE