./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_end_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_end_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 a49fa15b0860d2357f9ad3c8c6bab1d80cf83a6734355dc0b05c55121c837273 --preprocessor.use.memory.slicer true --- Real Ultimate output --- This is Ultimate 0.2.3-?-abd6749-m [2023-11-23 07:25:48,695 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 07:25:48,808 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-23 07:25:48,815 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 07:25:48,816 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 07:25:48,850 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 07:25:48,851 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 07:25:48,851 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 07:25:48,852 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 07:25:48,857 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 07:25:48,858 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 07:25:48,858 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 07:25:48,859 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 07:25:48,860 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 07:25:48,860 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 07:25:48,860 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 07:25:48,860 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 07:25:48,861 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 07:25:48,861 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 07:25:48,861 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 07:25:48,861 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 07:25:48,862 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 07:25:48,862 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 07:25:48,862 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 07:25:48,863 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 07:25:48,863 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 07:25:48,863 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 07:25:48,864 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 07:25:48,864 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 07:25:48,864 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 07:25:48,865 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 07:25:48,865 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 07:25:48,866 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 07:25:48,866 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 07:25:48,866 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 07:25:48,866 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 07:25:48,866 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 07:25:48,867 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 07:25:48,867 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 07:25:48,867 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 -> a49fa15b0860d2357f9ad3c8c6bab1d80cf83a6734355dc0b05c55121c837273 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> true [2023-11-23 07:25:49,121 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 07:25:49,142 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 07:25:49,144 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 07:25:49,146 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 07:25:49,146 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 07:25:49,147 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_end_harness.i [2023-11-23 07:25:50,243 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 07:25:50,591 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 07:25:50,592 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_end_harness.i [2023-11-23 07:25:50,630 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b1156766/e227504bb2be4a92b606c34b78177247/FLAGba21a7a11 [2023-11-23 07:25:50,647 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b1156766/e227504bb2be4a92b606c34b78177247 [2023-11-23 07:25:50,649 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 07:25:50,651 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 07:25:50,652 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 07:25:50,652 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 07:25:50,656 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 07:25:50,656 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:25:50" (1/1) ... [2023-11-23 07:25:50,657 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@754a6b74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:25:50, skipping insertion in model container [2023-11-23 07:25:50,657 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:25:50" (1/1) ... [2023-11-23 07:25:50,761 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 07:25:50,923 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_end_harness.i[4493,4506] [2023-11-23 07:25:50,928 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_end_harness.i[4553,4566] [2023-11-23 07:25:51,383 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:25:51,384 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:25:51,384 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:25:51,385 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:25:51,387 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:25:51,398 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:25:51,398 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:25:51,400 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:25:51,401 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:25:51,403 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:25:51,404 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:25:51,404 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:25:51,404 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:25:51,578 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 07:25:51,579 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 07:25:51,580 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 07:25:51,580 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 07:25:51,581 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 07:25:51,582 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 07:25:51,582 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 07:25:51,583 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 07:25:51,583 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 07:25:51,583 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 07:25:51,717 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 07:25:51,730 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 07:25:51,750 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_end_harness.i[4493,4506] [2023-11-23 07:25:51,750 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_end_harness.i[4553,4566] [2023-11-23 07:25:51,795 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:25:51,796 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:25:51,796 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:25:51,796 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:25:51,797 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:25:51,808 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:25:51,809 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:25:51,809 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:25:51,810 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:25:51,810 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:25:51,811 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:25:51,811 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:25:51,811 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:25:51,833 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 07:25:51,833 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 07:25:51,834 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 07:25:51,834 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 07:25:51,835 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 07:25:51,835 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 07:25:51,835 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 07:25:51,836 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 07:25:51,836 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 07:25:51,836 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 07:25:51,868 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 07:25:52,000 WARN L675 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:25:52,001 WARN L675 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:25:52,001 WARN L675 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:25:52,001 WARN L675 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:25:52,001 WARN L675 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:25:52,001 WARN L675 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:25:52,001 WARN L675 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:25:52,001 WARN L675 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:25:52,001 WARN L675 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:25:52,002 WARN L675 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:25:52,002 WARN L675 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:25:52,002 WARN L675 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:25:52,002 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:25:52,003 WARN L675 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:25:52,003 WARN L675 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:25:52,003 WARN L675 CHandler]: The function aws_array_list_ensure_capacity is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:25:52,010 INFO L206 MainTranslator]: Completed translation [2023-11-23 07:25:52,010 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:25:52 WrapperNode [2023-11-23 07:25:52,010 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 07:25:52,011 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 07:25:52,011 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 07:25:52,011 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 07:25:52,016 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:25:52" (1/1) ... [2023-11-23 07:25:52,056 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:25:52" (1/1) ... [2023-11-23 07:25:52,086 INFO L138 Inliner]: procedures = 678, calls = 1040, calls flagged for inlining = 52, calls inlined = 6, statements flattened = 135 [2023-11-23 07:25:52,087 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 07:25:52,087 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 07:25:52,087 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 07:25:52,087 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 07:25:52,103 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:25:52" (1/1) ... [2023-11-23 07:25:52,103 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:25:52" (1/1) ... [2023-11-23 07:25:52,106 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:25:52" (1/1) ... [2023-11-23 07:25:52,137 INFO L188 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 5, 14]. 67 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 6 writes are split as follows [0, 0, 6]. [2023-11-23 07:25:52,142 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:25:52" (1/1) ... [2023-11-23 07:25:52,142 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:25:52" (1/1) ... [2023-11-23 07:25:52,149 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:25:52" (1/1) ... [2023-11-23 07:25:52,166 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:25:52" (1/1) ... [2023-11-23 07:25:52,169 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:25:52" (1/1) ... [2023-11-23 07:25:52,170 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:25:52" (1/1) ... [2023-11-23 07:25:52,178 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 07:25:52,179 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 07:25:52,179 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 07:25:52,179 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 07:25:52,186 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:25:52" (1/1) ... [2023-11-23 07:25:52,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 07:25:52,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:25:52,215 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:25:52,257 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:25:52,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 07:25:52,280 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-23 07:25:52,280 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-23 07:25:52,280 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2023-11-23 07:25:52,281 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2023-11-23 07:25:52,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 07:25:52,281 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2023-11-23 07:25:52,281 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2023-11-23 07:25:52,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 07:25:52,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-23 07:25:52,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-23 07:25:52,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-23 07:25:52,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 07:25:52,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 07:25:52,282 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 07:25:52,282 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 07:25:52,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 07:25:52,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-23 07:25:52,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-23 07:25:52,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-23 07:25:52,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-23 07:25:52,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-23 07:25:52,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-23 07:25:52,283 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2023-11-23 07:25:52,283 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2023-11-23 07:25:52,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-23 07:25:52,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-23 07:25:52,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-23 07:25:52,481 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 07:25:52,483 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 07:25:52,623 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 07:25:52,662 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 07:25:52,662 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-23 07:25:52,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:25:52 BoogieIcfgContainer [2023-11-23 07:25:52,663 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 07:25:52,664 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 07:25:52,665 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 07:25:52,667 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 07:25:52,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 07:25:50" (1/3) ... [2023-11-23 07:25:52,668 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ed5f2bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 07:25:52, skipping insertion in model container [2023-11-23 07:25:52,669 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:25:52" (2/3) ... [2023-11-23 07:25:52,669 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ed5f2bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 07:25:52, skipping insertion in model container [2023-11-23 07:25:52,669 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:25:52" (3/3) ... [2023-11-23 07:25:52,670 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_end_harness.i [2023-11-23 07:25:52,687 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 07:25:52,687 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 07:25:52,736 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 07:25:52,752 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;@9e4b626, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 07:25:52,752 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 07:25:52,756 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 39 states have (on average 1.435897435897436) internal successors, (56), 40 states have internal predecessors, (56), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-23 07:25:52,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-23 07:25:52,768 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:25:52,769 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:25:52,770 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:25:52,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:25:52,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1341941210, now seen corresponding path program 1 times [2023-11-23 07:25:52,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:25:52,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519032130] [2023-11-23 07:25:52,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:25:52,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:25:52,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:25:53,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:25:53,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:25:53,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:25:53,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:25:53,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:25:53,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:25:53,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 07:25:53,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:25:53,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 07:25:53,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:25:53,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:25:53,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:25:53,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 07:25:53,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:25:53,371 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-11-23 07:25:53,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:25:53,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519032130] [2023-11-23 07:25:53,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519032130] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:25:53,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:25:53,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 07:25:53,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573162467] [2023-11-23 07:25:53,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:25:53,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-23 07:25:53,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:25:53,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-23 07:25:53,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 07:25:53,417 INFO L87 Difference]: Start difference. First operand has 59 states, 39 states have (on average 1.435897435897436) internal successors, (56), 40 states have internal predecessors, (56), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 07:25:53,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:25:53,463 INFO L93 Difference]: Finished difference Result 112 states and 168 transitions. [2023-11-23 07:25:53,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 07:25:53,466 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2023-11-23 07:25:53,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:25:53,473 INFO L225 Difference]: With dead ends: 112 [2023-11-23 07:25:53,473 INFO L226 Difference]: Without dead ends: 57 [2023-11-23 07:25:53,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 07:25:53,485 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 07:25:53,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 07:25:53,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-23 07:25:53,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2023-11-23 07:25:53,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 39 states have internal predecessors, (51), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-23 07:25:53,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 76 transitions. [2023-11-23 07:25:53,525 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 76 transitions. Word has length 65 [2023-11-23 07:25:53,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:25:53,526 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 76 transitions. [2023-11-23 07:25:53,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 07:25:53,527 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 76 transitions. [2023-11-23 07:25:53,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-23 07:25:53,532 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:25:53,532 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:25:53,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 07:25:53,532 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:25:53,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:25:53,533 INFO L85 PathProgramCache]: Analyzing trace with hash -71337452, now seen corresponding path program 1 times [2023-11-23 07:25:53,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:25:53,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852254972] [2023-11-23 07:25:53,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:25:53,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:25:53,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:25:53,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:25:53,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:25:53,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:25:53,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:25:53,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:25:53,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:25:53,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 07:25:53,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:25:53,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 07:25:53,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:25:53,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:25:53,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:25:53,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 07:25:53,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:25:53,993 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-11-23 07:25:53,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:25:53,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852254972] [2023-11-23 07:25:53,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852254972] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:25:53,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271922647] [2023-11-23 07:25:53,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:25:53,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:25:53,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:25:53,996 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:25:54,036 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:25:54,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:25:54,183 INFO L262 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 53 conjunts are in the unsatisfiable core [2023-11-23 07:25:54,191 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:25:54,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2023-11-23 07:25:54,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2023-11-23 07:25:54,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:25:54,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:25:54,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2023-11-23 07:25:54,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:25:54,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:25:54,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:25:54,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 40 [2023-11-23 07:25:54,924 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 07:25:54,925 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:25:54,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1271922647] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:25:54,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:25:54,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2023-11-23 07:25:54,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12288598] [2023-11-23 07:25:54,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:25:54,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 07:25:54,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:25:54,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 07:25:54,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2023-11-23 07:25:54,930 INFO L87 Difference]: Start difference. First operand 57 states and 76 transitions. Second operand has 9 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-23 07:25:55,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:25:55,461 INFO L93 Difference]: Finished difference Result 157 states and 214 transitions. [2023-11-23 07:25:55,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 07:25:55,462 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2023-11-23 07:25:55,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:25:55,464 INFO L225 Difference]: With dead ends: 157 [2023-11-23 07:25:55,464 INFO L226 Difference]: Without dead ends: 110 [2023-11-23 07:25:55,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2023-11-23 07:25:55,465 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 71 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-23 07:25:55,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 306 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-23 07:25:55,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-11-23 07:25:55,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2023-11-23 07:25:55,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 73 states have (on average 1.36986301369863) internal successors, (100), 76 states have internal predecessors, (100), 24 states have call successors, (24), 9 states have call predecessors, (24), 10 states have return successors, (24), 22 states have call predecessors, (24), 22 states have call successors, (24) [2023-11-23 07:25:55,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 148 transitions. [2023-11-23 07:25:55,485 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 148 transitions. Word has length 65 [2023-11-23 07:25:55,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:25:55,486 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 148 transitions. [2023-11-23 07:25:55,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-23 07:25:55,486 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 148 transitions. [2023-11-23 07:25:55,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-23 07:25:55,491 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:25:55,492 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:25:55,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-23 07:25:55,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:25:55,709 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:25:55,709 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:25:55,709 INFO L85 PathProgramCache]: Analyzing trace with hash -2120725294, now seen corresponding path program 1 times [2023-11-23 07:25:55,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:25:55,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761478803] [2023-11-23 07:25:55,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:25:55,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:25:55,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:25:55,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:25:55,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:25:55,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:25:55,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:25:55,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:25:55,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:25:55,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 07:25:55,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:25:55,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 07:25:55,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:25:55,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:25:55,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:25:55,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 07:25:55,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:25:55,964 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-11-23 07:25:55,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:25:55,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761478803] [2023-11-23 07:25:55,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761478803] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:25:55,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377228645] [2023-11-23 07:25:55,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:25:55,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:25:55,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:25:55,966 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:25:55,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-23 07:25:56,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:25:56,093 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 45 conjunts are in the unsatisfiable core [2023-11-23 07:25:56,105 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:25:56,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2023-11-23 07:25:56,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2023-11-23 07:25:56,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:25:56,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:25:56,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2023-11-23 07:25:56,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:25:56,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:25:56,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:25:56,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 40 [2023-11-23 07:25:57,021 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 07:25:57,021 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:25:57,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1377228645] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:25:57,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:25:57,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2023-11-23 07:25:57,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119584236] [2023-11-23 07:25:57,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:25:57,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 07:25:57,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:25:57,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 07:25:57,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2023-11-23 07:25:57,024 INFO L87 Difference]: Start difference. First operand 108 states and 148 transitions. Second operand has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-23 07:25:57,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:25:57,586 INFO L93 Difference]: Finished difference Result 157 states and 211 transitions. [2023-11-23 07:25:57,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 07:25:57,589 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2023-11-23 07:25:57,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:25:57,593 INFO L225 Difference]: With dead ends: 157 [2023-11-23 07:25:57,594 INFO L226 Difference]: Without dead ends: 108 [2023-11-23 07:25:57,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 67 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2023-11-23 07:25:57,598 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 65 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-23 07:25:57,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 303 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-23 07:25:57,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-11-23 07:25:57,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2023-11-23 07:25:57,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 72 states have (on average 1.3611111111111112) internal successors, (98), 74 states have internal predecessors, (98), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-23 07:25:57,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 144 transitions. [2023-11-23 07:25:57,625 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 144 transitions. Word has length 65 [2023-11-23 07:25:57,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:25:57,627 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 144 transitions. [2023-11-23 07:25:57,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-23 07:25:57,628 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 144 transitions. [2023-11-23 07:25:57,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-23 07:25:57,630 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:25:57,630 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:25:57,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-23 07:25:57,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-11-23 07:25:57,844 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:25:57,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:25:57,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1426934990, now seen corresponding path program 1 times [2023-11-23 07:25:57,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:25:57,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709093560] [2023-11-23 07:25:57,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:25:57,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:25:57,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:25:57,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:25:57,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:25:57,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:25:57,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:25:57,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:25:57,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:25:58,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 07:25:58,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:25:58,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 07:25:58,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:25:58,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:25:58,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:25:58,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 07:25:58,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:25:58,108 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-11-23 07:25:58,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:25:58,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709093560] [2023-11-23 07:25:58,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709093560] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:25:58,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682715276] [2023-11-23 07:25:58,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:25:58,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:25:58,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:25:58,112 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:25:58,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-23 07:25:58,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:25:58,237 INFO L262 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 34 conjunts are in the unsatisfiable core [2023-11-23 07:25:58,240 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:25:58,335 INFO L349 Elim1Store]: treesize reduction 42, result has 31.1 percent of original size [2023-11-23 07:25:58,336 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 80 [2023-11-23 07:25:58,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2023-11-23 07:25:58,370 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:25:58,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-11-23 07:25:58,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 39 treesize of output 20 [2023-11-23 07:26:00,514 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_10| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_10| Int)) (< |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_10| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_10|) (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_10| 24)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_10|))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_10| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_19| Int)) (let ((.cse0 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_10| 24))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_10|) .cse0))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_19| v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_10| v_DerPreprocessor_2) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_19|) v_DerPreprocessor_1) (= (select v_DerPreprocessor_2 .cse0) .cse1))) (<= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_19| .cse1) (<= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_10| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_19|))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_10|)))) is different from true [2023-11-23 07:26:01,046 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_19| Int)) (let ((.cse0 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_11| 24))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_11|) .cse0))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= (select v_DerPreprocessor_2 .cse0) .cse1) (= (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_19| v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_11| v_DerPreprocessor_2) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_19|) v_DerPreprocessor_1))) (<= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_19| .cse1) (<= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_11| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_19|))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_11|))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (< |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_11| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_11|) (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_11| 24)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_11|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_10| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_10| Int)) (< |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_10| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_10|) (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_10| 24)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_10|))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_10| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_19| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_10| 24))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_10|) .cse2))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_19| v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_10| v_DerPreprocessor_2) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_19|) v_DerPreprocessor_1) (= (select v_DerPreprocessor_2 .cse2) .cse3))) (<= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_19| .cse3) (<= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_10| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_19|))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_10|))))) is different from true [2023-11-23 07:26:03,628 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_19| Int)) (let ((.cse0 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_11| 24))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_11|) .cse0))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= (select v_DerPreprocessor_2 .cse0) .cse1) (= (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_19| v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_11| v_DerPreprocessor_2) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_19|) v_DerPreprocessor_1))) (<= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_19| .cse1) (<= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_11| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_19|))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_11|))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (< |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_11| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_11|) (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_11| 24)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_11|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_2| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_2|) (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_2| Int)) (< |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_2| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_2|) (+ |v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_2| 24)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_2| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_19| Int)) (let ((.cse3 (+ |v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_2| 24))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_2|) .cse3))) (and (<= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_19| .cse2) (<= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_2| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_19|) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_19| v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_2| v_DerPreprocessor_2) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_19|) v_DerPreprocessor_1) (= (select v_DerPreprocessor_2 .cse3) .cse2))))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_2|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_10| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_10| Int)) (< |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_10| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_10|) (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_10| 24)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_10|))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_10| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_19| Int)) (let ((.cse4 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_10| 24))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_10|) .cse4))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_19| v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_10| v_DerPreprocessor_2) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_19|) v_DerPreprocessor_1) (= (select v_DerPreprocessor_2 .cse4) .cse5))) (<= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_19| .cse5) (<= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_10| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_19|))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_10|))))) is different from true [2023-11-23 07:26:04,961 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2023-11-23 07:26:04,961 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:26:05,334 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:26:05,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 154 treesize of output 154 [2023-11-23 07:26:05,341 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 162 treesize of output 146 [2023-11-23 07:26:05,383 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 132 treesize of output 120 [2023-11-23 07:26:05,558 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-23 07:26:05,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682715276] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 07:26:05,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 07:26:05,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 15, 10] total 27 [2023-11-23 07:26:05,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850690639] [2023-11-23 07:26:05,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 07:26:05,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-23 07:26:05,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:26:05,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-23 07:26:05,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=481, Unknown=9, NotChecked=138, Total=702 [2023-11-23 07:26:05,561 INFO L87 Difference]: Start difference. First operand 106 states and 144 transitions. Second operand has 27 states, 22 states have (on average 3.9545454545454546) internal successors, (87), 23 states have internal predecessors, (87), 10 states have call successors, (20), 5 states have call predecessors, (20), 8 states have return successors, (19), 8 states have call predecessors, (19), 10 states have call successors, (19) [2023-11-23 07:26:09,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:26:09,372 INFO L93 Difference]: Finished difference Result 245 states and 355 transitions. [2023-11-23 07:26:09,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-23 07:26:09,373 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 22 states have (on average 3.9545454545454546) internal successors, (87), 23 states have internal predecessors, (87), 10 states have call successors, (20), 5 states have call predecessors, (20), 8 states have return successors, (19), 8 states have call predecessors, (19), 10 states have call successors, (19) Word has length 65 [2023-11-23 07:26:09,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:26:09,374 INFO L225 Difference]: With dead ends: 245 [2023-11-23 07:26:09,374 INFO L226 Difference]: Without dead ends: 136 [2023-11-23 07:26:09,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=172, Invalid=1145, Unknown=27, NotChecked=216, Total=1560 [2023-11-23 07:26:09,376 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 89 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 40 mSolverCounterUnsat, 61 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 1219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 61 IncrementalHoareTripleChecker+Unknown, 481 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-11-23 07:26:09,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 787 Invalid, 1219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 637 Invalid, 61 Unknown, 481 Unchecked, 2.8s Time] [2023-11-23 07:26:09,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-11-23 07:26:09,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 112. [2023-11-23 07:26:09,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 76 states have (on average 1.3421052631578947) internal successors, (102), 80 states have internal predecessors, (102), 24 states have call successors, (24), 9 states have call predecessors, (24), 11 states have return successors, (28), 22 states have call predecessors, (28), 22 states have call successors, (28) [2023-11-23 07:26:09,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 154 transitions. [2023-11-23 07:26:09,400 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 154 transitions. Word has length 65 [2023-11-23 07:26:09,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:26:09,400 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 154 transitions. [2023-11-23 07:26:09,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 22 states have (on average 3.9545454545454546) internal successors, (87), 23 states have internal predecessors, (87), 10 states have call successors, (20), 5 states have call predecessors, (20), 8 states have return successors, (19), 8 states have call predecessors, (19), 10 states have call successors, (19) [2023-11-23 07:26:09,401 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 154 transitions. [2023-11-23 07:26:09,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-23 07:26:09,401 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:26:09,402 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:26:09,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-23 07:26:09,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:26:09,614 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:26:09,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:26:09,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1010151624, now seen corresponding path program 1 times [2023-11-23 07:26:09,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:26:09,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651849000] [2023-11-23 07:26:09,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:09,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:26:09,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:09,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:26:09,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:09,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:26:09,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:09,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:26:09,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:09,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 07:26:09,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:09,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-23 07:26:09,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:09,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-23 07:26:09,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:09,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 07:26:09,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:09,808 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-23 07:26:09,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:26:09,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651849000] [2023-11-23 07:26:09,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651849000] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:26:09,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968472260] [2023-11-23 07:26:09,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:09,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:26:09,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:26:09,810 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:26:09,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-23 07:26:09,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:09,932 INFO L262 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-23 07:26:09,934 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:26:09,980 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 07:26:09,980 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:26:09,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968472260] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:26:09,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:26:09,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2023-11-23 07:26:09,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654491296] [2023-11-23 07:26:09,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:26:09,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 07:26:09,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:26:09,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 07:26:09,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-23 07:26:09,982 INFO L87 Difference]: Start difference. First operand 112 states and 154 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 07:26:10,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:26:10,086 INFO L93 Difference]: Finished difference Result 217 states and 302 transitions. [2023-11-23 07:26:10,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 07:26:10,087 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 67 [2023-11-23 07:26:10,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:26:10,088 INFO L225 Difference]: With dead ends: 217 [2023-11-23 07:26:10,088 INFO L226 Difference]: Without dead ends: 118 [2023-11-23 07:26:10,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2023-11-23 07:26:10,089 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 32 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 07:26:10,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 232 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 07:26:10,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-11-23 07:26:10,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2023-11-23 07:26:10,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 80 states have (on average 1.325) internal successors, (106), 86 states have internal predecessors, (106), 24 states have call successors, (24), 9 states have call predecessors, (24), 13 states have return successors, (32), 22 states have call predecessors, (32), 22 states have call successors, (32) [2023-11-23 07:26:10,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 162 transitions. [2023-11-23 07:26:10,105 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 162 transitions. Word has length 67 [2023-11-23 07:26:10,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:26:10,105 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 162 transitions. [2023-11-23 07:26:10,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 07:26:10,106 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 162 transitions. [2023-11-23 07:26:10,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-11-23 07:26:10,106 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:26:10,107 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:26:10,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-23 07:26:10,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:26:10,319 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:26:10,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:26:10,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1982015221, now seen corresponding path program 1 times [2023-11-23 07:26:10,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:26:10,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111208845] [2023-11-23 07:26:10,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:10,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:26:10,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:10,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:26:10,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:10,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:26:10,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:10,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:26:10,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:10,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 07:26:10,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:10,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 07:26:10,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:10,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 07:26:10,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:10,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 07:26:10,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:10,532 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-23 07:26:10,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:26:10,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111208845] [2023-11-23 07:26:10,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111208845] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:26:10,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273019483] [2023-11-23 07:26:10,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:10,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:26:10,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:26:10,534 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:26:10,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-23 07:26:10,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:10,666 INFO L262 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-23 07:26:10,668 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:26:10,727 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 07:26:10,728 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:26:10,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273019483] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:26:10,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:26:10,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2023-11-23 07:26:10,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755464329] [2023-11-23 07:26:10,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:26:10,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 07:26:10,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:26:10,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 07:26:10,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2023-11-23 07:26:10,730 INFO L87 Difference]: Start difference. First operand 118 states and 162 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 07:26:10,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:26:10,884 INFO L93 Difference]: Finished difference Result 243 states and 340 transitions. [2023-11-23 07:26:10,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 07:26:10,884 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 69 [2023-11-23 07:26:10,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:26:10,885 INFO L225 Difference]: With dead ends: 243 [2023-11-23 07:26:10,886 INFO L226 Difference]: Without dead ends: 138 [2023-11-23 07:26:10,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2023-11-23 07:26:10,886 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 56 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 07:26:10,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 273 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 07:26:10,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2023-11-23 07:26:10,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 122. [2023-11-23 07:26:10,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 84 states have (on average 1.3333333333333333) internal successors, (112), 90 states have internal predecessors, (112), 24 states have call successors, (24), 9 states have call predecessors, (24), 13 states have return successors, (32), 22 states have call predecessors, (32), 22 states have call successors, (32) [2023-11-23 07:26:10,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 168 transitions. [2023-11-23 07:26:10,899 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 168 transitions. Word has length 69 [2023-11-23 07:26:10,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:26:10,899 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 168 transitions. [2023-11-23 07:26:10,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 07:26:10,899 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 168 transitions. [2023-11-23 07:26:10,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-23 07:26:10,902 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:26:10,902 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:26:10,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-23 07:26:11,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:26:11,114 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:26:11,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:26:11,114 INFO L85 PathProgramCache]: Analyzing trace with hash 733632409, now seen corresponding path program 1 times [2023-11-23 07:26:11,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:26:11,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033893339] [2023-11-23 07:26:11,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:11,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:26:11,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:11,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:26:11,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:11,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:26:11,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:11,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:26:11,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:11,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 07:26:11,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:11,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 07:26:11,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:11,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 07:26:11,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:11,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-23 07:26:11,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:11,227 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-11-23 07:26:11,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:26:11,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033893339] [2023-11-23 07:26:11,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033893339] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:26:11,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740603998] [2023-11-23 07:26:11,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:11,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:26:11,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:26:11,229 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:26:11,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-23 07:26:11,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:11,355 INFO L262 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-23 07:26:11,356 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:26:11,364 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-23 07:26:11,380 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:26:11,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [740603998] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:26:11,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:26:11,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2023-11-23 07:26:11,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621108481] [2023-11-23 07:26:11,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:26:11,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 07:26:11,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:26:11,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 07:26:11,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-23 07:26:11,382 INFO L87 Difference]: Start difference. First operand 122 states and 168 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 07:26:11,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:26:11,412 INFO L93 Difference]: Finished difference Result 241 states and 342 transitions. [2023-11-23 07:26:11,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 07:26:11,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2023-11-23 07:26:11,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:26:11,413 INFO L225 Difference]: With dead ends: 241 [2023-11-23 07:26:11,413 INFO L226 Difference]: Without dead ends: 132 [2023-11-23 07:26:11,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-23 07:26:11,414 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 4 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 07:26:11,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 128 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 07:26:11,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2023-11-23 07:26:11,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 124. [2023-11-23 07:26:11,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 86 states have (on average 1.3255813953488371) internal successors, (114), 92 states have internal predecessors, (114), 24 states have call successors, (24), 9 states have call predecessors, (24), 13 states have return successors, (32), 22 states have call predecessors, (32), 22 states have call successors, (32) [2023-11-23 07:26:11,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 170 transitions. [2023-11-23 07:26:11,437 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 170 transitions. Word has length 70 [2023-11-23 07:26:11,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:26:11,437 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 170 transitions. [2023-11-23 07:26:11,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 07:26:11,438 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 170 transitions. [2023-11-23 07:26:11,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-11-23 07:26:11,438 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:26:11,438 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:26:11,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-23 07:26:11,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:26:11,639 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:26:11,639 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:26:11,639 INFO L85 PathProgramCache]: Analyzing trace with hash 30271977, now seen corresponding path program 1 times [2023-11-23 07:26:11,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:26:11,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689725713] [2023-11-23 07:26:11,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:11,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:26:11,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:11,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:26:11,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:11,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:26:11,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:11,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:26:11,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:11,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:26:11,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:11,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 07:26:11,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:11,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:26:11,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:11,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 07:26:11,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:11,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-23 07:26:11,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:11,894 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-11-23 07:26:11,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:26:11,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689725713] [2023-11-23 07:26:11,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689725713] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:26:11,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187018328] [2023-11-23 07:26:11,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:11,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:26:11,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:26:11,900 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:26:11,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-23 07:26:12,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:12,061 INFO L262 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 54 conjunts are in the unsatisfiable core [2023-11-23 07:26:12,064 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:26:12,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2023-11-23 07:26:12,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2023-11-23 07:26:12,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:26:12,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:26:12,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2023-11-23 07:26:12,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:26:12,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:26:12,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:26:12,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 40 [2023-11-23 07:26:13,112 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 07:26:13,112 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:26:13,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187018328] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:26:13,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:26:13,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [7] total 16 [2023-11-23 07:26:13,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020446727] [2023-11-23 07:26:13,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:26:13,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-23 07:26:13,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:26:13,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-23 07:26:13,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2023-11-23 07:26:13,113 INFO L87 Difference]: Start difference. First operand 124 states and 170 transitions. Second operand has 11 states, 10 states have (on average 6.0) internal successors, (60), 11 states have internal predecessors, (60), 5 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2023-11-23 07:26:15,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:26:16,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:26:16,763 INFO L93 Difference]: Finished difference Result 210 states and 290 transitions. [2023-11-23 07:26:16,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-23 07:26:16,764 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.0) internal successors, (60), 11 states have internal predecessors, (60), 5 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) Word has length 77 [2023-11-23 07:26:16,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:26:16,765 INFO L225 Difference]: With dead ends: 210 [2023-11-23 07:26:16,765 INFO L226 Difference]: Without dead ends: 131 [2023-11-23 07:26:16,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 80 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2023-11-23 07:26:16,766 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 79 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 21 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2023-11-23 07:26:16,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 457 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 363 Invalid, 1 Unknown, 0 Unchecked, 3.4s Time] [2023-11-23 07:26:16,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-11-23 07:26:16,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 126. [2023-11-23 07:26:16,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 88 states have (on average 1.3181818181818181) internal successors, (116), 94 states have internal predecessors, (116), 24 states have call successors, (24), 9 states have call predecessors, (24), 13 states have return successors, (32), 22 states have call predecessors, (32), 22 states have call successors, (32) [2023-11-23 07:26:16,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 172 transitions. [2023-11-23 07:26:16,788 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 172 transitions. Word has length 77 [2023-11-23 07:26:16,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:26:16,789 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 172 transitions. [2023-11-23 07:26:16,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.0) internal successors, (60), 11 states have internal predecessors, (60), 5 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2023-11-23 07:26:16,789 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 172 transitions. [2023-11-23 07:26:16,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-11-23 07:26:16,790 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:26:16,791 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:26:16,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-23 07:26:17,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:26:17,011 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:26:17,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:26:17,011 INFO L85 PathProgramCache]: Analyzing trace with hash 311069669, now seen corresponding path program 1 times [2023-11-23 07:26:17,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:26:17,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191298490] [2023-11-23 07:26:17,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:17,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:26:17,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:17,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:26:17,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:17,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:26:17,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:17,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:26:17,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:17,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:26:17,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:17,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 07:26:17,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:17,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:26:17,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:17,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 07:26:17,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:17,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-23 07:26:17,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:17,263 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-11-23 07:26:17,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:26:17,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191298490] [2023-11-23 07:26:17,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191298490] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:26:17,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698301420] [2023-11-23 07:26:17,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:17,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:26:17,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:26:17,281 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:26:17,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-23 07:26:17,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:17,419 INFO L262 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 53 conjunts are in the unsatisfiable core [2023-11-23 07:26:17,421 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:26:17,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2023-11-23 07:26:18,293 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-23 07:26:18,293 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:26:18,514 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 170 treesize of output 162 [2023-11-23 07:26:18,637 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-23 07:26:18,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1698301420] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-23 07:26:18,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-23 07:26:18,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [7, 13] total 26 [2023-11-23 07:26:18,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980914852] [2023-11-23 07:26:18,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:26:18,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 07:26:18,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:26:18,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 07:26:18,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=574, Unknown=0, NotChecked=0, Total=650 [2023-11-23 07:26:18,639 INFO L87 Difference]: Start difference. First operand 126 states and 172 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-23 07:26:18,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:26:18,987 INFO L93 Difference]: Finished difference Result 247 states and 348 transitions. [2023-11-23 07:26:18,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 07:26:18,987 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 77 [2023-11-23 07:26:18,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:26:18,989 INFO L225 Difference]: With dead ends: 247 [2023-11-23 07:26:18,989 INFO L226 Difference]: Without dead ends: 162 [2023-11-23 07:26:18,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 142 SyntacticMatches, 8 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=99, Invalid=771, Unknown=0, NotChecked=0, Total=870 [2023-11-23 07:26:18,990 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 86 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 07:26:18,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 382 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 07:26:18,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-11-23 07:26:18,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 128. [2023-11-23 07:26:18,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 90 states have (on average 1.3111111111111111) internal successors, (118), 96 states have internal predecessors, (118), 24 states have call successors, (24), 9 states have call predecessors, (24), 13 states have return successors, (32), 22 states have call predecessors, (32), 22 states have call successors, (32) [2023-11-23 07:26:19,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 174 transitions. [2023-11-23 07:26:19,008 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 174 transitions. Word has length 77 [2023-11-23 07:26:19,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:26:19,009 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 174 transitions. [2023-11-23 07:26:19,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-23 07:26:19,009 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 174 transitions. [2023-11-23 07:26:19,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-11-23 07:26:19,010 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:26:19,010 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:26:19,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-23 07:26:19,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-11-23 07:26:19,223 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:26:19,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:26:19,223 INFO L85 PathProgramCache]: Analyzing trace with hash -425287967, now seen corresponding path program 1 times [2023-11-23 07:26:19,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:26:19,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575731591] [2023-11-23 07:26:19,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:19,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:26:19,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:19,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:26:19,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:19,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:26:19,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:19,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:26:19,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:19,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:26:19,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:19,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 07:26:19,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:19,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:26:19,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:19,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 07:26:19,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:19,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-23 07:26:19,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:19,437 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-23 07:26:19,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:26:19,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575731591] [2023-11-23 07:26:19,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575731591] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:26:19,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292062788] [2023-11-23 07:26:19,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:19,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:26:19,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:26:19,452 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:26:19,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-23 07:26:19,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:19,630 INFO L262 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-23 07:26:19,632 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:26:19,725 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-23 07:26:19,726 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:26:19,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292062788] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:26:19,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:26:19,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2023-11-23 07:26:19,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794296737] [2023-11-23 07:26:19,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:26:19,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 07:26:19,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:26:19,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 07:26:19,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-11-23 07:26:19,727 INFO L87 Difference]: Start difference. First operand 128 states and 174 transitions. Second operand has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-23 07:26:19,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:26:19,817 INFO L93 Difference]: Finished difference Result 287 states and 400 transitions. [2023-11-23 07:26:19,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 07:26:19,818 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 77 [2023-11-23 07:26:19,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:26:19,819 INFO L225 Difference]: With dead ends: 287 [2023-11-23 07:26:19,819 INFO L226 Difference]: Without dead ends: 119 [2023-11-23 07:26:19,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-11-23 07:26:19,821 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 35 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 07:26:19,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 281 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 07:26:19,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-11-23 07:26:19,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2023-11-23 07:26:19,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 82 states have (on average 1.2682926829268293) internal successors, (104), 87 states have internal predecessors, (104), 24 states have call successors, (24), 9 states have call predecessors, (24), 12 states have return successors, (29), 22 states have call predecessors, (29), 22 states have call successors, (29) [2023-11-23 07:26:19,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 157 transitions. [2023-11-23 07:26:19,835 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 157 transitions. Word has length 77 [2023-11-23 07:26:19,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:26:19,835 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 157 transitions. [2023-11-23 07:26:19,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-23 07:26:19,836 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 157 transitions. [2023-11-23 07:26:19,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-11-23 07:26:19,837 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:26:19,837 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:26:19,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-23 07:26:20,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-23 07:26:20,048 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:26:20,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:26:20,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1618485028, now seen corresponding path program 1 times [2023-11-23 07:26:20,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:26:20,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471906979] [2023-11-23 07:26:20,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:20,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:26:20,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:20,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:26:20,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:20,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:26:20,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:20,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:26:20,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:20,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:26:20,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:20,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 07:26:20,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:20,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-23 07:26:20,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:20,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 07:26:20,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:20,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 07:26:20,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:20,299 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-23 07:26:20,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:26:20,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471906979] [2023-11-23 07:26:20,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471906979] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:26:20,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533096844] [2023-11-23 07:26:20,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:20,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:26:20,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:26:20,317 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:26:20,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-23 07:26:20,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:20,513 INFO L262 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 51 conjunts are in the unsatisfiable core [2023-11-23 07:26:20,516 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:26:20,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2023-11-23 07:26:20,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2023-11-23 07:26:20,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:26:20,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:26:20,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2023-11-23 07:26:20,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:26:20,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2023-11-23 07:26:20,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:26:20,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-23 07:26:20,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:26:20,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-23 07:26:20,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:26:20,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:26:20,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2023-11-23 07:26:20,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:26:20,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:26:20,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 29 [2023-11-23 07:26:20,697 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 24 treesize of output 13 [2023-11-23 07:26:20,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2023-11-23 07:26:21,232 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 44 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 07:26:21,233 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:26:21,499 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse2 (+ |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset| 16))) (and (forall ((v_ArrVal_756 Int) (v_ArrVal_752 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_752))) (store .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_756))) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) .cse2) 0)) (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int) (v_ArrVal_753 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_753))) (store .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset|))) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) .cse2) 0)))) is different from false [2023-11-23 07:26:21,532 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse2 (+ |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset| 16))) (and (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_26| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_26| 1)) (forall ((v_ArrVal_751 Int) (v_ArrVal_756 Int) (v_ArrVal_752 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_751)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_26| v_ArrVal_752))) (store .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_756))) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) .cse2) 0)))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_26| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_26| 1)) (forall ((v_ArrVal_750 Int) (v_subst_1 Int) (v_ArrVal_753 (Array Int Int))) (= (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_750)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_26| v_ArrVal_753))) (store .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_subst_1))) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) .cse2) 0)))))) is different from false [2023-11-23 07:26:21,552 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:26:21,553 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:26:21,618 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2023-11-23 07:26:21,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 297 treesize of output 284 [2023-11-23 07:26:21,628 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:26:21,629 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:26:21,693 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2023-11-23 07:26:21,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 201 treesize of output 230 [2023-11-23 07:26:21,711 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:26:21,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 250 treesize of output 250 [2023-11-23 07:26:21,727 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:26:21,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 294 treesize of output 292 [2023-11-23 07:26:21,739 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 251 treesize of output 239 [2023-11-23 07:26:21,751 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 263 treesize of output 251 [2023-11-23 07:26:21,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-23 07:26:22,313 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:26:22,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 82 [2023-11-23 07:26:22,368 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:26:22,368 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 76 treesize of output 72 [2023-11-23 07:26:22,433 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 1 not checked. [2023-11-23 07:26:22,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533096844] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 07:26:22,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 07:26:22,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 10] total 24 [2023-11-23 07:26:22,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256813297] [2023-11-23 07:26:22,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 07:26:22,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-23 07:26:22,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:26:22,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-23 07:26:22,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=400, Unknown=2, NotChecked=82, Total=552 [2023-11-23 07:26:22,435 INFO L87 Difference]: Start difference. First operand 119 states and 157 transitions. Second operand has 24 states, 21 states have (on average 5.333333333333333) internal successors, (112), 23 states have internal predecessors, (112), 10 states have call successors, (22), 3 states have call predecessors, (22), 7 states have return successors, (21), 8 states have call predecessors, (21), 10 states have call successors, (21) [2023-11-23 07:26:23,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:26:23,290 INFO L93 Difference]: Finished difference Result 244 states and 325 transitions. [2023-11-23 07:26:23,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-23 07:26:23,291 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 5.333333333333333) internal successors, (112), 23 states have internal predecessors, (112), 10 states have call successors, (22), 3 states have call predecessors, (22), 7 states have return successors, (21), 8 states have call predecessors, (21), 10 states have call successors, (21) Word has length 78 [2023-11-23 07:26:23,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:26:23,292 INFO L225 Difference]: With dead ends: 244 [2023-11-23 07:26:23,292 INFO L226 Difference]: Without dead ends: 136 [2023-11-23 07:26:23,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 152 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=142, Invalid=920, Unknown=2, NotChecked=126, Total=1190 [2023-11-23 07:26:23,293 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 80 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 183 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-23 07:26:23,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 576 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 561 Invalid, 0 Unknown, 183 Unchecked, 0.5s Time] [2023-11-23 07:26:23,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-11-23 07:26:23,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 128. [2023-11-23 07:26:23,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 89 states have (on average 1.247191011235955) internal successors, (111), 95 states have internal predecessors, (111), 24 states have call successors, (24), 10 states have call predecessors, (24), 14 states have return successors, (32), 22 states have call predecessors, (32), 22 states have call successors, (32) [2023-11-23 07:26:23,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 167 transitions. [2023-11-23 07:26:23,311 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 167 transitions. Word has length 78 [2023-11-23 07:26:23,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:26:23,312 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 167 transitions. [2023-11-23 07:26:23,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 5.333333333333333) internal successors, (112), 23 states have internal predecessors, (112), 10 states have call successors, (22), 3 states have call predecessors, (22), 7 states have return successors, (21), 8 states have call predecessors, (21), 10 states have call successors, (21) [2023-11-23 07:26:23,313 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 167 transitions. [2023-11-23 07:26:23,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-11-23 07:26:23,313 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:26:23,314 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:26:23,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-23 07:26:23,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-23 07:26:23,522 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:26:23,522 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:26:23,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1539305395, now seen corresponding path program 1 times [2023-11-23 07:26:23,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:26:23,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99139109] [2023-11-23 07:26:23,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:23,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:26:23,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:23,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:26:23,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:23,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:26:23,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:23,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:26:23,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:23,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:26:23,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:23,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 07:26:23,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:23,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 07:26:23,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:23,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 07:26:23,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:23,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 07:26:23,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:23,931 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-11-23 07:26:23,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:26:23,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99139109] [2023-11-23 07:26:23,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99139109] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:26:23,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88216354] [2023-11-23 07:26:23,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:23,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:26:23,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:26:23,932 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:26:23,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-23 07:26:24,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:24,101 INFO L262 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 47 conjunts are in the unsatisfiable core [2023-11-23 07:26:24,104 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:26:24,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-11-23 07:26:24,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:26:24,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-23 07:26:24,262 INFO L349 Elim1Store]: treesize reduction 50, result has 18.0 percent of original size [2023-11-23 07:26:24,263 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 98 [2023-11-23 07:26:24,269 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 78 treesize of output 55 [2023-11-23 07:26:26,330 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_38| Int) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_48| Int)) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_48|))) (let ((.cse0 (select .cse3 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_38|))) (and (not (= .cse0 0)) (<= (+ .cse0 2) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_48|) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_48| v_DerPreprocessor_4) .cse0))) (and (= .cse1 (select |c_#memory_$Pointer$#2.base| .cse0)) (= v_DerPreprocessor_4 (let ((.cse2 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_38| 24))) (store .cse1 .cse2 (select .cse3 .cse2))))))))))) is different from true [2023-11-23 07:26:26,670 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_38| Int) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_48| Int)) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_48|))) (let ((.cse1 (select .cse3 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_38|))) (let ((.cse0 (select (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_48| v_DerPreprocessor_4) .cse1))) (and (= .cse0 (select |c_#memory_$Pointer$#2.base| .cse1)) (= v_DerPreprocessor_4 (let ((.cse2 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_38| 24))) (store .cse0 .cse2 (select .cse3 .cse2)))) (not (= .cse1 0)) (<= (+ .cse1 2) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_48|)))))) is different from true [2023-11-23 07:26:26,889 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 07:26:26,890 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:26:27,169 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_860 Int) (v_ArrVal_862 (Array Int Int))) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_862))) (store .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24) v_ArrVal_860))) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset|) 0))) is different from false [2023-11-23 07:26:27,187 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:26:27,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 33 [2023-11-23 07:26:27,213 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:26:27,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 187 treesize of output 187 [2023-11-23 07:26:27,226 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 176 treesize of output 168 [2023-11-23 07:26:27,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-23 07:26:27,350 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 24 treesize of output 22 [2023-11-23 07:26:27,373 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:26:27,373 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 62 treesize of output 60 [2023-11-23 07:26:27,549 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 25 trivial. 1 not checked. [2023-11-23 07:26:27,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [88216354] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 07:26:27,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 07:26:27,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 11] total 28 [2023-11-23 07:26:27,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582264417] [2023-11-23 07:26:27,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 07:26:27,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-23 07:26:27,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:26:27,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-23 07:26:27,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=533, Unknown=5, NotChecked=144, Total=756 [2023-11-23 07:26:27,551 INFO L87 Difference]: Start difference. First operand 128 states and 167 transitions. Second operand has 28 states, 26 states have (on average 4.1923076923076925) internal successors, (109), 27 states have internal predecessors, (109), 9 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (20), 7 states have call predecessors, (20), 9 states have call successors, (20) [2023-11-23 07:26:30,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:26:30,266 INFO L93 Difference]: Finished difference Result 389 states and 569 transitions. [2023-11-23 07:26:30,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-11-23 07:26:30,267 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 4.1923076923076925) internal successors, (109), 27 states have internal predecessors, (109), 9 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (20), 7 states have call predecessors, (20), 9 states have call successors, (20) Word has length 80 [2023-11-23 07:26:30,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:26:30,270 INFO L225 Difference]: With dead ends: 389 [2023-11-23 07:26:30,270 INFO L226 Difference]: Without dead ends: 258 [2023-11-23 07:26:30,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=369, Invalid=2187, Unknown=6, NotChecked=300, Total=2862 [2023-11-23 07:26:30,272 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 268 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 1260 mSolverCounterSat, 48 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 2295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1260 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 970 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-23 07:26:30,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 1025 Invalid, 2295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1260 Invalid, 17 Unknown, 970 Unchecked, 1.4s Time] [2023-11-23 07:26:30,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2023-11-23 07:26:30,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 202. [2023-11-23 07:26:30,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 145 states have (on average 1.2620689655172415) internal successors, (183), 153 states have internal predecessors, (183), 39 states have call successors, (39), 12 states have call predecessors, (39), 17 states have return successors, (61), 36 states have call predecessors, (61), 37 states have call successors, (61) [2023-11-23 07:26:30,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 283 transitions. [2023-11-23 07:26:30,309 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 283 transitions. Word has length 80 [2023-11-23 07:26:30,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:26:30,309 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 283 transitions. [2023-11-23 07:26:30,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 4.1923076923076925) internal successors, (109), 27 states have internal predecessors, (109), 9 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (20), 7 states have call predecessors, (20), 9 states have call successors, (20) [2023-11-23 07:26:30,310 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 283 transitions. [2023-11-23 07:26:30,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-11-23 07:26:30,311 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:26:30,311 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:26:30,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-23 07:26:30,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-23 07:26:30,514 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:26:30,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:26:30,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1857669000, now seen corresponding path program 1 times [2023-11-23 07:26:30,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:26:30,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541127019] [2023-11-23 07:26:30,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:30,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:26:30,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:30,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:26:30,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:30,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:26:30,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:30,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 07:26:30,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:30,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:26:30,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:30,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 07:26:30,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:30,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 07:26:30,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:30,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-23 07:26:30,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:30,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-23 07:26:30,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:30,705 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-11-23 07:26:30,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:26:30,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541127019] [2023-11-23 07:26:30,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541127019] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:26:30,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734762478] [2023-11-23 07:26:30,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:30,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:26:30,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:26:30,716 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:26:30,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-23 07:26:30,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:30,907 INFO L262 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-23 07:26:30,909 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:26:30,914 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-11-23 07:26:30,914 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:26:30,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734762478] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:26:30,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:26:30,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2023-11-23 07:26:30,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231076620] [2023-11-23 07:26:30,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:26:30,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 07:26:30,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:26:30,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 07:26:30,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 07:26:30,916 INFO L87 Difference]: Start difference. First operand 202 states and 283 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-23 07:26:30,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:26:30,976 INFO L93 Difference]: Finished difference Result 319 states and 478 transitions. [2023-11-23 07:26:30,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 07:26:30,977 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 81 [2023-11-23 07:26:30,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:26:30,978 INFO L225 Difference]: With dead ends: 319 [2023-11-23 07:26:30,978 INFO L226 Difference]: Without dead ends: 209 [2023-11-23 07:26:30,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-23 07:26:30,980 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 8 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 07:26:30,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 205 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 07:26:30,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2023-11-23 07:26:31,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 202. [2023-11-23 07:26:31,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 145 states have (on average 1.2482758620689656) internal successors, (181), 153 states have internal predecessors, (181), 39 states have call successors, (39), 12 states have call predecessors, (39), 17 states have return successors, (61), 36 states have call predecessors, (61), 37 states have call successors, (61) [2023-11-23 07:26:31,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 281 transitions. [2023-11-23 07:26:31,002 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 281 transitions. Word has length 81 [2023-11-23 07:26:31,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:26:31,002 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 281 transitions. [2023-11-23 07:26:31,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-23 07:26:31,003 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 281 transitions. [2023-11-23 07:26:31,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-11-23 07:26:31,005 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:26:31,005 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:26:31,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-23 07:26:31,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-23 07:26:31,218 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:26:31,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:26:31,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1655845066, now seen corresponding path program 1 times [2023-11-23 07:26:31,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:26:31,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672957469] [2023-11-23 07:26:31,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:31,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:26:31,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:31,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:26:31,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:31,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:26:31,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:31,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 07:26:31,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:31,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:26:31,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:31,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 07:26:31,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:31,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 07:26:31,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:31,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-23 07:26:31,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:31,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-23 07:26:31,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:31,374 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-11-23 07:26:31,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:26:31,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672957469] [2023-11-23 07:26:31,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672957469] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:26:31,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231117412] [2023-11-23 07:26:31,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:31,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:26:31,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:26:31,383 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:26:31,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-23 07:26:31,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:31,578 INFO L262 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-23 07:26:31,580 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:26:31,601 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-23 07:26:31,601 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:26:31,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231117412] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:26:31,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:26:31,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2023-11-23 07:26:31,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616781815] [2023-11-23 07:26:31,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:26:31,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 07:26:31,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:26:31,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 07:26:31,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 07:26:31,602 INFO L87 Difference]: Start difference. First operand 202 states and 281 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-23 07:26:31,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:26:31,667 INFO L93 Difference]: Finished difference Result 298 states and 441 transitions. [2023-11-23 07:26:31,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 07:26:31,667 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 81 [2023-11-23 07:26:31,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:26:31,668 INFO L225 Difference]: With dead ends: 298 [2023-11-23 07:26:31,668 INFO L226 Difference]: Without dead ends: 175 [2023-11-23 07:26:31,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-23 07:26:31,670 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 2 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 07:26:31,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 195 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 07:26:31,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2023-11-23 07:26:31,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 159. [2023-11-23 07:26:31,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 115 states have (on average 1.208695652173913) internal successors, (139), 121 states have internal predecessors, (139), 28 states have call successors, (28), 12 states have call predecessors, (28), 15 states have return successors, (37), 25 states have call predecessors, (37), 26 states have call successors, (37) [2023-11-23 07:26:31,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 204 transitions. [2023-11-23 07:26:31,692 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 204 transitions. Word has length 81 [2023-11-23 07:26:31,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:26:31,692 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 204 transitions. [2023-11-23 07:26:31,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-23 07:26:31,692 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 204 transitions. [2023-11-23 07:26:31,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-11-23 07:26:31,694 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:26:31,695 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:26:31,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-11-23 07:26:31,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-23 07:26:31,906 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:26:31,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:26:31,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1936643785, now seen corresponding path program 1 times [2023-11-23 07:26:31,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:26:31,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78266406] [2023-11-23 07:26:31,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:31,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:26:31,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:31,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:26:31,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:32,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:26:32,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:32,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:26:32,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:32,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:26:32,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:32,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 07:26:32,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:32,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 07:26:32,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:32,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-23 07:26:32,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:32,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-23 07:26:32,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:32,111 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-11-23 07:26:32,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:26:32,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78266406] [2023-11-23 07:26:32,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78266406] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:26:32,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233560741] [2023-11-23 07:26:32,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:32,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:26:32,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:26:32,128 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:26:32,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-23 07:26:32,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:32,358 INFO L262 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 45 conjunts are in the unsatisfiable core [2023-11-23 07:26:32,361 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:26:32,475 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:26:32,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:26:32,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-23 07:26:32,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:26:32,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:26:32,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 27 [2023-11-23 07:26:32,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 11 [2023-11-23 07:26:32,916 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 30 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 07:26:32,916 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:26:35,235 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:26:35,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 34 [2023-11-23 07:26:35,253 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:26:35,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 325 treesize of output 331 [2023-11-23 07:26:35,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 166 [2023-11-23 07:26:35,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-23 07:26:35,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-23 07:26:35,412 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:26:35,416 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 262 treesize of output 256 [2023-11-23 07:26:36,069 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-23 07:26:36,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233560741] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 07:26:36,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 07:26:36,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 12, 11] total 25 [2023-11-23 07:26:36,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268153216] [2023-11-23 07:26:36,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 07:26:36,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-23 07:26:36,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:26:36,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-23 07:26:36,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=517, Unknown=7, NotChecked=0, Total=600 [2023-11-23 07:26:36,072 INFO L87 Difference]: Start difference. First operand 159 states and 204 transitions. Second operand has 25 states, 22 states have (on average 5.045454545454546) internal successors, (111), 24 states have internal predecessors, (111), 9 states have call successors, (24), 3 states have call predecessors, (24), 7 states have return successors, (23), 7 states have call predecessors, (23), 9 states have call successors, (23) [2023-11-23 07:26:38,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:26:38,106 INFO L93 Difference]: Finished difference Result 245 states and 324 transitions. [2023-11-23 07:26:38,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-23 07:26:38,107 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 5.045454545454546) internal successors, (111), 24 states have internal predecessors, (111), 9 states have call successors, (24), 3 states have call predecessors, (24), 7 states have return successors, (23), 7 states have call predecessors, (23), 9 states have call successors, (23) Word has length 81 [2023-11-23 07:26:38,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:26:38,108 INFO L225 Difference]: With dead ends: 245 [2023-11-23 07:26:38,108 INFO L226 Difference]: Without dead ends: 181 [2023-11-23 07:26:38,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=208, Invalid=1344, Unknown=8, NotChecked=0, Total=1560 [2023-11-23 07:26:38,110 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 136 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 1228 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 1233 SdHoareTripleChecker+Invalid, 1268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-23 07:26:38,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 1233 Invalid, 1268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1228 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-11-23 07:26:38,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-11-23 07:26:38,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 163. [2023-11-23 07:26:38,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 118 states have (on average 1.2118644067796611) internal successors, (143), 125 states have internal predecessors, (143), 28 states have call successors, (28), 12 states have call predecessors, (28), 16 states have return successors, (39), 25 states have call predecessors, (39), 26 states have call successors, (39) [2023-11-23 07:26:38,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 210 transitions. [2023-11-23 07:26:38,134 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 210 transitions. Word has length 81 [2023-11-23 07:26:38,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:26:38,134 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 210 transitions. [2023-11-23 07:26:38,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 5.045454545454546) internal successors, (111), 24 states have internal predecessors, (111), 9 states have call successors, (24), 3 states have call predecessors, (24), 7 states have return successors, (23), 7 states have call predecessors, (23), 9 states have call successors, (23) [2023-11-23 07:26:38,134 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 210 transitions. [2023-11-23 07:26:38,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-11-23 07:26:38,135 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:26:38,136 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:26:38,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-11-23 07:26:38,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:26:38,352 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:26:38,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:26:38,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1301963288, now seen corresponding path program 1 times [2023-11-23 07:26:38,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:26:38,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843856982] [2023-11-23 07:26:38,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:38,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:26:38,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:38,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:26:38,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:38,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:26:38,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:38,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:26:38,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:38,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:26:38,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:38,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 07:26:38,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:38,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 07:26:38,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:38,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-23 07:26:38,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:38,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 07:26:38,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:38,596 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-11-23 07:26:38,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:26:38,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843856982] [2023-11-23 07:26:38,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843856982] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:26:38,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821399546] [2023-11-23 07:26:38,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:38,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:26:38,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:26:38,599 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:26:38,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-23 07:26:38,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:38,779 INFO L262 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-23 07:26:38,781 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:26:38,850 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-23 07:26:38,850 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:26:38,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821399546] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:26:38,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:26:38,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2023-11-23 07:26:38,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52693442] [2023-11-23 07:26:38,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:26:38,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 07:26:38,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:26:38,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 07:26:38,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2023-11-23 07:26:38,852 INFO L87 Difference]: Start difference. First operand 163 states and 210 transitions. Second operand has 7 states, 6 states have (on average 10.5) internal successors, (63), 7 states have internal predecessors, (63), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-23 07:26:38,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:26:38,993 INFO L93 Difference]: Finished difference Result 283 states and 361 transitions. [2023-11-23 07:26:38,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 07:26:38,993 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.5) internal successors, (63), 7 states have internal predecessors, (63), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 84 [2023-11-23 07:26:38,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:26:38,994 INFO L225 Difference]: With dead ends: 283 [2023-11-23 07:26:38,994 INFO L226 Difference]: Without dead ends: 160 [2023-11-23 07:26:38,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2023-11-23 07:26:38,995 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 33 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 07:26:38,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 275 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 07:26:38,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2023-11-23 07:26:39,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2023-11-23 07:26:39,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 116 states have (on average 1.1982758620689655) internal successors, (139), 122 states have internal predecessors, (139), 28 states have call successors, (28), 12 states have call predecessors, (28), 15 states have return successors, (37), 25 states have call predecessors, (37), 26 states have call successors, (37) [2023-11-23 07:26:39,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 204 transitions. [2023-11-23 07:26:39,010 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 204 transitions. Word has length 84 [2023-11-23 07:26:39,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:26:39,010 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 204 transitions. [2023-11-23 07:26:39,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.5) internal successors, (63), 7 states have internal predecessors, (63), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-23 07:26:39,011 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 204 transitions. [2023-11-23 07:26:39,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-23 07:26:39,011 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:26:39,011 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:26:39,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-11-23 07:26:39,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-23 07:26:39,223 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:26:39,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:26:39,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1193222234, now seen corresponding path program 1 times [2023-11-23 07:26:39,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:26:39,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259319756] [2023-11-23 07:26:39,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:39,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:26:39,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:39,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:26:39,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:39,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:26:39,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:39,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:26:39,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:39,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:26:39,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:39,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 07:26:39,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:39,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 07:26:39,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:39,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:26:39,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:39,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-23 07:26:39,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:39,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 07:26:39,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:39,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:26:39,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:39,441 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-11-23 07:26:39,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:26:39,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259319756] [2023-11-23 07:26:39,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259319756] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:26:39,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697834731] [2023-11-23 07:26:39,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:39,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:26:39,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:26:39,443 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:26:39,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-23 07:26:39,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:39,667 INFO L262 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 121 conjunts are in the unsatisfiable core [2023-11-23 07:26:39,670 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:26:39,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-11-23 07:26:39,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-23 07:26:39,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2023-11-23 07:26:39,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-11-23 07:26:41,665 INFO L349 Elim1Store]: treesize reduction 56, result has 1.8 percent of original size [2023-11-23 07:26:41,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 13 case distinctions, treesize of input 61 treesize of output 1 [2023-11-23 07:26:41,667 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 76 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 07:26:41,667 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:26:48,029 INFO L349 Elim1Store]: treesize reduction 63, result has 62.0 percent of original size [2023-11-23 07:26:48,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 5972 treesize of output 5691 [2023-11-23 07:26:48,318 INFO L349 Elim1Store]: treesize reduction 72, result has 65.9 percent of original size [2023-11-23 07:26:48,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 39924 treesize of output 37134 [2023-11-23 07:26:48,579 INFO L349 Elim1Store]: treesize reduction 51, result has 68.3 percent of original size [2023-11-23 07:26:48,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 2708 treesize of output 2557 [2023-11-23 07:26:48,831 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:26:48,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 2420 treesize of output 2348 [2023-11-23 07:26:57,658 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 120 treesize of output 116 [2023-11-23 07:26:57,791 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-23 07:26:57,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 [2023-11-23 07:26:57,800 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-23 07:26:57,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 [2023-11-23 07:26:57,824 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:26:57,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 101 [2023-11-23 07:26:57,873 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 87 treesize of output 81 [2023-11-23 07:26:58,059 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 8 proven. 62 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-23 07:26:58,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697834731] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 07:26:58,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 07:26:58,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 27, 25] total 55 [2023-11-23 07:26:58,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892043266] [2023-11-23 07:26:58,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 07:26:58,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2023-11-23 07:26:58,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:26:58,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2023-11-23 07:26:58,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=2744, Unknown=2, NotChecked=0, Total=2970 [2023-11-23 07:26:58,062 INFO L87 Difference]: Start difference. First operand 160 states and 204 transitions. Second operand has 55 states, 46 states have (on average 3.5869565217391304) internal successors, (165), 47 states have internal predecessors, (165), 15 states have call successors, (27), 4 states have call predecessors, (27), 13 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) [2023-11-23 07:27:05,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:27:05,248 INFO L93 Difference]: Finished difference Result 324 states and 432 transitions. [2023-11-23 07:27:05,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2023-11-23 07:27:05,250 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 46 states have (on average 3.5869565217391304) internal successors, (165), 47 states have internal predecessors, (165), 15 states have call successors, (27), 4 states have call predecessors, (27), 13 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) Word has length 104 [2023-11-23 07:27:05,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:27:05,251 INFO L225 Difference]: With dead ends: 324 [2023-11-23 07:27:05,251 INFO L226 Difference]: Without dead ends: 210 [2023-11-23 07:27:05,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 187 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2663 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=1141, Invalid=9363, Unknown=2, NotChecked=0, Total=10506 [2023-11-23 07:27:05,254 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 566 mSDsluCounter, 1447 mSDsCounter, 0 mSdLazyCounter, 2196 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 1503 SdHoareTripleChecker+Invalid, 2409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 2196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-11-23 07:27:05,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 1503 Invalid, 2409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 2196 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-11-23 07:27:05,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2023-11-23 07:27:05,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 161. [2023-11-23 07:27:05,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 117 states have (on average 1.1965811965811965) internal successors, (140), 122 states have internal predecessors, (140), 28 states have call successors, (28), 12 states have call predecessors, (28), 15 states have return successors, (35), 26 states have call predecessors, (35), 26 states have call successors, (35) [2023-11-23 07:27:05,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 203 transitions. [2023-11-23 07:27:05,286 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 203 transitions. Word has length 104 [2023-11-23 07:27:05,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:27:05,287 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 203 transitions. [2023-11-23 07:27:05,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 46 states have (on average 3.5869565217391304) internal successors, (165), 47 states have internal predecessors, (165), 15 states have call successors, (27), 4 states have call predecessors, (27), 13 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) [2023-11-23 07:27:05,287 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 203 transitions. [2023-11-23 07:27:05,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-23 07:27:05,288 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:27:05,288 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:27:05,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-11-23 07:27:05,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-23 07:27:05,500 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:27:05,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:27:05,501 INFO L85 PathProgramCache]: Analyzing trace with hash 403807591, now seen corresponding path program 1 times [2023-11-23 07:27:05,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:27:05,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548827743] [2023-11-23 07:27:05,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:27:05,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:27:05,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:05,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:27:05,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:05,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:27:05,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:05,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:27:05,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:05,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:27:05,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:05,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 07:27:05,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:05,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 07:27:05,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:05,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:27:05,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:05,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 07:27:05,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:05,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-23 07:27:05,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:05,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:27:05,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:06,039 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-11-23 07:27:06,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:27:06,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548827743] [2023-11-23 07:27:06,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548827743] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:27:06,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:27:06,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-23 07:27:06,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384387422] [2023-11-23 07:27:06,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:27:06,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-23 07:27:06,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:27:06,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-23 07:27:06,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-23 07:27:06,042 INFO L87 Difference]: Start difference. First operand 161 states and 203 transitions. Second operand has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 3 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-23 07:27:06,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:27:06,338 INFO L93 Difference]: Finished difference Result 299 states and 395 transitions. [2023-11-23 07:27:06,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-23 07:27:06,338 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 3 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 107 [2023-11-23 07:27:06,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:27:06,340 INFO L225 Difference]: With dead ends: 299 [2023-11-23 07:27:06,340 INFO L226 Difference]: Without dead ends: 178 [2023-11-23 07:27:06,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2023-11-23 07:27:06,341 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 93 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 07:27:06,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 346 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 07:27:06,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2023-11-23 07:27:06,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 169. [2023-11-23 07:27:06,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 123 states have (on average 1.2032520325203253) internal successors, (148), 130 states have internal predecessors, (148), 28 states have call successors, (28), 12 states have call predecessors, (28), 17 states have return successors, (37), 26 states have call predecessors, (37), 26 states have call successors, (37) [2023-11-23 07:27:06,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 213 transitions. [2023-11-23 07:27:06,374 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 213 transitions. Word has length 107 [2023-11-23 07:27:06,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:27:06,374 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 213 transitions. [2023-11-23 07:27:06,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 3 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-23 07:27:06,374 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 213 transitions. [2023-11-23 07:27:06,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-23 07:27:06,375 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:27:06,376 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:27:06,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-23 07:27:06,376 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:27:06,376 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:27:06,376 INFO L85 PathProgramCache]: Analyzing trace with hash -182998423, now seen corresponding path program 1 times [2023-11-23 07:27:06,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:27:06,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455569668] [2023-11-23 07:27:06,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:27:06,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:27:06,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:06,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:27:06,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:06,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:27:06,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:06,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:27:06,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:06,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:27:06,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:06,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 07:27:06,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:06,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 07:27:06,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:06,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:27:06,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:06,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 07:27:06,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:06,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-23 07:27:06,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:06,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:27:06,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:06,721 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2023-11-23 07:27:06,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:27:06,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455569668] [2023-11-23 07:27:06,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455569668] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:27:06,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:27:06,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-23 07:27:06,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715166876] [2023-11-23 07:27:06,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:27:06,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 07:27:06,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:27:06,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 07:27:06,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-23 07:27:06,725 INFO L87 Difference]: Start difference. First operand 169 states and 213 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 5 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2023-11-23 07:27:06,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:27:06,880 INFO L93 Difference]: Finished difference Result 305 states and 400 transitions. [2023-11-23 07:27:06,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 07:27:06,880 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 5 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 107 [2023-11-23 07:27:06,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:27:06,881 INFO L225 Difference]: With dead ends: 305 [2023-11-23 07:27:06,881 INFO L226 Difference]: Without dead ends: 166 [2023-11-23 07:27:06,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2023-11-23 07:27:06,882 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 39 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 07:27:06,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 392 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 07:27:06,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2023-11-23 07:27:06,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 162. [2023-11-23 07:27:06,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 117 states have (on average 1.1623931623931625) internal successors, (136), 124 states have internal predecessors, (136), 28 states have call successors, (28), 12 states have call predecessors, (28), 16 states have return successors, (34), 25 states have call predecessors, (34), 26 states have call successors, (34) [2023-11-23 07:27:06,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 198 transitions. [2023-11-23 07:27:06,904 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 198 transitions. Word has length 107 [2023-11-23 07:27:06,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:27:06,905 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 198 transitions. [2023-11-23 07:27:06,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 5 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2023-11-23 07:27:06,905 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 198 transitions. [2023-11-23 07:27:06,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-23 07:27:06,906 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:27:06,906 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:06,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-23 07:27:06,906 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:27:06,906 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:27:06,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1775262772, now seen corresponding path program 1 times [2023-11-23 07:27:06,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:27:06,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406143557] [2023-11-23 07:27:06,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:27:06,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:27:06,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:07,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:27:07,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:07,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:27:07,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:07,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:27:07,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:07,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:27:07,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:07,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 07:27:07,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:07,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-23 07:27:07,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:07,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 07:27:07,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:07,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:27:07,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:07,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-23 07:27:07,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:07,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-23 07:27:07,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:07,351 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2023-11-23 07:27:07,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:27:07,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406143557] [2023-11-23 07:27:07,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406143557] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:27:07,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301188408] [2023-11-23 07:27:07,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:27:07,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:27:07,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:27:07,356 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:27:07,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-11-23 07:27:07,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:07,666 INFO L262 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 69 conjunts are in the unsatisfiable core [2023-11-23 07:27:07,669 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:27:07,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-23 07:27:07,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-23 07:27:09,883 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_10| Int) (|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_10| Int)) (not (= (+ 16 |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_10|) (select (select |c_#memory_$Pointer$#2.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_10|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_10|)))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_10| Int) (|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_10| Int)) (not (= |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_10| (select (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_10|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_10|))))) is different from true [2023-11-23 07:27:11,990 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_72| Int)) (not (= 16 (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_72|) 0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_72| Int)) (not (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_72| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_72|) 0))))) is different from true [2023-11-23 07:27:14,072 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_18| Int)) (not (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_18| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_18|) 0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_18| Int)) (not (= 16 (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_18|) 0))))) is different from true [2023-11-23 07:27:26,508 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 62 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2023-11-23 07:27:26,508 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:27:29,354 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 4 proven. 51 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-11-23 07:27:29,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301188408] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 07:27:29,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 07:27:29,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 19, 14] total 36 [2023-11-23 07:27:29,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901387161] [2023-11-23 07:27:29,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 07:27:29,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-11-23 07:27:29,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:27:29,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-11-23 07:27:29,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=936, Unknown=10, NotChecked=192, Total=1260 [2023-11-23 07:27:29,357 INFO L87 Difference]: Start difference. First operand 162 states and 198 transitions. Second operand has 36 states, 33 states have (on average 4.636363636363637) internal successors, (153), 33 states have internal predecessors, (153), 13 states have call successors, (24), 5 states have call predecessors, (24), 9 states have return successors, (25), 11 states have call predecessors, (25), 13 states have call successors, (25) [2023-11-23 07:27:31,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:27:33,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:27:35,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:27:37,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:27:39,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:27:41,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:27:43,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:27:45,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:27:47,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:27:49,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:27:51,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:27:53,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:27:59,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:28:01,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:28:03,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:28:05,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:28:13,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:28:15,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:28:17,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:28:19,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:28:21,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:28:23,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:28:25,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:28:27,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:28:29,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:28:31,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:28:33,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:28:41,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:28:43,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:28:45,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:28:54,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:28:56,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:28:58,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:29:00,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:29:02,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:29:04,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:29:06,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:29:08,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:29:10,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:29:12,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:29:22,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:29:24,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:29:26,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:29:34,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:29:36,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:29:38,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:29:40,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:29:42,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:29:44,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:29:46,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:30:00,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:30:02,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] Killed by 15