./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_insert_before_harness.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_insert_before_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 2f0ef11561022276ce844351f7c3da39e7886059141883b3ddc06067a22b3d7d --preprocessor.use.memory.slicer true --- Real Ultimate output --- This is Ultimate 0.2.3-?-abd6749-m [2023-11-23 07:27:20,913 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 07:27:20,987 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-23 07:27:20,990 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 07:27:20,991 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 07:27:21,012 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 07:27:21,013 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 07:27:21,013 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 07:27:21,014 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 07:27:21,017 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 07:27:21,017 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 07:27:21,018 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 07:27:21,018 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 07:27:21,019 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 07:27:21,019 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 07:27:21,020 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 07:27:21,020 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 07:27:21,020 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 07:27:21,020 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 07:27:21,021 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 07:27:21,021 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 07:27:21,021 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 07:27:21,021 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 07:27:21,021 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 07:27:21,022 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 07:27:21,022 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 07:27:21,022 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 07:27:21,023 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 07:27:21,023 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 07:27:21,023 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 07:27:21,024 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 07:27:21,024 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 07:27:21,024 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 07:27:21,024 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 07:27:21,025 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 07:27:21,025 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 07:27:21,025 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 07:27:21,025 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 07:27:21,025 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 07:27:21,025 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 -> 2f0ef11561022276ce844351f7c3da39e7886059141883b3ddc06067a22b3d7d Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> true [2023-11-23 07:27:21,279 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 07:27:21,298 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 07:27:21,301 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 07:27:21,302 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 07:27:21,303 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 07:27:21,304 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_insert_before_harness.i [2023-11-23 07:27:22,349 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 07:27:22,695 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 07:27:22,696 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_insert_before_harness.i [2023-11-23 07:27:22,720 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7661daac2/ccd0cae7073c461b960b4597a63da5f4/FLAGbc6764c47 [2023-11-23 07:27:22,733 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7661daac2/ccd0cae7073c461b960b4597a63da5f4 [2023-11-23 07:27:22,735 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 07:27:22,735 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 07:27:22,737 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 07:27:22,738 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 07:27:22,741 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 07:27:22,742 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:27:22" (1/1) ... [2023-11-23 07:27:22,742 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4699b748 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:27:22, skipping insertion in model container [2023-11-23 07:27:22,742 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:27:22" (1/1) ... [2023-11-23 07:27:22,818 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 07:27:23,000 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_insert_before_harness.i[4503,4516] [2023-11-23 07:27:23,007 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_insert_before_harness.i[4563,4576] [2023-11-23 07:27:23,466 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:23,467 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:23,467 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:23,467 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:23,468 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:23,476 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:23,477 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:23,478 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:23,479 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:23,480 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:23,481 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:23,481 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:23,482 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:23,692 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 07:27:23,694 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 07:27:23,695 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 07:27:23,696 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 07:27:23,697 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 07:27:23,698 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 07:27:23,699 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 07:27:23,700 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 07:27:23,700 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 07:27:23,701 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 07:27:23,825 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 07:27:23,839 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 07:27:23,848 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_insert_before_harness.i[4503,4516] [2023-11-23 07:27:23,849 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_insert_before_harness.i[4563,4576] [2023-11-23 07:27:23,888 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:23,890 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:23,892 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:23,893 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:23,893 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:23,900 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:23,905 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:23,906 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:23,907 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:23,908 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:23,909 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:23,909 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:23,912 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:23,937 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 07:27:23,937 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 07:27:23,938 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 07:27:23,938 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 07:27:23,939 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 07:27:23,939 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 07:27:23,939 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 07:27:23,940 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 07:27:23,940 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 07:27:23,940 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 07:27:23,969 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 07:27:24,131 WARN L675 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:27:24,132 WARN L675 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:27:24,132 WARN L675 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:27:24,132 WARN L675 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:27:24,132 WARN L675 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:27:24,133 WARN L675 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:27:24,133 WARN L675 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:27:24,133 WARN L675 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:27:24,134 WARN L675 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:27:24,134 WARN L675 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:27:24,134 WARN L675 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:27:24,135 WARN L675 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:27:24,135 WARN L675 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:27:24,135 WARN L675 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:27:24,135 WARN L675 CHandler]: The function aws_array_list_ensure_capacity is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:27:24,141 INFO L206 MainTranslator]: Completed translation [2023-11-23 07:27:24,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:27:24 WrapperNode [2023-11-23 07:27:24,143 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 07:27:24,144 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 07:27:24,144 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 07:27:24,144 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 07:27:24,150 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:27:24" (1/1) ... [2023-11-23 07:27:24,212 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:27:24" (1/1) ... [2023-11-23 07:27:24,238 INFO L138 Inliner]: procedures = 678, calls = 1048, calls flagged for inlining = 49, calls inlined = 3, statements flattened = 50 [2023-11-23 07:27:24,238 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 07:27:24,239 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 07:27:24,239 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 07:27:24,239 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 07:27:24,247 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:27:24" (1/1) ... [2023-11-23 07:27:24,247 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:27:24" (1/1) ... [2023-11-23 07:27:24,250 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:27:24" (1/1) ... [2023-11-23 07:27:24,264 INFO L188 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [2, 5, 17]. 71 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:27:24,264 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:27:24" (1/1) ... [2023-11-23 07:27:24,264 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:27:24" (1/1) ... [2023-11-23 07:27:24,271 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:27:24" (1/1) ... [2023-11-23 07:27:24,273 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:27:24" (1/1) ... [2023-11-23 07:27:24,276 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:27:24" (1/1) ... [2023-11-23 07:27:24,278 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:27:24" (1/1) ... [2023-11-23 07:27:24,282 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 07:27:24,282 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 07:27:24,282 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 07:27:24,283 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 07:27:24,283 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:27:24" (1/1) ... [2023-11-23 07:27:24,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 07:27:24,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:27:24,319 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:27:24,338 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:27:24,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 07:27:24,399 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-23 07:27:24,399 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-23 07:27:24,399 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2023-11-23 07:27:24,399 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2023-11-23 07:27:24,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 07:27:24,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-23 07:27:24,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-23 07:27:24,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-23 07:27:24,399 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_insert_before [2023-11-23 07:27:24,399 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_insert_before [2023-11-23 07:27:24,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 07:27:24,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 07:27:24,399 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 07:27:24,399 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 07:27:24,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 07:27:24,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-23 07:27:24,400 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-23 07:27:24,400 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-23 07:27:24,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-23 07:27:24,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-23 07:27:24,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-23 07:27:24,400 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2023-11-23 07:27:24,400 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2023-11-23 07:27:24,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-23 07:27:24,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-23 07:27:24,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-23 07:27:24,616 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 07:27:24,617 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 07:27:24,750 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 07:27:24,774 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 07:27:24,774 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-23 07:27:24,775 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:27:24 BoogieIcfgContainer [2023-11-23 07:27:24,775 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 07:27:24,776 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 07:27:24,777 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 07:27:24,779 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 07:27:24,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 07:27:22" (1/3) ... [2023-11-23 07:27:24,780 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@207a81b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 07:27:24, skipping insertion in model container [2023-11-23 07:27:24,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:27:24" (2/3) ... [2023-11-23 07:27:24,780 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@207a81b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 07:27:24, skipping insertion in model container [2023-11-23 07:27:24,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:27:24" (3/3) ... [2023-11-23 07:27:24,781 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_insert_before_harness.i [2023-11-23 07:27:24,795 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 07:27:24,795 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 07:27:24,829 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 07:27:24,837 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;@3e2046a3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 07:27:24,837 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 07:27:24,840 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 32 states have internal predecessors, (38), 21 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-23 07:27:24,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-23 07:27:24,846 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:27:24,847 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 07:27:24,848 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:27:24,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:27:24,852 INFO L85 PathProgramCache]: Analyzing trace with hash -669486050, now seen corresponding path program 1 times [2023-11-23 07:27:24,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:27:24,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956471301] [2023-11-23 07:27:24,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:27:24,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:27:25,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:25,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 07:27:25,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:25,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 07:27:25,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:25,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 07:27:25,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:25,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 07:27:25,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:25,250 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-23 07:27:25,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:27:25,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956471301] [2023-11-23 07:27:25,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956471301] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:27:25,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:27:25,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 07:27:25,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312521083] [2023-11-23 07:27:25,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:27:25,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-23 07:27:25,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:27:25,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-23 07:27:25,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 07:27:25,283 INFO L87 Difference]: Start difference. First operand has 59 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 32 states have internal predecessors, (38), 21 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 07:27:25,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:27:25,337 INFO L93 Difference]: Finished difference Result 113 states and 165 transitions. [2023-11-23 07:27:25,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 07:27:25,339 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2023-11-23 07:27:25,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:27:25,347 INFO L225 Difference]: With dead ends: 113 [2023-11-23 07:27:25,350 INFO L226 Difference]: Without dead ends: 57 [2023-11-23 07:27:25,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 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:27:25,356 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 07:27:25,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 07:27:25,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-23 07:27:25,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2023-11-23 07:27:25,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 31 states have internal predecessors, (35), 21 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-23 07:27:25,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 76 transitions. [2023-11-23 07:27:25,418 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 76 transitions. Word has length 33 [2023-11-23 07:27:25,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:27:25,424 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 76 transitions. [2023-11-23 07:27:25,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 07:27:25,425 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 76 transitions. [2023-11-23 07:27:25,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-23 07:27:25,426 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:27:25,426 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 07:27:25,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 07:27:25,427 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:27:25,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:27:25,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1526647902, now seen corresponding path program 1 times [2023-11-23 07:27:25,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:27:25,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567375070] [2023-11-23 07:27:25,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:27:25,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:27:25,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:27,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 07:27:27,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:27,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 07:27:27,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:27,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 07:27:27,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:27,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 07:27:27,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:27,429 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-23 07:27:27,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:27:27,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567375070] [2023-11-23 07:27:27,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567375070] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:27:27,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:27:27,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-23 07:27:27,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605470264] [2023-11-23 07:27:27,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:27:27,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-23 07:27:27,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:27:27,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-23 07:27:27,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2023-11-23 07:27:27,433 INFO L87 Difference]: Start difference. First operand 57 states and 76 transitions. Second operand has 15 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 07:27:28,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:27:28,011 INFO L93 Difference]: Finished difference Result 67 states and 90 transitions. [2023-11-23 07:27:28,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-23 07:27:28,011 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2023-11-23 07:27:28,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:27:28,013 INFO L225 Difference]: With dead ends: 67 [2023-11-23 07:27:28,013 INFO L226 Difference]: Without dead ends: 65 [2023-11-23 07:27:28,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2023-11-23 07:27:28,014 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 23 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-23 07:27:28,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 531 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-23 07:27:28,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-11-23 07:27:28,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2023-11-23 07:27:28,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 36 states have internal predecessors, (39), 22 states have call successors, (22), 6 states have call predecessors, (22), 7 states have return successors, (26), 21 states have call predecessors, (26), 21 states have call successors, (26) [2023-11-23 07:27:28,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 87 transitions. [2023-11-23 07:27:28,024 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 87 transitions. Word has length 33 [2023-11-23 07:27:28,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:27:28,024 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 87 transitions. [2023-11-23 07:27:28,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 07:27:28,024 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 87 transitions. [2023-11-23 07:27:28,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-23 07:27:28,025 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:27:28,025 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 07:27:28,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 07:27:28,025 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:27:28,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:27:28,025 INFO L85 PathProgramCache]: Analyzing trace with hash 248359460, now seen corresponding path program 1 times [2023-11-23 07:27:28,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:27:28,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880290070] [2023-11-23 07:27:28,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:27:28,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:27:28,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:28,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 07:27:28,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:28,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 07:27:28,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:28,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 07:27:28,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:28,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 07:27:28,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:28,343 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-23 07:27:28,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:27:28,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880290070] [2023-11-23 07:27:28,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880290070] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:27:28,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:27:28,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-23 07:27:28,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221239827] [2023-11-23 07:27:28,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:27:28,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 07:27:28,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:27:28,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 07:27:28,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-23 07:27:28,347 INFO L87 Difference]: Start difference. First operand 64 states and 87 transitions. Second operand has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 07:27:28,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:27:28,587 INFO L93 Difference]: Finished difference Result 115 states and 161 transitions. [2023-11-23 07:27:28,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 07:27:28,587 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2023-11-23 07:27:28,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:27:28,588 INFO L225 Difference]: With dead ends: 115 [2023-11-23 07:27:28,589 INFO L226 Difference]: Without dead ends: 69 [2023-11-23 07:27:28,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2023-11-23 07:27:28,590 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 33 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 07:27:28,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 374 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 07:27:28,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-11-23 07:27:28,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2023-11-23 07:27:28,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 37 states have (on average 1.162162162162162) internal successors, (43), 40 states have internal predecessors, (43), 22 states have call successors, (22), 6 states have call predecessors, (22), 8 states have return successors, (30), 21 states have call predecessors, (30), 21 states have call successors, (30) [2023-11-23 07:27:28,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 95 transitions. [2023-11-23 07:27:28,600 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 95 transitions. Word has length 33 [2023-11-23 07:27:28,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:27:28,600 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 95 transitions. [2023-11-23 07:27:28,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 07:27:28,601 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 95 transitions. [2023-11-23 07:27:28,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-23 07:27:28,601 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:27:28,602 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 07:27:28,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 07:27:28,602 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:27:28,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:27:28,602 INFO L85 PathProgramCache]: Analyzing trace with hash 928417830, now seen corresponding path program 1 times [2023-11-23 07:27:28,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:27:28,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202898447] [2023-11-23 07:27:28,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:27:28,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:27:28,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:28,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 07:27:28,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:28,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 07:27:28,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:28,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 07:27:28,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:28,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 07:27:28,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:28,726 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-23 07:27:28,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:27:28,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202898447] [2023-11-23 07:27:28,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202898447] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:27:28,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:27:28,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 07:27:28,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422256907] [2023-11-23 07:27:28,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:27:28,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 07:27:28,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:27:28,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 07:27:28,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-23 07:27:28,729 INFO L87 Difference]: Start difference. First operand 68 states and 95 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-23 07:27:28,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:27:28,827 INFO L93 Difference]: Finished difference Result 133 states and 187 transitions. [2023-11-23 07:27:28,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 07:27:28,827 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 33 [2023-11-23 07:27:28,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:27:28,828 INFO L225 Difference]: With dead ends: 133 [2023-11-23 07:27:28,828 INFO L226 Difference]: Without dead ends: 69 [2023-11-23 07:27:28,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-23 07:27:28,830 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 18 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 07:27:28,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 290 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 07:27:28,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-11-23 07:27:28,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2023-11-23 07:27:28,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 37 states have (on average 1.162162162162162) internal successors, (43), 40 states have internal predecessors, (43), 21 states have call successors, (21), 6 states have call predecessors, (21), 8 states have return successors, (26), 20 states have call predecessors, (26), 20 states have call successors, (26) [2023-11-23 07:27:28,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 90 transitions. [2023-11-23 07:27:28,838 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 90 transitions. Word has length 33 [2023-11-23 07:27:28,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:27:28,839 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 90 transitions. [2023-11-23 07:27:28,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-23 07:27:28,839 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 90 transitions. [2023-11-23 07:27:28,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-23 07:27:28,840 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:27:28,840 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 07:27:28,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 07:27:28,841 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:27:28,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:27:28,841 INFO L85 PathProgramCache]: Analyzing trace with hash 2092129131, now seen corresponding path program 1 times [2023-11-23 07:27:28,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:27:28,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791449517] [2023-11-23 07:27:28,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:27:28,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:27:28,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:29,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 07:27:29,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:29,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 07:27:29,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:29,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 07:27:29,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:29,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 07:27:29,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:29,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 07:27:29,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:29,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 07:27:29,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:30,068 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-23 07:27:30,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:27:30,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791449517] [2023-11-23 07:27:30,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791449517] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:27:30,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:27:30,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-23 07:27:30,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165980718] [2023-11-23 07:27:30,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:27:30,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-23 07:27:30,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:27:30,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-23 07:27:30,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2023-11-23 07:27:30,071 INFO L87 Difference]: Start difference. First operand 67 states and 90 transitions. Second operand has 13 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 5 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-23 07:27:30,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:27:30,452 INFO L93 Difference]: Finished difference Result 77 states and 101 transitions. [2023-11-23 07:27:30,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-23 07:27:30,453 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 5 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 46 [2023-11-23 07:27:30,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:27:30,454 INFO L225 Difference]: With dead ends: 77 [2023-11-23 07:27:30,454 INFO L226 Difference]: Without dead ends: 75 [2023-11-23 07:27:30,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2023-11-23 07:27:30,455 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 17 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 07:27:30,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 551 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 07:27:30,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-11-23 07:27:30,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2023-11-23 07:27:30,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 41 states have (on average 1.146341463414634) internal successors, (47), 45 states have internal predecessors, (47), 22 states have call successors, (22), 7 states have call predecessors, (22), 10 states have return successors, (29), 21 states have call predecessors, (29), 21 states have call successors, (29) [2023-11-23 07:27:30,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 98 transitions. [2023-11-23 07:27:30,464 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 98 transitions. Word has length 46 [2023-11-23 07:27:30,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:27:30,464 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 98 transitions. [2023-11-23 07:27:30,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 5 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-23 07:27:30,465 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 98 transitions. [2023-11-23 07:27:30,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-23 07:27:30,466 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:27:30,466 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 07:27:30,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 07:27:30,466 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:27:30,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:27:30,466 INFO L85 PathProgramCache]: Analyzing trace with hash -427830803, now seen corresponding path program 1 times [2023-11-23 07:27:30,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:27:30,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720163057] [2023-11-23 07:27:30,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:27:30,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:27:30,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:31,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 07:27:31,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:31,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 07:27:31,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:31,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 07:27:31,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:31,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 07:27:31,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:31,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 07:27:31,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:31,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 07:27:31,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:31,473 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-23 07:27:31,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:27:31,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720163057] [2023-11-23 07:27:31,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720163057] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:27:31,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:27:31,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-23 07:27:31,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118239135] [2023-11-23 07:27:31,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:27:31,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-23 07:27:31,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:27:31,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-23 07:27:31,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-11-23 07:27:31,476 INFO L87 Difference]: Start difference. First operand 74 states and 98 transitions. Second operand has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 5 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-23 07:27:31,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:27:31,796 INFO L93 Difference]: Finished difference Result 123 states and 163 transitions. [2023-11-23 07:27:31,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 07:27:31,797 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 5 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 46 [2023-11-23 07:27:31,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:27:31,797 INFO L225 Difference]: With dead ends: 123 [2023-11-23 07:27:31,798 INFO L226 Difference]: Without dead ends: 74 [2023-11-23 07:27:31,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2023-11-23 07:27:31,799 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 18 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 07:27:31,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 360 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 07:27:31,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-11-23 07:27:31,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2023-11-23 07:27:31,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 41 states have (on average 1.146341463414634) internal successors, (47), 45 states have internal predecessors, (47), 22 states have call successors, (22), 7 states have call predecessors, (22), 10 states have return successors, (28), 21 states have call predecessors, (28), 21 states have call successors, (28) [2023-11-23 07:27:31,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 97 transitions. [2023-11-23 07:27:31,829 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 97 transitions. Word has length 46 [2023-11-23 07:27:31,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:27:31,830 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 97 transitions. [2023-11-23 07:27:31,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 5 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-23 07:27:31,830 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 97 transitions. [2023-11-23 07:27:31,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-23 07:27:31,833 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:27:31,833 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 07:27:31,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-23 07:27:31,834 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:27:31,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:27:31,834 INFO L85 PathProgramCache]: Analyzing trace with hash 252227567, now seen corresponding path program 1 times [2023-11-23 07:27:31,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:27:31,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777873228] [2023-11-23 07:27:31,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:27:31,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:27:31,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:31,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 07:27:31,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:31,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 07:27:31,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:31,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 07:27:31,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:31,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 07:27:31,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:31,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 07:27:31,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:31,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 07:27:31,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:32,001 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-23 07:27:32,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:27:32,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777873228] [2023-11-23 07:27:32,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777873228] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:27:32,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:27:32,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 07:27:32,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928133712] [2023-11-23 07:27:32,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:27:32,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 07:27:32,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:27:32,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 07:27:32,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-23 07:27:32,004 INFO L87 Difference]: Start difference. First operand 74 states and 97 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-23 07:27:32,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:27:32,074 INFO L93 Difference]: Finished difference Result 127 states and 165 transitions. [2023-11-23 07:27:32,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 07:27:32,075 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 46 [2023-11-23 07:27:32,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:27:32,076 INFO L225 Difference]: With dead ends: 127 [2023-11-23 07:27:32,076 INFO L226 Difference]: Without dead ends: 67 [2023-11-23 07:27:32,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-23 07:27:32,077 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 17 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 07:27:32,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 297 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 07:27:32,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-11-23 07:27:32,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2023-11-23 07:27:32,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 39 states have internal predecessors, (41), 21 states have call successors, (21), 7 states have call predecessors, (21), 8 states have return successors, (23), 20 states have call predecessors, (23), 20 states have call successors, (23) [2023-11-23 07:27:32,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 85 transitions. [2023-11-23 07:27:32,087 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 85 transitions. Word has length 46 [2023-11-23 07:27:32,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:27:32,087 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 85 transitions. [2023-11-23 07:27:32,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-23 07:27:32,087 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 85 transitions. [2023-11-23 07:27:32,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-23 07:27:32,088 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:27:32,088 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 07:27:32,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-23 07:27:32,089 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:27:32,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:27:32,089 INFO L85 PathProgramCache]: Analyzing trace with hash 620792392, now seen corresponding path program 1 times [2023-11-23 07:27:32,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:27:32,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828177870] [2023-11-23 07:27:32,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:27:32,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:27:32,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:33,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 07:27:33,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:33,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 07:27:33,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:33,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 07:27:33,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:33,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 07:27:33,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:33,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 07:27:33,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:33,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 07:27:33,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:33,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 07:27:33,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:33,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 07:27:33,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:33,602 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-23 07:27:33,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:27:33,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828177870] [2023-11-23 07:27:33,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828177870] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:27:33,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:27:33,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-23 07:27:33,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246246422] [2023-11-23 07:27:33,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:27:33,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-23 07:27:33,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:27:33,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-23 07:27:33,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2023-11-23 07:27:33,605 INFO L87 Difference]: Start difference. First operand 67 states and 85 transitions. Second operand has 13 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 5 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-23 07:27:34,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:27:34,098 INFO L93 Difference]: Finished difference Result 77 states and 97 transitions. [2023-11-23 07:27:34,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-23 07:27:34,098 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 5 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 59 [2023-11-23 07:27:34,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:27:34,099 INFO L225 Difference]: With dead ends: 77 [2023-11-23 07:27:34,100 INFO L226 Difference]: Without dead ends: 75 [2023-11-23 07:27:34,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2023-11-23 07:27:34,100 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 17 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-23 07:27:34,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 552 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-23 07:27:34,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-11-23 07:27:34,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2023-11-23 07:27:34,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 44 states have internal predecessors, (45), 22 states have call successors, (22), 8 states have call predecessors, (22), 10 states have return successors, (27), 21 states have call predecessors, (27), 21 states have call successors, (27) [2023-11-23 07:27:34,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 94 transitions. [2023-11-23 07:27:34,112 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 94 transitions. Word has length 59 [2023-11-23 07:27:34,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:27:34,112 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 94 transitions. [2023-11-23 07:27:34,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 5 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-23 07:27:34,112 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2023-11-23 07:27:34,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-23 07:27:34,113 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:27:34,113 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 07:27:34,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-23 07:27:34,114 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:27:34,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:27:34,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1899167542, now seen corresponding path program 1 times [2023-11-23 07:27:34,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:27:34,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281255514] [2023-11-23 07:27:34,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:27:34,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:27:34,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:34,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 07:27:34,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:34,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 07:27:34,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:34,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 07:27:34,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:34,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 07:27:34,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:34,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 07:27:34,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:34,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 07:27:34,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:34,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 07:27:34,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:34,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 07:27:34,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:34,706 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-23 07:27:34,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:27:34,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281255514] [2023-11-23 07:27:34,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281255514] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:27:34,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:27:34,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-23 07:27:34,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548307928] [2023-11-23 07:27:34,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:27:34,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-23 07:27:34,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:27:34,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-23 07:27:34,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2023-11-23 07:27:34,709 INFO L87 Difference]: Start difference. First operand 74 states and 94 transitions. Second operand has 14 states, 12 states have (on average 2.5) internal successors, (30), 13 states have internal predecessors, (30), 6 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-23 07:27:35,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:27:35,061 INFO L93 Difference]: Finished difference Result 123 states and 159 transitions. [2023-11-23 07:27:35,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-23 07:27:35,061 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.5) internal successors, (30), 13 states have internal predecessors, (30), 6 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 59 [2023-11-23 07:27:35,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:27:35,062 INFO L225 Difference]: With dead ends: 123 [2023-11-23 07:27:35,062 INFO L226 Difference]: Without dead ends: 81 [2023-11-23 07:27:35,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2023-11-23 07:27:35,063 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 37 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 07:27:35,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 498 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 07:27:35,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-11-23 07:27:35,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2023-11-23 07:27:35,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 44 states have (on average 1.1136363636363635) internal successors, (49), 48 states have internal predecessors, (49), 22 states have call successors, (22), 8 states have call predecessors, (22), 11 states have return successors, (29), 21 states have call predecessors, (29), 21 states have call successors, (29) [2023-11-23 07:27:35,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 100 transitions. [2023-11-23 07:27:35,072 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 100 transitions. Word has length 59 [2023-11-23 07:27:35,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:27:35,072 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 100 transitions. [2023-11-23 07:27:35,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.5) internal successors, (30), 13 states have internal predecessors, (30), 6 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-23 07:27:35,073 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 100 transitions. [2023-11-23 07:27:35,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-23 07:27:35,073 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:27:35,073 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 07:27:35,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-23 07:27:35,074 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:27:35,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:27:35,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1219109172, now seen corresponding path program 1 times [2023-11-23 07:27:35,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:27:35,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466155410] [2023-11-23 07:27:35,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:27:35,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:27:35,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:35,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 07:27:35,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:35,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 07:27:35,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:35,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 07:27:35,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:35,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 07:27:35,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:35,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 07:27:35,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:35,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 07:27:35,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:35,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 07:27:35,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:35,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 07:27:35,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:35,274 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-23 07:27:35,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:27:35,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466155410] [2023-11-23 07:27:35,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466155410] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:27:35,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:27:35,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-23 07:27:35,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354341040] [2023-11-23 07:27:35,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:27:35,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 07:27:35,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:27:35,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 07:27:35,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-23 07:27:35,276 INFO L87 Difference]: Start difference. First operand 78 states and 100 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 4 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-23 07:27:35,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:27:35,407 INFO L93 Difference]: Finished difference Result 130 states and 168 transitions. [2023-11-23 07:27:35,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 07:27:35,408 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 4 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 59 [2023-11-23 07:27:35,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:27:35,408 INFO L225 Difference]: With dead ends: 130 [2023-11-23 07:27:35,408 INFO L226 Difference]: Without dead ends: 79 [2023-11-23 07:27:35,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-11-23 07:27:35,409 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 20 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 07:27:35,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 439 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 07:27:35,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-11-23 07:27:35,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. [2023-11-23 07:27:35,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 46 states have internal predecessors, (48), 21 states have call successors, (21), 8 states have call predecessors, (21), 10 states have return successors, (25), 20 states have call predecessors, (25), 20 states have call successors, (25) [2023-11-23 07:27:35,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 94 transitions. [2023-11-23 07:27:35,418 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 94 transitions. Word has length 59 [2023-11-23 07:27:35,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:27:35,419 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 94 transitions. [2023-11-23 07:27:35,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 4 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-23 07:27:35,419 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 94 transitions. [2023-11-23 07:27:35,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-23 07:27:35,420 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:27:35,420 INFO L195 NwaCegarLoop]: trace histogram [4, 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:27:35,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-23 07:27:35,420 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:27:35,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:27:35,421 INFO L85 PathProgramCache]: Analyzing trace with hash -929607402, now seen corresponding path program 1 times [2023-11-23 07:27:35,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:27:35,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699768286] [2023-11-23 07:27:35,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:27:35,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:27:35,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:35,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 07:27:35,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:35,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 07:27:35,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:35,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 07:27:35,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:35,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 07:27:35,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:35,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 07:27:35,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:35,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 07:27:35,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:35,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 07:27:35,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:35,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 07:27:35,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:35,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 07:27:35,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:35,684 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-11-23 07:27:35,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:27:35,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699768286] [2023-11-23 07:27:35,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699768286] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:27:35,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:27:35,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 07:27:35,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479280547] [2023-11-23 07:27:35,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:27:35,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 07:27:35,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:27:35,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 07:27:35,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 07:27:35,686 INFO L87 Difference]: Start difference. First operand 75 states and 94 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-23 07:27:35,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:27:35,767 INFO L93 Difference]: Finished difference Result 81 states and 99 transitions. [2023-11-23 07:27:35,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 07:27:35,768 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 65 [2023-11-23 07:27:35,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:27:35,768 INFO L225 Difference]: With dead ends: 81 [2023-11-23 07:27:35,768 INFO L226 Difference]: Without dead ends: 79 [2023-11-23 07:27:35,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-23 07:27:35,769 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 7 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 07:27:35,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 302 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 07:27:35,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-11-23 07:27:35,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2023-11-23 07:27:35,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 46 states have (on average 1.108695652173913) internal successors, (51), 49 states have internal predecessors, (51), 21 states have call successors, (21), 9 states have call predecessors, (21), 11 states have return successors, (25), 20 states have call predecessors, (25), 20 states have call successors, (25) [2023-11-23 07:27:35,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 97 transitions. [2023-11-23 07:27:35,777 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 97 transitions. Word has length 65 [2023-11-23 07:27:35,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:27:35,777 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 97 transitions. [2023-11-23 07:27:35,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-23 07:27:35,777 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 97 transitions. [2023-11-23 07:27:35,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-23 07:27:35,778 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:27:35,778 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 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] [2023-11-23 07:27:35,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-23 07:27:35,778 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:27:35,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:27:35,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1890293950, now seen corresponding path program 1 times [2023-11-23 07:27:35,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:27:35,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113914909] [2023-11-23 07:27:35,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:27:35,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:27:35,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:36,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:27:37,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:37,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:27:37,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:37,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 07:27:37,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:37,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:27:37,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:37,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 07:27:37,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:37,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 07:27:37,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:37,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-23 07:27:37,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:37,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 07:27:37,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:37,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 07:27:37,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:37,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 07:27:37,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:37,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-23 07:27:37,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:37,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-23 07:27:37,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:37,722 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2023-11-23 07:27:37,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:27:37,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113914909] [2023-11-23 07:27:37,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113914909] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:27:37,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:27:37,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-11-23 07:27:37,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277290271] [2023-11-23 07:27:37,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:27:37,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-23 07:27:37,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:27:37,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-23 07:27:37,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2023-11-23 07:27:37,724 INFO L87 Difference]: Start difference. First operand 79 states and 97 transitions. Second operand has 16 states, 10 states have (on average 3.2) internal successors, (32), 12 states have internal predecessors, (32), 7 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2023-11-23 07:27:38,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:27:38,576 INFO L93 Difference]: Finished difference Result 87 states and 105 transitions. [2023-11-23 07:27:38,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-23 07:27:38,577 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 10 states have (on average 3.2) internal successors, (32), 12 states have internal predecessors, (32), 7 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) Word has length 79 [2023-11-23 07:27:38,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:27:38,577 INFO L225 Difference]: With dead ends: 87 [2023-11-23 07:27:38,577 INFO L226 Difference]: Without dead ends: 85 [2023-11-23 07:27:38,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2023-11-23 07:27:38,578 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 45 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-23 07:27:38,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 162 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-23 07:27:38,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-11-23 07:27:38,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2023-11-23 07:27:38,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 52 states have internal predecessors, (54), 22 states have call successors, (22), 10 states have call predecessors, (22), 12 states have return successors, (26), 21 states have call predecessors, (26), 21 states have call successors, (26) [2023-11-23 07:27:38,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 102 transitions. [2023-11-23 07:27:38,591 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 102 transitions. Word has length 79 [2023-11-23 07:27:38,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:27:38,592 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 102 transitions. [2023-11-23 07:27:38,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 10 states have (on average 3.2) internal successors, (32), 12 states have internal predecessors, (32), 7 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2023-11-23 07:27:38,592 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 102 transitions. [2023-11-23 07:27:38,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-23 07:27:38,592 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:27:38,592 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 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:27:38,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-23 07:27:38,592 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:27:38,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:27:38,593 INFO L85 PathProgramCache]: Analyzing trace with hash -115286588, now seen corresponding path program 1 times [2023-11-23 07:27:38,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:27:38,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135579151] [2023-11-23 07:27:38,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:27:38,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:27:38,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:38,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:27:38,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:39,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:27:39,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:39,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 07:27:39,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:39,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:27:39,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:39,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 07:27:39,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:39,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 07:27:39,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:39,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-23 07:27:39,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:39,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 07:27:39,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:39,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 07:27:39,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:39,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 07:27:39,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:39,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-23 07:27:39,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:39,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-23 07:27:39,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:39,244 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 28 proven. 5 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-11-23 07:27:39,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:27:39,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135579151] [2023-11-23 07:27:39,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135579151] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:27:39,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724297489] [2023-11-23 07:27:39,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:27:39,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:27:39,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:27:39,246 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:27:39,256 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:27:39,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:39,455 INFO L262 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-23 07:27:39,466 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:27:39,591 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:27:39,596 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 125 treesize of output 123 [2023-11-23 07:27:39,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 99 [2023-11-23 07:27:39,653 INFO L349 Elim1Store]: treesize reduction 37, result has 42.2 percent of original size [2023-11-23 07:27:39,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 123 treesize of output 166 [2023-11-23 07:27:39,663 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 342 treesize of output 334 [2023-11-23 07:27:39,721 INFO L349 Elim1Store]: treesize reduction 84, result has 13.4 percent of original size [2023-11-23 07:27:39,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 2163 treesize of output 1981 [2023-11-23 07:27:39,877 INFO L349 Elim1Store]: treesize reduction 146, result has 43.2 percent of original size [2023-11-23 07:27:39,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 202 treesize of output 286 [2023-11-23 07:27:40,471 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-23 07:27:40,479 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-23 07:27:40,494 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-23 07:27:40,505 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-23 07:27:40,515 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-23 07:27:40,522 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-23 07:27:44,068 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-23 07:27:44,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-23 07:27:44,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-23 07:27:44,269 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Complicated and unsupported kind of self-update: (select |#memory_$Pointer$#2.base| (select v_arrayElimArr_4 aws_linked_list_insert_before_~to_add.offset)) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.classify(DerPreprocessor.java:233) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.classify(DerPreprocessor.java:205) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:104) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:122) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:543) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:522) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:515) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:326) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:298) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-11-23 07:27:44,275 INFO L158 Benchmark]: Toolchain (without parser) took 21539.23ms. Allocated memory was 132.1MB in the beginning and 673.2MB in the end (delta: 541.1MB). Free memory was 79.4MB in the beginning and 290.8MB in the end (delta: -211.3MB). Peak memory consumption was 393.3MB. Max. memory is 16.1GB. [2023-11-23 07:27:44,275 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 94.4MB. Free memory is still 61.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 07:27:44,275 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1406.58ms. Allocated memory was 132.1MB in the beginning and 176.2MB in the end (delta: 44.0MB). Free memory was 79.3MB in the beginning and 122.9MB in the end (delta: -43.6MB). Peak memory consumption was 68.6MB. Max. memory is 16.1GB. [2023-11-23 07:27:44,275 INFO L158 Benchmark]: Boogie Procedure Inliner took 94.04ms. Allocated memory is still 176.2MB. Free memory was 122.9MB in the beginning and 117.8MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-23 07:27:44,275 INFO L158 Benchmark]: Boogie Preprocessor took 43.05ms. Allocated memory is still 176.2MB. Free memory was 117.8MB in the beginning and 114.5MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-23 07:27:44,275 INFO L158 Benchmark]: RCFGBuilder took 492.75ms. Allocated memory is still 176.2MB. Free memory was 114.5MB in the beginning and 109.0MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-23 07:27:44,276 INFO L158 Benchmark]: TraceAbstraction took 19497.92ms. Allocated memory was 176.2MB in the beginning and 673.2MB in the end (delta: 497.0MB). Free memory was 107.9MB in the beginning and 290.8MB in the end (delta: -182.8MB). Peak memory consumption was 380.0MB. Max. memory is 16.1GB. [2023-11-23 07:27:44,277 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.36ms. Allocated memory is still 94.4MB. Free memory is still 61.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1406.58ms. Allocated memory was 132.1MB in the beginning and 176.2MB in the end (delta: 44.0MB). Free memory was 79.3MB in the beginning and 122.9MB in the end (delta: -43.6MB). Peak memory consumption was 68.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 94.04ms. Allocated memory is still 176.2MB. Free memory was 122.9MB in the beginning and 117.8MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.05ms. Allocated memory is still 176.2MB. Free memory was 117.8MB in the beginning and 114.5MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 492.75ms. Allocated memory is still 176.2MB. Free memory was 114.5MB in the beginning and 109.0MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 19497.92ms. Allocated memory was 176.2MB in the beginning and 673.2MB in the end (delta: 497.0MB). Free memory was 107.9MB in the beginning and 290.8MB in the end (delta: -182.8MB). Peak memory consumption was 380.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Complicated and unsupported kind of self-update: (select |#memory_$Pointer$#2.base| (select v_arrayElimArr_4 aws_linked_list_insert_before_~to_add.offset)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Complicated and unsupported kind of self-update: (select |#memory_$Pointer$#2.base| (select v_arrayElimArr_4 aws_linked_list_insert_before_~to_add.offset)): de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.classify(DerPreprocessor.java:233) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-11-23 07:27:44,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_insert_before_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.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 2f0ef11561022276ce844351f7c3da39e7886059141883b3ddc06067a22b3d7d --preprocessor.use.memory.slicer true --- Real Ultimate output --- This is Ultimate 0.2.3-?-abd6749-m [2023-11-23 07:27:46,273 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 07:27:46,341 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2023-11-23 07:27:46,347 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 07:27:46,348 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 07:27:46,369 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 07:27:46,370 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 07:27:46,371 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 07:27:46,371 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 07:27:46,374 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 07:27:46,374 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 07:27:46,375 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 07:27:46,375 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 07:27:46,376 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 07:27:46,376 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 07:27:46,376 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 07:27:46,377 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 07:27:46,377 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 07:27:46,377 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 07:27:46,377 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 07:27:46,377 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 07:27:46,378 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-23 07:27:46,378 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-23 07:27:46,379 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-23 07:27:46,379 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 07:27:46,379 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 07:27:46,380 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 07:27:46,380 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 07:27:46,380 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 07:27:46,380 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 07:27:46,381 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 07:27:46,382 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 07:27:46,382 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 07:27:46,382 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 07:27:46,382 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-23 07:27:46,382 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-23 07:27:46,383 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 07:27:46,383 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 07:27:46,383 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 07:27:46,384 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 07:27:46,384 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 07:27:46,384 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-23 07:27:46,384 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 -> 2f0ef11561022276ce844351f7c3da39e7886059141883b3ddc06067a22b3d7d Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> true [2023-11-23 07:27:46,685 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 07:27:46,720 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 07:27:46,722 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 07:27:46,723 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 07:27:46,723 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 07:27:46,725 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_insert_before_harness.i [2023-11-23 07:27:47,784 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 07:27:48,163 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 07:27:48,164 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_insert_before_harness.i [2023-11-23 07:27:48,194 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a50b7fd74/0bbab7378b4b443d8509ec7f96c2c453/FLAG4468f8172 [2023-11-23 07:27:48,210 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a50b7fd74/0bbab7378b4b443d8509ec7f96c2c453 [2023-11-23 07:27:48,212 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 07:27:48,213 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 07:27:48,217 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 07:27:48,217 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 07:27:48,220 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 07:27:48,222 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:27:48" (1/1) ... [2023-11-23 07:27:48,223 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@565053fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:27:48, skipping insertion in model container [2023-11-23 07:27:48,223 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:27:48" (1/1) ... [2023-11-23 07:27:48,296 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 07:27:48,499 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_insert_before_harness.i[4503,4516] [2023-11-23 07:27:48,504 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_insert_before_harness.i[4563,4576] [2023-11-23 07:27:48,987 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:48,987 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:48,987 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:48,988 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:48,988 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:49,001 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:49,002 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:49,005 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:49,005 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:49,006 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:49,008 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:49,008 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:49,010 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:49,221 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 07:27:49,222 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 07:27:49,223 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 07:27:49,225 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 07:27:49,226 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 07:27:49,226 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 07:27:49,227 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 07:27:49,227 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 07:27:49,227 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 07:27:49,228 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 07:27:49,390 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 07:27:49,408 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-23 07:27:49,432 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 07:27:49,436 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_insert_before_harness.i[4503,4516] [2023-11-23 07:27:49,436 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_insert_before_harness.i[4563,4576] [2023-11-23 07:27:49,478 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:49,479 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:49,479 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:49,480 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:49,480 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:49,487 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:49,487 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:49,488 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:49,488 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:49,489 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:49,489 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:49,490 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:49,490 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:49,528 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 07:27:49,529 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 07:27:49,529 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 07:27:49,530 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 07:27:49,530 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 07:27:49,532 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 07:27:49,532 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 07:27:49,533 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 07:27:49,533 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 07:27:49,533 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 07:27:49,570 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 07:27:49,579 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 07:27:49,599 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_insert_before_harness.i[4503,4516] [2023-11-23 07:27:49,599 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_insert_before_harness.i[4563,4576] [2023-11-23 07:27:49,633 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:49,633 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:49,634 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:49,634 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:49,635 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:49,643 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:49,644 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:49,644 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:49,644 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:49,645 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:49,646 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:49,646 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:49,646 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:49,668 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 07:27:49,668 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 07:27:49,669 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 07:27:49,669 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 07:27:49,669 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 07:27:49,670 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 07:27:49,670 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 07:27:49,670 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 07:27:49,671 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 07:27:49,671 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 07:27:49,698 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 07:27:49,922 WARN L675 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:27:49,922 WARN L675 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:27:49,922 WARN L675 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:27:49,922 WARN L675 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:27:49,922 WARN L675 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:27:49,922 WARN L675 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:27:49,923 WARN L675 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:27:49,923 WARN L675 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:27:49,923 WARN L675 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:27:49,923 WARN L675 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:27:49,923 WARN L675 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:27:49,923 WARN L675 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:27:49,923 WARN L675 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:27:49,924 WARN L675 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:27:49,924 WARN L675 CHandler]: The function aws_array_list_ensure_capacity is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:27:49,929 INFO L206 MainTranslator]: Completed translation [2023-11-23 07:27:49,932 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:27:49 WrapperNode [2023-11-23 07:27:49,932 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 07:27:49,933 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 07:27:49,933 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 07:27:49,933 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 07:27:49,939 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:27:49" (1/1) ... [2023-11-23 07:27:50,017 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:27:49" (1/1) ... [2023-11-23 07:27:50,061 INFO L138 Inliner]: procedures = 697, calls = 1048, calls flagged for inlining = 49, calls inlined = 3, statements flattened = 51 [2023-11-23 07:27:50,061 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 07:27:50,062 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 07:27:50,062 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 07:27:50,062 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 07:27:50,070 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:27:49" (1/1) ... [2023-11-23 07:27:50,070 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:27:49" (1/1) ... [2023-11-23 07:27:50,073 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:27:49" (1/1) ... [2023-11-23 07:27:50,094 INFO L188 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [2, 5, 17]. 71 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:27:50,095 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:27:49" (1/1) ... [2023-11-23 07:27:50,095 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:27:49" (1/1) ... [2023-11-23 07:27:50,108 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:27:49" (1/1) ... [2023-11-23 07:27:50,110 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:27:49" (1/1) ... [2023-11-23 07:27:50,120 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:27:49" (1/1) ... [2023-11-23 07:27:50,129 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:27:49" (1/1) ... [2023-11-23 07:27:50,132 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 07:27:50,136 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 07:27:50,136 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 07:27:50,136 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 07:27:50,137 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:27:49" (1/1) ... [2023-11-23 07:27:50,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 07:27:50,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:27:50,163 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:27:50,184 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:27:50,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 07:27:50,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-23 07:27:50,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-23 07:27:50,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-23 07:27:50,207 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-23 07:27:50,207 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-23 07:27:50,207 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2023-11-23 07:27:50,207 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2023-11-23 07:27:50,208 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 07:27:50,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-23 07:27:50,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-23 07:27:50,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-23 07:27:50,208 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_insert_before [2023-11-23 07:27:50,209 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_insert_before [2023-11-23 07:27:50,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 07:27:50,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 07:27:50,209 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 07:27:50,209 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 07:27:50,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 07:27:50,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-23 07:27:50,210 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-23 07:27:50,210 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-23 07:27:50,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-23 07:27:50,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-23 07:27:50,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-23 07:27:50,211 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2023-11-23 07:27:50,211 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2023-11-23 07:27:50,417 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 07:27:50,419 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 07:27:50,589 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 07:27:50,627 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 07:27:50,627 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-23 07:27:50,628 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:27:50 BoogieIcfgContainer [2023-11-23 07:27:50,628 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 07:27:50,629 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 07:27:50,629 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 07:27:50,631 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 07:27:50,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 07:27:48" (1/3) ... [2023-11-23 07:27:50,632 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45151b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 07:27:50, skipping insertion in model container [2023-11-23 07:27:50,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:27:49" (2/3) ... [2023-11-23 07:27:50,633 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45151b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 07:27:50, skipping insertion in model container [2023-11-23 07:27:50,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:27:50" (3/3) ... [2023-11-23 07:27:50,635 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_insert_before_harness.i [2023-11-23 07:27:50,647 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 07:27:50,647 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 07:27:50,698 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 07:27:50,706 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;@86bc416, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 07:27:50,706 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 07:27:50,709 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 32 states have internal predecessors, (38), 21 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-23 07:27:50,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-23 07:27:50,718 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:27:50,718 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 07:27:50,719 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:27:50,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:27:50,722 INFO L85 PathProgramCache]: Analyzing trace with hash -669486050, now seen corresponding path program 1 times [2023-11-23 07:27:50,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 07:27:50,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [898642317] [2023-11-23 07:27:50,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:27:50,737 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 07:27:50,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-23 07:27:50,739 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 07:27:50,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-23 07:27:50,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:50,935 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-23 07:27:50,939 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:27:50,955 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-23 07:27:50,955 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:27:50,955 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 07:27:50,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [898642317] [2023-11-23 07:27:50,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [898642317] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:27:50,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:27:50,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 07:27:50,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068488789] [2023-11-23 07:27:50,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:27:50,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-23 07:27:50,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 07:27:50,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-23 07:27:50,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 07:27:50,978 INFO L87 Difference]: Start difference. First operand has 59 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 32 states have internal predecessors, (38), 21 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 07:27:51,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:27:51,073 INFO L93 Difference]: Finished difference Result 113 states and 165 transitions. [2023-11-23 07:27:51,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 07:27:51,075 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2023-11-23 07:27:51,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:27:51,080 INFO L225 Difference]: With dead ends: 113 [2023-11-23 07:27:51,080 INFO L226 Difference]: Without dead ends: 57 [2023-11-23 07:27:51,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 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:27:51,084 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 07:27:51,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 07:27:51,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-23 07:27:51,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2023-11-23 07:27:51,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 31 states have internal predecessors, (35), 21 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-23 07:27:51,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 76 transitions. [2023-11-23 07:27:51,112 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 76 transitions. Word has length 33 [2023-11-23 07:27:51,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:27:51,113 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 76 transitions. [2023-11-23 07:27:51,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 07:27:51,113 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 76 transitions. [2023-11-23 07:27:51,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-23 07:27:51,114 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:27:51,114 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 07:27:51,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-23 07:27:51,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 07:27:51,321 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:27:51,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:27:51,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1526647902, now seen corresponding path program 1 times [2023-11-23 07:27:51,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 07:27:51,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1627707261] [2023-11-23 07:27:51,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:27:51,322 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 07:27:51,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-23 07:27:51,323 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 07:27:51,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-23 07:27:51,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:51,640 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 54 conjunts are in the unsatisfiable core [2023-11-23 07:27:51,646 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:27:51,716 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:27:51,733 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2023-11-23 07:27:51,733 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 35 treesize of output 27 [2023-11-23 07:27:51,755 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-23 07:27:51,756 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 1 case distinctions, treesize of input 33 treesize of output 32 [2023-11-23 07:27:53,926 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_aws_linked_list_insert_before_~before.base_BEFORE_CALL_1 (_ BitVec 64))) (not (= (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_insert_before_~before.base_BEFORE_CALL_1) (_ bv8 64)) v_aws_linked_list_insert_before_~before.base_BEFORE_CALL_1))) is different from true [2023-11-23 07:27:56,071 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_aws_linked_list_insert_before_~before.base_BEFORE_CALL_2 (_ BitVec 64))) (not (= (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_insert_before_~before.base_BEFORE_CALL_2) (_ bv8 64)) v_aws_linked_list_insert_before_~before.base_BEFORE_CALL_2))) is different from true [2023-11-23 07:27:58,160 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_aws_linked_list_insert_before_~before.base_BEFORE_CALL_3 (_ BitVec 64))) (not (= (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_insert_before_~before.base_BEFORE_CALL_3) (_ bv8 64)) v_aws_linked_list_insert_before_~before.base_BEFORE_CALL_3))) is different from true [2023-11-23 07:27:58,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:27:58,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:27:58,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:27:58,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 675 treesize of output 450 [2023-11-23 07:27:58,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:27:58,404 INFO L349 Elim1Store]: treesize reduction 164, result has 20.4 percent of original size [2023-11-23 07:27:58,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 203 treesize of output 72 [2023-11-23 07:27:59,676 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2023-11-23 07:27:59,676 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:28:00,388 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 410 treesize of output 374 [2023-11-23 07:28:00,447 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 1776 treesize of output 1740 [2023-11-23 07:28:01,174 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 07:28:01,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1627707261] [2023-11-23 07:28:01,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1627707261] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:28:01,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [922818616] [2023-11-23 07:28:01,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:28:01,175 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-23 07:28:01,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-11-23 07:28:01,177 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-23 07:28:01,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2023-11-23 07:28:01,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:01,642 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 45 conjunts are in the unsatisfiable core [2023-11-23 07:28:01,646 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:28:01,663 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-23 07:28:01,664 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 19 [2023-11-23 07:28:01,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 16 treesize of output 16 [2023-11-23 07:28:01,691 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-23 07:28:01,691 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 1 case distinctions, treesize of input 33 treesize of output 32 [2023-11-23 07:28:03,804 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_aws_linked_list_insert_before_~before.base_BEFORE_CALL_6 (_ BitVec 64))) (not (= (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_insert_before_~before.base_BEFORE_CALL_6) (_ bv8 64)) v_aws_linked_list_insert_before_~before.base_BEFORE_CALL_6))) is different from true [2023-11-23 07:28:05,872 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_aws_linked_list_insert_before_~before.base_BEFORE_CALL_7 (_ BitVec 64))) (not (= v_aws_linked_list_insert_before_~before.base_BEFORE_CALL_7 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_insert_before_~before.base_BEFORE_CALL_7) (_ bv8 64))))) is different from true [2023-11-23 07:28:07,965 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_aws_linked_list_insert_before_~before.base_BEFORE_CALL_8 (_ BitVec 64))) (not (= (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_insert_before_~before.base_BEFORE_CALL_8) (_ bv8 64)) v_aws_linked_list_insert_before_~before.base_BEFORE_CALL_8))) is different from true [2023-11-23 07:28:08,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:28:09,346 INFO L349 Elim1Store]: treesize reduction 241, result has 5.9 percent of original size [2023-11-23 07:28:09,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 249 treesize of output 218 [2023-11-23 07:28:09,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:28:09,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 113 [2023-11-23 07:28:09,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:28:14,511 WARN L293 SmtUtils]: Spent 5.10s on a formula simplification. DAG size of input: 109 DAG size of output: 42 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-23 07:28:14,511 INFO L349 Elim1Store]: treesize reduction 443, result has 18.7 percent of original size [2023-11-23 07:28:14,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 797 treesize of output 974 [2023-11-23 07:28:14,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:28:14,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:28:16,778 INFO L349 Elim1Store]: treesize reduction 144, result has 34.8 percent of original size [2023-11-23 07:28:16,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 438 treesize of output 502 [2023-11-23 07:28:18,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-23 07:28:18,252 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 184 treesize of output 148 [2023-11-23 07:28:18,441 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 170 treesize of output 136 [2023-11-23 07:28:19,416 INFO L349 Elim1Store]: treesize reduction 218, result has 13.8 percent of original size [2023-11-23 07:28:19,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 247 treesize of output 280 [2023-11-23 07:28:20,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:28:28,063 WARN L293 SmtUtils]: Spent 7.77s on a formula simplification. DAG size of input: 121 DAG size of output: 63 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-23 07:28:28,063 INFO L349 Elim1Store]: treesize reduction 457, result has 27.2 percent of original size [2023-11-23 07:28:28,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 8 new quantified variables, introduced 27 case distinctions, treesize of input 1049 treesize of output 1272 [2023-11-23 07:28:40,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2023-11-23 07:28:41,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2023-11-23 07:28:42,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 356 treesize of output 340 [2023-11-23 07:28:47,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 157 [2023-11-23 07:28:50,241 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-23 07:28:50,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Forceful destruction successful, exit code 0 [2023-11-23 07:28:50,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-23 07:28:50,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 07:28:50,643 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: no need to replace index at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:331) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructDerEnabler(DerPreprocessor.java:186) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:144) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:122) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:543) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:522) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:515) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:326) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:298) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-11-23 07:28:50,646 INFO L158 Benchmark]: Toolchain (without parser) took 62433.16ms. Allocated memory was 71.3MB in the beginning and 167.8MB in the end (delta: 96.5MB). Free memory was 42.7MB in the beginning and 96.9MB in the end (delta: -54.2MB). Peak memory consumption was 116.7MB. Max. memory is 16.1GB. [2023-11-23 07:28:50,647 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 52.4MB. Free memory is still 27.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 07:28:50,647 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1715.99ms. Allocated memory was 71.3MB in the beginning and 113.2MB in the end (delta: 41.9MB). Free memory was 42.5MB in the beginning and 45.4MB in the end (delta: -2.9MB). Peak memory consumption was 45.3MB. Max. memory is 16.1GB. [2023-11-23 07:28:50,647 INFO L158 Benchmark]: Boogie Procedure Inliner took 128.06ms. Allocated memory is still 113.2MB. Free memory was 45.4MB in the beginning and 69.8MB in the end (delta: -24.4MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. [2023-11-23 07:28:50,647 INFO L158 Benchmark]: Boogie Preprocessor took 73.63ms. Allocated memory is still 113.2MB. Free memory was 69.8MB in the beginning and 65.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-23 07:28:50,647 INFO L158 Benchmark]: RCFGBuilder took 492.05ms. Allocated memory is still 113.2MB. Free memory was 65.6MB in the beginning and 36.8MB in the end (delta: 28.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2023-11-23 07:28:50,647 INFO L158 Benchmark]: TraceAbstraction took 60016.90ms. Allocated memory was 113.2MB in the beginning and 167.8MB in the end (delta: 54.5MB). Free memory was 36.2MB in the beginning and 96.9MB in the end (delta: -60.7MB). Peak memory consumption was 68.6MB. Max. memory is 16.1GB. [2023-11-23 07:28:50,648 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.16ms. Allocated memory is still 52.4MB. Free memory is still 27.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1715.99ms. Allocated memory was 71.3MB in the beginning and 113.2MB in the end (delta: 41.9MB). Free memory was 42.5MB in the beginning and 45.4MB in the end (delta: -2.9MB). Peak memory consumption was 45.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 128.06ms. Allocated memory is still 113.2MB. Free memory was 45.4MB in the beginning and 69.8MB in the end (delta: -24.4MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.63ms. Allocated memory is still 113.2MB. Free memory was 69.8MB in the beginning and 65.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 492.05ms. Allocated memory is still 113.2MB. Free memory was 65.6MB in the beginning and 36.8MB in the end (delta: 28.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 60016.90ms. Allocated memory was 113.2MB in the beginning and 167.8MB in the end (delta: 54.5MB). Free memory was 36.2MB in the beginning and 96.9MB in the end (delta: -60.7MB). Peak memory consumption was 68.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: no need to replace index de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: no need to replace index: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-11-23 07:28:50,679 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 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: no need to replace index