./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-more-inc-subseq.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e7fbc69 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_9b0e9dcc-063a-438a-b857-68a9c1ab6d9c/bin/ugemcutter-1C6z4D84am/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b0e9dcc-063a-438a-b857-68a9c1ab6d9c/bin/ugemcutter-1C6z4D84am/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b0e9dcc-063a-438a-b857-68a9c1ab6d9c/bin/ugemcutter-1C6z4D84am/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b0e9dcc-063a-438a-b857-68a9c1ab6d9c/bin/ugemcutter-1C6z4D84am/config/GemCutterReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-inc-subseq.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b0e9dcc-063a-438a-b857-68a9c1ab6d9c/bin/ugemcutter-1C6z4D84am/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b0e9dcc-063a-438a-b857-68a9c1ab6d9c/bin/ugemcutter-1C6z4D84am --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 cd94157895dc71e9f24fce5dbc4a71d4e4b55c4da9be28372139a3001decae0a --- 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-4e7fbc6 [2022-11-23 06:54:51,389 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 06:54:51,391 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 06:54:51,429 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 06:54:51,429 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 06:54:51,430 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 06:54:51,431 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 06:54:51,433 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 06:54:51,435 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 06:54:51,435 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 06:54:51,436 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 06:54:51,438 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 06:54:51,438 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 06:54:51,446 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 06:54:51,449 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 06:54:51,453 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 06:54:51,454 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 06:54:51,455 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 06:54:51,456 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 06:54:51,458 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 06:54:51,460 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 06:54:51,469 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 06:54:51,470 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 06:54:51,471 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 06:54:51,474 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 06:54:51,475 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 06:54:51,475 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 06:54:51,476 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 06:54:51,476 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 06:54:51,477 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 06:54:51,477 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 06:54:51,478 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 06:54:51,487 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 06:54:51,488 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 06:54:51,489 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 06:54:51,490 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 06:54:51,491 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 06:54:51,491 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 06:54:51,491 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 06:54:51,493 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 06:54:51,493 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 06:54:51,494 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b0e9dcc-063a-438a-b857-68a9c1ab6d9c/bin/ugemcutter-1C6z4D84am/config/svcomp-Reach-32bit-GemCutter_Default.epf [2022-11-23 06:54:51,534 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 06:54:51,534 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 06:54:51,534 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 06:54:51,535 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 06:54:51,535 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 06:54:51,535 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 06:54:51,536 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 06:54:51,536 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 06:54:51,536 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 06:54:51,536 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 06:54:51,537 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 06:54:51,537 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 06:54:51,537 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 06:54:51,537 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 06:54:51,537 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 06:54:51,537 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 06:54:51,538 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 06:54:51,538 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 06:54:51,538 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 06:54:51,538 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 06:54:51,538 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 06:54:51,539 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 06:54:51,539 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 06:54:51,539 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 06:54:51,539 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 06:54:51,539 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 06:54:51,539 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 06:54:51,540 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 06:54:51,540 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-23 06:54:51,540 INFO L138 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2022-11-23 06:54:51,540 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 06:54:51,540 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-23 06:54:51,540 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-23 06:54:51,541 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 06:54:51,541 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-23 06:54:51,541 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-23 06:54:51,541 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_9b0e9dcc-063a-438a-b857-68a9c1ab6d9c/bin/ugemcutter-1C6z4D84am/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_9b0e9dcc-063a-438a-b857-68a9c1ab6d9c/bin/ugemcutter-1C6z4D84am 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 -> cd94157895dc71e9f24fce5dbc4a71d4e4b55c4da9be28372139a3001decae0a [2022-11-23 06:54:51,836 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 06:54:51,861 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 06:54:51,864 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 06:54:51,866 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 06:54:51,866 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 06:54:51,867 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b0e9dcc-063a-438a-b857-68a9c1ab6d9c/bin/ugemcutter-1C6z4D84am/../../sv-benchmarks/c/weaver/popl20-more-inc-subseq.wvr.c [2022-11-23 06:54:54,984 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 06:54:55,233 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 06:54:55,234 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b0e9dcc-063a-438a-b857-68a9c1ab6d9c/sv-benchmarks/c/weaver/popl20-more-inc-subseq.wvr.c [2022-11-23 06:54:55,241 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b0e9dcc-063a-438a-b857-68a9c1ab6d9c/bin/ugemcutter-1C6z4D84am/data/a1645deb8/408f145357a74d68b13d8d73b49786c3/FLAGef079a7fe [2022-11-23 06:54:55,256 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b0e9dcc-063a-438a-b857-68a9c1ab6d9c/bin/ugemcutter-1C6z4D84am/data/a1645deb8/408f145357a74d68b13d8d73b49786c3 [2022-11-23 06:54:55,260 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 06:54:55,262 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 06:54:55,263 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 06:54:55,263 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 06:54:55,267 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 06:54:55,267 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:54:55" (1/1) ... [2022-11-23 06:54:55,268 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@266d1ed5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:54:55, skipping insertion in model container [2022-11-23 06:54:55,269 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:54:55" (1/1) ... [2022-11-23 06:54:55,276 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 06:54:55,307 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 06:54:55,482 WARN L237 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_9b0e9dcc-063a-438a-b857-68a9c1ab6d9c/sv-benchmarks/c/weaver/popl20-more-inc-subseq.wvr.c[2924,2937] [2022-11-23 06:54:55,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 06:54:55,500 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 06:54:55,538 WARN L237 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_9b0e9dcc-063a-438a-b857-68a9c1ab6d9c/sv-benchmarks/c/weaver/popl20-more-inc-subseq.wvr.c[2924,2937] [2022-11-23 06:54:55,561 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 06:54:55,603 INFO L208 MainTranslator]: Completed translation [2022-11-23 06:54:55,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:54:55 WrapperNode [2022-11-23 06:54:55,604 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 06:54:55,607 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 06:54:55,607 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 06:54:55,607 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 06:54:55,614 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:54:55" (1/1) ... [2022-11-23 06:54:55,639 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:54:55" (1/1) ... [2022-11-23 06:54:55,661 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 191 [2022-11-23 06:54:55,661 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 06:54:55,662 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 06:54:55,662 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 06:54:55,662 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 06:54:55,672 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:54:55" (1/1) ... [2022-11-23 06:54:55,672 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:54:55" (1/1) ... [2022-11-23 06:54:55,675 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:54:55" (1/1) ... [2022-11-23 06:54:55,675 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:54:55" (1/1) ... [2022-11-23 06:54:55,693 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:54:55" (1/1) ... [2022-11-23 06:54:55,698 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:54:55" (1/1) ... [2022-11-23 06:54:55,700 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:54:55" (1/1) ... [2022-11-23 06:54:55,701 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:54:55" (1/1) ... [2022-11-23 06:54:55,704 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 06:54:55,705 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 06:54:55,705 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 06:54:55,705 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 06:54:55,706 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:54:55" (1/1) ... [2022-11-23 06:54:55,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 06:54:55,742 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b0e9dcc-063a-438a-b857-68a9c1ab6d9c/bin/ugemcutter-1C6z4D84am/z3 [2022-11-23 06:54:55,752 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b0e9dcc-063a-438a-b857-68a9c1ab6d9c/bin/ugemcutter-1C6z4D84am/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 06:54:55,763 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b0e9dcc-063a-438a-b857-68a9c1ab6d9c/bin/ugemcutter-1C6z4D84am/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 06:54:55,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 06:54:55,792 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-23 06:54:55,792 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-23 06:54:55,792 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-23 06:54:55,793 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-23 06:54:55,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 06:54:55,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 06:54:55,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 06:54:55,793 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-23 06:54:55,793 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-23 06:54:55,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-23 06:54:55,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 06:54:55,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 06:54:55,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-23 06:54:55,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 06:54:55,796 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-23 06:54:55,911 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 06:54:55,913 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 06:54:56,294 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 06:54:56,435 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 06:54:56,436 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-23 06:54:56,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:54:56 BoogieIcfgContainer [2022-11-23 06:54:56,439 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 06:54:56,441 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 06:54:56,441 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 06:54:56,444 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 06:54:56,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 06:54:55" (1/3) ... [2022-11-23 06:54:56,445 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@715c55ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:54:56, skipping insertion in model container [2022-11-23 06:54:56,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:54:55" (2/3) ... [2022-11-23 06:54:56,446 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@715c55ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:54:56, skipping insertion in model container [2022-11-23 06:54:56,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:54:56" (3/3) ... [2022-11-23 06:54:56,448 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-inc-subseq.wvr.c [2022-11-23 06:54:56,457 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-23 06:54:56,468 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 06:54:56,469 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-23 06:54:56,469 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 06:54:56,549 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-23 06:54:56,601 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 06:54:56,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-23 06:54:56,602 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b0e9dcc-063a-438a-b857-68a9c1ab6d9c/bin/ugemcutter-1C6z4D84am/z3 [2022-11-23 06:54:56,605 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b0e9dcc-063a-438a-b857-68a9c1ab6d9c/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-23 06:54:56,612 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b0e9dcc-063a-438a-b857-68a9c1ab6d9c/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-11-23 06:54:56,659 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-23 06:54:56,674 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2022-11-23 06:54:56,680 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;@1e00fb79, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 06:54:56,681 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-11-23 06:54:56,896 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-23 06:54:56,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:54:56,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1885589734, now seen corresponding path program 1 times [2022-11-23 06:54:56,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:54:56,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877309039] [2022-11-23 06:54:56,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:54:56,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:54:57,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:54:57,320 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-23 06:54:57,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:54:57,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877309039] [2022-11-23 06:54:57,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877309039] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 06:54:57,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 06:54:57,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 06:54:57,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161322256] [2022-11-23 06:54:57,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 06:54:57,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-23 06:54:57,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:54:57,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-23 06:54:57,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 06:54:57,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:57,368 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:54:57,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 69.0) internal successors, (138), 2 states have internal predecessors, (138), 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-23 06:54:57,371 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:57,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:57,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 06:54:57,443 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-23 06:54:57,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:54:57,444 INFO L85 PathProgramCache]: Analyzing trace with hash 532094629, now seen corresponding path program 1 times [2022-11-23 06:54:57,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:54:57,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363061929] [2022-11-23 06:54:57,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:54:57,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:54:57,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:54:58,062 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-23 06:54:58,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:54:58,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363061929] [2022-11-23 06:54:58,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363061929] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 06:54:58,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 06:54:58,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 06:54:58,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683131524] [2022-11-23 06:54:58,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 06:54:58,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 06:54:58,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:54:58,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 06:54:58,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 06:54:58,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:58,068 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:54:58,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 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-23 06:54:58,068 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:58,069 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:58,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:58,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 06:54:58,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 06:54:58,220 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-23 06:54:58,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:54:58,221 INFO L85 PathProgramCache]: Analyzing trace with hash 90971035, now seen corresponding path program 1 times [2022-11-23 06:54:58,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:54:58,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925768822] [2022-11-23 06:54:58,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:54:58,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:54:58,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:54:58,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 06:54:58,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:54:58,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925768822] [2022-11-23 06:54:58,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925768822] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 06:54:58,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 06:54:58,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 06:54:58,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385594314] [2022-11-23 06:54:58,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 06:54:58,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 06:54:58,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:54:58,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 06:54:58,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 06:54:58,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:58,762 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:54:58,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 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-23 06:54:58,763 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:58,764 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-23 06:54:58,764 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:59,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:59,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 06:54:59,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:54:59,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 06:54:59,005 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-23 06:54:59,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:54:59,009 INFO L85 PathProgramCache]: Analyzing trace with hash 276527094, now seen corresponding path program 1 times [2022-11-23 06:54:59,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:54:59,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784840981] [2022-11-23 06:54:59,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:54:59,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:54:59,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:54:59,308 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 06:54:59,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:54:59,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784840981] [2022-11-23 06:54:59,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784840981] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 06:54:59,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 06:54:59,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 06:54:59,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38931895] [2022-11-23 06:54:59,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 06:54:59,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 06:54:59,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:54:59,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 06:54:59,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-23 06:54:59,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:59,318 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:54:59,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 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-23 06:54:59,318 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:59,318 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-23 06:54:59,318 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:54:59,318 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:59,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:59,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 06:54:59,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:54:59,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:54:59,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 06:54:59,673 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-23 06:54:59,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:54:59,674 INFO L85 PathProgramCache]: Analyzing trace with hash 83365203, now seen corresponding path program 1 times [2022-11-23 06:54:59,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:54:59,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064665224] [2022-11-23 06:54:59,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:54:59,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:54:59,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:54:59,975 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 06:54:59,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:54:59,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064665224] [2022-11-23 06:54:59,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064665224] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 06:54:59,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 06:54:59,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-23 06:54:59,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889581902] [2022-11-23 06:54:59,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 06:54:59,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 06:54:59,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:54:59,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 06:54:59,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-23 06:54:59,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:59,980 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:54:59,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.857142857142858) internal successors, (153), 7 states have internal predecessors, (153), 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-23 06:54:59,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:59,982 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-23 06:54:59,982 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:54:59,982 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:54:59,982 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:55:00,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:55:00,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 06:55:00,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:55:00,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:55:00,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:55:00,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 06:55:00,253 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-23 06:55:00,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:55:00,254 INFO L85 PathProgramCache]: Analyzing trace with hash -732015546, now seen corresponding path program 1 times [2022-11-23 06:55:00,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:55:00,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704251122] [2022-11-23 06:55:00,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:55:00,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:55:00,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:55:03,032 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 06:55:03,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:55:03,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704251122] [2022-11-23 06:55:03,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704251122] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 06:55:03,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466826003] [2022-11-23 06:55:03,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:55:03,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 06:55:03,035 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b0e9dcc-063a-438a-b857-68a9c1ab6d9c/bin/ugemcutter-1C6z4D84am/z3 [2022-11-23 06:55:03,065 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b0e9dcc-063a-438a-b857-68a9c1ab6d9c/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 06:55:03,086 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b0e9dcc-063a-438a-b857-68a9c1ab6d9c/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-23 06:55:03,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:55:03,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-23 06:55:03,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 06:55:05,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-23 06:55:05,553 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 06:55:05,553 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 06:55:06,223 INFO L321 Elim1Store]: treesize reduction 15, result has 83.9 percent of original size [2022-11-23 06:55:06,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 74 treesize of output 103 [2022-11-23 06:55:08,201 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 06:55:08,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466826003] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 06:55:08,204 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 06:55:08,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25, 20] total 57 [2022-11-23 06:55:08,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428528952] [2022-11-23 06:55:08,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 06:55:08,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-11-23 06:55:08,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:55:08,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-11-23 06:55:08,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=529, Invalid=2663, Unknown=0, NotChecked=0, Total=3192 [2022-11-23 06:55:08,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:55:08,211 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:55:08,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 7.175438596491228) internal successors, (409), 57 states have internal predecessors, (409), 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-23 06:55:08,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:55:08,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-23 06:55:08,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:55:08,213 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:55:08,214 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:55:08,217 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:55:16,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:55:16,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 06:55:16,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:55:16,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:55:16,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:55:16,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-11-23 06:55:16,194 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b0e9dcc-063a-438a-b857-68a9c1ab6d9c/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-23 06:55:16,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b0e9dcc-063a-438a-b857-68a9c1ab6d9c/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 06:55:16,394 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-23 06:55:16,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:55:16,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1531297126, now seen corresponding path program 2 times [2022-11-23 06:55:16,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:55:16,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026906749] [2022-11-23 06:55:16,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:55:16,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:55:16,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:55:16,816 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 06:55:16,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:55:16,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026906749] [2022-11-23 06:55:16,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026906749] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 06:55:16,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445178398] [2022-11-23 06:55:16,817 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 06:55:16,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 06:55:16,817 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b0e9dcc-063a-438a-b857-68a9c1ab6d9c/bin/ugemcutter-1C6z4D84am/z3 [2022-11-23 06:55:16,818 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b0e9dcc-063a-438a-b857-68a9c1ab6d9c/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 06:55:16,838 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b0e9dcc-063a-438a-b857-68a9c1ab6d9c/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-23 06:55:17,147 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 06:55:17,147 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 06:55:17,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-23 06:55:17,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 06:55:17,390 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 06:55:17,391 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 06:55:17,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445178398] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 06:55:17,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 06:55:17,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2022-11-23 06:55:17,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898057868] [2022-11-23 06:55:17,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 06:55:17,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 06:55:17,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:55:17,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 06:55:17,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-23 06:55:17,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:55:17,394 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:55:17,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 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-23 06:55:17,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:55:17,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-23 06:55:17,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:55:17,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:55:17,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:55:17,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 76 states. [2022-11-23 06:55:17,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:55:20,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:55:20,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 06:55:20,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:55:20,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:55:20,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:55:20,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-11-23 06:55:20,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 06:55:20,088 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b0e9dcc-063a-438a-b857-68a9c1ab6d9c/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-23 06:55:20,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b0e9dcc-063a-438a-b857-68a9c1ab6d9c/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 06:55:20,279 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-23 06:55:20,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:55:20,279 INFO L85 PathProgramCache]: Analyzing trace with hash 81772503, now seen corresponding path program 3 times [2022-11-23 06:55:20,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:55:20,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7954937] [2022-11-23 06:55:20,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:55:20,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:55:20,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:55:20,631 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 06:55:20,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:55:20,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7954937] [2022-11-23 06:55:20,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7954937] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 06:55:20,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924100895] [2022-11-23 06:55:20,632 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 06:55:20,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 06:55:20,632 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b0e9dcc-063a-438a-b857-68a9c1ab6d9c/bin/ugemcutter-1C6z4D84am/z3 [2022-11-23 06:55:20,633 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b0e9dcc-063a-438a-b857-68a9c1ab6d9c/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 06:55:20,654 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b0e9dcc-063a-438a-b857-68a9c1ab6d9c/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-23 06:55:20,967 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-23 06:55:20,967 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 06:55:20,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-23 06:55:20,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 06:55:21,296 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 06:55:21,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 06:55:21,721 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 06:55:21,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924100895] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 06:55:21,722 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 06:55:21,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 24 [2022-11-23 06:55:21,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055950262] [2022-11-23 06:55:21,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 06:55:21,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-23 06:55:21,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:55:21,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-23 06:55:21,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2022-11-23 06:55:21,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:55:21,763 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:55:21,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 15.0) internal successors, (360), 24 states have internal predecessors, (360), 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-23 06:55:21,764 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:55:21,764 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-23 06:55:21,764 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:55:21,764 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:55:21,764 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:55:21,764 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 94 states. [2022-11-23 06:55:21,764 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-23 06:55:21,765 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:55:26,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:55:26,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 06:55:26,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:55:26,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:55:26,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:55:26,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2022-11-23 06:55:26,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 06:55:26,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-11-23 06:55:26,587 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b0e9dcc-063a-438a-b857-68a9c1ab6d9c/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-23 06:55:26,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b0e9dcc-063a-438a-b857-68a9c1ab6d9c/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-23 06:55:26,781 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-23 06:55:26,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:55:26,781 INFO L85 PathProgramCache]: Analyzing trace with hash -282215482, now seen corresponding path program 4 times [2022-11-23 06:55:26,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:55:26,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676454230] [2022-11-23 06:55:26,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:55:26,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:55:26,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:55:30,333 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 06:55:30,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:55:30,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676454230] [2022-11-23 06:55:30,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676454230] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 06:55:30,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634083056] [2022-11-23 06:55:30,333 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 06:55:30,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 06:55:30,334 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b0e9dcc-063a-438a-b857-68a9c1ab6d9c/bin/ugemcutter-1C6z4D84am/z3 [2022-11-23 06:55:30,335 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b0e9dcc-063a-438a-b857-68a9c1ab6d9c/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 06:55:30,358 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b0e9dcc-063a-438a-b857-68a9c1ab6d9c/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-23 06:55:30,471 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 06:55:30,471 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 06:55:30,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 64 conjunts are in the unsatisfiable core [2022-11-23 06:55:30,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 06:55:31,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 06:55:31,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 06:55:32,419 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 06:55:32,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-23 06:55:32,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 06:55:33,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 06:55:34,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 06:55:34,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-23 06:55:35,021 INFO L321 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-11-23 06:55:35,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 10 [2022-11-23 06:55:35,103 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 06:55:35,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 06:55:36,072 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse1 (+ (* c_~end~0 4) c_~queue~0.offset)) (.cse2 (+ c_~A~0.offset (* c_~i~0 4)))) (and (or (forall ((v_ArrVal_196 (Array Int Int))) (not (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (= (select (select .cse0 c_~queue~0.base) .cse1) (select (select .cse0 c_~A~0.base) .cse2))))) (not (= (mod c_~ok~0 256) 0))) (forall ((v_ArrVal_196 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (let ((.cse3 (select .cse4 c_~queue~0.base))) (or (not (= (select .cse3 .cse1) (select (select .cse4 c_~A~0.base) .cse2))) (< c_~v_old~0 (+ (select .cse3 (+ (* c_~start~0 4) c_~queue~0.offset)) 1)))))))) (not (< c_~end~0 c_~n~0)) (not (<= c_~last~0 |c_thread1Thread1of1ForFork0_#t~mem1#1|)) (not (<= 0 c_~end~0)) (and (not (< c_~start~0 c_~end~0)) (not (< c_~i~0 c_~N~0)))) is different from false [2022-11-23 06:55:41,473 WARN L837 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~end~0) (let ((.cse4 (+ (* c_~end~0 4) c_~queue~0.offset))) (and (forall ((~A~0.offset Int) (v_ArrVal_195 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (~i~0 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195))) (let ((.cse3 (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (let ((.cse1 (+ (* ~i~0 4) ~A~0.offset)) (.cse2 (select .cse3 c_~queue~0.base))) (or (< (select (select .cse0 c_~A~0.base) .cse1) (+ (select .cse2 (+ (* c_~start~0 4) c_~queue~0.offset)) 1)) (not (= (select (select .cse3 c_~A~0.base) .cse1) (select .cse2 .cse4)))))))) (or (not (= (mod c_~ok~0 256) 0)) (forall ((~A~0.offset Int) (v_ArrVal_195 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (~i~0 Int)) (not (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (= (select (select .cse5 c_~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select .cse5 c_~queue~0.base) .cse4)))))))) (< c_~end~0 0)) is different from false [2022-11-23 06:55:47,656 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:55:47,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 123 treesize of output 87 [2022-11-23 06:55:47,705 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:55:47,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 5148 treesize of output 4750 [2022-11-23 06:55:47,781 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:55:47,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 4700 treesize of output 4408 [2022-11-23 06:55:47,862 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:55:47,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 4364 treesize of output 3448 [2022-11-23 06:55:47,973 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:55:47,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3404 treesize of output 2776 [2022-11-23 06:55:59,684 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:55:59,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 51 [2022-11-23 06:55:59,736 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:55:59,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 217078 treesize of output 200714 [2022-11-23 06:56:00,487 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:56:00,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 200694 treesize of output 176135 [2022-11-23 06:56:01,015 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:56:01,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 176118 treesize of output 163847 [2022-11-23 06:56:01,539 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:56:01,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163830 treesize of output 114695 [2022-11-23 06:56:16,057 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:56:16,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 78 [2022-11-23 06:56:16,997 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 06:56:16,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634083056] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 06:56:16,998 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 06:56:16,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 35, 35] total 92 [2022-11-23 06:56:16,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46678637] [2022-11-23 06:56:16,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 06:56:16,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 92 states [2022-11-23 06:56:17,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:56:17,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2022-11-23 06:56:17,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=831, Invalid=7105, Unknown=82, NotChecked=354, Total=8372 [2022-11-23 06:56:17,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:56:17,005 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:56:17,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 92 states, 92 states have (on average 4.5978260869565215) internal successors, (423), 92 states have internal predecessors, (423), 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-23 06:56:17,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:56:17,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-23 06:56:17,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:56:17,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:56:17,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:56:17,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 110 states. [2022-11-23 06:56:17,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-23 06:56:17,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2022-11-23 06:56:17,007 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:56:38,917 WARN L233 SmtUtils]: Spent 21.15s on a formula simplification that was a NOOP. DAG size: 306 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 06:56:39,040 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse26 (* c_~end~0 4)) (.cse24 (* c_~start~0 4))) (let ((.cse2 (not (= (mod c_~ok~0 256) 0))) (.cse4 (= .cse26 .cse24))) (let ((.cse5 (and (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_main_~#t2~0#1.base| 1)) .cse2 .cse4)) (.cse0 (<= c_~n~0 c_~end~0)) (.cse1 (< c_~end~0 0)) (.cse11 (+ .cse24 c_~queue~0.offset)) (.cse9 (+ .cse26 c_~queue~0.offset))) (and (or .cse0 .cse1 (let ((.cse3 (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| Int)) (or (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22|) 0)))))) (and (or (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|) (not (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (or .cse2 .cse3) (or .cse3 .cse4) (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| Int)) (or (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| |c_ULTIMATE.start_main_~#t2~0#1.base|) (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22|) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))))) (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (or .cse0 .cse1 .cse5 (< 1 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|)) (or .cse0 (and (forall ((v_~A~0.base_19 Int)) (or (not (<= v_~A~0.base_19 |c_ULTIMATE.start_main_#t~ret13#1.base|)) (forall ((~A~0.offset Int) (v_ArrVal_195 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (~i~0 Int)) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195))) (let ((.cse6 (store .cse10 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (let ((.cse7 (+ (* ~i~0 4) ~A~0.offset)) (.cse8 (select .cse6 c_~queue~0.base))) (or (not (= (select (select .cse6 v_~A~0.base_19) .cse7) (select .cse8 .cse9))) (< (select (select .cse10 v_~A~0.base_19) .cse7) (+ (select .cse8 .cse11) 1))))))))) (or .cse2 (forall ((v_~A~0.base_19 Int) (~A~0.offset Int) (v_ArrVal_195 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (~i~0 Int)) (or (not (let ((.cse12 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (= (select (select .cse12 v_~A~0.base_19) (+ (* ~i~0 4) ~A~0.offset)) (select (select .cse12 c_~queue~0.base) .cse9)))) (not (<= v_~A~0.base_19 |c_ULTIMATE.start_main_#t~ret13#1.base|)))))) .cse1) (or .cse0 .cse1 (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse5) (or .cse0 .cse1 (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| Int)) (or (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| |c_#StackHeapBarrier|)) (forall ((v_~A~0.base_19 Int) (~A~0.offset Int) (v_ArrVal_195 (Array Int Int)) (v_ArrVal_194 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (~i~0 Int)) (let ((.cse13 (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| v_ArrVal_194) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195))) (let ((.cse16 (store .cse13 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (let ((.cse15 (select .cse16 c_~queue~0.base)) (.cse14 (+ (* ~i~0 4) ~A~0.offset))) (or (< (select (select .cse13 v_~A~0.base_19) .cse14) (+ (select .cse15 .cse11) 1)) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| v_~A~0.base_19) (not (= (select .cse15 .cse9) (select (select .cse16 v_~A~0.base_19) .cse14)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22|) 0)))) (or .cse2 (forall ((v_~A~0.base_19 Int) (~A~0.offset Int) (v_ArrVal_195 (Array Int Int)) (v_ArrVal_194 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| Int) (v_ArrVal_196 (Array Int Int)) (~i~0 Int)) (or (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22|) 0)) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| v_~A~0.base_19) (not (let ((.cse17 (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| v_ArrVal_194) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (= (select (select .cse17 c_~queue~0.base) .cse9) (select (select .cse17 v_~A~0.base_19) (+ (* ~i~0 4) ~A~0.offset)))))))))) (let ((.cse18 (select |c_#memory_int| c_~queue~0.base))) (or (not (< c_~end~0 c_~n~0)) (not (= (select .cse18 .cse9) (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (and .cse2 (< c_~v_old~0 (+ (select .cse18 .cse11) 1))) (not (<= 0 c_~end~0)) (= (mod |c_thread2Thread1of1ForFork1_~cond~0#1| 256) 0))) (or .cse0 .cse1 (let ((.cse20 (+ .cse26 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| Int)) (or (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22|) 0)) (forall ((v_~A~0.base_19 Int) (~A~0.offset Int) (v_ArrVal_195 (Array Int Int)) (v_ArrVal_194 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (~i~0 Int)) (let ((.cse23 (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| v_ArrVal_194) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195))) (let ((.cse21 (store .cse23 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (let ((.cse22 (+ (* ~i~0 4) ~A~0.offset)) (.cse19 (select .cse21 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse19 .cse20) (select (select .cse21 v_~A~0.base_19) .cse22))) (< (select (select .cse23 v_~A~0.base_19) .cse22) (+ (select .cse19 (+ .cse24 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| v_~A~0.base_19)))))))) (or .cse2 (forall ((v_~A~0.base_19 Int) (~A~0.offset Int) (v_ArrVal_195 (Array Int Int)) (v_ArrVal_194 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| Int) (v_ArrVal_196 (Array Int Int)) (~i~0 Int)) (or (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| |c_#StackHeapBarrier|)) (not (let ((.cse25 (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| v_ArrVal_194) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (= (select (select .cse25 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse20) (select (select .cse25 v_~A~0.base_19) (+ (* ~i~0 4) ~A~0.offset))))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22|) 0)) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| v_~A~0.base_19))))))) (or .cse0 .cse1 (and (forall ((v_~A~0.base_19 Int) (~A~0.offset Int) (v_ArrVal_195 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (~i~0 Int)) (let ((.cse30 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195))) (let ((.cse27 (store .cse30 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (let ((.cse28 (+ (* ~i~0 4) ~A~0.offset)) (.cse29 (select .cse27 c_~queue~0.base))) (or (not (= (select (select .cse27 v_~A~0.base_19) .cse28) (select .cse29 .cse9))) (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| v_~A~0.base_19) (< (select (select .cse30 v_~A~0.base_19) .cse28) (+ (select .cse29 .cse11) 1))))))) (or .cse2 (forall ((v_~A~0.base_19 Int) (~A~0.offset Int) (v_ArrVal_195 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (~i~0 Int)) (or (not (let ((.cse31 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (= (select (select .cse31 v_~A~0.base_19) (+ (* ~i~0 4) ~A~0.offset)) (select (select .cse31 c_~queue~0.base) .cse9)))) (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| v_~A~0.base_19)))))) (or .cse0 (let ((.cse33 (+ .cse26 |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| Int)) (or (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| |c_#StackHeapBarrier|)) (forall ((v_~A~0.base_19 Int) (~A~0.offset Int) (v_ArrVal_195 (Array Int Int)) (v_ArrVal_194 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (~i~0 Int)) (let ((.cse36 (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| v_ArrVal_194) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195))) (let ((.cse34 (store .cse36 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (let ((.cse35 (+ (* ~i~0 4) ~A~0.offset)) (.cse32 (select .cse34 |c_ULTIMATE.start_main_#t~ret12#1.base|))) (or (not (= (select .cse32 .cse33) (select (select .cse34 v_~A~0.base_19) .cse35))) (< (select (select .cse36 v_~A~0.base_19) .cse35) (+ (select .cse32 (+ .cse24 |c_ULTIMATE.start_main_#t~ret12#1.offset|)) 1)) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| v_~A~0.base_19)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22|) 0)))) (or .cse2 (forall ((v_~A~0.base_19 Int) (~A~0.offset Int) (v_ArrVal_195 (Array Int Int)) (v_ArrVal_194 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| Int) (v_ArrVal_196 (Array Int Int)) (~i~0 Int)) (or (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| |c_#StackHeapBarrier|)) (not (let ((.cse37 (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| v_ArrVal_194) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (= (select (select .cse37 |c_ULTIMATE.start_main_#t~ret12#1.base|) .cse33) (select (select .cse37 v_~A~0.base_19) (+ (* ~i~0 4) ~A~0.offset))))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22|) 0)) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| v_~A~0.base_19)))))) .cse1) (or .cse0 (let ((.cse39 (+ .cse26 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| Int)) (or (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22|) 0)) (forall ((v_~A~0.base_19 Int) (~A~0.offset Int) (v_ArrVal_195 (Array Int Int)) (v_ArrVal_194 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (~i~0 Int)) (let ((.cse42 (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| v_ArrVal_194) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195))) (let ((.cse40 (store .cse42 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (let ((.cse41 (+ (* ~i~0 4) ~A~0.offset)) (.cse38 (select .cse40 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (select .cse38 .cse39) (select (select .cse40 v_~A~0.base_19) .cse41))) (< (select (select .cse42 v_~A~0.base_19) .cse41) (+ (select .cse38 (+ .cse24 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1)) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| v_~A~0.base_19)))))))) (or .cse2 (forall ((v_~A~0.base_19 Int) (~A~0.offset Int) (v_ArrVal_195 (Array Int Int)) (v_ArrVal_194 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| Int) (v_ArrVal_196 (Array Int Int)) (~i~0 Int)) (or (not (let ((.cse43 (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| v_ArrVal_194) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (= (select (select .cse43 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse39) (select (select .cse43 v_~A~0.base_19) (+ (* ~i~0 4) ~A~0.offset))))) (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22|) 0)) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| v_~A~0.base_19)))))) .cse1) (or .cse0 .cse1 (and (forall ((v_~A~0.base_19 Int) (~A~0.offset Int) (v_ArrVal_195 (Array Int Int)) (v_ArrVal_194 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (~i~0 Int)) (let ((.cse44 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| v_ArrVal_194) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195))) (let ((.cse47 (store .cse44 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (let ((.cse45 (+ (* ~i~0 4) ~A~0.offset)) (.cse46 (select .cse47 c_~queue~0.base))) (or (< (select (select .cse44 v_~A~0.base_19) .cse45) (+ (select .cse46 .cse11) 1)) (not (= (select (select .cse47 v_~A~0.base_19) .cse45) (select .cse46 .cse9))) (< |c_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| v_~A~0.base_19)))))) (or .cse2 (forall ((v_~A~0.base_19 Int) (~A~0.offset Int) (v_ArrVal_195 (Array Int Int)) (v_ArrVal_194 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (~i~0 Int)) (or (not (let ((.cse48 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| v_ArrVal_194) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (= (select (select .cse48 v_~A~0.base_19) (+ (* ~i~0 4) ~A~0.offset)) (select (select .cse48 c_~queue~0.base) .cse9)))) (< |c_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| v_~A~0.base_19)))))) (or .cse0 .cse1 (and (forall ((v_~A~0.base_19 Int) (~A~0.offset Int) (v_ArrVal_195 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (~i~0 Int)) (let ((.cse52 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195))) (let ((.cse49 (store .cse52 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (let ((.cse50 (+ (* ~i~0 4) ~A~0.offset)) (.cse51 (select .cse49 c_~queue~0.base))) (or (not (= (select (select .cse49 v_~A~0.base_19) .cse50) (select .cse51 .cse9))) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_~A~0.base_19) (< (select (select .cse52 v_~A~0.base_19) .cse50) (+ (select .cse51 .cse11) 1))))))) (or (forall ((v_~A~0.base_19 Int) (~A~0.offset Int) (v_ArrVal_195 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (~i~0 Int)) (or (not (let ((.cse53 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (= (select (select .cse53 v_~A~0.base_19) (+ (* ~i~0 4) ~A~0.offset)) (select (select .cse53 c_~queue~0.base) .cse9)))) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_~A~0.base_19))) .cse2))) (or .cse0 .cse1 (and (or (forall ((v_~A~0.base_19 Int) (~A~0.offset Int) (v_ArrVal_195 (Array Int Int)) (v_ArrVal_194 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (~i~0 Int)) (or (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_~A~0.base_19) (not (let ((.cse54 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_194) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (= (select (select .cse54 v_~A~0.base_19) (+ (* ~i~0 4) ~A~0.offset)) (select (select .cse54 c_~queue~0.base) .cse9)))))) .cse2) (forall ((v_~A~0.base_19 Int) (~A~0.offset Int) (v_ArrVal_195 (Array Int Int)) (v_ArrVal_194 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (~i~0 Int)) (let ((.cse55 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_194) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195))) (let ((.cse58 (store .cse55 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (let ((.cse56 (+ (* ~i~0 4) ~A~0.offset)) (.cse57 (select .cse58 c_~queue~0.base))) (or (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_~A~0.base_19) (< (select (select .cse55 v_~A~0.base_19) .cse56) (+ (select .cse57 .cse11) 1)) (not (= (select (select .cse58 v_~A~0.base_19) .cse56) (select .cse57 .cse9)))))))))))))) is different from false [2022-11-23 06:57:06,345 WARN L233 SmtUtils]: Spent 12.05s on a formula simplification. DAG size of input: 206 DAG size of output: 139 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 06:57:20,532 WARN L233 SmtUtils]: Spent 11.27s on a formula simplification. DAG size of input: 201 DAG size of output: 134 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 06:57:22,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 06:57:24,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 06:57:41,107 WARN L233 SmtUtils]: Spent 13.30s on a formula simplification. DAG size of input: 193 DAG size of output: 130 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 06:57:43,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 06:57:54,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 06:58:05,711 WARN L233 SmtUtils]: Spent 10.53s on a formula simplification. DAG size of input: 237 DAG size of output: 171 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 06:58:09,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 06:58:11,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 06:58:16,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 06:58:45,131 WARN L233 SmtUtils]: Spent 11.66s on a formula simplification. DAG size of input: 235 DAG size of output: 169 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 06:58:47,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 06:58:49,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 06:59:05,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 06:59:10,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 06:59:17,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 06:59:30,446 WARN L233 SmtUtils]: Spent 5.32s on a formula simplification. DAG size of input: 204 DAG size of output: 146 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 06:59:42,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 06:59:44,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 06:59:46,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 06:59:48,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 06:59:50,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 07:00:06,074 WARN L233 SmtUtils]: Spent 11.04s on a formula simplification. DAG size of input: 228 DAG size of output: 156 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 07:00:27,961 WARN L233 SmtUtils]: Spent 17.43s on a formula simplification. DAG size of input: 230 DAG size of output: 158 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 07:00:30,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 07:00:43,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 07:00:43,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 07:00:43,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 07:00:43,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 07:00:43,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 07:00:43,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2022-11-23 07:00:43,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 07:00:43,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-11-23 07:00:43,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-11-23 07:00:43,347 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b0e9dcc-063a-438a-b857-68a9c1ab6d9c/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-23 07:00:43,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b0e9dcc-063a-438a-b857-68a9c1ab6d9c/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 07:00:43,542 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-23 07:00:43,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 07:00:43,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1182337734, now seen corresponding path program 5 times [2022-11-23 07:00:43,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 07:00:43,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850243797] [2022-11-23 07:00:43,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 07:00:43,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 07:00:43,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 07:00:45,919 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 07:00:45,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 07:00:45,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850243797] [2022-11-23 07:00:45,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850243797] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 07:00:45,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871847902] [2022-11-23 07:00:45,919 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-23 07:00:45,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 07:00:45,920 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b0e9dcc-063a-438a-b857-68a9c1ab6d9c/bin/ugemcutter-1C6z4D84am/z3 [2022-11-23 07:00:45,923 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b0e9dcc-063a-438a-b857-68a9c1ab6d9c/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 07:00:45,937 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b0e9dcc-063a-438a-b857-68a9c1ab6d9c/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-23 07:00:46,055 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 07:00:46,055 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 07:00:46,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-23 07:00:46,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 07:00:46,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 07:00:46,413 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 07:00:46,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-23 07:00:51,657 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-23 07:00:51,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 44 [2022-11-23 07:00:51,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-11-23 07:00:52,211 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-11-23 07:00:52,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2022-11-23 07:00:52,290 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 07:00:52,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 07:00:53,372 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 07:00:53,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 94 treesize of output 139 [2022-11-23 07:00:53,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2022-11-23 07:00:56,722 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 07:00:56,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871847902] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 07:00:56,722 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 07:00:56,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22, 20] total 57 [2022-11-23 07:00:56,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653632798] [2022-11-23 07:00:56,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 07:00:56,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-11-23 07:00:56,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 07:00:56,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-11-23 07:00:56,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=2811, Unknown=2, NotChecked=0, Total=3192 [2022-11-23 07:00:56,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 07:00:56,725 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 07:00:56,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 7.4035087719298245) internal successors, (422), 57 states have internal predecessors, (422), 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-23 07:00:56,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 07:00:56,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-23 07:00:56,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 07:00:56,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-23 07:00:56,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-23 07:00:56,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 112 states. [2022-11-23 07:00:56,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-23 07:00:56,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2022-11-23 07:00:56,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 96 states. [2022-11-23 07:00:56,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 07:01:06,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 07:01:09,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 07:01:14,102 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 07:01:20,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 07:01:22,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 07:01:24,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 07:01:26,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 07:01:32,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 07:01:34,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 07:01:36,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 07:01:38,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 07:01:48,129 WARN L233 SmtUtils]: Spent 7.50s on a formula simplification. DAG size of input: 202 DAG size of output: 144 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 07:01:50,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 07:02:02,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 07:02:24,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 07:02:25,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 07:02:27,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 07:02:48,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 07:02:54,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 07:03:05,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 07:03:14,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 07:03:16,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 07:03:33,024 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (<= c_~n~0 c_~end~0)) (.cse1 (< c_~end~0 0)) (.cse7 (+ (* c_~start~0 4) c_~queue~0.offset)) (.cse5 (+ (* c_~end~0 4) c_~queue~0.offset)) (.cse8 (not (= (mod c_~ok~0 256) 0)))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (or .cse0 .cse1 (and (forall ((v_~A~0.base_19 Int) (~A~0.offset Int) (v_ArrVal_195 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (~i~0 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195))) (let ((.cse2 (store .cse6 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (let ((.cse3 (+ (* ~i~0 4) ~A~0.offset)) (.cse4 (select .cse2 c_~queue~0.base))) (or (not (= (select (select .cse2 v_~A~0.base_19) .cse3) (select .cse4 .cse5))) (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| v_~A~0.base_19) (< (select (select .cse6 v_~A~0.base_19) .cse3) (+ (select .cse4 .cse7) 1))))))) (or .cse8 (forall ((v_~A~0.base_19 Int) (~A~0.offset Int) (v_ArrVal_195 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (~i~0 Int)) (or (not (let ((.cse9 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (= (select (select .cse9 v_~A~0.base_19) (+ (* ~i~0 4) ~A~0.offset)) (select (select .cse9 c_~queue~0.base) .cse5)))) (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| v_~A~0.base_19)))))) (= c_~ok~0 1) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or .cse0 .cse1 (and (forall ((v_~A~0.base_19 Int) (~A~0.offset Int) (v_ArrVal_195 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (~i~0 Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195))) (let ((.cse10 (store .cse13 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (let ((.cse11 (+ (* ~i~0 4) ~A~0.offset)) (.cse12 (select .cse10 c_~queue~0.base))) (or (not (= (select (select .cse10 v_~A~0.base_19) .cse11) (select .cse12 .cse5))) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_~A~0.base_19) (< (select (select .cse13 v_~A~0.base_19) .cse11) (+ (select .cse12 .cse7) 1))))))) (or (forall ((v_~A~0.base_19 Int) (~A~0.offset Int) (v_ArrVal_195 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (~i~0 Int)) (or (not (let ((.cse14 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (= (select (select .cse14 v_~A~0.base_19) (+ (* ~i~0 4) ~A~0.offset)) (select (select .cse14 c_~queue~0.base) .cse5)))) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_~A~0.base_19))) .cse8))) (= c_~start~0 c_~end~0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|))) is different from false [2022-11-23 07:03:38,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 07:03:41,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 07:03:43,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 07:03:45,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 07:03:59,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 07:04:01,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 07:04:04,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 07:04:15,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 07:04:17,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 07:04:19,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 07:04:26,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 07:04:26,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 07:04:26,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 07:04:26,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 07:04:26,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 07:04:26,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2022-11-23 07:04:26,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 07:04:26,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-11-23 07:04:26,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2022-11-23 07:04:26,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2022-11-23 07:04:26,080 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b0e9dcc-063a-438a-b857-68a9c1ab6d9c/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-23 07:04:26,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b0e9dcc-063a-438a-b857-68a9c1ab6d9c/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-23 07:04:26,275 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-23 07:04:26,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 07:04:26,276 INFO L85 PathProgramCache]: Analyzing trace with hash -704172357, now seen corresponding path program 6 times [2022-11-23 07:04:26,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 07:04:26,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055101237] [2022-11-23 07:04:26,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 07:04:26,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 07:04:26,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 07:04:33,938 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 07:04:33,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 07:04:33,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055101237] [2022-11-23 07:04:33,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055101237] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 07:04:33,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730317125] [2022-11-23 07:04:33,939 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-23 07:04:33,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 07:04:33,939 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b0e9dcc-063a-438a-b857-68a9c1ab6d9c/bin/ugemcutter-1C6z4D84am/z3 [2022-11-23 07:04:33,940 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b0e9dcc-063a-438a-b857-68a9c1ab6d9c/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 07:04:33,943 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b0e9dcc-063a-438a-b857-68a9c1ab6d9c/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-23 07:04:34,362 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-11-23 07:04:34,362 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 07:04:34,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-23 07:04:34,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 07:04:38,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 07:04:38,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 07:04:38,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 07:04:38,961 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 07:04:39,988 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-23 07:04:39,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2022-11-23 07:04:40,071 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 07:04:40,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 07:04:41,514 WARN L837 $PredicateComparison]: unable to prove that (or (not (< c_~end~0 c_~n~0)) (let ((.cse1 (+ (* c_~end~0 4) c_~queue~0.offset)) (.cse2 (+ c_~A~0.offset (* c_~i~0 4)))) (and (or (forall ((~queue~0.base Int) (v_ArrVal_268 (Array Int Int))) (not (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_268))) (= (select (select .cse0 ~queue~0.base) .cse1) (select (select .cse0 c_~A~0.base) .cse2))))) (not (= (mod c_~ok~0 256) 0))) (forall ((~queue~0.base Int) (v_ArrVal_268 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_268))) (let ((.cse3 (select .cse4 ~queue~0.base))) (or (not (= (select .cse3 .cse1) (select (select .cse4 c_~A~0.base) .cse2))) (< c_~v_old~0 (+ (select .cse3 (+ (* c_~start~0 4) c_~queue~0.offset)) 1)))))))) (< c_~start~0 0) (not (<= 0 c_~end~0)) (<= c_~n~0 c_~start~0)) is different from false [2022-11-23 07:04:41,892 WARN L837 $PredicateComparison]: unable to prove that (or (not (< c_~end~0 c_~n~0)) (let ((.cse1 (+ (* c_~end~0 4) c_~queue~0.offset)) (.cse2 (+ c_~A~0.offset (* c_~i~0 4)))) (and (or (forall ((~queue~0.base Int) (v_ArrVal_267 (Array Int Int)) (v_ArrVal_268 (Array Int Int))) (not (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_267) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_268))) (= (select (select .cse0 ~queue~0.base) .cse1) (select (select .cse0 c_~A~0.base) .cse2))))) (not (= (mod c_~ok~0 256) 0))) (forall ((~queue~0.base Int) (v_ArrVal_267 (Array Int Int)) (v_ArrVal_268 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_267) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_268))) (let ((.cse3 (select .cse4 ~queue~0.base))) (or (not (= (select .cse3 .cse1) (select (select .cse4 c_~A~0.base) .cse2))) (< c_~v_old~0 (+ (select .cse3 (+ (* c_~start~0 4) c_~queue~0.offset)) 1)))))))) (< c_~start~0 0) (not (<= 0 c_~end~0)) (<= c_~n~0 c_~start~0)) is different from false [2022-11-23 07:04:42,635 INFO L321 Elim1Store]: treesize reduction 15, result has 89.9 percent of original size [2022-11-23 07:04:42,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 937 treesize of output 929 [2022-11-23 07:04:42,707 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 07:04:42,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 792 treesize of output 783 [2022-11-23 07:04:42,779 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 07:04:42,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 738 treesize of output 675 [2022-11-23 07:04:42,826 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 07:04:42,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 630 treesize of output 551 [2022-11-23 07:04:42,873 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 07:04:42,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 534 treesize of output 503 [2022-11-23 07:05:06,285 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-11-23 07:05:06,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1730317125] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 07:05:06,286 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 07:05:06,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 30, 31] total 89 [2022-11-23 07:05:06,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836267239] [2022-11-23 07:05:06,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 07:05:06,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 89 states [2022-11-23 07:05:06,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 07:05:06,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2022-11-23 07:05:06,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=728, Invalid=6754, Unknown=8, NotChecked=342, Total=7832 [2022-11-23 07:05:06,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 07:05:06,291 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 07:05:06,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 89 states, 89 states have (on average 4.865168539325842) internal successors, (433), 89 states have internal predecessors, (433), 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-23 07:05:06,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 07:05:06,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-23 07:05:06,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 07:05:06,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-23 07:05:06,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-23 07:05:06,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 151 states. [2022-11-23 07:05:06,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-23 07:05:06,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 73 states. [2022-11-23 07:05:06,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 159 states. [2022-11-23 07:05:06,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 98 states. [2022-11-23 07:05:06,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 07:05:39,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 07:05:41,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 07:05:44,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 07:05:46,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 07:05:48,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 07:05:50,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 07:05:52,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 07:05:57,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 07:05:57,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 07:05:57,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 07:05:57,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 07:05:57,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 07:05:57,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2022-11-23 07:05:57,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 07:05:57,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2022-11-23 07:05:57,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2022-11-23 07:05:57,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2022-11-23 07:05:57,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2022-11-23 07:05:57,399 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b0e9dcc-063a-438a-b857-68a9c1ab6d9c/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-23 07:05:57,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b0e9dcc-063a-438a-b857-68a9c1ab6d9c/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 07:05:57,595 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-23 07:05:57,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 07:05:57,595 INFO L85 PathProgramCache]: Analyzing trace with hash 335291463, now seen corresponding path program 7 times [2022-11-23 07:05:57,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 07:05:57,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828883985] [2022-11-23 07:05:57,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 07:05:57,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 07:05:57,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 07:06:02,450 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-23 07:06:02,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 07:06:02,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828883985] [2022-11-23 07:06:02,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828883985] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 07:06:02,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937763753] [2022-11-23 07:06:02,451 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-23 07:06:02,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 07:06:02,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b0e9dcc-063a-438a-b857-68a9c1ab6d9c/bin/ugemcutter-1C6z4D84am/z3 [2022-11-23 07:06:02,452 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b0e9dcc-063a-438a-b857-68a9c1ab6d9c/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 07:06:02,460 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b0e9dcc-063a-438a-b857-68a9c1ab6d9c/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-23 07:06:02,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 07:06:02,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 57 conjunts are in the unsatisfiable core [2022-11-23 07:06:02,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 07:06:07,575 INFO L321 Elim1Store]: treesize reduction 104, result has 35.4 percent of original size [2022-11-23 07:06:07,575 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 82 treesize of output 72 [2022-11-23 07:06:07,780 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-23 07:06:07,781 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 07:06:14,323 INFO L321 Elim1Store]: treesize reduction 214, result has 82.6 percent of original size [2022-11-23 07:06:14,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 78 case distinctions, treesize of input 262 treesize of output 1098 [2022-11-23 07:06:20,049 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:06:21,806 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:06:28,953 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:06:29,872 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:06:29,985 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 07:06:30,168 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:06:30,368 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:06:30,796 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:06:31,861 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:06:32,602 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:06:32,747 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 07:06:32,941 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:06:33,189 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:06:33,723 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:06:35,465 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:06:50,321 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:06:58,027 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:07:09,593 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:07:17,180 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:07:20,999 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:07:23,812 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:07:33,539 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:07:34,412 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:07:34,561 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 07:07:34,784 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:07:35,058 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:07:35,662 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:07:37,106 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:07:38,058 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:07:38,252 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 07:07:38,528 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:07:38,873 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:07:39,663 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:07:41,702 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:08:01,199 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:08:10,684 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:08:25,759 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:08:35,682 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:08:49,083 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:08:57,047 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 07:08:57,335 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:08:57,622 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:08:57,751 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:08:58,240 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:08:58,968 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:09:00,854 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:09:03,384 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 07:09:03,696 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:09:04,085 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:09:04,441 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:09:05,186 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:09:08,987 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts.