./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread/queue_longer.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b09c85b7 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3bbf59-43f2-4747-a86e-61c04e1b5533/bin/ugemcutter-QpsTfqS70U/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3bbf59-43f2-4747-a86e-61c04e1b5533/bin/ugemcutter-QpsTfqS70U/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3bbf59-43f2-4747-a86e-61c04e1b5533/bin/ugemcutter-QpsTfqS70U/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3bbf59-43f2-4747-a86e-61c04e1b5533/bin/ugemcutter-QpsTfqS70U/config/GemCutterReach.xml -i ../../sv-benchmarks/c/pthread/queue_longer.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3bbf59-43f2-4747-a86e-61c04e1b5533/bin/ugemcutter-QpsTfqS70U/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3bbf59-43f2-4747-a86e-61c04e1b5533/bin/ugemcutter-QpsTfqS70U --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9f874a9872f93f025fac23ebed37f94a1f3b80bd0133ea4d7e298577c4fec427 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b09c85b [2022-11-08 07:42:18,666 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-08 07:42:18,673 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-08 07:42:18,715 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-08 07:42:18,715 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-08 07:42:18,717 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-08 07:42:18,718 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-08 07:42:18,720 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-08 07:42:18,721 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-08 07:42:18,722 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-08 07:42:18,723 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-08 07:42:18,724 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-08 07:42:18,725 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-08 07:42:18,726 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-08 07:42:18,727 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-08 07:42:18,728 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-08 07:42:18,729 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-08 07:42:18,730 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-08 07:42:18,732 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-08 07:42:18,734 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-08 07:42:18,736 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-08 07:42:18,740 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-08 07:42:18,741 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-08 07:42:18,742 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-08 07:42:18,745 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-08 07:42:18,746 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-08 07:42:18,746 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-08 07:42:18,747 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-08 07:42:18,747 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-08 07:42:18,748 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-08 07:42:18,749 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-08 07:42:18,750 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-08 07:42:18,750 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-08 07:42:18,751 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-08 07:42:18,752 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-08 07:42:18,753 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-08 07:42:18,754 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-08 07:42:18,754 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-08 07:42:18,764 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-08 07:42:18,765 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-08 07:42:18,766 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-08 07:42:18,766 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3bbf59-43f2-4747-a86e-61c04e1b5533/bin/ugemcutter-QpsTfqS70U/config/svcomp-Reach-32bit-GemCutter_Default.epf [2022-11-08 07:42:18,803 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-08 07:42:18,803 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-08 07:42:18,804 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-08 07:42:18,804 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-08 07:42:18,805 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-08 07:42:18,805 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-08 07:42:18,806 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-08 07:42:18,806 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-08 07:42:18,806 INFO L138 SettingsManager]: * Use SBE=true [2022-11-08 07:42:18,807 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-08 07:42:18,808 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-08 07:42:18,808 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-08 07:42:18,808 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-08 07:42:18,808 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-08 07:42:18,808 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-08 07:42:18,809 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-08 07:42:18,809 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-08 07:42:18,809 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-08 07:42:18,809 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-08 07:42:18,809 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-08 07:42:18,809 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-08 07:42:18,810 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-08 07:42:18,810 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-08 07:42:18,810 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-11-08 07:42:18,810 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-08 07:42:18,810 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-08 07:42:18,811 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-08 07:42:18,811 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-08 07:42:18,811 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-08 07:42:18,811 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-08 07:42:18,811 INFO L138 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2022-11-08 07:42:18,811 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-08 07:42:18,812 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-08 07:42:18,812 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-08 07:42:18,812 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-08 07:42:18,812 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-08 07:42:18,812 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-08 07:42:18,813 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3bbf59-43f2-4747-a86e-61c04e1b5533/bin/ugemcutter-QpsTfqS70U/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3bbf59-43f2-4747-a86e-61c04e1b5533/bin/ugemcutter-QpsTfqS70U Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9f874a9872f93f025fac23ebed37f94a1f3b80bd0133ea4d7e298577c4fec427 [2022-11-08 07:42:19,144 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-08 07:42:19,182 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-08 07:42:19,185 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-08 07:42:19,186 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-08 07:42:19,187 INFO L275 PluginConnector]: CDTParser initialized [2022-11-08 07:42:19,189 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3bbf59-43f2-4747-a86e-61c04e1b5533/bin/ugemcutter-QpsTfqS70U/../../sv-benchmarks/c/pthread/queue_longer.i [2022-11-08 07:42:19,266 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3bbf59-43f2-4747-a86e-61c04e1b5533/bin/ugemcutter-QpsTfqS70U/data/809eb5e56/e614c650ef47476eaef4844fd33bbafb/FLAG35826d3f7 [2022-11-08 07:42:19,988 INFO L306 CDTParser]: Found 1 translation units. [2022-11-08 07:42:19,989 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3bbf59-43f2-4747-a86e-61c04e1b5533/sv-benchmarks/c/pthread/queue_longer.i [2022-11-08 07:42:20,006 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3bbf59-43f2-4747-a86e-61c04e1b5533/bin/ugemcutter-QpsTfqS70U/data/809eb5e56/e614c650ef47476eaef4844fd33bbafb/FLAG35826d3f7 [2022-11-08 07:42:20,200 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3bbf59-43f2-4747-a86e-61c04e1b5533/bin/ugemcutter-QpsTfqS70U/data/809eb5e56/e614c650ef47476eaef4844fd33bbafb [2022-11-08 07:42:20,203 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-08 07:42:20,204 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-08 07:42:20,212 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-08 07:42:20,213 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-08 07:42:20,216 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-08 07:42:20,218 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:42:20" (1/1) ... [2022-11-08 07:42:20,220 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f0e9909 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:42:20, skipping insertion in model container [2022-11-08 07:42:20,221 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:42:20" (1/1) ... [2022-11-08 07:42:20,229 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-08 07:42:20,300 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-08 07:42:20,774 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3bbf59-43f2-4747-a86e-61c04e1b5533/sv-benchmarks/c/pthread/queue_longer.i[43296,43309] [2022-11-08 07:42:20,780 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3bbf59-43f2-4747-a86e-61c04e1b5533/sv-benchmarks/c/pthread/queue_longer.i[43503,43516] [2022-11-08 07:42:20,783 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3bbf59-43f2-4747-a86e-61c04e1b5533/sv-benchmarks/c/pthread/queue_longer.i[43783,43796] [2022-11-08 07:42:20,790 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-08 07:42:20,800 INFO L203 MainTranslator]: Completed pre-run [2022-11-08 07:42:20,847 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3bbf59-43f2-4747-a86e-61c04e1b5533/sv-benchmarks/c/pthread/queue_longer.i[43296,43309] [2022-11-08 07:42:20,849 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3bbf59-43f2-4747-a86e-61c04e1b5533/sv-benchmarks/c/pthread/queue_longer.i[43503,43516] [2022-11-08 07:42:20,853 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3bbf59-43f2-4747-a86e-61c04e1b5533/sv-benchmarks/c/pthread/queue_longer.i[43783,43796] [2022-11-08 07:42:20,860 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-08 07:42:20,918 INFO L208 MainTranslator]: Completed translation [2022-11-08 07:42:20,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:42:20 WrapperNode [2022-11-08 07:42:20,919 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-08 07:42:20,920 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-08 07:42:20,920 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-08 07:42:20,921 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-08 07:42:20,928 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:42:20" (1/1) ... [2022-11-08 07:42:20,951 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:42:20" (1/1) ... [2022-11-08 07:42:20,995 INFO L138 Inliner]: procedures = 274, calls = 62, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 243 [2022-11-08 07:42:20,996 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-08 07:42:20,997 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-08 07:42:20,997 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-08 07:42:20,997 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-08 07:42:21,008 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:42:20" (1/1) ... [2022-11-08 07:42:21,009 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:42:20" (1/1) ... [2022-11-08 07:42:21,013 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:42:20" (1/1) ... [2022-11-08 07:42:21,014 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:42:20" (1/1) ... [2022-11-08 07:42:21,026 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:42:20" (1/1) ... [2022-11-08 07:42:21,031 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:42:20" (1/1) ... [2022-11-08 07:42:21,034 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:42:20" (1/1) ... [2022-11-08 07:42:21,036 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:42:20" (1/1) ... [2022-11-08 07:42:21,040 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-08 07:42:21,041 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-08 07:42:21,042 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-08 07:42:21,042 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-08 07:42:21,043 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:42:20" (1/1) ... [2022-11-08 07:42:21,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-08 07:42:21,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3bbf59-43f2-4747-a86e-61c04e1b5533/bin/ugemcutter-QpsTfqS70U/z3 [2022-11-08 07:42:21,108 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3bbf59-43f2-4747-a86e-61c04e1b5533/bin/ugemcutter-QpsTfqS70U/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-08 07:42:21,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3bbf59-43f2-4747-a86e-61c04e1b5533/bin/ugemcutter-QpsTfqS70U/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-08 07:42:21,176 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-08 07:42:21,176 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-08 07:42:21,177 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-08 07:42:21,177 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-08 07:42:21,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-08 07:42:21,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-08 07:42:21,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-08 07:42:21,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-08 07:42:21,178 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-08 07:42:21,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-08 07:42:21,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-08 07:42:21,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-08 07:42:21,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-08 07:42:21,180 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-08 07:42:21,401 INFO L235 CfgBuilder]: Building ICFG [2022-11-08 07:42:21,404 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-08 07:42:21,955 INFO L276 CfgBuilder]: Performing block encoding [2022-11-08 07:42:21,969 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-08 07:42:21,969 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-08 07:42:21,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:42:21 BoogieIcfgContainer [2022-11-08 07:42:21,972 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-08 07:42:21,974 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-08 07:42:21,988 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-08 07:42:21,992 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-08 07:42:21,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:42:20" (1/3) ... [2022-11-08 07:42:21,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3153cf5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:42:21, skipping insertion in model container [2022-11-08 07:42:21,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:42:20" (2/3) ... [2022-11-08 07:42:21,994 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3153cf5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:42:21, skipping insertion in model container [2022-11-08 07:42:21,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:42:21" (3/3) ... [2022-11-08 07:42:21,995 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_longer.i [2022-11-08 07:42:22,004 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-08 07:42:22,016 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-08 07:42:22,016 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-11-08 07:42:22,016 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-08 07:42:22,128 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-08 07:42:22,197 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-08 07:42:22,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-08 07:42:22,198 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3bbf59-43f2-4747-a86e-61c04e1b5533/bin/ugemcutter-QpsTfqS70U/z3 [2022-11-08 07:42:22,201 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3bbf59-43f2-4747-a86e-61c04e1b5533/bin/ugemcutter-QpsTfqS70U/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-08 07:42:22,222 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3bbf59-43f2-4747-a86e-61c04e1b5533/bin/ugemcutter-QpsTfqS70U/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-11-08 07:42:22,248 INFO L156 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-08 07:42:22,265 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork0 ======== [2022-11-08 07:42:22,276 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=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@688aca9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-08 07:42:22,276 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-08 07:42:22,632 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-08 07:42:22,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-08 07:42:22,644 INFO L85 PathProgramCache]: Analyzing trace with hash 205077742, now seen corresponding path program 1 times [2022-11-08 07:42:22,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-08 07:42:22,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382875888] [2022-11-08 07:42:22,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-08 07:42:22,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-08 07:42:22,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-08 07:42:23,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-08 07:42:23,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-08 07:42:23,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382875888] [2022-11-08 07:42:23,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382875888] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-08 07:42:23,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-08 07:42:23,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-08 07:42:23,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87929359] [2022-11-08 07:42:23,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-08 07:42:23,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-08 07:42:23,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-08 07:42:23,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-08 07:42:23,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-08 07:42:23,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:42:23,077 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-08 07:42:23,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 49.0) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-08 07:42:23,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:42:23,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:42:23,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-08 07:42:23,115 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-08 07:42:23,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-08 07:42:23,115 INFO L85 PathProgramCache]: Analyzing trace with hash -2013468752, now seen corresponding path program 1 times [2022-11-08 07:42:23,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-08 07:42:23,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688791190] [2022-11-08 07:42:23,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-08 07:42:23,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-08 07:42:23,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-08 07:42:23,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-08 07:42:23,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-08 07:42:23,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688791190] [2022-11-08 07:42:23,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688791190] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-08 07:42:23,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-08 07:42:23,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-08 07:42:23,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851990671] [2022-11-08 07:42:23,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-08 07:42:23,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-08 07:42:23,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-08 07:42:23,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-08 07:42:23,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-08 07:42:23,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:42:23,528 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-08 07:42:23,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-08 07:42:23,529 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:42:23,529 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:42:23,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:42:23,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:42:23,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-08 07:42:23,685 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-08 07:42:23,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-08 07:42:23,688 INFO L85 PathProgramCache]: Analyzing trace with hash -703749757, now seen corresponding path program 1 times [2022-11-08 07:42:23,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-08 07:42:23,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79134161] [2022-11-08 07:42:23,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-08 07:42:23,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-08 07:42:23,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-08 07:42:25,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-08 07:42:25,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-08 07:42:25,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79134161] [2022-11-08 07:42:25,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79134161] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-08 07:42:26,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-08 07:42:26,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-08 07:42:26,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524459201] [2022-11-08 07:42:26,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-08 07:42:26,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-08 07:42:26,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-08 07:42:26,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-08 07:42:26,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2022-11-08 07:42:26,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:42:26,012 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-08 07:42:26,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.705882352941177) internal successors, (114), 17 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-08 07:42:26,013 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:42:26,013 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:42:26,013 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:42:26,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:42:26,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:42:26,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-08 07:42:26,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-08 07:42:26,766 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-08 07:42:26,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-08 07:42:26,767 INFO L85 PathProgramCache]: Analyzing trace with hash -940168002, now seen corresponding path program 1 times [2022-11-08 07:42:26,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-08 07:42:26,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681240704] [2022-11-08 07:42:26,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-08 07:42:26,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-08 07:42:26,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-08 07:42:30,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-08 07:42:30,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-08 07:42:30,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681240704] [2022-11-08 07:42:30,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681240704] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-08 07:42:30,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-08 07:42:30,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-11-08 07:42:30,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63406264] [2022-11-08 07:42:30,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-08 07:42:30,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-08 07:42:30,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-08 07:42:30,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-08 07:42:30,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=573, Unknown=0, NotChecked=0, Total=650 [2022-11-08 07:42:30,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:42:30,941 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-08 07:42:30,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.538461538461538) internal successors, (118), 26 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-08 07:42:30,942 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:42:30,942 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:42:30,942 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-08 07:42:30,942 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:42:33,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:42:33,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:42:33,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-08 07:42:33,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-08 07:42:33,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-08 07:42:33,523 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-08 07:42:33,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-08 07:42:33,524 INFO L85 PathProgramCache]: Analyzing trace with hash 764148819, now seen corresponding path program 1 times [2022-11-08 07:42:33,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-08 07:42:33,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629435441] [2022-11-08 07:42:33,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-08 07:42:33,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-08 07:42:33,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-08 07:42:33,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-08 07:42:33,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-08 07:42:33,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629435441] [2022-11-08 07:42:33,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629435441] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-08 07:42:33,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-08 07:42:33,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-08 07:42:33,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528221597] [2022-11-08 07:42:33,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-08 07:42:33,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-08 07:42:33,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-08 07:42:33,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-08 07:42:33,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-08 07:42:33,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:42:33,630 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-08 07:42:33,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-08 07:42:33,630 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:42:33,631 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:42:33,631 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-08 07:42:33,631 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-08 07:42:33,631 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:42:33,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:42:33,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:42:33,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-08 07:42:33,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-08 07:42:33,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:42:33,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-08 07:42:33,854 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-08 07:42:33,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-08 07:42:33,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1965528174, now seen corresponding path program 1 times [2022-11-08 07:42:33,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-08 07:42:33,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545073778] [2022-11-08 07:42:33,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-08 07:42:33,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-08 07:42:33,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-08 07:42:38,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-08 07:42:38,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-08 07:42:38,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545073778] [2022-11-08 07:42:38,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545073778] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-08 07:42:38,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-08 07:42:38,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-11-08 07:42:38,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336779877] [2022-11-08 07:42:38,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-08 07:42:38,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-08 07:42:38,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-08 07:42:38,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-08 07:42:38,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=675, Unknown=0, NotChecked=0, Total=756 [2022-11-08 07:42:38,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:42:38,369 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-08 07:42:38,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.392857142857143) internal successors, (123), 28 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-08 07:42:38,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:42:38,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:42:38,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-08 07:42:38,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-08 07:42:38,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:42:38,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:42:42,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:42:42,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:42:42,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-08 07:42:42,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-08 07:42:42,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:42:42,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-08 07:42:42,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-08 07:42:42,613 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-08 07:42:42,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-08 07:42:42,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1154321913, now seen corresponding path program 1 times [2022-11-08 07:42:42,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-08 07:42:42,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648173349] [2022-11-08 07:42:42,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-08 07:42:42,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-08 07:42:42,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-08 07:42:42,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-08 07:42:42,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-08 07:42:42,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648173349] [2022-11-08 07:42:42,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648173349] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-08 07:42:42,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-08 07:42:42,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-08 07:42:42,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740283977] [2022-11-08 07:42:42,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-08 07:42:42,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-08 07:42:42,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-08 07:42:42,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-08 07:42:42,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-08 07:42:42,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:42:42,770 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-08 07:42:42,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-08 07:42:42,770 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:42:42,770 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:42:42,770 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-08 07:42:42,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-08 07:42:42,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:42:42,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-08 07:42:42,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:42:43,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:42:43,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:42:43,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-08 07:42:43,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-08 07:42:43,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:42:43,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-08 07:42:43,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:42:43,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-08 07:42:43,643 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-08 07:42:43,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-08 07:42:43,644 INFO L85 PathProgramCache]: Analyzing trace with hash 634770346, now seen corresponding path program 1 times [2022-11-08 07:42:43,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-08 07:42:43,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230496653] [2022-11-08 07:42:43,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-08 07:42:43,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-08 07:42:43,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-08 07:42:43,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-08 07:42:43,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-08 07:42:43,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230496653] [2022-11-08 07:42:43,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230496653] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-08 07:42:43,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-08 07:42:43,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-08 07:42:43,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768380965] [2022-11-08 07:42:43,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-08 07:42:43,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-08 07:42:43,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-08 07:42:43,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-08 07:42:43,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-08 07:42:43,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:42:43,781 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-08 07:42:43,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-08 07:42:43,782 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:42:43,782 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:42:43,782 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-08 07:42:43,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-08 07:42:43,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:42:43,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-08 07:42:43,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:42:43,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:42:44,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:42:44,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:42:44,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-08 07:42:44,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-08 07:42:44,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:42:44,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-08 07:42:44,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:42:44,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:42:44,010 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-08 07:42:44,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-08 07:42:44,028 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-08 07:42:44,030 INFO L307 ceAbstractionStarter]: Result for error location t1Thread1of1ForFork0 was SAFE (1/3) [2022-11-08 07:42:44,042 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-08 07:42:44,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-08 07:42:44,043 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3bbf59-43f2-4747-a86e-61c04e1b5533/bin/ugemcutter-QpsTfqS70U/z3 [2022-11-08 07:42:44,046 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3bbf59-43f2-4747-a86e-61c04e1b5533/bin/ugemcutter-QpsTfqS70U/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-08 07:42:44,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3bbf59-43f2-4747-a86e-61c04e1b5533/bin/ugemcutter-QpsTfqS70U/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2022-11-08 07:42:44,053 INFO L156 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-08 07:42:44,053 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2022-11-08 07:42:44,054 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=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@688aca9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-08 07:42:44,054 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-11-08 07:42:44,058 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-08 07:42:44,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-08 07:42:44,059 INFO L85 PathProgramCache]: Analyzing trace with hash 860146292, now seen corresponding path program 1 times [2022-11-08 07:42:44,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-08 07:42:44,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109395745] [2022-11-08 07:42:44,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-08 07:42:44,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-08 07:42:44,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-08 07:42:44,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-08 07:42:44,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-08 07:42:44,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109395745] [2022-11-08 07:42:44,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109395745] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-08 07:42:44,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-08 07:42:44,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-08 07:42:44,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924073127] [2022-11-08 07:42:44,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-08 07:42:44,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-08 07:42:44,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-08 07:42:44,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-08 07:42:44,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-08 07:42:44,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:42:44,089 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-08 07:42:44,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-08 07:42:44,089 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:42:44,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:42:44,376 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-11-08 07:42:44,376 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-11-08 07:42:44,377 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-11-08 07:42:44,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-08 07:42:44,378 INFO L444 BasicCegarLoop]: Path program histogram: [1] [2022-11-08 07:42:44,379 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE,SAFE,SAFE (2/3) [2022-11-08 07:42:44,382 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-08 07:42:44,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-08 07:42:44,383 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3bbf59-43f2-4747-a86e-61c04e1b5533/bin/ugemcutter-QpsTfqS70U/z3 [2022-11-08 07:42:44,424 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3bbf59-43f2-4747-a86e-61c04e1b5533/bin/ugemcutter-QpsTfqS70U/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-08 07:42:44,432 INFO L156 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-08 07:42:44,433 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2Thread1of1ForFork1 ======== [2022-11-08 07:42:44,433 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=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@688aca9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-08 07:42:44,433 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-08 07:42:44,438 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3bbf59-43f2-4747-a86e-61c04e1b5533/bin/ugemcutter-QpsTfqS70U/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2022-11-08 07:42:44,527 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-08 07:42:44,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-08 07:42:44,530 INFO L85 PathProgramCache]: Analyzing trace with hash -173963075, now seen corresponding path program 1 times [2022-11-08 07:42:44,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-08 07:42:44,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755412478] [2022-11-08 07:42:44,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-08 07:42:44,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-08 07:42:44,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-08 07:42:44,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-08 07:42:44,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-08 07:42:44,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755412478] [2022-11-08 07:42:44,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755412478] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-08 07:42:44,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-08 07:42:44,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-08 07:42:44,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831116758] [2022-11-08 07:42:44,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-08 07:42:44,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-08 07:42:44,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-08 07:42:44,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-08 07:42:44,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-08 07:42:44,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:42:44,574 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-08 07:42:44,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 71.5) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-08 07:42:44,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:42:44,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:42:44,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-08 07:42:44,583 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-08 07:42:44,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-08 07:42:44,584 INFO L85 PathProgramCache]: Analyzing trace with hash 727937339, now seen corresponding path program 1 times [2022-11-08 07:42:44,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-08 07:42:44,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693363478] [2022-11-08 07:42:44,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-08 07:42:44,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-08 07:42:44,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-08 07:42:44,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-08 07:42:44,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-08 07:42:44,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693363478] [2022-11-08 07:42:44,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693363478] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-08 07:42:44,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-08 07:42:44,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-08 07:42:44,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104720221] [2022-11-08 07:42:44,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-08 07:42:44,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-08 07:42:44,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-08 07:42:44,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-08 07:42:44,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-08 07:42:44,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:42:44,670 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-08 07:42:44,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-08 07:42:44,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:42:44,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:42:44,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:42:44,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:42:44,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-08 07:42:44,713 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-08 07:42:44,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-08 07:42:44,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1170927032, now seen corresponding path program 1 times [2022-11-08 07:42:44,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-08 07:42:44,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629704426] [2022-11-08 07:42:44,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-08 07:42:44,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-08 07:42:44,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-08 07:42:44,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-08 07:42:44,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-08 07:42:44,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629704426] [2022-11-08 07:42:44,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629704426] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-08 07:42:44,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-08 07:42:44,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-08 07:42:44,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086737980] [2022-11-08 07:42:44,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-08 07:42:44,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-08 07:42:44,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-08 07:42:44,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-08 07:42:44,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-08 07:42:44,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:42:44,876 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-08 07:42:44,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-08 07:42:44,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:42:44,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:42:44,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:42:44,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:42:44,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:42:44,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:42:44,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-08 07:42:44,983 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-08 07:42:44,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-08 07:42:44,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1178061083, now seen corresponding path program 1 times [2022-11-08 07:42:44,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-08 07:42:44,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967985095] [2022-11-08 07:42:44,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-08 07:42:44,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-08 07:42:45,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-08 07:42:45,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-08 07:42:45,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-08 07:42:45,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967985095] [2022-11-08 07:42:45,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967985095] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-08 07:42:45,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-08 07:42:45,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-08 07:42:45,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625892131] [2022-11-08 07:42:45,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-08 07:42:45,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-08 07:42:45,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-08 07:42:45,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-08 07:42:45,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-08 07:42:45,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:42:45,088 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-08 07:42:45,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-08 07:42:45,089 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:42:45,089 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:42:45,089 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:42:45,089 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:42:45,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:42:45,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:42:45,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:42:45,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:42:45,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-08 07:42:45,157 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-08 07:42:45,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-08 07:42:45,157 INFO L85 PathProgramCache]: Analyzing trace with hash -829906736, now seen corresponding path program 1 times [2022-11-08 07:42:45,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-08 07:42:45,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535577693] [2022-11-08 07:42:45,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-08 07:42:45,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-08 07:42:45,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-08 07:42:45,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-08 07:42:45,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-08 07:42:45,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535577693] [2022-11-08 07:42:45,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535577693] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-08 07:42:45,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-08 07:42:45,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-08 07:42:45,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969532688] [2022-11-08 07:42:45,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-08 07:42:45,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-08 07:42:45,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-08 07:42:45,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-08 07:42:45,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-08 07:42:45,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:42:45,254 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-08 07:42:45,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-08 07:42:45,255 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:42:45,255 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:42:45,255 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:42:45,255 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:42:45,255 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:42:45,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:42:45,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:42:45,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:42:45,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:42:45,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:42:45,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-08 07:42:45,378 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-08 07:42:45,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-08 07:42:45,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1157481246, now seen corresponding path program 1 times [2022-11-08 07:42:45,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-08 07:42:45,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576869735] [2022-11-08 07:42:45,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-08 07:42:45,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-08 07:42:45,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-08 07:42:47,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-08 07:42:47,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-08 07:42:47,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576869735] [2022-11-08 07:42:47,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576869735] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-08 07:42:47,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-08 07:42:47,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-08 07:42:47,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483872385] [2022-11-08 07:42:47,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-08 07:42:47,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-08 07:42:47,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-08 07:42:47,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-08 07:42:47,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2022-11-08 07:42:47,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:42:47,139 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-08 07:42:47,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 11.529411764705882) internal successors, (196), 17 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-08 07:42:47,140 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:42:47,140 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:42:47,140 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:42:47,140 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:42:47,140 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:42:47,140 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:42:47,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:42:47,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:42:47,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:42:47,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:42:47,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:42:47,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-08 07:42:47,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-08 07:42:47,879 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-08 07:42:47,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-08 07:42:47,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1682884771, now seen corresponding path program 1 times [2022-11-08 07:42:47,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-08 07:42:47,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423492759] [2022-11-08 07:42:47,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-08 07:42:47,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-08 07:42:47,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-08 07:43:00,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-08 07:43:00,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-08 07:43:00,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423492759] [2022-11-08 07:43:00,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423492759] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-08 07:43:00,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-08 07:43:00,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-11-08 07:43:00,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824096616] [2022-11-08 07:43:00,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-08 07:43:00,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-08 07:43:00,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-08 07:43:00,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-08 07:43:00,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1219, Unknown=0, NotChecked=0, Total=1406 [2022-11-08 07:43:00,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:00,363 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-08 07:43:00,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 5.2631578947368425) internal successors, (200), 38 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-08 07:43:00,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:00,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:43:00,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:43:00,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:43:00,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:43:00,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-08 07:43:00,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:08,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:08,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:43:08,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:43:08,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:43:08,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:43:08,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-08 07:43:08,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-08 07:43:08,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-08 07:43:08,536 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-08 07:43:08,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-08 07:43:08,537 INFO L85 PathProgramCache]: Analyzing trace with hash 227291992, now seen corresponding path program 1 times [2022-11-08 07:43:08,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-08 07:43:08,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314503451] [2022-11-08 07:43:08,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-08 07:43:08,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-08 07:43:08,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-08 07:43:11,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-08 07:43:11,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-08 07:43:11,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314503451] [2022-11-08 07:43:11,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314503451] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-08 07:43:11,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-08 07:43:11,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-11-08 07:43:11,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265994436] [2022-11-08 07:43:11,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-08 07:43:11,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-08 07:43:11,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-08 07:43:11,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-08 07:43:11,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=717, Unknown=0, NotChecked=0, Total=870 [2022-11-08 07:43:11,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:11,996 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-08 07:43:11,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 6.8) internal successors, (204), 30 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-08 07:43:11,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:11,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:43:11,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:43:11,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:43:11,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:43:11,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-08 07:43:11,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-11-08 07:43:11,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:14,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:14,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:43:14,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:43:14,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:43:14,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:43:14,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-08 07:43:14,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-08 07:43:14,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-08 07:43:14,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-08 07:43:14,689 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-08 07:43:14,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-08 07:43:14,690 INFO L85 PathProgramCache]: Analyzing trace with hash -580705896, now seen corresponding path program 1 times [2022-11-08 07:43:14,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-08 07:43:14,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884250077] [2022-11-08 07:43:14,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-08 07:43:14,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-08 07:43:14,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-08 07:43:21,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-08 07:43:21,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-08 07:43:21,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884250077] [2022-11-08 07:43:21,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884250077] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-08 07:43:21,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-08 07:43:21,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-11-08 07:43:21,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781381461] [2022-11-08 07:43:21,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-08 07:43:21,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-08 07:43:21,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-08 07:43:21,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-08 07:43:21,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1088, Unknown=0, NotChecked=0, Total=1260 [2022-11-08 07:43:21,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:21,320 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-08 07:43:21,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 5.666666666666667) internal successors, (204), 36 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-08 07:43:21,321 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:21,321 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:43:21,321 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:43:21,321 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:43:21,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:43:21,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-08 07:43:21,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-11-08 07:43:21,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-08 07:43:21,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:25,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:25,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:43:25,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:43:25,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:43:25,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:43:25,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-08 07:43:25,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-08 07:43:25,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-08 07:43:25,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-08 07:43:25,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-08 07:43:25,148 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-08 07:43:25,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-08 07:43:25,149 INFO L85 PathProgramCache]: Analyzing trace with hash -210204653, now seen corresponding path program 1 times [2022-11-08 07:43:25,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-08 07:43:25,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409536157] [2022-11-08 07:43:25,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-08 07:43:25,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-08 07:43:25,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-08 07:43:34,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-08 07:43:34,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-08 07:43:34,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409536157] [2022-11-08 07:43:34,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409536157] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-08 07:43:34,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-08 07:43:34,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50 [2022-11-08 07:43:34,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066524330] [2022-11-08 07:43:34,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-08 07:43:34,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-08 07:43:34,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-08 07:43:34,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-08 07:43:34,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=2300, Unknown=0, NotChecked=0, Total=2450 [2022-11-08 07:43:34,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:34,683 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-08 07:43:34,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 4.16) internal successors, (208), 50 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-08 07:43:34,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:34,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:43:34,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:43:34,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:43:34,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:43:34,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-08 07:43:34,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-11-08 07:43:34,685 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-08 07:43:34,685 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-11-08 07:43:34,685 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:47,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:47,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:43:47,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:43:47,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:43:47,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:43:47,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-08 07:43:47,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-08 07:43:47,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-08 07:43:47,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-08 07:43:47,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-11-08 07:43:47,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-08 07:43:47,015 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-08 07:43:47,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-08 07:43:47,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1785824410, now seen corresponding path program 1 times [2022-11-08 07:43:47,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-08 07:43:47,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86462427] [2022-11-08 07:43:47,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-08 07:43:47,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-08 07:43:47,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-08 07:43:47,188 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-08 07:43:47,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-08 07:43:47,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86462427] [2022-11-08 07:43:47,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86462427] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-08 07:43:47,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206911110] [2022-11-08 07:43:47,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-08 07:43:47,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-08 07:43:47,189 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3bbf59-43f2-4747-a86e-61c04e1b5533/bin/ugemcutter-QpsTfqS70U/z3 [2022-11-08 07:43:47,194 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3bbf59-43f2-4747-a86e-61c04e1b5533/bin/ugemcutter-QpsTfqS70U/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-08 07:43:47,199 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3bbf59-43f2-4747-a86e-61c04e1b5533/bin/ugemcutter-QpsTfqS70U/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-08 07:43:47,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-08 07:43:47,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-08 07:43:47,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-08 07:43:47,679 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-08 07:43:47,679 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-08 07:43:47,864 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-08 07:43:47,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206911110] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-08 07:43:47,878 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-08 07:43:47,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-08 07:43:47,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952979674] [2022-11-08 07:43:47,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-08 07:43:47,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-08 07:43:47,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-08 07:43:47,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-08 07:43:47,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-08 07:43:47,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:47,882 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-08 07:43:47,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 40.2) internal successors, (402), 10 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-08 07:43:47,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:47,883 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:43:47,883 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:43:47,883 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:43:47,883 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:43:47,883 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-08 07:43:47,883 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-11-08 07:43:47,883 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-08 07:43:47,884 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-11-08 07:43:47,884 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2022-11-08 07:43:47,884 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:48,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:43:48,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:43:48,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:43:48,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:43:48,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:43:48,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-08 07:43:48,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-08 07:43:48,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-08 07:43:48,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-08 07:43:48,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-11-08 07:43:48,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-08 07:43:48,311 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3bbf59-43f2-4747-a86e-61c04e1b5533/bin/ugemcutter-QpsTfqS70U/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-08 07:43:48,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3bbf59-43f2-4747-a86e-61c04e1b5533/bin/ugemcutter-QpsTfqS70U/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-08 07:43:48,470 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-08 07:43:48,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-08 07:43:48,471 INFO L85 PathProgramCache]: Analyzing trace with hash -523280424, now seen corresponding path program 1 times [2022-11-08 07:43:48,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-08 07:43:48,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382357112] [2022-11-08 07:43:48,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-08 07:43:48,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-08 07:43:48,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-08 07:43:53,621 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 40 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-08 07:43:53,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-08 07:43:53,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382357112] [2022-11-08 07:43:53,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382357112] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-08 07:43:53,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707428950] [2022-11-08 07:43:53,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-08 07:43:53,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-08 07:43:53,622 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3bbf59-43f2-4747-a86e-61c04e1b5533/bin/ugemcutter-QpsTfqS70U/z3 [2022-11-08 07:43:53,623 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3bbf59-43f2-4747-a86e-61c04e1b5533/bin/ugemcutter-QpsTfqS70U/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-08 07:43:53,633 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3bbf59-43f2-4747-a86e-61c04e1b5533/bin/ugemcutter-QpsTfqS70U/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-08 07:43:53,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-08 07:43:53,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 634 conjuncts, 117 conjunts are in the unsatisfiable core [2022-11-08 07:43:53,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-08 07:43:54,098 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-08 07:43:54,099 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-08 07:43:54,165 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-08 07:43:54,166 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-08 07:43:54,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2022-11-08 07:43:54,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 22 [2022-11-08 07:43:55,073 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 [2022-11-08 07:43:55,643 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-08 07:43:55,653 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-08 07:43:55,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-08 07:43:55,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:43:55,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 22 [2022-11-08 07:43:56,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-08 07:43:56,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:43:56,221 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 [2022-11-08 07:43:56,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 [2022-11-08 07:43:57,101 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-08 07:43:57,115 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-08 07:43:57,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-08 07:43:57,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:43:57,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 22 [2022-11-08 07:43:57,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-08 07:43:57,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:43:57,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 [2022-11-08 07:43:57,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:43:57,928 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 22 [2022-11-08 07:43:58,028 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 22 [2022-11-08 07:43:58,421 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-08 07:43:58,436 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-08 07:43:58,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 27 [2022-11-08 07:43:58,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:43:58,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 20 [2022-11-08 07:43:58,539 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2022-11-08 07:43:58,583 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 40 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-08 07:43:58,583 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-08 07:44:00,356 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_913 (Array Int Int)) (v_ArrVal_919 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_913) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse0 .cse1))) (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_919) .cse1)))))) is different from false [2022-11-08 07:44:00,371 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_913 (Array Int Int)) (v_ArrVal_919 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_913) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse0 .cse1))) (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_919) .cse1)))))) is different from false [2022-11-08 07:44:00,387 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_913 (Array Int Int)) (v_ArrVal_919 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_913) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_919) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse0 .cse1)))))) is different from false [2022-11-08 07:44:00,460 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_909 Int) (v_ArrVal_913 (Array Int Int)) (v_ArrVal_919 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_909) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_913) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse0 .cse1))) (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_919) .cse1)))))) is different from false [2022-11-08 07:44:00,522 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_909 Int) (v_ArrVal_908 Int) (v_ArrVal_913 (Array Int Int)) (v_ArrVal_919 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_908)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_909) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_913) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_919) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse0 .cse1)))))) is different from false [2022-11-08 07:44:00,552 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (forall ((v_ArrVal_909 Int) (v_ArrVal_908 Int) (v_ArrVal_913 (Array Int Int)) (v_ArrVal_919 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store .cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_908))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_909) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_913) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_919) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse0 .cse1)))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse4 .cse3)))))) is different from false [2022-11-08 07:44:00,604 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_909 Int) (v_ArrVal_908 Int) (v_ArrVal_913 (Array Int Int)) (v_ArrVal_919 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int)) (let ((.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604)) (.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse4 (store .cse2 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_908))) (store (store .cse4 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_909) .cse3 (+ (select .cse4 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_913) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_919) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse2 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse0 .cse1))))))) is different from false [2022-11-08 07:44:01,106 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_909 Int) (v_ArrVal_908 Int) (v_ArrVal_913 (Array Int Int)) (v_ArrVal_919 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_906 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_906))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_908))) (store (store .cse4 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_909) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_913) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse2 .cse1))) (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_919) .cse1) 400))))))) is different from false [2022-11-08 07:44:01,530 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_909 Int) (v_ArrVal_908 Int) (v_ArrVal_913 (Array Int Int)) (v_ArrVal_919 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_906 (Array Int Int)) (v_ArrVal_905 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int)) (let ((.cse3 (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_905) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_906))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_908))) (store (store .cse4 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_909) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_913) |c_~#queue~0.base|))) (or (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_919) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse0 .cse1)))))))) is different from false [2022-11-08 07:44:01,692 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_909 Int) (v_ArrVal_908 Int) (v_ArrVal_913 (Array Int Int)) (v_ArrVal_919 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_906 (Array Int Int)) (v_ArrVal_905 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int)) (let ((.cse3 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_905) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_906))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_908))) (store (store .cse4 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_909) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_913) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse2 .cse1))) (not (= (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_919) .cse1) 400))))))) is different from false [2022-11-08 07:44:01,735 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_909 Int) (v_ArrVal_908 Int) (v_ArrVal_913 (Array Int Int)) (v_ArrVal_919 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_906 (Array Int Int)) (v_ArrVal_905 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int)) (let ((.cse3 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_905) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_906))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_908))) (store (store .cse4 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_909) .cse1 (+ 1 (select .cse4 .cse1))))) |c_~#stored_elements~0.base| v_ArrVal_913) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse2 .cse1))) (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_919) .cse1)))))))) is different from false [2022-11-08 07:44:01,761 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_909 Int) (v_ArrVal_908 Int) (v_ArrVal_913 (Array Int Int)) (v_ArrVal_919 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_906 (Array Int Int)) (v_ArrVal_905 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int)) (let ((.cse3 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse5 .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_905) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_906))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_908))) (store (store .cse4 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_909) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_913) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse0 .cse1))) (not (= 400 (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_919) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse2 .cse1)))))))) is different from false [2022-11-08 07:44:04,762 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_909 Int) (v_ArrVal_908 Int) (v_ArrVal_919 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_902 Int) (v_ArrVal_900 Int) (v_ArrVal_898 (Array Int Int)) (v_ArrVal_913 (Array Int Int)) (v_ArrVal_906 (Array Int Int)) (v_ArrVal_905 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_898))) (let ((.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse3 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_900))) (store (store .cse8 .cse6 v_ArrVal_902) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_905) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_906))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_908))) (store (store .cse5 .cse6 v_ArrVal_909) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_913) |c_~#queue~0.base|))) (or (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_919) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse3 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse0 .cse1)))))))))) is different from false [2022-11-08 07:44:05,491 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_909 Int) (v_ArrVal_908 Int) (v_ArrVal_919 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_902 Int) (v_ArrVal_900 Int) (v_ArrVal_897 Int) (v_ArrVal_898 (Array Int Int)) (v_ArrVal_913 (Array Int Int)) (v_ArrVal_906 (Array Int Int)) (v_ArrVal_905 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int)) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 1608 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_897)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_898))) (let ((.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_900))) (store (store .cse8 .cse6 v_ArrVal_902) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_905) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_906))) (let ((.cse3 (select .cse4 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_908))) (store (store .cse5 .cse6 v_ArrVal_909) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_913) |c_~#queue~0.base|))) (or (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_919) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse3 .cse1)))))))))) is different from false [2022-11-08 07:44:05,517 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-08 07:44:05,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 825 treesize of output 515 [2022-11-08 07:44:05,551 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-08 07:44:05,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2050 treesize of output 2026 [2022-11-08 07:44:05,585 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1883 treesize of output 1787 [2022-11-08 07:44:05,609 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2075 treesize of output 2059 [2022-11-08 07:44:05,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2109 treesize of output 2037 [2022-11-08 07:44:05,665 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2127 treesize of output 2091 [2022-11-08 07:44:05,774 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-08 07:44:07,066 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-08 07:44:07,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 224 treesize of output 212 [2022-11-08 07:44:08,132 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-08 07:44:08,132 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 66 treesize of output 136 [2022-11-08 07:44:08,574 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 40 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 14 not checked. [2022-11-08 07:44:08,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707428950] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-08 07:44:08,575 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-08 07:44:08,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 34, 39] total 106 [2022-11-08 07:44:08,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864396587] [2022-11-08 07:44:08,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-08 07:44:08,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 106 states [2022-11-08 07:44:08,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-08 07:44:08,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2022-11-08 07:44:08,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=812, Invalid=7555, Unknown=61, NotChecked=2702, Total=11130 [2022-11-08 07:44:08,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:44:08,584 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-08 07:44:08,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 106 states, 106 states have (on average 6.754716981132075) internal successors, (716), 106 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-08 07:44:08,585 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:44:08,586 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:44:08,586 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:44:08,586 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:44:08,586 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:44:08,586 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-08 07:44:08,586 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-11-08 07:44:08,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-08 07:44:08,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-11-08 07:44:08,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2022-11-08 07:44:08,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-08 07:44:08,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:44:33,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:44:33,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:44:33,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:44:33,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:44:33,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:44:33,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-08 07:44:33,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-08 07:44:33,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-08 07:44:33,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-08 07:44:33,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-11-08 07:44:33,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-08 07:44:33,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-11-08 07:44:33,842 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3bbf59-43f2-4747-a86e-61c04e1b5533/bin/ugemcutter-QpsTfqS70U/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-08 07:44:34,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3bbf59-43f2-4747-a86e-61c04e1b5533/bin/ugemcutter-QpsTfqS70U/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-08 07:44:34,031 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-08 07:44:34,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-08 07:44:34,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1645046637, now seen corresponding path program 1 times [2022-11-08 07:44:34,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-08 07:44:34,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845406671] [2022-11-08 07:44:34,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-08 07:44:34,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-08 07:44:34,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-08 07:44:42,697 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 6 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-08 07:44:42,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-08 07:44:42,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845406671] [2022-11-08 07:44:42,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845406671] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-08 07:44:42,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275069119] [2022-11-08 07:44:42,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-08 07:44:42,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-08 07:44:42,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3bbf59-43f2-4747-a86e-61c04e1b5533/bin/ugemcutter-QpsTfqS70U/z3 [2022-11-08 07:44:42,699 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3bbf59-43f2-4747-a86e-61c04e1b5533/bin/ugemcutter-QpsTfqS70U/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-08 07:44:42,700 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3bbf59-43f2-4747-a86e-61c04e1b5533/bin/ugemcutter-QpsTfqS70U/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-08 07:44:42,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-08 07:44:42,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 148 conjunts are in the unsatisfiable core [2022-11-08 07:44:42,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-08 07:44:43,107 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-08 07:44:43,108 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-08 07:44:43,183 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-08 07:44:43,183 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-08 07:44:43,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2022-11-08 07:44:43,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 22 [2022-11-08 07:44:44,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 29 [2022-11-08 07:44:45,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:44:45,192 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-08 07:44:45,211 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-08 07:44:45,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 39 [2022-11-08 07:44:45,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:44:45,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:44:45,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2022-11-08 07:44:45,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 27 [2022-11-08 07:44:46,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:44:46,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 33 treesize of output 31 [2022-11-08 07:44:46,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 33 treesize of output 31 [2022-11-08 07:44:47,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:44:47,748 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-08 07:44:47,769 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-08 07:44:47,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 41 [2022-11-08 07:44:47,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:44:47,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:44:47,977 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2022-11-08 07:44:48,488 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 51 treesize of output 32 [2022-11-08 07:44:48,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:44:48,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 33 treesize of output 31 [2022-11-08 07:44:49,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:44:49,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:44:49,423 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2022-11-08 07:44:49,774 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 48 treesize of output 29 [2022-11-08 07:44:50,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:44:50,592 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-08 07:44:50,615 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-08 07:44:50,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-11-08 07:44:50,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:44:50,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:44:50,712 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-08 07:44:50,896 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 25 [2022-11-08 07:44:51,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:44:51,071 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 [2022-11-08 07:44:51,429 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 22 [2022-11-08 07:44:51,449 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2022-11-08 07:44:51,503 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 6 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-08 07:44:51,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-08 07:44:55,413 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1083 Int) (v_ArrVal_1085 Int) (v_ArrVal_1077 Int) (v_ArrVal_1087 Int) (v_ArrVal_1079 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_1078 (Array Int Int)) (v_ArrVal_1089 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_1077)) |c_~#stored_elements~0.base| v_ArrVal_1078))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse0 .cse1))) (not (= (let ((.cse4 (+ 1600 |c_~#queue~0.offset|))) (select (select (store (store .cse2 |c_~#queue~0.base| (store (let ((.cse3 (+ 1608 |c_~#queue~0.offset|))) (store (store (store (store .cse0 .cse3 v_ArrVal_1079) .cse4 (+ (select .cse0 .cse4) 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_1083) .cse3 v_ArrVal_1085)) .cse1 v_ArrVal_1087)) |c_~#stored_elements~0.base| v_ArrVal_1089) |c_~#queue~0.base|) .cse4)) 400)) (not (<= v_ArrVal_1077 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))))) is different from false [2022-11-08 07:44:55,475 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1083 Int) (v_ArrVal_1085 Int) (v_ArrVal_1077 Int) (v_ArrVal_1087 Int) (v_ArrVal_1079 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_1078 (Array Int Int)) (v_ArrVal_1089 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_1077)) |c_~#stored_elements~0.base| v_ArrVal_1078))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse0 .cse1))) (not (= (let ((.cse4 (+ 1600 |c_~#queue~0.offset|))) (select (select (store (store .cse2 |c_~#queue~0.base| (store (let ((.cse3 (+ 1608 |c_~#queue~0.offset|))) (store (store (store (store .cse0 .cse3 v_ArrVal_1079) .cse4 (+ (select .cse0 .cse4) 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_1083) .cse3 v_ArrVal_1085)) .cse1 v_ArrVal_1087)) |c_~#stored_elements~0.base| v_ArrVal_1089) |c_~#queue~0.base|) .cse4)) 400)) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1077))))) is different from false [2022-11-08 07:44:55,499 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1083 Int) (v_ArrVal_1085 Int) (v_ArrVal_1077 Int) (v_ArrVal_1087 Int) (v_ArrVal_1079 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_1078 (Array Int Int)) (v_ArrVal_1089 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_1077)) |c_~#stored_elements~0.base| v_ArrVal_1078))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1077) (not (= (let ((.cse6 (+ 1600 |c_~#queue~0.offset|))) (select (select (store (store .cse4 |c_~#queue~0.base| (store (let ((.cse5 (+ 1608 |c_~#queue~0.offset|))) (store (store (store (store .cse0 .cse5 v_ArrVal_1079) .cse6 (+ (select .cse0 .cse6) 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_1083) .cse5 v_ArrVal_1085)) .cse1 v_ArrVal_1087)) |c_~#stored_elements~0.base| v_ArrVal_1089) |c_~#queue~0.base|) .cse6)) 400))))))) is different from false [2022-11-08 07:44:55,616 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1083 Int) (v_ArrVal_1074 Int) (v_ArrVal_1085 Int) (v_ArrVal_1077 Int) (v_ArrVal_1087 Int) (v_ArrVal_1079 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_1078 (Array Int Int)) (v_ArrVal_1089 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1074) .cse1 v_ArrVal_1077)) |c_~#stored_elements~0.base| v_ArrVal_1078))) (let ((.cse3 (select .cse2 |c_~#queue~0.base|)) (.cse6 (+ |c_~#queue~0.offset| 1604))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1077) (not (= 400 (let ((.cse5 (+ 1600 |c_~#queue~0.offset|))) (select (select (store (store .cse2 |c_~#queue~0.base| (store (let ((.cse4 (+ 1608 |c_~#queue~0.offset|))) (store (store (store (store .cse3 .cse4 v_ArrVal_1079) .cse5 (+ (select .cse3 .cse5) 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_1083) .cse4 v_ArrVal_1085)) .cse6 v_ArrVal_1087)) |c_~#stored_elements~0.base| v_ArrVal_1089) |c_~#queue~0.base|) .cse5)))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse3 .cse6)))))))) is different from false [2022-11-08 07:44:55,708 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1072 Int) (v_ArrVal_1083 Int) (v_ArrVal_1074 Int) (v_ArrVal_1085 Int) (v_ArrVal_1077 Int) (v_ArrVal_1087 Int) (v_ArrVal_1079 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_1078 (Array Int Int)) (v_ArrVal_1089 (Array Int Int))) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1072)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1074) .cse1 v_ArrVal_1077)) |c_~#stored_elements~0.base| v_ArrVal_1078))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1077) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse2 .cse3))) (not (= 400 (let ((.cse6 (+ 1600 |c_~#queue~0.offset|))) (select (select (store (store .cse4 |c_~#queue~0.base| (store (let ((.cse5 (+ 1608 |c_~#queue~0.offset|))) (store (store (store (store .cse2 .cse5 v_ArrVal_1079) .cse6 (+ (select .cse2 .cse6) 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_1083) .cse5 v_ArrVal_1085)) .cse3 v_ArrVal_1087)) |c_~#stored_elements~0.base| v_ArrVal_1089) |c_~#queue~0.base|) .cse6))))))))) is different from false [2022-11-08 07:44:55,753 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| Int)) (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (forall ((v_ArrVal_1072 Int) (v_ArrVal_1083 Int) (v_ArrVal_1074 Int) (v_ArrVal_1085 Int) (v_ArrVal_1077 Int) (v_ArrVal_1087 Int) (v_ArrVal_1079 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_1078 (Array Int Int)) (v_ArrVal_1089 (Array Int Int))) (let ((.cse0 (store .cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36|)) v_ArrVal_1072))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1074) .cse1 v_ArrVal_1077)) |c_~#stored_elements~0.base| v_ArrVal_1078))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1077) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse2 .cse3))) (not (= 400 (let ((.cse6 (+ 1600 |c_~#queue~0.offset|))) (select (select (store (store .cse4 |c_~#queue~0.base| (store (let ((.cse5 (+ 1608 |c_~#queue~0.offset|))) (store (store (store (store .cse2 .cse5 v_ArrVal_1079) .cse6 (+ (select .cse2 .cse6) 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_1083) .cse5 v_ArrVal_1085)) .cse3 v_ArrVal_1087)) |c_~#stored_elements~0.base| v_ArrVal_1089) |c_~#queue~0.base|) .cse6))))))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| (select .cse7 .cse1)))))) is different from false [2022-11-08 07:44:55,816 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1072 Int) (v_ArrVal_1083 Int) (v_ArrVal_1074 Int) (v_ArrVal_1085 Int) (v_ArrVal_1077 Int) (v_ArrVal_1087 Int) (v_ArrVal_1079 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| Int) (v_ArrVal_1078 (Array Int Int)) (v_ArrVal_1089 (Array Int Int))) (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse5 (store .cse7 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36|)) v_ArrVal_1072)) (.cse6 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse5 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_1074) .cse6 v_ArrVal_1077)) |c_~#stored_elements~0.base| v_ArrVal_1078))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (let ((.cse3 (+ 1600 |c_~#queue~0.offset|))) (select (select (store (store .cse0 |c_~#queue~0.base| (store (let ((.cse2 (+ 1608 |c_~#queue~0.offset|))) (store (store (store (store .cse1 .cse2 v_ArrVal_1079) .cse3 (+ (select .cse1 .cse3) 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_1083) .cse2 v_ArrVal_1085)) .cse4 v_ArrVal_1087)) |c_~#stored_elements~0.base| v_ArrVal_1089) |c_~#queue~0.base|) .cse3)))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse1 .cse4))) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1077) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| (select .cse7 .cse6))))))))) is different from false [2022-11-08 07:45:00,852 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_1078 (Array Int Int)) (v_ArrVal_1089 (Array Int Int)) (v_ArrVal_1071 (Array Int Int)) (v_ArrVal_1072 Int) (v_ArrVal_1083 Int) (v_ArrVal_1074 Int) (v_ArrVal_1085 Int) (v_ArrVal_1077 Int) (v_ArrVal_1087 Int) (v_ArrVal_1079 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1071))) (let ((.cse2 (select .cse7 |c_~#queue~0.base|))) (let ((.cse0 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36|)) v_ArrVal_1072)) (.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (store (store .cse0 .cse5 v_ArrVal_1074) .cse1 v_ArrVal_1077)) |c_~#stored_elements~0.base| v_ArrVal_1078))) (let ((.cse3 (select .cse4 |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1077) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse3 .cse1))) (not (= 400 (let ((.cse6 (+ 1600 |c_~#queue~0.offset|))) (select (select (store (store .cse4 |c_~#queue~0.base| (store (store (store (store (store .cse3 .cse5 v_ArrVal_1079) .cse6 (+ (select .cse3 .cse6) 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_1083) .cse5 v_ArrVal_1085) .cse1 v_ArrVal_1087)) |c_~#stored_elements~0.base| v_ArrVal_1089) |c_~#queue~0.base|) .cse6))))))))))) is different from false [2022-11-08 07:45:01,564 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_1078 (Array Int Int)) (v_ArrVal_1089 (Array Int Int)) (v_ArrVal_1071 (Array Int Int)) (v_ArrVal_1072 Int) (v_ArrVal_1083 Int) (v_ArrVal_1074 Int) (v_ArrVal_1085 Int) (v_ArrVal_1077 Int) (v_ArrVal_1087 Int) (v_ArrVal_1079 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1071))) (let ((.cse2 (select .cse7 |c_~#queue~0.base|))) (let ((.cse0 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36|)) v_ArrVal_1072)) (.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (store (store .cse0 .cse5 v_ArrVal_1074) .cse1 v_ArrVal_1077)) |c_~#stored_elements~0.base| v_ArrVal_1078))) (let ((.cse3 (select .cse4 |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1077) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse3 .cse1))) (not (= 400 (let ((.cse6 (+ 1600 |c_~#queue~0.offset|))) (select (select (store (store .cse4 |c_~#queue~0.base| (store (store (store (store (store .cse3 .cse5 v_ArrVal_1079) .cse6 (+ (select .cse3 .cse6) 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_1083) .cse5 v_ArrVal_1085) .cse1 v_ArrVal_1087)) |c_~#stored_elements~0.base| v_ArrVal_1089) |c_~#queue~0.base|) .cse6))))))))))) (= |c_t1Thread1of1ForFork0_empty_#t~mem31#1| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_empty_~q#1.base|) (+ |c_t1Thread1of1ForFork0_empty_~q#1.offset| 1604)))) is different from false [2022-11-08 07:45:01,605 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_1078 (Array Int Int)) (v_ArrVal_1089 (Array Int Int)) (v_ArrVal_1071 (Array Int Int)) (v_ArrVal_1072 Int) (v_ArrVal_1083 Int) (v_ArrVal_1074 Int) (v_ArrVal_1085 Int) (v_ArrVal_1077 Int) (v_ArrVal_1087 Int) (v_ArrVal_1079 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1071))) (let ((.cse2 (select .cse7 |c_~#queue~0.base|))) (let ((.cse0 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36|)) v_ArrVal_1072)) (.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (store (store .cse0 .cse5 v_ArrVal_1074) .cse1 v_ArrVal_1077)) |c_~#stored_elements~0.base| v_ArrVal_1078))) (let ((.cse3 (select .cse4 |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1077) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse3 .cse1))) (not (= 400 (let ((.cse6 (+ 1600 |c_~#queue~0.offset|))) (select (select (store (store .cse4 |c_~#queue~0.base| (store (store (store (store (store .cse3 .cse5 v_ArrVal_1079) .cse6 (+ (select .cse3 .cse6) 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_1083) .cse5 v_ArrVal_1085) .cse1 v_ArrVal_1087)) |c_~#stored_elements~0.base| v_ArrVal_1089) |c_~#queue~0.base|) .cse6))))))))))) (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_empty_~q#1.base|))) (= (select .cse8 (+ 1600 |c_t1Thread1of1ForFork0_empty_~q#1.offset|)) (select .cse8 (+ |c_t1Thread1of1ForFork0_empty_~q#1.offset| 1604))))) is different from false [2022-11-08 07:45:01,971 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse6 (+ 1600 |c_~#queue~0.offset|))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_1078 (Array Int Int)) (v_ArrVal_1089 (Array Int Int)) (v_ArrVal_1071 (Array Int Int)) (v_ArrVal_1072 Int) (v_ArrVal_1083 Int) (v_ArrVal_1074 Int) (v_ArrVal_1085 Int) (v_ArrVal_1077 Int) (v_ArrVal_1087 Int) (v_ArrVal_1079 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1071))) (let ((.cse2 (select .cse7 |c_~#queue~0.base|))) (let ((.cse0 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36|)) v_ArrVal_1072)) (.cse5 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (store (store .cse0 .cse5 v_ArrVal_1074) .cse1 v_ArrVal_1077)) |c_~#stored_elements~0.base| v_ArrVal_1078))) (let ((.cse3 (select .cse4 |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1077) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse3 .cse1))) (not (= 400 (select (select (store (store .cse4 |c_~#queue~0.base| (store (store (store (store (store .cse3 .cse5 v_ArrVal_1079) .cse6 (+ (select .cse3 .cse6) 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_1083) .cse5 v_ArrVal_1085) .cse1 v_ArrVal_1087)) |c_~#stored_elements~0.base| v_ArrVal_1089) |c_~#queue~0.base|) .cse6)))))))))) (let ((.cse8 (select |c_#memory_int| |c_~#queue~0.base|))) (= (select .cse8 .cse1) (select .cse8 .cse6))))) is different from false [2022-11-08 07:45:03,162 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_1078 (Array Int Int)) (v_ArrVal_1089 (Array Int Int)) (v_ArrVal_1071 (Array Int Int)) (v_ArrVal_1070 (Array Int Int)) (v_ArrVal_1072 Int) (v_ArrVal_1083 Int) (v_ArrVal_1074 Int) (v_ArrVal_1085 Int) (v_ArrVal_1077 Int) (v_ArrVal_1087 Int) (v_ArrVal_1079 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_1070))) (let ((.cse9 (store .cse3 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1071))) (let ((.cse4 (select .cse9 |c_~#queue~0.base|))) (let ((.cse8 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36|)) v_ArrVal_1072)) (.cse7 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse6 (store (store .cse9 |c_~#queue~0.base| (store (store .cse8 .cse7 v_ArrVal_1074) .cse1 v_ArrVal_1077)) |c_~#stored_elements~0.base| v_ArrVal_1078))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|)) (.cse2 (+ 1600 |c_~#queue~0.offset|))) (or (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (= (select .cse0 .cse1) (select .cse0 .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| (select .cse4 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse5 .cse1))) (not (= (select (select (store (store .cse6 |c_~#queue~0.base| (store (store (store (store (store .cse5 .cse7 v_ArrVal_1079) .cse2 (+ (select .cse5 .cse2) 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_1083) .cse7 v_ArrVal_1085) .cse1 v_ArrVal_1087)) |c_~#stored_elements~0.base| v_ArrVal_1089) |c_~#queue~0.base|) .cse2) 400)) (< (+ (select .cse8 .cse1) 1) v_ArrVal_1077))))))))) is different from false [2022-11-08 07:45:04,000 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_1078 (Array Int Int)) (v_ArrVal_1089 (Array Int Int)) (v_ArrVal_1071 (Array Int Int)) (v_ArrVal_1070 (Array Int Int)) (v_ArrVal_1072 Int) (v_ArrVal_1083 Int) (v_ArrVal_1074 Int) (v_ArrVal_1085 Int) (v_ArrVal_1066 Int) (v_ArrVal_1077 Int) (v_ArrVal_1087 Int) (v_ArrVal_1079 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| Int)) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse11 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse10 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1066) .cse11 (+ (select .cse10 .cse11) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1070))) (let ((.cse9 (store .cse8 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1071))) (let ((.cse0 (select .cse9 |c_~#queue~0.base|))) (let ((.cse6 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36|)) v_ArrVal_1072)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (store (store .cse9 |c_~#queue~0.base| (store (store .cse6 .cse4 v_ArrVal_1074) .cse1 v_ArrVal_1077)) |c_~#stored_elements~0.base| v_ArrVal_1078))) (let ((.cse3 (select .cse2 |c_~#queue~0.base|)) (.cse5 (+ 1600 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| (select .cse0 .cse1))) (not (= (select (select (store (store .cse2 |c_~#queue~0.base| (store (store (store (store (store .cse3 .cse4 v_ArrVal_1079) .cse5 (+ (select .cse3 .cse5) 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_1083) .cse4 v_ArrVal_1085) .cse1 v_ArrVal_1087)) |c_~#stored_elements~0.base| v_ArrVal_1089) |c_~#queue~0.base|) .cse5) 400)) (< (+ (select .cse6 .cse1) 1) v_ArrVal_1077) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse3 .cse1))) (let ((.cse7 (select .cse8 |c_~#queue~0.base|))) (= (select .cse7 .cse5) (select .cse7 .cse1))))))))))) is different from false [2022-11-08 07:45:04,200 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_1078 (Array Int Int)) (v_ArrVal_1089 (Array Int Int)) (v_ArrVal_1071 (Array Int Int)) (v_ArrVal_1070 (Array Int Int)) (v_ArrVal_1072 Int) (v_ArrVal_1083 Int) (v_ArrVal_1074 Int) (v_ArrVal_1085 Int) (v_ArrVal_1066 Int) (v_ArrVal_1077 Int) (v_ArrVal_1065 Int) (v_ArrVal_1087 Int) (v_ArrVal_1079 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| Int)) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse10 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1065)) (.cse11 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse10 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1066) .cse11 (+ (select .cse10 .cse11) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1070))) (let ((.cse9 (store .cse4 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1071))) (let ((.cse0 (select .cse9 |c_~#queue~0.base|))) (let ((.cse8 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36|)) v_ArrVal_1072)) (.cse7 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse5 (store (store .cse9 |c_~#queue~0.base| (store (store .cse8 .cse7 v_ArrVal_1074) .cse1 v_ArrVal_1077)) |c_~#stored_elements~0.base| v_ArrVal_1078))) (let ((.cse3 (+ 1600 |c_~#queue~0.offset|)) (.cse6 (select .cse5 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| (select .cse0 .cse1))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|))) (= (select .cse2 .cse1) (select .cse2 .cse3))) (not (= (select (select (store (store .cse5 |c_~#queue~0.base| (store (store (store (store (store .cse6 .cse7 v_ArrVal_1079) .cse3 (+ (select .cse6 .cse3) 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_1083) .cse7 v_ArrVal_1085) .cse1 v_ArrVal_1087)) |c_~#stored_elements~0.base| v_ArrVal_1089) |c_~#queue~0.base|) .cse3) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse6 .cse1))) (< (+ (select .cse8 .cse1) 1) v_ArrVal_1077))))))))) is different from false [2022-11-08 07:45:04,289 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| Int)) (let ((.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| (select .cse0 .cse1))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_1078 (Array Int Int)) (v_ArrVal_1089 (Array Int Int)) (v_ArrVal_1071 (Array Int Int)) (v_ArrVal_1070 (Array Int Int)) (v_ArrVal_1072 Int) (v_ArrVal_1083 Int) (v_ArrVal_1074 Int) (v_ArrVal_1085 Int) (v_ArrVal_1066 Int) (v_ArrVal_1077 Int) (v_ArrVal_1065 Int) (v_ArrVal_1087 Int) (v_ArrVal_1079 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| Int)) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse12 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1065))) (store (store .cse12 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1066) .cse1 (+ (select .cse12 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1070))) (let ((.cse11 (store .cse10 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1071))) (let ((.cse7 (select .cse11 |c_~#queue~0.base|))) (let ((.cse8 (store .cse7 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36|)) v_ArrVal_1072)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse6 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (store (store .cse11 |c_~#queue~0.base| (store (store .cse8 .cse4 v_ArrVal_1074) .cse6 v_ArrVal_1077)) |c_~#stored_elements~0.base| v_ArrVal_1078))) (let ((.cse3 (select .cse2 |c_~#queue~0.base|)) (.cse5 (+ 1600 |c_~#queue~0.offset|))) (or (not (= (select (select (store (store .cse2 |c_~#queue~0.base| (store (store (store (store (store .cse3 .cse4 v_ArrVal_1079) .cse5 (+ (select .cse3 .cse5) 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_1083) .cse4 v_ArrVal_1085) .cse6 v_ArrVal_1087)) |c_~#stored_elements~0.base| v_ArrVal_1089) |c_~#queue~0.base|) .cse5) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| (select .cse7 .cse6))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse3 .cse6))) (< (+ (select .cse8 .cse6) 1) v_ArrVal_1077) (let ((.cse9 (select .cse10 |c_~#queue~0.base|))) (= (select .cse9 .cse5) (select .cse9 .cse6)))))))))))))) is different from false [2022-11-08 07:45:04,452 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_1078 (Array Int Int)) (v_ArrVal_1089 (Array Int Int)) (v_ArrVal_1071 (Array Int Int)) (v_ArrVal_1070 (Array Int Int)) (v_ArrVal_1072 Int) (v_ArrVal_1083 Int) (v_ArrVal_1074 Int) (v_ArrVal_1085 Int) (v_ArrVal_1066 Int) (v_ArrVal_1077 Int) (v_ArrVal_1065 Int) (v_ArrVal_1087 Int) (v_ArrVal_1079 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| Int)) (let ((.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse12 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_1065))) (store (store .cse12 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_1066) .cse1 (+ (select .cse12 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1070))) (let ((.cse11 (store .cse8 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1071))) (let ((.cse4 (select .cse11 |c_~#queue~0.base|))) (let ((.cse2 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36|)) v_ArrVal_1072)) (.cse10 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse9 (store (store .cse11 |c_~#queue~0.base| (store (store .cse2 .cse10 v_ArrVal_1074) .cse3 v_ArrVal_1077)) |c_~#stored_elements~0.base| v_ArrVal_1078))) (let ((.cse5 (select .cse9 |c_~#queue~0.base|)) (.cse7 (+ 1600 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1077) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| (select .cse4 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse5 .cse3))) (let ((.cse6 (select .cse8 |c_~#queue~0.base|))) (= (select .cse6 .cse7) (select .cse6 .cse3))) (not (= 400 (select (select (store (store .cse9 |c_~#queue~0.base| (store (store (store (store (store .cse5 .cse10 v_ArrVal_1079) .cse7 (+ (select .cse5 .cse7) 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_1083) .cse10 v_ArrVal_1085) .cse3 v_ArrVal_1087)) |c_~#stored_elements~0.base| v_ArrVal_1089) |c_~#queue~0.base|) .cse7)))))))))))) is different from false [2022-11-08 07:45:06,110 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_1078 (Array Int Int)) (v_ArrVal_1089 (Array Int Int)) (v_ArrVal_1063 (Array Int Int)) (v_ArrVal_1071 (Array Int Int)) (v_ArrVal_1070 (Array Int Int)) (v_ArrVal_1072 Int) (v_ArrVal_1083 Int) (v_ArrVal_1074 Int) (v_ArrVal_1085 Int) (v_ArrVal_1066 Int) (v_ArrVal_1077 Int) (v_ArrVal_1065 Int) (v_ArrVal_1087 Int) (v_ArrVal_1079 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| Int)) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_1063))) (let ((.cse9 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse7 (select .cse11 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse11 |c_~#queue~0.base| (let ((.cse12 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_~#queue~0.offset|) v_ArrVal_1065))) (store (store .cse12 .cse9 v_ArrVal_1066) .cse1 (+ (select .cse12 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1070))) (let ((.cse10 (store .cse4 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1071))) (let ((.cse0 (select .cse10 |c_~#queue~0.base|))) (let ((.cse5 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36|)) v_ArrVal_1072))) (let ((.cse8 (store (store .cse10 |c_~#queue~0.base| (store (store .cse5 .cse9 v_ArrVal_1074) .cse1 v_ArrVal_1077)) |c_~#stored_elements~0.base| v_ArrVal_1078))) (let ((.cse6 (select .cse8 |c_~#queue~0.base|)) (.cse3 (+ 1600 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| (select .cse0 .cse1))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|))) (= (select .cse2 .cse3) (select .cse2 .cse1))) (< (+ (select .cse5 .cse1) 1) v_ArrVal_1077) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse6 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| (select .cse7 .cse1))) (not (= (select (select (store (store .cse8 |c_~#queue~0.base| (store (store (store (store (store .cse6 .cse9 v_ArrVal_1079) .cse3 (+ (select .cse6 .cse3) 1)) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_1083) .cse9 v_ArrVal_1085) .cse1 v_ArrVal_1087)) |c_~#stored_elements~0.base| v_ArrVal_1089) |c_~#queue~0.base|) .cse3) 400)))))))))))) is different from false [2022-11-08 07:45:09,368 INFO L356 Elim1Store]: treesize reduction 96, result has 47.0 percent of original size [2022-11-08 07:45:09,369 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 2155 treesize of output 1588 [2022-11-08 07:45:09,501 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-08 07:45:09,502 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4827 treesize of output 4763 [2022-11-08 07:45:09,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2502 treesize of output 2374 [2022-11-08 07:45:09,621 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 2797 treesize of output 2669 [2022-11-08 07:45:09,671 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 3373 treesize of output 3305 [2022-11-08 07:45:09,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 3597 treesize of output 3533 [2022-11-08 07:45:09,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 3436 treesize of output 3340 [2022-11-08 07:45:10,838 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-08 07:45:10,839 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 33 [2022-11-08 07:45:16,001 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-08 07:45:16,002 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 925 treesize of output 879 [2022-11-08 07:45:20,450 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-08 07:45:20,450 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 85 [2022-11-08 07:45:20,846 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 6 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 18 not checked. [2022-11-08 07:45:20,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275069119] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-08 07:45:20,846 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-08 07:45:20,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 47, 57] total 144 [2022-11-08 07:45:20,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596651887] [2022-11-08 07:45:20,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-08 07:45:20,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 144 states [2022-11-08 07:45:20,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-08 07:45:20,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2022-11-08 07:45:20,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1434, Invalid=14420, Unknown=216, NotChecked=4522, Total=20592 [2022-11-08 07:45:20,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:45:20,853 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-08 07:45:20,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 144 states, 144 states have (on average 5.555555555555555) internal successors, (800), 144 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-08 07:45:20,854 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:45:20,854 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:45:20,854 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:45:20,854 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:45:20,854 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:45:20,854 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-08 07:45:20,854 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-11-08 07:45:20,854 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-08 07:45:20,854 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-11-08 07:45:20,855 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2022-11-08 07:45:20,855 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-08 07:45:20,855 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2022-11-08 07:45:20,855 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:45:56,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-08 07:45:56,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:45:56,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:45:56,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-08 07:45:56,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-08 07:45:56,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-08 07:45:56,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-08 07:45:56,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-08 07:45:56,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-08 07:45:56,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-11-08 07:45:56,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-08 07:45:56,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-11-08 07:45:56,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-11-08 07:45:56,216 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3bbf59-43f2-4747-a86e-61c04e1b5533/bin/ugemcutter-QpsTfqS70U/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-08 07:45:56,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3bbf59-43f2-4747-a86e-61c04e1b5533/bin/ugemcutter-QpsTfqS70U/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-08 07:45:56,400 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-08 07:45:56,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-08 07:45:56,401 INFO L85 PathProgramCache]: Analyzing trace with hash 684721550, now seen corresponding path program 1 times [2022-11-08 07:45:56,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-08 07:45:56,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736657598] [2022-11-08 07:45:56,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-08 07:45:56,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-08 07:45:56,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-08 07:46:40,968 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-08 07:46:40,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-08 07:46:40,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736657598] [2022-11-08 07:46:40,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736657598] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-08 07:46:40,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306861716] [2022-11-08 07:46:40,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-08 07:46:40,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-08 07:46:40,970 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3bbf59-43f2-4747-a86e-61c04e1b5533/bin/ugemcutter-QpsTfqS70U/z3 [2022-11-08 07:46:40,971 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3bbf59-43f2-4747-a86e-61c04e1b5533/bin/ugemcutter-QpsTfqS70U/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-08 07:46:40,978 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3bbf59-43f2-4747-a86e-61c04e1b5533/bin/ugemcutter-QpsTfqS70U/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-08 07:46:41,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-08 07:46:41,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 644 conjuncts, 183 conjunts are in the unsatisfiable core [2022-11-08 07:46:41,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-08 07:46:41,737 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-08 07:46:41,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-08 07:46:41,923 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-08 07:46:41,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-08 07:46:42,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2022-11-08 07:46:42,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 22 [2022-11-08 07:46:44,282 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 29 [2022-11-08 07:46:45,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:46:45,375 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-08 07:46:45,397 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-08 07:46:45,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 39 [2022-11-08 07:46:45,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:46:45,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:46:45,699 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2022-11-08 07:46:46,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 27 [2022-11-08 07:46:46,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:46:46,951 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 33 treesize of output 31 [2022-11-08 07:46:48,737 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 33 treesize of output 31 [2022-11-08 07:46:50,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:46:50,742 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-08 07:46:50,763 INFO L356 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-08 07:46:50,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 41 [2022-11-08 07:46:51,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:46:51,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:46:51,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:46:51,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:46:51,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2022-11-08 07:46:51,814 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2022-11-08 07:46:52,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:46:52,240 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2022-11-08 07:46:54,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:46:54,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:46:54,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:46:54,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:46:54,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 55 [2022-11-08 07:46:55,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:46:55,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2022-11-08 07:46:58,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:46:58,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:46:58,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:46:58,254 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-08 07:46:58,284 INFO L356 Elim1Store]: treesize reduction 66, result has 29.8 percent of original size [2022-11-08 07:46:58,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 60 [2022-11-08 07:46:58,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:46:58,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:46:58,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:46:58,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:46:58,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 55 [2022-11-08 07:46:59,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:46:59,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 46 [2022-11-08 07:46:59,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:46:59,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 43 [2022-11-08 07:47:01,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:47:01,155 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2022-11-08 07:47:01,168 INFO L356 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-11-08 07:47:01,168 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 24 [2022-11-08 07:47:01,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-08 07:47:01,446 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 [2022-11-08 07:47:01,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2022-11-08 07:47:02,078 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-08 07:47:02,078 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-08 07:47:02,846 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset|)) (.cse0 (= |c_t2Thread1of1ForFork1_dequeue_#t~mem43#1| 0))) (and (or .cse0 (forall ((v_ArrVal_1263 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| v_ArrVal_1263) |c_~#stored_elements~0.base|) .cse1))))) (or (forall ((v_ArrVal_1263 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| v_ArrVal_1263) |c_~#stored_elements~0.base|) .cse1) 1))) (not .cse0)))) is different from false [2022-11-08 07:50:23,279 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse14 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) (.cse22 (* |c_t1Thread1of1ForFork0_~i~0#1| 4))) (let ((.cse1 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 4)) (.cse5 (+ |c_~#stored_elements~0.offset| 8 .cse22)) (.cse3 (+ 1600 |c_~#queue~0.offset|)) (.cse8 (+ 1608 |c_~#queue~0.offset|)) (.cse9 (+ |c_~#queue~0.offset| 1604)) (.cse11 (+ |c_~#stored_elements~0.offset| 4 .cse22)) (.cse13 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse15 (+ (select .cse12 .cse14) 1))) (and (forall ((v_ArrVal_1251 Int) (v_ArrVal_1261 Int) (v_ArrVal_1244 Int) (v_ArrVal_1255 Int) (v_ArrVal_1257 Int) (v_ArrVal_1259 Int)) (let ((.cse0 (let ((.cse4 (let ((.cse6 (let ((.cse10 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse12 .cse13 v_ArrVal_1244) .cse14 .cse15)))) (store .cse10 |c_~#stored_elements~0.base| (store (select .cse10 |c_~#stored_elements~0.base|) .cse11 |c_t1Thread1of1ForFork0_~value~0#1|))))) (store .cse6 |c_~#queue~0.base| (store (store (let ((.cse7 (select .cse6 |c_~#queue~0.base|))) (store (store (store .cse7 .cse8 v_ArrVal_1251) .cse3 (+ (select .cse7 .cse3) 1)) (+ |c_~#queue~0.offset| (* (select .cse7 .cse9) 4)) v_ArrVal_1255)) .cse8 v_ArrVal_1257) .cse9 v_ArrVal_1259))))) (store .cse4 |c_~#stored_elements~0.base| (store (select .cse4 |c_~#stored_elements~0.base|) .cse5 v_ArrVal_1261))))) (or (forall ((v_ArrVal_1263 (Array Int Int))) (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_1263) |c_~#stored_elements~0.base|) .cse1) 0))) (= (let ((.cse2 (select .cse0 |c_~#queue~0.base|))) (select .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|))) 0)))) (forall ((v_ArrVal_1251 Int) (v_ArrVal_1261 Int) (v_ArrVal_1244 Int) (v_ArrVal_1255 Int) (v_ArrVal_1257 Int) (v_ArrVal_1259 Int)) (let ((.cse16 (let ((.cse18 (let ((.cse19 (let ((.cse21 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse12 .cse13 v_ArrVal_1244) .cse14 .cse15)))) (store .cse21 |c_~#stored_elements~0.base| (store (select .cse21 |c_~#stored_elements~0.base|) .cse11 |c_t1Thread1of1ForFork0_~value~0#1|))))) (store .cse19 |c_~#queue~0.base| (store (store (let ((.cse20 (select .cse19 |c_~#queue~0.base|))) (store (store (store .cse20 .cse8 v_ArrVal_1251) .cse3 (+ (select .cse20 .cse3) 1)) (+ |c_~#queue~0.offset| (* (select .cse20 .cse9) 4)) v_ArrVal_1255)) .cse8 v_ArrVal_1257) .cse9 v_ArrVal_1259))))) (store .cse18 |c_~#stored_elements~0.base| (store (select .cse18 |c_~#stored_elements~0.base|) .cse5 v_ArrVal_1261))))) (or (forall ((v_ArrVal_1263 (Array Int Int))) (not (= (select (select (store .cse16 |c_~#queue~0.base| v_ArrVal_1263) |c_~#stored_elements~0.base|) .cse1) 1))) (not (= (let ((.cse17 (select .cse16 |c_~#queue~0.base|))) (select .cse17 (+ (* (select .cse17 .cse3) 4) |c_~#queue~0.offset|))) 0)))))))) is different from false [2022-11-08 07:52:44,837 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse14 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse12 (let ((.cse23 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (store .cse23 (+ (* (select .cse23 .cse14) 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) |c_t1Thread1of1ForFork0_enqueue_#in~x#1|))) (.cse22 (* |c_t1Thread1of1ForFork0_~i~0#1| 4))) (let ((.cse3 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 4)) (.cse5 (+ |c_~#stored_elements~0.offset| 8 .cse22)) (.cse1 (+ 1600 |c_~#queue~0.offset|)) (.cse8 (+ 1608 |c_~#queue~0.offset|)) (.cse9 (+ |c_~#queue~0.offset| 1604)) (.cse11 (+ |c_~#stored_elements~0.offset| 4 .cse22)) (.cse13 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse15 (+ (select .cse12 .cse14) 1))) (and (forall ((v_ArrVal_1251 Int) (v_ArrVal_1261 Int) (v_ArrVal_1244 Int) (v_ArrVal_1255 Int) (v_ArrVal_1257 Int) (v_ArrVal_1259 Int)) (let ((.cse2 (let ((.cse4 (let ((.cse6 (let ((.cse10 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse12 .cse13 v_ArrVal_1244) .cse14 .cse15)))) (store .cse10 |c_~#stored_elements~0.base| (store (select .cse10 |c_~#stored_elements~0.base|) .cse11 |c_t1Thread1of1ForFork0_~value~0#1|))))) (store .cse6 |c_~#queue~0.base| (store (store (let ((.cse7 (select .cse6 |c_~#queue~0.base|))) (store (store (store .cse7 .cse8 v_ArrVal_1251) .cse1 (+ 1 (select .cse7 .cse1))) (+ (* (select .cse7 .cse9) 4) |c_~#queue~0.offset|) v_ArrVal_1255)) .cse8 v_ArrVal_1257) .cse9 v_ArrVal_1259))))) (store .cse4 |c_~#stored_elements~0.base| (store (select .cse4 |c_~#stored_elements~0.base|) .cse5 v_ArrVal_1261))))) (or (= (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (select .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|))) 0) (forall ((v_ArrVal_1263 (Array Int Int))) (not (= (select (select (store .cse2 |c_~#queue~0.base| v_ArrVal_1263) |c_~#stored_elements~0.base|) .cse3) 0)))))) (forall ((v_ArrVal_1251 Int) (v_ArrVal_1261 Int) (v_ArrVal_1244 Int) (v_ArrVal_1255 Int) (v_ArrVal_1257 Int) (v_ArrVal_1259 Int)) (let ((.cse17 (let ((.cse18 (let ((.cse19 (let ((.cse21 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse12 .cse13 v_ArrVal_1244) .cse14 .cse15)))) (store .cse21 |c_~#stored_elements~0.base| (store (select .cse21 |c_~#stored_elements~0.base|) .cse11 |c_t1Thread1of1ForFork0_~value~0#1|))))) (store .cse19 |c_~#queue~0.base| (store (store (let ((.cse20 (select .cse19 |c_~#queue~0.base|))) (store (store (store .cse20 .cse8 v_ArrVal_1251) .cse1 (+ 1 (select .cse20 .cse1))) (+ (* (select .cse20 .cse9) 4) |c_~#queue~0.offset|) v_ArrVal_1255)) .cse8 v_ArrVal_1257) .cse9 v_ArrVal_1259))))) (store .cse18 |c_~#stored_elements~0.base| (store (select .cse18 |c_~#stored_elements~0.base|) .cse5 v_ArrVal_1261))))) (or (not (= (let ((.cse16 (select .cse17 |c_~#queue~0.base|))) (select .cse16 (+ (* (select .cse16 .cse1) 4) |c_~#queue~0.offset|))) 0)) (forall ((v_ArrVal_1263 (Array Int Int))) (not (= (select (select (store .cse17 |c_~#queue~0.base| v_ArrVal_1263) |c_~#stored_elements~0.base|) .cse3) 1)))))))))) is different from false [2022-11-08 07:52:47,329 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse9 (+ |c_~#queue~0.offset| 1604)) (.cse22 (* |c_t1Thread1of1ForFork0_~i~0#1| 4))) (let ((.cse3 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 4)) (.cse5 (+ |c_~#stored_elements~0.offset| 8 .cse22)) (.cse1 (+ 1600 |c_~#queue~0.offset|)) (.cse11 (+ |c_~#stored_elements~0.offset| 4 .cse22)) (.cse8 (+ 1608 |c_~#queue~0.offset|)) (.cse14 (+ (* (select .cse13 .cse9) 4) |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1251 Int) (v_ArrVal_1261 Int) (v_ArrVal_1244 Int) (v_ArrVal_1255 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1257 Int) (v_ArrVal_1259 Int)) (let ((.cse2 (let ((.cse4 (let ((.cse6 (let ((.cse10 (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse12 (store .cse13 .cse14 |t1Thread1of1ForFork0_~value~0#1|))) (store (store .cse12 .cse8 v_ArrVal_1244) .cse9 (+ (select .cse12 .cse9) 1)))))) (store .cse10 |c_~#stored_elements~0.base| (store (select .cse10 |c_~#stored_elements~0.base|) .cse11 |t1Thread1of1ForFork0_~value~0#1|))))) (store .cse6 |c_~#queue~0.base| (store (store (let ((.cse7 (select .cse6 |c_~#queue~0.base|))) (store (store (store .cse7 .cse8 v_ArrVal_1251) .cse1 (+ (select .cse7 .cse1) 1)) (+ (* 4 (select .cse7 .cse9)) |c_~#queue~0.offset|) v_ArrVal_1255)) .cse8 v_ArrVal_1257) .cse9 v_ArrVal_1259))))) (store .cse4 |c_~#stored_elements~0.base| (store (select .cse4 |c_~#stored_elements~0.base|) .cse5 v_ArrVal_1261))))) (or (= 0 (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (select .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1)))))) (forall ((v_ArrVal_1263 (Array Int Int))) (not (= (select (select (store .cse2 |c_~#queue~0.base| v_ArrVal_1263) |c_~#stored_elements~0.base|) .cse3) 0)))))) (forall ((v_ArrVal_1251 Int) (v_ArrVal_1261 Int) (v_ArrVal_1244 Int) (v_ArrVal_1255 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1257 Int) (v_ArrVal_1259 Int)) (let ((.cse15 (let ((.cse17 (let ((.cse18 (let ((.cse20 (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse21 (store .cse13 .cse14 |t1Thread1of1ForFork0_~value~0#1|))) (store (store .cse21 .cse8 v_ArrVal_1244) .cse9 (+ (select .cse21 .cse9) 1)))))) (store .cse20 |c_~#stored_elements~0.base| (store (select .cse20 |c_~#stored_elements~0.base|) .cse11 |t1Thread1of1ForFork0_~value~0#1|))))) (store .cse18 |c_~#queue~0.base| (store (store (let ((.cse19 (select .cse18 |c_~#queue~0.base|))) (store (store (store .cse19 .cse8 v_ArrVal_1251) .cse1 (+ (select .cse19 .cse1) 1)) (+ (* 4 (select .cse19 .cse9)) |c_~#queue~0.offset|) v_ArrVal_1255)) .cse8 v_ArrVal_1257) .cse9 v_ArrVal_1259))))) (store .cse17 |c_~#stored_elements~0.base| (store (select .cse17 |c_~#stored_elements~0.base|) .cse5 v_ArrVal_1261))))) (or (forall ((v_ArrVal_1263 (Array Int Int))) (not (= (select (select (store .cse15 |c_~#queue~0.base| v_ArrVal_1263) |c_~#stored_elements~0.base|) .cse3) 1))) (not (= 0 (let ((.cse16 (select .cse15 |c_~#queue~0.base|))) (select .cse16 (+ |c_~#queue~0.offset| (* 4 (select .cse16 .cse1))))))))))))) is different from false [2022-11-08 07:54:09,527 WARN L233 SmtUtils]: Spent 6.43s on a formula simplification that was a NOOP. DAG size: 77 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-08 07:54:12,159 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse24 (* |c_t1Thread1of1ForFork0_~i~0#1| 4))) (let ((.cse3 (+ |c_~#stored_elements~0.offset| 4)) (.cse5 (+ |c_~#stored_elements~0.offset| 8 .cse24)) (.cse1 (+ 1600 |c_~#queue~0.offset|)) (.cse11 (+ |c_~#stored_elements~0.offset| 4 .cse24)) (.cse8 (+ 1608 |c_~#queue~0.offset|)) (.cse9 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1251 Int) (v_ArrVal_1261 Int) (v_ArrVal_1244 Int) (v_ArrVal_1255 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1257 Int) (v_ArrVal_1259 Int) (v_ArrVal_1241 (Array Int Int))) (let ((.cse2 (let ((.cse4 (let ((.cse6 (let ((.cse10 (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1241))) (store .cse12 |c_~#queue~0.base| (let ((.cse13 (let ((.cse14 (select .cse12 |c_~#queue~0.base|))) (store .cse14 (+ (* 4 (select .cse14 .cse9)) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse13 .cse8 v_ArrVal_1244) .cse9 (+ (select .cse13 .cse9) 1))))))) (store .cse10 |c_~#stored_elements~0.base| (store (select .cse10 |c_~#stored_elements~0.base|) .cse11 |t1Thread1of1ForFork0_~value~0#1|))))) (store .cse6 |c_~#queue~0.base| (store (store (let ((.cse7 (select .cse6 |c_~#queue~0.base|))) (store (store (store .cse7 .cse8 v_ArrVal_1251) .cse1 (+ (select .cse7 .cse1) 1)) (+ (* (select .cse7 .cse9) 4) |c_~#queue~0.offset|) v_ArrVal_1255)) .cse8 v_ArrVal_1257) .cse9 v_ArrVal_1259))))) (store .cse4 |c_~#stored_elements~0.base| (store (select .cse4 |c_~#stored_elements~0.base|) .cse5 v_ArrVal_1261))))) (or (= (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (select .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|))) 0) (forall ((v_ArrVal_1263 (Array Int Int))) (not (= (select (select (store .cse2 |c_~#queue~0.base| v_ArrVal_1263) |c_~#stored_elements~0.base|) .cse3) 0)))))) (forall ((v_ArrVal_1251 Int) (v_ArrVal_1261 Int) (v_ArrVal_1244 Int) (v_ArrVal_1255 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1257 Int) (v_ArrVal_1259 Int) (v_ArrVal_1241 (Array Int Int))) (let ((.cse16 (let ((.cse17 (let ((.cse18 (let ((.cse20 (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1241))) (store .cse21 |c_~#queue~0.base| (let ((.cse22 (let ((.cse23 (select .cse21 |c_~#queue~0.base|))) (store .cse23 (+ (* 4 (select .cse23 .cse9)) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse22 .cse8 v_ArrVal_1244) .cse9 (+ (select .cse22 .cse9) 1))))))) (store .cse20 |c_~#stored_elements~0.base| (store (select .cse20 |c_~#stored_elements~0.base|) .cse11 |t1Thread1of1ForFork0_~value~0#1|))))) (store .cse18 |c_~#queue~0.base| (store (store (let ((.cse19 (select .cse18 |c_~#queue~0.base|))) (store (store (store .cse19 .cse8 v_ArrVal_1251) .cse1 (+ (select .cse19 .cse1) 1)) (+ (* (select .cse19 .cse9) 4) |c_~#queue~0.offset|) v_ArrVal_1255)) .cse8 v_ArrVal_1257) .cse9 v_ArrVal_1259))))) (store .cse17 |c_~#stored_elements~0.base| (store (select .cse17 |c_~#stored_elements~0.base|) .cse5 v_ArrVal_1261))))) (or (not (= (let ((.cse15 (select .cse16 |c_~#queue~0.base|))) (select .cse15 (+ (* 4 (select .cse15 .cse1)) |c_~#queue~0.offset|))) 0)) (forall ((v_ArrVal_1263 (Array Int Int))) (not (= (select (select (store .cse16 |c_~#queue~0.base| v_ArrVal_1263) |c_~#stored_elements~0.base|) .cse3) 1))))))))) is different from false [2022-11-08 07:54:12,995 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_~#stored_elements~0.offset| 8)) (.cse1 (+ 1600 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#stored_elements~0.offset| 4)) (.cse8 (+ 1608 |c_~#queue~0.offset|)) (.cse9 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1251 Int) (v_ArrVal_1261 Int) (v_ArrVal_1244 Int) (v_ArrVal_1255 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1257 Int) (v_ArrVal_1259 Int) (v_ArrVal_1241 (Array Int Int))) (let ((.cse2 (let ((.cse4 (let ((.cse6 (let ((.cse10 (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1241))) (store .cse11 |c_~#queue~0.base| (let ((.cse12 (let ((.cse13 (select .cse11 |c_~#queue~0.base|))) (store .cse13 (+ (* 4 (select .cse13 .cse9)) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse12 .cse8 v_ArrVal_1244) .cse9 (+ (select .cse12 .cse9) 1))))))) (store .cse10 |c_~#stored_elements~0.base| (store (select .cse10 |c_~#stored_elements~0.base|) .cse3 |t1Thread1of1ForFork0_~value~0#1|))))) (store .cse6 |c_~#queue~0.base| (store (store (let ((.cse7 (select .cse6 |c_~#queue~0.base|))) (store (store (store .cse7 .cse8 v_ArrVal_1251) .cse1 (+ (select .cse7 .cse1) 1)) (+ (* (select .cse7 .cse9) 4) |c_~#queue~0.offset|) v_ArrVal_1255)) .cse8 v_ArrVal_1257) .cse9 v_ArrVal_1259))))) (store .cse4 |c_~#stored_elements~0.base| (store (select .cse4 |c_~#stored_elements~0.base|) .cse5 v_ArrVal_1261))))) (or (not (= (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (select .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))))) 0)) (forall ((v_ArrVal_1263 (Array Int Int))) (not (= (select (select (store .cse2 |c_~#queue~0.base| v_ArrVal_1263) |c_~#stored_elements~0.base|) .cse3) 1)))))) (forall ((v_ArrVal_1251 Int) (v_ArrVal_1261 Int) (v_ArrVal_1244 Int) (v_ArrVal_1255 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1257 Int) (v_ArrVal_1259 Int) (v_ArrVal_1241 (Array Int Int))) (let ((.cse15 (let ((.cse16 (let ((.cse17 (let ((.cse19 (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1241))) (store .cse20 |c_~#queue~0.base| (let ((.cse21 (let ((.cse22 (select .cse20 |c_~#queue~0.base|))) (store .cse22 (+ (* 4 (select .cse22 .cse9)) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse21 .cse8 v_ArrVal_1244) .cse9 (+ (select .cse21 .cse9) 1))))))) (store .cse19 |c_~#stored_elements~0.base| (store (select .cse19 |c_~#stored_elements~0.base|) .cse3 |t1Thread1of1ForFork0_~value~0#1|))))) (store .cse17 |c_~#queue~0.base| (store (store (let ((.cse18 (select .cse17 |c_~#queue~0.base|))) (store (store (store .cse18 .cse8 v_ArrVal_1251) .cse1 (+ (select .cse18 .cse1) 1)) (+ (* (select .cse18 .cse9) 4) |c_~#queue~0.offset|) v_ArrVal_1255)) .cse8 v_ArrVal_1257) .cse9 v_ArrVal_1259))))) (store .cse16 |c_~#stored_elements~0.base| (store (select .cse16 |c_~#stored_elements~0.base|) .cse5 v_ArrVal_1261))))) (or (= (let ((.cse14 (select .cse15 |c_~#queue~0.base|))) (select .cse14 (+ |c_~#queue~0.offset| (* 4 (select .cse14 .cse1))))) 0) (forall ((v_ArrVal_1263 (Array Int Int))) (not (= (select (select (store .cse15 |c_~#queue~0.base| v_ArrVal_1263) |c_~#stored_elements~0.base|) .cse3) 0)))))))) is different from false [2022-11-08 07:54:15,319 WARN L833 $PredicateComparison]: unable to prove that (or (= |c_t1Thread1of1ForFork0_empty_#t~mem31#1| |c_t1Thread1of1ForFork0_empty_#t~mem32#1|) (let ((.cse5 (+ |c_~#stored_elements~0.offset| 8)) (.cse1 (+ 1600 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#stored_elements~0.offset| 4)) (.cse8 (+ 1608 |c_~#queue~0.offset|)) (.cse9 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1251 Int) (v_ArrVal_1261 Int) (v_ArrVal_1244 Int) (v_ArrVal_1255 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1257 Int) (v_ArrVal_1259 Int) (v_ArrVal_1241 (Array Int Int))) (let ((.cse2 (let ((.cse4 (let ((.cse6 (let ((.cse10 (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1241))) (store .cse11 |c_~#queue~0.base| (let ((.cse12 (let ((.cse13 (select .cse11 |c_~#queue~0.base|))) (store .cse13 (+ (* 4 (select .cse13 .cse9)) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse12 .cse8 v_ArrVal_1244) .cse9 (+ (select .cse12 .cse9) 1))))))) (store .cse10 |c_~#stored_elements~0.base| (store (select .cse10 |c_~#stored_elements~0.base|) .cse3 |t1Thread1of1ForFork0_~value~0#1|))))) (store .cse6 |c_~#queue~0.base| (store (store (let ((.cse7 (select .cse6 |c_~#queue~0.base|))) (store (store (store .cse7 .cse8 v_ArrVal_1251) .cse1 (+ (select .cse7 .cse1) 1)) (+ (* (select .cse7 .cse9) 4) |c_~#queue~0.offset|) v_ArrVal_1255)) .cse8 v_ArrVal_1257) .cse9 v_ArrVal_1259))))) (store .cse4 |c_~#stored_elements~0.base| (store (select .cse4 |c_~#stored_elements~0.base|) .cse5 v_ArrVal_1261))))) (or (not (= (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (select .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))))) 0)) (forall ((v_ArrVal_1263 (Array Int Int))) (not (= (select (select (store .cse2 |c_~#queue~0.base| v_ArrVal_1263) |c_~#stored_elements~0.base|) .cse3) 1)))))) (forall ((v_ArrVal_1251 Int) (v_ArrVal_1261 Int) (v_ArrVal_1244 Int) (v_ArrVal_1255 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1257 Int) (v_ArrVal_1259 Int) (v_ArrVal_1241 (Array Int Int))) (let ((.cse15 (let ((.cse16 (let ((.cse17 (let ((.cse19 (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1241))) (store .cse20 |c_~#queue~0.base| (let ((.cse21 (let ((.cse22 (select .cse20 |c_~#queue~0.base|))) (store .cse22 (+ (* 4 (select .cse22 .cse9)) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse21 .cse8 v_ArrVal_1244) .cse9 (+ (select .cse21 .cse9) 1))))))) (store .cse19 |c_~#stored_elements~0.base| (store (select .cse19 |c_~#stored_elements~0.base|) .cse3 |t1Thread1of1ForFork0_~value~0#1|))))) (store .cse17 |c_~#queue~0.base| (store (store (let ((.cse18 (select .cse17 |c_~#queue~0.base|))) (store (store (store .cse18 .cse8 v_ArrVal_1251) .cse1 (+ (select .cse18 .cse1) 1)) (+ (* (select .cse18 .cse9) 4) |c_~#queue~0.offset|) v_ArrVal_1255)) .cse8 v_ArrVal_1257) .cse9 v_ArrVal_1259))))) (store .cse16 |c_~#stored_elements~0.base| (store (select .cse16 |c_~#stored_elements~0.base|) .cse5 v_ArrVal_1261))))) (or (= (let ((.cse14 (select .cse15 |c_~#queue~0.base|))) (select .cse14 (+ |c_~#queue~0.offset| (* 4 (select .cse14 .cse1))))) 0) (forall ((v_ArrVal_1263 (Array Int Int))) (not (= (select (select (store .cse15 |c_~#queue~0.base| v_ArrVal_1263) |c_~#stored_elements~0.base|) .cse3) 0))))))))) is different from false [2022-11-08 07:54:16,135 WARN L833 $PredicateComparison]: unable to prove that (or (= |c_t1Thread1of1ForFork0_empty_#t~mem31#1| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_empty_~q#1.base|) (+ |c_t1Thread1of1ForFork0_empty_~q#1.offset| 1604))) (let ((.cse5 (+ |c_~#stored_elements~0.offset| 8)) (.cse1 (+ 1600 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#stored_elements~0.offset| 4)) (.cse8 (+ 1608 |c_~#queue~0.offset|)) (.cse9 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1251 Int) (v_ArrVal_1261 Int) (v_ArrVal_1244 Int) (v_ArrVal_1255 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1257 Int) (v_ArrVal_1259 Int) (v_ArrVal_1241 (Array Int Int))) (let ((.cse2 (let ((.cse4 (let ((.cse6 (let ((.cse10 (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1241))) (store .cse11 |c_~#queue~0.base| (let ((.cse12 (let ((.cse13 (select .cse11 |c_~#queue~0.base|))) (store .cse13 (+ (* 4 (select .cse13 .cse9)) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse12 .cse8 v_ArrVal_1244) .cse9 (+ (select .cse12 .cse9) 1))))))) (store .cse10 |c_~#stored_elements~0.base| (store (select .cse10 |c_~#stored_elements~0.base|) .cse3 |t1Thread1of1ForFork0_~value~0#1|))))) (store .cse6 |c_~#queue~0.base| (store (store (let ((.cse7 (select .cse6 |c_~#queue~0.base|))) (store (store (store .cse7 .cse8 v_ArrVal_1251) .cse1 (+ (select .cse7 .cse1) 1)) (+ (* (select .cse7 .cse9) 4) |c_~#queue~0.offset|) v_ArrVal_1255)) .cse8 v_ArrVal_1257) .cse9 v_ArrVal_1259))))) (store .cse4 |c_~#stored_elements~0.base| (store (select .cse4 |c_~#stored_elements~0.base|) .cse5 v_ArrVal_1261))))) (or (not (= (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (select .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))))) 0)) (forall ((v_ArrVal_1263 (Array Int Int))) (not (= (select (select (store .cse2 |c_~#queue~0.base| v_ArrVal_1263) |c_~#stored_elements~0.base|) .cse3) 1)))))) (forall ((v_ArrVal_1251 Int) (v_ArrVal_1261 Int) (v_ArrVal_1244 Int) (v_ArrVal_1255 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1257 Int) (v_ArrVal_1259 Int) (v_ArrVal_1241 (Array Int Int))) (let ((.cse15 (let ((.cse16 (let ((.cse17 (let ((.cse19 (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1241))) (store .cse20 |c_~#queue~0.base| (let ((.cse21 (let ((.cse22 (select .cse20 |c_~#queue~0.base|))) (store .cse22 (+ (* 4 (select .cse22 .cse9)) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse21 .cse8 v_ArrVal_1244) .cse9 (+ (select .cse21 .cse9) 1))))))) (store .cse19 |c_~#stored_elements~0.base| (store (select .cse19 |c_~#stored_elements~0.base|) .cse3 |t1Thread1of1ForFork0_~value~0#1|))))) (store .cse17 |c_~#queue~0.base| (store (store (let ((.cse18 (select .cse17 |c_~#queue~0.base|))) (store (store (store .cse18 .cse8 v_ArrVal_1251) .cse1 (+ (select .cse18 .cse1) 1)) (+ (* (select .cse18 .cse9) 4) |c_~#queue~0.offset|) v_ArrVal_1255)) .cse8 v_ArrVal_1257) .cse9 v_ArrVal_1259))))) (store .cse16 |c_~#stored_elements~0.base| (store (select .cse16 |c_~#stored_elements~0.base|) .cse5 v_ArrVal_1261))))) (or (= (let ((.cse14 (select .cse15 |c_~#queue~0.base|))) (select .cse14 (+ |c_~#queue~0.offset| (* 4 (select .cse14 .cse1))))) 0) (forall ((v_ArrVal_1263 (Array Int Int))) (not (= (select (select (store .cse15 |c_~#queue~0.base| v_ArrVal_1263) |c_~#stored_elements~0.base|) .cse3) 0))))))))) is different from false [2022-11-08 07:54:16,744 WARN L833 $PredicateComparison]: unable to prove that (or (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_empty_~q#1.base|))) (= (select .cse0 (+ 1600 |c_t1Thread1of1ForFork0_empty_~q#1.offset|)) (select .cse0 (+ |c_t1Thread1of1ForFork0_empty_~q#1.offset| 1604)))) (let ((.cse6 (+ |c_~#stored_elements~0.offset| 8)) (.cse2 (+ 1600 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#stored_elements~0.offset| 4)) (.cse9 (+ 1608 |c_~#queue~0.offset|)) (.cse10 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1251 Int) (v_ArrVal_1261 Int) (v_ArrVal_1244 Int) (v_ArrVal_1255 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1257 Int) (v_ArrVal_1259 Int) (v_ArrVal_1241 (Array Int Int))) (let ((.cse3 (let ((.cse5 (let ((.cse7 (let ((.cse11 (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1241))) (store .cse12 |c_~#queue~0.base| (let ((.cse13 (let ((.cse14 (select .cse12 |c_~#queue~0.base|))) (store .cse14 (+ (* 4 (select .cse14 .cse10)) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse13 .cse9 v_ArrVal_1244) .cse10 (+ (select .cse13 .cse10) 1))))))) (store .cse11 |c_~#stored_elements~0.base| (store (select .cse11 |c_~#stored_elements~0.base|) .cse4 |t1Thread1of1ForFork0_~value~0#1|))))) (store .cse7 |c_~#queue~0.base| (store (store (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (store (store (store .cse8 .cse9 v_ArrVal_1251) .cse2 (+ (select .cse8 .cse2) 1)) (+ (* (select .cse8 .cse10) 4) |c_~#queue~0.offset|) v_ArrVal_1255)) .cse9 v_ArrVal_1257) .cse10 v_ArrVal_1259))))) (store .cse5 |c_~#stored_elements~0.base| (store (select .cse5 |c_~#stored_elements~0.base|) .cse6 v_ArrVal_1261))))) (or (not (= (let ((.cse1 (select .cse3 |c_~#queue~0.base|))) (select .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))))) 0)) (forall ((v_ArrVal_1263 (Array Int Int))) (not (= (select (select (store .cse3 |c_~#queue~0.base| v_ArrVal_1263) |c_~#stored_elements~0.base|) .cse4) 1)))))) (forall ((v_ArrVal_1251 Int) (v_ArrVal_1261 Int) (v_ArrVal_1244 Int) (v_ArrVal_1255 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1257 Int) (v_ArrVal_1259 Int) (v_ArrVal_1241 (Array Int Int))) (let ((.cse16 (let ((.cse17 (let ((.cse18 (let ((.cse20 (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1241))) (store .cse21 |c_~#queue~0.base| (let ((.cse22 (let ((.cse23 (select .cse21 |c_~#queue~0.base|))) (store .cse23 (+ (* 4 (select .cse23 .cse10)) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse22 .cse9 v_ArrVal_1244) .cse10 (+ (select .cse22 .cse10) 1))))))) (store .cse20 |c_~#stored_elements~0.base| (store (select .cse20 |c_~#stored_elements~0.base|) .cse4 |t1Thread1of1ForFork0_~value~0#1|))))) (store .cse18 |c_~#queue~0.base| (store (store (let ((.cse19 (select .cse18 |c_~#queue~0.base|))) (store (store (store .cse19 .cse9 v_ArrVal_1251) .cse2 (+ (select .cse19 .cse2) 1)) (+ (* (select .cse19 .cse10) 4) |c_~#queue~0.offset|) v_ArrVal_1255)) .cse9 v_ArrVal_1257) .cse10 v_ArrVal_1259))))) (store .cse17 |c_~#stored_elements~0.base| (store (select .cse17 |c_~#stored_elements~0.base|) .cse6 v_ArrVal_1261))))) (or (= (let ((.cse15 (select .cse16 |c_~#queue~0.base|))) (select .cse15 (+ |c_~#queue~0.offset| (* 4 (select .cse15 .cse2))))) 0) (forall ((v_ArrVal_1263 (Array Int Int))) (not (= (select (select (store .cse16 |c_~#queue~0.base| v_ArrVal_1263) |c_~#stored_elements~0.base|) .cse4) 0))))))))) is different from false [2022-11-08 07:54:17,644 WARN L833 $PredicateComparison]: unable to prove that (or (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_empty_#in~q#1.base|))) (= (select .cse0 (+ |c_t1Thread1of1ForFork0_empty_#in~q#1.offset| 1600)) (select .cse0 (+ |c_t1Thread1of1ForFork0_empty_#in~q#1.offset| 1604)))) (let ((.cse6 (+ |c_~#stored_elements~0.offset| 8)) (.cse2 (+ 1600 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#stored_elements~0.offset| 4)) (.cse9 (+ 1608 |c_~#queue~0.offset|)) (.cse10 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1251 Int) (v_ArrVal_1261 Int) (v_ArrVal_1244 Int) (v_ArrVal_1255 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1257 Int) (v_ArrVal_1259 Int) (v_ArrVal_1241 (Array Int Int))) (let ((.cse3 (let ((.cse5 (let ((.cse7 (let ((.cse11 (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1241))) (store .cse12 |c_~#queue~0.base| (let ((.cse13 (let ((.cse14 (select .cse12 |c_~#queue~0.base|))) (store .cse14 (+ (* 4 (select .cse14 .cse10)) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse13 .cse9 v_ArrVal_1244) .cse10 (+ (select .cse13 .cse10) 1))))))) (store .cse11 |c_~#stored_elements~0.base| (store (select .cse11 |c_~#stored_elements~0.base|) .cse4 |t1Thread1of1ForFork0_~value~0#1|))))) (store .cse7 |c_~#queue~0.base| (store (store (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (store (store (store .cse8 .cse9 v_ArrVal_1251) .cse2 (+ (select .cse8 .cse2) 1)) (+ (* (select .cse8 .cse10) 4) |c_~#queue~0.offset|) v_ArrVal_1255)) .cse9 v_ArrVal_1257) .cse10 v_ArrVal_1259))))) (store .cse5 |c_~#stored_elements~0.base| (store (select .cse5 |c_~#stored_elements~0.base|) .cse6 v_ArrVal_1261))))) (or (not (= (let ((.cse1 (select .cse3 |c_~#queue~0.base|))) (select .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))))) 0)) (forall ((v_ArrVal_1263 (Array Int Int))) (not (= (select (select (store .cse3 |c_~#queue~0.base| v_ArrVal_1263) |c_~#stored_elements~0.base|) .cse4) 1)))))) (forall ((v_ArrVal_1251 Int) (v_ArrVal_1261 Int) (v_ArrVal_1244 Int) (v_ArrVal_1255 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1257 Int) (v_ArrVal_1259 Int) (v_ArrVal_1241 (Array Int Int))) (let ((.cse16 (let ((.cse17 (let ((.cse18 (let ((.cse20 (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1241))) (store .cse21 |c_~#queue~0.base| (let ((.cse22 (let ((.cse23 (select .cse21 |c_~#queue~0.base|))) (store .cse23 (+ (* 4 (select .cse23 .cse10)) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse22 .cse9 v_ArrVal_1244) .cse10 (+ (select .cse22 .cse10) 1))))))) (store .cse20 |c_~#stored_elements~0.base| (store (select .cse20 |c_~#stored_elements~0.base|) .cse4 |t1Thread1of1ForFork0_~value~0#1|))))) (store .cse18 |c_~#queue~0.base| (store (store (let ((.cse19 (select .cse18 |c_~#queue~0.base|))) (store (store (store .cse19 .cse9 v_ArrVal_1251) .cse2 (+ (select .cse19 .cse2) 1)) (+ (* (select .cse19 .cse10) 4) |c_~#queue~0.offset|) v_ArrVal_1255)) .cse9 v_ArrVal_1257) .cse10 v_ArrVal_1259))))) (store .cse17 |c_~#stored_elements~0.base| (store (select .cse17 |c_~#stored_elements~0.base|) .cse6 v_ArrVal_1261))))) (or (= (let ((.cse15 (select .cse16 |c_~#queue~0.base|))) (select .cse15 (+ |c_~#queue~0.offset| (* 4 (select .cse15 .cse2))))) 0) (forall ((v_ArrVal_1263 (Array Int Int))) (not (= (select (select (store .cse16 |c_~#queue~0.base| v_ArrVal_1263) |c_~#stored_elements~0.base|) .cse4) 0))))))))) is different from false