./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 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0fee536-a938-483a-814b-683880ca6bcd/bin/ugemcutter-syNpU3ikLH/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0fee536-a938-483a-814b-683880ca6bcd/bin/ugemcutter-syNpU3ikLH/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0fee536-a938-483a-814b-683880ca6bcd/bin/ugemcutter-syNpU3ikLH/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0fee536-a938-483a-814b-683880ca6bcd/bin/ugemcutter-syNpU3ikLH/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_d0fee536-a938-483a-814b-683880ca6bcd/bin/ugemcutter-syNpU3ikLH/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0fee536-a938-483a-814b-683880ca6bcd/bin/ugemcutter-syNpU3ikLH --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-38b53e6 [2022-11-25 18:48:27,492 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 18:48:27,494 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 18:48:27,528 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 18:48:27,528 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 18:48:27,529 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 18:48:27,531 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 18:48:27,532 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 18:48:27,534 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 18:48:27,535 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 18:48:27,536 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 18:48:27,537 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 18:48:27,538 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 18:48:27,540 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 18:48:27,541 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 18:48:27,542 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 18:48:27,543 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 18:48:27,544 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 18:48:27,546 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 18:48:27,548 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 18:48:27,549 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 18:48:27,558 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 18:48:27,561 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 18:48:27,562 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 18:48:27,568 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 18:48:27,568 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 18:48:27,569 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 18:48:27,569 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 18:48:27,570 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 18:48:27,571 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 18:48:27,571 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 18:48:27,572 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 18:48:27,573 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 18:48:27,574 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 18:48:27,581 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 18:48:27,582 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 18:48:27,583 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 18:48:27,583 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 18:48:27,584 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 18:48:27,587 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 18:48:27,588 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 18:48:27,589 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0fee536-a938-483a-814b-683880ca6bcd/bin/ugemcutter-syNpU3ikLH/config/svcomp-Reach-32bit-GemCutter_Default.epf [2022-11-25 18:48:27,614 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 18:48:27,614 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 18:48:27,615 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 18:48:27,615 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 18:48:27,616 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 18:48:27,616 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 18:48:27,617 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 18:48:27,617 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 18:48:27,617 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 18:48:27,618 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 18:48:27,618 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 18:48:27,618 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 18:48:27,618 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 18:48:27,619 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 18:48:27,619 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 18:48:27,619 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 18:48:27,619 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 18:48:27,619 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 18:48:27,620 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 18:48:27,620 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 18:48:27,620 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 18:48:27,620 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 18:48:27,621 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 18:48:27,621 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 18:48:27,621 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:48:27,621 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 18:48:27,622 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 18:48:27,622 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 18:48:27,622 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 18:48:27,622 INFO L138 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2022-11-25 18:48:27,622 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 18:48:27,625 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-25 18:48:27,626 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-25 18:48:27,626 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 18:48:27,626 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-25 18:48:27,626 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-25 18:48:27,627 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_d0fee536-a938-483a-814b-683880ca6bcd/bin/ugemcutter-syNpU3ikLH/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_d0fee536-a938-483a-814b-683880ca6bcd/bin/ugemcutter-syNpU3ikLH 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-25 18:48:27,927 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 18:48:27,963 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 18:48:27,965 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 18:48:27,967 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 18:48:27,967 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 18:48:27,969 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0fee536-a938-483a-814b-683880ca6bcd/bin/ugemcutter-syNpU3ikLH/../../sv-benchmarks/c/weaver/popl20-more-inc-subseq.wvr.c [2022-11-25 18:48:30,931 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 18:48:31,112 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 18:48:31,113 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0fee536-a938-483a-814b-683880ca6bcd/sv-benchmarks/c/weaver/popl20-more-inc-subseq.wvr.c [2022-11-25 18:48:31,120 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0fee536-a938-483a-814b-683880ca6bcd/bin/ugemcutter-syNpU3ikLH/data/0e3d0bef0/e2fda121676b4ede9d18d5b73ef2aa79/FLAGab3d1dbc3 [2022-11-25 18:48:31,139 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0fee536-a938-483a-814b-683880ca6bcd/bin/ugemcutter-syNpU3ikLH/data/0e3d0bef0/e2fda121676b4ede9d18d5b73ef2aa79 [2022-11-25 18:48:31,142 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 18:48:31,144 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 18:48:31,150 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 18:48:31,150 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 18:48:31,153 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 18:48:31,154 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:48:31" (1/1) ... [2022-11-25 18:48:31,155 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65a02cd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:48:31, skipping insertion in model container [2022-11-25 18:48:31,156 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:48:31" (1/1) ... [2022-11-25 18:48:31,163 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 18:48:31,192 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 18:48:31,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:48:31,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:48:31,384 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:48:31,384 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:48:31,389 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:48:31,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:48:31,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:48:31,392 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:48:31,400 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:48:31,400 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:48:31,408 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_d0fee536-a938-483a-814b-683880ca6bcd/sv-benchmarks/c/weaver/popl20-more-inc-subseq.wvr.c[2924,2937] [2022-11-25 18:48:31,416 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:48:31,426 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 18:48:31,440 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:48:31,441 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:48:31,442 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:48:31,443 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:48:31,443 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:48:31,447 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:48:31,459 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:48:31,460 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:48:31,461 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:48:31,461 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:48:31,474 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_d0fee536-a938-483a-814b-683880ca6bcd/sv-benchmarks/c/weaver/popl20-more-inc-subseq.wvr.c[2924,2937] [2022-11-25 18:48:31,479 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:48:31,495 INFO L208 MainTranslator]: Completed translation [2022-11-25 18:48:31,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:48:31 WrapperNode [2022-11-25 18:48:31,496 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 18:48:31,497 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 18:48:31,497 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 18:48:31,497 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 18:48:31,502 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:48:31" (1/1) ... [2022-11-25 18:48:31,510 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:48:31" (1/1) ... [2022-11-25 18:48:31,538 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 191 [2022-11-25 18:48:31,540 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 18:48:31,542 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 18:48:31,542 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 18:48:31,542 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 18:48:31,552 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:48:31" (1/1) ... [2022-11-25 18:48:31,552 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:48:31" (1/1) ... [2022-11-25 18:48:31,556 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:48:31" (1/1) ... [2022-11-25 18:48:31,556 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:48:31" (1/1) ... [2022-11-25 18:48:31,563 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:48:31" (1/1) ... [2022-11-25 18:48:31,568 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:48:31" (1/1) ... [2022-11-25 18:48:31,570 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:48:31" (1/1) ... [2022-11-25 18:48:31,571 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:48:31" (1/1) ... [2022-11-25 18:48:31,574 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 18:48:31,575 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 18:48:31,575 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 18:48:31,575 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 18:48:31,576 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:48:31" (1/1) ... [2022-11-25 18:48:31,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:48:31,595 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0fee536-a938-483a-814b-683880ca6bcd/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:48:31,617 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0fee536-a938-483a-814b-683880ca6bcd/bin/ugemcutter-syNpU3ikLH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 18:48:31,622 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0fee536-a938-483a-814b-683880ca6bcd/bin/ugemcutter-syNpU3ikLH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 18:48:31,656 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 18:48:31,657 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-25 18:48:31,657 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-25 18:48:31,657 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-25 18:48:31,657 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-25 18:48:31,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 18:48:31,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 18:48:31,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 18:48:31,658 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 18:48:31,658 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 18:48:31,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 18:48:31,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 18:48:31,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 18:48:31,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 18:48:31,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 18:48:31,660 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 18:48:31,797 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 18:48:31,810 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 18:48:32,313 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 18:48:32,397 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 18:48:32,398 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-25 18:48:32,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:48:32 BoogieIcfgContainer [2022-11-25 18:48:32,400 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 18:48:32,403 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 18:48:32,403 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 18:48:32,407 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 18:48:32,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:48:31" (1/3) ... [2022-11-25 18:48:32,411 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27ad3abe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:48:32, skipping insertion in model container [2022-11-25 18:48:32,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:48:31" (2/3) ... [2022-11-25 18:48:32,412 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27ad3abe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:48:32, skipping insertion in model container [2022-11-25 18:48:32,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:48:32" (3/3) ... [2022-11-25 18:48:32,413 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-inc-subseq.wvr.c [2022-11-25 18:48:32,420 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-25 18:48:32,429 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 18:48:32,430 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 18:48:32,430 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 18:48:32,498 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-25 18:48:32,550 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:48:32,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-25 18:48:32,551 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0fee536-a938-483a-814b-683880ca6bcd/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:48:32,560 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0fee536-a938-483a-814b-683880ca6bcd/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-25 18:48:32,562 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0fee536-a938-483a-814b-683880ca6bcd/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-11-25 18:48:32,608 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-25 18:48:32,623 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2022-11-25 18:48:32,630 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;@21f8c691, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:48:32,630 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-11-25 18:48:32,861 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-25 18:48:32,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:48:32,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1885589734, now seen corresponding path program 1 times [2022-11-25 18:48:32,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:48:32,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937670733] [2022-11-25 18:48:32,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:48:32,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:48:33,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:48:33,161 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-25 18:48:33,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:48:33,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937670733] [2022-11-25 18:48:33,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937670733] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:48:33,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:48:33,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:48:33,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354298997] [2022-11-25 18:48:33,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:48:33,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 18:48:33,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:48:33,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 18:48:33,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 18:48:33,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:48:33,214 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:48:33,216 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-25 18:48:33,217 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:48:33,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:48:33,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 18:48:33,303 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-25 18:48:33,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:48:33,305 INFO L85 PathProgramCache]: Analyzing trace with hash 532094629, now seen corresponding path program 1 times [2022-11-25 18:48:33,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:48:33,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433481628] [2022-11-25 18:48:33,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:48:33,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:48:33,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:48:34,052 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-25 18:48:34,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:48:34,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433481628] [2022-11-25 18:48:34,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433481628] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:48:34,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:48:34,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:48:34,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016660568] [2022-11-25 18:48:34,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:48:34,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:48:34,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:48:34,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:48:34,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:48:34,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:48:34,058 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:48:34,059 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-25 18:48:34,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:48:34,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:48:34,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:48:34,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:48:34,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 18:48:34,257 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-25 18:48:34,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:48:34,258 INFO L85 PathProgramCache]: Analyzing trace with hash 90971035, now seen corresponding path program 1 times [2022-11-25 18:48:34,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:48:34,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097650074] [2022-11-25 18:48:34,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:48:34,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:48:34,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:48:34,805 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-25 18:48:34,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:48:34,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097650074] [2022-11-25 18:48:34,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097650074] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:48:34,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:48:34,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:48:34,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643666731] [2022-11-25 18:48:34,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:48:34,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:48:34,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:48:34,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:48:34,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:48:34,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:48:34,813 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:48:34,813 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-25 18:48:34,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:48:34,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:48:34,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:48:35,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:48:35,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:48:35,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:48:35,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 18:48:35,031 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-25 18:48:35,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:48:35,033 INFO L85 PathProgramCache]: Analyzing trace with hash 276527094, now seen corresponding path program 1 times [2022-11-25 18:48:35,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:48:35,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992894367] [2022-11-25 18:48:35,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:48:35,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:48:35,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:48:35,314 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-25 18:48:35,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:48:35,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992894367] [2022-11-25 18:48:35,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992894367] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:48:35,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:48:35,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 18:48:35,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693218040] [2022-11-25 18:48:35,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:48:35,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:48:35,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:48:35,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:48:35,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:48:35,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:48:35,325 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:48:35,326 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-25 18:48:35,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:48:35,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:48:35,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:48:35,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:48:35,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:48:35,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:48:35,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:48:35,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:48:35,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 18:48:35,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-25 18:48:35,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:48:35,675 INFO L85 PathProgramCache]: Analyzing trace with hash 83365203, now seen corresponding path program 1 times [2022-11-25 18:48:35,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:48:35,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639801589] [2022-11-25 18:48:35,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:48:35,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:48:35,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:48:35,989 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-25 18:48:35,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:48:35,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639801589] [2022-11-25 18:48:35,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639801589] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:48:35,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:48:35,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 18:48:35,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616976478] [2022-11-25 18:48:35,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:48:35,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 18:48:35,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:48:35,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 18:48:35,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:48:35,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:48:35,993 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:48:35,993 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-25 18:48:35,993 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:48:35,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:48:35,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:48:35,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:48:35,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:48:36,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:48:36,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:48:36,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:48:36,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:48:36,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:48:36,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 18:48:36,279 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-25 18:48:36,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:48:36,282 INFO L85 PathProgramCache]: Analyzing trace with hash -732015546, now seen corresponding path program 1 times [2022-11-25 18:48:36,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:48:36,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770183956] [2022-11-25 18:48:36,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:48:36,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:48:36,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:48:38,932 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-25 18:48:38,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:48:38,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770183956] [2022-11-25 18:48:38,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770183956] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:48:38,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730177278] [2022-11-25 18:48:38,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:48:38,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:48:38,933 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0fee536-a938-483a-814b-683880ca6bcd/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:48:38,939 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0fee536-a938-483a-814b-683880ca6bcd/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:48:38,962 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0fee536-a938-483a-814b-683880ca6bcd/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 18:48:39,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:48:39,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-25 18:48:39,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:48:41,351 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-25 18:48:41,394 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-25 18:48:41,395 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:48:42,098 INFO L321 Elim1Store]: treesize reduction 15, result has 83.9 percent of original size [2022-11-25 18:48:42,099 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-25 18:48:44,108 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-25 18:48:44,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730177278] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:48:44,109 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:48:44,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25, 20] total 57 [2022-11-25 18:48:44,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096725876] [2022-11-25 18:48:44,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:48:44,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-11-25 18:48:44,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:48:44,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-11-25 18:48:44,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=529, Invalid=2663, Unknown=0, NotChecked=0, Total=3192 [2022-11-25 18:48:44,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:48:44,113 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:48:44,114 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-25 18:48:44,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:48:44,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:48:44,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:48:44,115 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:48:44,115 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:48:44,115 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:48:52,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:48:52,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:48:52,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:48:52,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:48:52,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:48:52,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-11-25 18:48:52,071 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0fee536-a938-483a-814b-683880ca6bcd/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 18:48:52,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0fee536-a938-483a-814b-683880ca6bcd/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-25 18:48:52,267 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-25 18:48:52,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:48:52,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1531297126, now seen corresponding path program 2 times [2022-11-25 18:48:52,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:48:52,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462470823] [2022-11-25 18:48:52,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:48:52,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:48:52,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:48:52,692 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-25 18:48:52,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:48:52,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462470823] [2022-11-25 18:48:52,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462470823] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:48:52,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2095201842] [2022-11-25 18:48:52,693 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 18:48:52,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:48:52,693 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0fee536-a938-483a-814b-683880ca6bcd/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:48:52,694 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0fee536-a938-483a-814b-683880ca6bcd/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:48:52,718 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0fee536-a938-483a-814b-683880ca6bcd/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 18:48:53,025 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 18:48:53,026 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:48:53,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 18:48:53,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:48:53,252 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-25 18:48:53,253 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:48:53,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2095201842] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:48:53,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 18:48:53,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2022-11-25 18:48:53,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402597471] [2022-11-25 18:48:53,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:48:53,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:48:53,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:48:53,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:48:53,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:48:53,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:48:53,256 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:48:53,256 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-25 18:48:53,256 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:48:53,256 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:48:53,256 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:48:53,256 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:48:53,256 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:48:53,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 76 states. [2022-11-25 18:48:53,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:48:56,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:48:56,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:48:56,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:48:56,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:48:56,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:48:56,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-11-25 18:48:56,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:48:56,055 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0fee536-a938-483a-814b-683880ca6bcd/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-25 18:48:56,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0fee536-a938-483a-814b-683880ca6bcd/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-25 18:48:56,246 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-25 18:48:56,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:48:56,247 INFO L85 PathProgramCache]: Analyzing trace with hash 81772503, now seen corresponding path program 3 times [2022-11-25 18:48:56,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:48:56,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338073621] [2022-11-25 18:48:56,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:48:56,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:48:56,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:48:56,588 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-25 18:48:56,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:48:56,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338073621] [2022-11-25 18:48:56,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338073621] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:48:56,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379434530] [2022-11-25 18:48:56,589 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 18:48:56,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:48:56,589 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0fee536-a938-483a-814b-683880ca6bcd/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:48:56,590 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0fee536-a938-483a-814b-683880ca6bcd/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:48:56,598 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0fee536-a938-483a-814b-683880ca6bcd/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 18:48:56,926 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-25 18:48:56,926 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:48:56,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-25 18:48:56,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:48:57,268 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-25 18:48:57,268 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:48:57,701 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-25 18:48:57,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379434530] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:48:57,704 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:48:57,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 24 [2022-11-25 18:48:57,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164198085] [2022-11-25 18:48:57,705 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:48:57,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-25 18:48:57,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:48:57,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-25 18:48:57,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2022-11-25 18:48:57,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:48:57,711 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:48:57,712 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-25 18:48:57,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:48:57,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:48:57,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:48:57,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:48:57,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:48:57,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 94 states. [2022-11-25 18:48:57,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:48:57,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:49:02,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:49:02,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:49:02,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:49:02,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:49:02,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:49:02,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2022-11-25 18:49:02,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:49:02,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-11-25 18:49:02,639 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0fee536-a938-483a-814b-683880ca6bcd/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 18:49:02,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0fee536-a938-483a-814b-683880ca6bcd/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:49:02,832 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-25 18:49:02,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:49:02,833 INFO L85 PathProgramCache]: Analyzing trace with hash -282215482, now seen corresponding path program 4 times [2022-11-25 18:49:02,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:49:02,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364020434] [2022-11-25 18:49:02,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:49:02,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:49:02,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:49:06,436 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-25 18:49:06,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:49:06,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364020434] [2022-11-25 18:49:06,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364020434] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:49:06,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475523432] [2022-11-25 18:49:06,437 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 18:49:06,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:49:06,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0fee536-a938-483a-814b-683880ca6bcd/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:49:06,439 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0fee536-a938-483a-814b-683880ca6bcd/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:49:06,467 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0fee536-a938-483a-814b-683880ca6bcd/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 18:49:06,590 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 18:49:06,590 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:49:06,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 64 conjunts are in the unsatisfiable core [2022-11-25 18:49:06,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:49:07,250 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-25 18:49:07,615 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-25 18:49:08,718 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 18:49:08,718 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-25 18:49:09,032 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-25 18:49:10,204 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-25 18:49:10,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:49:10,753 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-25 18:49:11,404 INFO L321 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-11-25 18:49:11,404 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-25 18:49:11,481 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-25 18:49:11,481 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:49:16,611 WARN L837 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~end~0) (let ((.cse3 (+ (* c_~end~0 4) c_~queue~0.offset))) (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 ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (let ((.cse1 (+ (* ~i~0 4) ~A~0.offset)) (.cse2 (select .cse0 c_~queue~0.base))) (or (not (= (select (select .cse0 v_~A~0.base_19) .cse1) (select .cse2 .cse3))) (< (select (select .cse4 v_~A~0.base_19) .cse1) (+ (select .cse2 (+ (* c_~start~0 4) c_~queue~0.offset)) 1))))))))) (or (not (= (mod c_~ok~0 256) 0)) (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 ((.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 v_~A~0.base_19) (+ (* ~i~0 4) ~A~0.offset)) (select (select .cse5 c_~queue~0.base) .cse3)))) (not (<= v_~A~0.base_19 |c_ULTIMATE.start_main_#t~ret13#1.base|))))))) (< c_~end~0 0)) is different from false [2022-11-25 18:49:22,519 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:49:22,520 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-25 18:49:22,570 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:49:22,570 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-25 18:49:22,652 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:49:22,653 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-25 18:49:22,724 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:49:22,725 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-25 18:49:22,811 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:49:22,812 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-25 18:49:35,022 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:49:35,022 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-25 18:49:35,075 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:49:35,077 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-25 18:49:35,644 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:49:35,645 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-25 18:49:36,192 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:49:36,193 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-25 18:49:36,732 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:49:36,733 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-25 18:49:51,421 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:49:51,422 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-25 18:49:52,389 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-25 18:49:52,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475523432] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:49:52,390 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:49:52,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 35, 35] total 92 [2022-11-25 18:49:52,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555023517] [2022-11-25 18:49:52,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:49:52,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 92 states [2022-11-25 18:49:52,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:49:52,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2022-11-25 18:49:52,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=839, Invalid=7261, Unknown=94, NotChecked=178, Total=8372 [2022-11-25 18:49:52,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:49:52,396 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:49:52,397 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-25 18:49:52,397 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:49:52,397 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:49:52,397 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:49:52,397 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:49:52,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:49:52,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 110 states. [2022-11-25 18:49:52,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:49:52,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2022-11-25 18:49:52,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:50:50,255 WARN L233 SmtUtils]: Spent 57.22s on a formula simplification. DAG size of input: 305 DAG size of output: 301 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:51:09,828 WARN L233 SmtUtils]: Spent 18.59s on a formula simplification that was a NOOP. DAG size: 259 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:51:12,357 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse14 (not (= (mod c_~ok~0 256) 0))) (.cse21 (+ (* c_~start~0 4) c_~queue~0.offset)) (.cse49 (select |c_#memory_int| c_~queue~0.base)) (.cse18 (+ (* c_~end~0 4) c_~queue~0.offset)) (.cse15 (select |c_#memory_int| c_~A~0.base)) (.cse34 (+ c_~A~0.offset (* c_~i~0 4)))) (let ((.cse5 (<= c_~n~0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse2 (<= c_~start~0 c_~end~0)) (.cse3 (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse4 (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t2~0#1.base|)) (.cse0 (<= (+ c_~start~0 1) 0)) (.cse1 (<= c_~n~0 1)) (.cse7 (not (= (select .cse49 .cse18) (select .cse15 .cse34)))) (.cse9 (and .cse14 (< c_~v_old~0 (+ (select .cse49 .cse21) 1)))) (.cse6 (not (< c_~end~0 c_~n~0))) (.cse8 (not (<= c_~last~0 |c_thread1Thread1of1ForFork0_#t~mem1#1|))) (.cse10 (not (<= 0 c_~end~0))) (.cse11 (and (not (< c_~start~0 c_~end~0)) (not (< c_~i~0 c_~N~0)))) (.cse12 (<= c_~n~0 c_~end~0)) (.cse13 (< c_~end~0 0))) (and (or (not .cse0) (<= c_~end~0 c_~start~0)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (or (and .cse1 .cse2 .cse3 .cse4) .cse0) .cse5 (or (and (= 0 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) .cse5 .cse2 .cse3 .cse4) .cse0) (or .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) .cse1 (or .cse12 .cse13 (and (or .cse14 (forall ((~A~0.offset Int) (v_ArrVal_196 (Array Int Int)) (~i~0 Int)) (let ((.cse16 (+ (* ~i~0 4) ~A~0.offset))) (or (< (select .cse15 .cse16) c_~last~0) (not (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (= (select (select .cse17 c_~queue~0.base) .cse18) (select (select .cse17 c_~A~0.base) .cse16)))))))) (forall ((~A~0.offset Int) (~i~0 Int)) (let ((.cse19 (+ (* ~i~0 4) ~A~0.offset))) (or (< (select .cse15 .cse19) c_~last~0) (forall ((v_ArrVal_196 (Array Int Int))) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (let ((.cse20 (select .cse22 c_~queue~0.base))) (or (< c_~v_old~0 (+ (select .cse20 .cse21) 1)) (not (= (select .cse20 .cse18) (select (select .cse22 c_~A~0.base) .cse19)))))))))))) (or .cse12 (and (forall ((~A~0.offset Int) (v_ArrVal_195 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (~i~0 Int)) (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195))) (let ((.cse26 (store .cse23 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (let ((.cse24 (+ (* ~i~0 4) ~A~0.offset)) (.cse25 (select .cse26 c_~queue~0.base))) (or (< (select (select .cse23 c_~A~0.base) .cse24) (+ (select .cse25 .cse21) 1)) (not (= (select (select .cse26 c_~A~0.base) .cse24) (select .cse25 .cse18)))))))) (or .cse14 (forall ((~A~0.offset Int) (v_ArrVal_195 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (~i~0 Int)) (not (let ((.cse27 (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 .cse27 c_~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select .cse27 c_~queue~0.base) .cse18))))))) .cse13) (or .cse6 .cse7 .cse9 .cse10 (= (mod |c_thread2Thread1of1ForFork1_~cond~0#1| 256) 0)) (<= |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (or .cse12 .cse13 (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 ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195))) (let ((.cse28 (store .cse31 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (let ((.cse29 (+ (* ~i~0 4) ~A~0.offset)) (.cse30 (select .cse28 c_~queue~0.base))) (or (not (= (select (select .cse28 v_~A~0.base_19) .cse29) (select .cse30 .cse18))) (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| v_~A~0.base_19) (< (select (select .cse31 v_~A~0.base_19) .cse29) (+ (select .cse30 .cse21) 1))))))) (or .cse14 (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 ((.cse32 (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 .cse32 v_~A~0.base_19) (+ (* ~i~0 4) ~A~0.offset)) (select (select .cse32 c_~queue~0.base) .cse18)))) (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| v_~A~0.base_19)))))) (= c_~ok~0 1) (or (and (or (forall ((v_ArrVal_196 (Array Int Int))) (not (let ((.cse33 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (= (select (select .cse33 c_~queue~0.base) .cse18) (select (select .cse33 c_~A~0.base) .cse34))))) .cse14) (forall ((v_ArrVal_196 (Array Int Int))) (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (let ((.cse35 (select .cse36 c_~queue~0.base))) (or (not (= (select .cse35 .cse18) (select (select .cse36 c_~A~0.base) .cse34))) (< c_~v_old~0 (+ (select .cse35 .cse21) 1))))))) .cse6 .cse8 .cse10 .cse11) (<= c_~n~0 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or .cse12 (and (forall ((~A~0.offset Int) (v_ArrVal_195 (Array Int Int)) (~i~0 Int)) (let ((.cse40 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195)) (.cse39 (+ (* ~i~0 4) ~A~0.offset))) (or (forall ((v_ArrVal_196 (Array Int Int))) (let ((.cse38 (store .cse40 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (let ((.cse37 (select .cse38 c_~queue~0.base))) (or (< c_~v_old~0 (+ (select .cse37 .cse21) 1)) (not (= (select (select .cse38 c_~A~0.base) .cse39) (select .cse37 .cse18))))))) (< (select (select .cse40 c_~A~0.base) .cse39) c_~last~0)))) (or .cse14 (forall ((~A~0.offset Int) (v_ArrVal_195 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (~i~0 Int)) (let ((.cse42 (+ (* ~i~0 4) ~A~0.offset)) (.cse41 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195))) (or (< (select (select .cse41 c_~A~0.base) .cse42) c_~last~0) (not (let ((.cse43 (store .cse41 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (= (select (select .cse43 c_~A~0.base) .cse42) (select (select .cse43 c_~queue~0.base) .cse18))))))))) .cse13) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (or .cse12 .cse13 (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 .cse21) 1)) (not (= (select (select .cse47 v_~A~0.base_19) .cse45) (select .cse46 .cse18))) (< |c_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| v_~A~0.base_19)))))) (or .cse14 (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) .cse18)))) (< |c_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| v_~A~0.base_19)))))) (= c_~start~0 c_~end~0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|)))) is different from false [2022-11-25 18:51:23,830 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse36 (* c_~end~0 4)) (.cse11 (+ (* c_~start~0 4) c_~queue~0.offset))) (let ((.cse10 (+ c_~start~0 1)) (.cse9 (<= .cse11 0)) (.cse17 (+ .cse36 c_~queue~0.offset))) (let ((.cse0 (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t2~0#1.base|)) (.cse8 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4)))) (.cse2 (< 0 (+ .cse36 c_~queue~0.offset 1))) (.cse6 (or (<= .cse17 0) (<= c_~n~0 1))) (.cse3 (not (= .cse17 0))) (.cse5 (or (<= (+ c_~start~0 c_~n~0) (+ c_~end~0 1)) .cse9)) (.cse4 (not (= .cse11 0))) (.cse1 (<= .cse10 0)) (.cse7 (= c_~queue~0.offset 0)) (.cse12 (<= c_~n~0 c_~end~0)) (.cse13 (< c_~end~0 0)) (.cse19 (not (= (mod c_~ok~0 256) 0)))) (and (or (and (<= c_~start~0 c_~end~0) .cse0) .cse1) (or (and .cse2 (or .cse3 (and (or .cse4 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) .cse5)) .cse6 .cse7) .cse1) (or (and .cse2 .cse6 .cse7 (or .cse3 (and .cse5 (or .cse4 (and (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~A~0.base)) (= .cse8 |c_thread1Thread1of1ForFork0_#t~mem1#1|))))) (= c_~v_old~0 c_~last~0)) .cse1) (or (not .cse1) (<= c_~end~0 c_~start~0)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) .cse9 (or (and (or (and (or .cse4 (not (= |c_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|))) .cse5) .cse3) .cse2 .cse6 .cse7) .cse1) (or (and .cse2 .cse6 .cse7 (or .cse3 (and (or .cse4 .cse0) .cse5))) .cse1) (or .cse1 (and .cse2 (or .cse3 (and (or .cse4 (<= c_~v_old~0 .cse8)) .cse5)) .cse6 .cse7)) (< 0 .cse10) (<= c_~v_old~0 (select (select |c_#memory_int| c_~queue~0.base) .cse11)) (or .cse12 .cse13 (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 ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195))) (let ((.cse14 (store .cse18 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (let ((.cse15 (+ (* ~i~0 4) ~A~0.offset)) (.cse16 (select .cse14 c_~queue~0.base))) (or (not (= (select (select .cse14 v_~A~0.base_19) .cse15) (select .cse16 .cse17))) (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| v_~A~0.base_19) (< (select (select .cse18 v_~A~0.base_19) .cse15) (+ (select .cse16 .cse11) 1))))))) (or .cse19 (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 ((.cse20 (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 .cse20 v_~A~0.base_19) (+ (* ~i~0 4) ~A~0.offset)) (select (select .cse20 c_~queue~0.base) .cse17)))) (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| v_~A~0.base_19)))))) (or (and .cse2 .cse6 .cse7 (or .cse3 (and (or .cse4 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) .cse5))) .cse1) (= c_~ok~0 1) (or (and .cse2 .cse6 .cse7 (or .cse3 (and .cse5 (or .cse4 (not (= |c_ULTIMATE.start_main_#t~ret13#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)))))) .cse1) .cse7 (or .cse12 .cse13 (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 ((.cse21 (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 ((.cse24 (store .cse21 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (let ((.cse22 (+ (* ~i~0 4) ~A~0.offset)) (.cse23 (select .cse24 c_~queue~0.base))) (or (< (select (select .cse21 v_~A~0.base_19) .cse22) (+ (select .cse23 .cse11) 1)) (not (= (select (select .cse24 v_~A~0.base_19) .cse22) (select .cse23 .cse17))) (< |c_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| v_~A~0.base_19)))))) (or .cse19 (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 ((.cse25 (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 .cse25 v_~A~0.base_19) (+ (* ~i~0 4) ~A~0.offset)) (select (select .cse25 c_~queue~0.base) .cse17)))) (< |c_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| v_~A~0.base_19)))))) (or .cse12 .cse13 (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 ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195))) (let ((.cse26 (store .cse29 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (let ((.cse27 (+ (* ~i~0 4) ~A~0.offset)) (.cse28 (select .cse26 c_~queue~0.base))) (or (not (= (select (select .cse26 v_~A~0.base_19) .cse27) (select .cse28 .cse17))) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_~A~0.base_19) (< (select (select .cse29 v_~A~0.base_19) .cse27) (+ (select .cse28 .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 ((.cse30 (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 .cse30 v_~A~0.base_19) (+ (* ~i~0 4) ~A~0.offset)) (select (select .cse30 c_~queue~0.base) .cse17)))) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_~A~0.base_19))) .cse19))) (or .cse12 .cse13 (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 ((.cse31 (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 .cse31 v_~A~0.base_19) (+ (* ~i~0 4) ~A~0.offset)) (select (select .cse31 c_~queue~0.base) .cse17)))))) .cse19) (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 ((.cse32 (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 ((.cse35 (store .cse32 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (let ((.cse33 (+ (* ~i~0 4) ~A~0.offset)) (.cse34 (select .cse35 c_~queue~0.base))) (or (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_~A~0.base_19) (< (select (select .cse32 v_~A~0.base_19) .cse33) (+ (select .cse34 .cse11) 1)) (not (= (select (select .cse35 v_~A~0.base_19) .cse33) (select .cse34 .cse17)))))))))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|))))) is different from false [2022-11-25 18:51:29,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:51:29,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:51:29,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:51:29,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:51:29,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:51:29,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2022-11-25 18:51:29,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:51:29,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-11-25 18:51:29,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-11-25 18:51:29,961 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0fee536-a938-483a-814b-683880ca6bcd/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 18:51:30,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0fee536-a938-483a-814b-683880ca6bcd/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:51:30,156 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-25 18:51:30,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:51:30,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1182337734, now seen corresponding path program 5 times [2022-11-25 18:51:30,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:51:30,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441608348] [2022-11-25 18:51:30,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:51:30,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:51:30,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:51:32,380 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-25 18:51:32,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:51:32,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441608348] [2022-11-25 18:51:32,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441608348] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:51:32,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652507976] [2022-11-25 18:51:32,381 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-25 18:51:32,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:51:32,381 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0fee536-a938-483a-814b-683880ca6bcd/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:51:32,382 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0fee536-a938-483a-814b-683880ca6bcd/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:51:32,391 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0fee536-a938-483a-814b-683880ca6bcd/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 18:51:32,514 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 18:51:32,515 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:51:32,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-25 18:51:32,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:51:32,525 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-25 18:51:32,792 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 18:51:32,792 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-25 18:51:34,241 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-25 18:51:34,242 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-25 18:51:34,254 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-25 18:51:34,722 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-11-25 18:51:34,722 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-25 18:51:34,818 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-25 18:51:34,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:51:35,248 WARN L837 $PredicateComparison]: unable to prove that (or (and (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_230 (Array Int Int))) (< c_~v_old~0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_230) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) 1)))) (< c_~start~0 0) (<= c_~end~0 c_~start~0)) is different from false [2022-11-25 18:51:35,637 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:51:35,638 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-25 18:51:35,648 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-25 18:51:38,501 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-25 18:51:38,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652507976] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:51:38,501 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:51:38,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22, 20] total 57 [2022-11-25 18:51:38,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456256682] [2022-11-25 18:51:38,502 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:51:38,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-11-25 18:51:38,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:51:38,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-11-25 18:51:38,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=348, Invalid=2735, Unknown=1, NotChecked=108, Total=3192 [2022-11-25 18:51:38,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:51:38,505 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:51:38,506 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-25 18:51:38,506 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:51:38,506 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:51:38,506 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:51:38,506 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:51:38,506 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:51:38,506 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 112 states. [2022-11-25 18:51:38,506 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:51:38,506 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2022-11-25 18:51:38,506 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 68 states. [2022-11-25 18:51:38,506 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:51:52,233 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-25 18:51:58,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 [0] [2022-11-25 18:52:07,581 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-25 18:52:09,612 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-25 18:52:11,637 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-25 18:52:13,645 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-25 18:52:16,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 [0] [2022-11-25 18:52:26,645 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-25 18:52:28,654 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-25 18:52:30,664 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-25 18:52:35,642 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-25 18:52:37,677 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-25 18:52:40,059 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-25 18:52:46,271 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-25 18:52:48,692 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-25 18:52:51,112 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-25 18:52:53,118 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-25 18:52:55,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] [2022-11-25 18:52:57,388 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-25 18:53:00,155 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-25 18:53:02,165 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-25 18:53:04,173 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-25 18:53:04,761 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (not (= (mod c_~ok~0 256) 0))) (.cse2 (select |c_#memory_int| c_~queue~0.base)) (.cse12 (+ (* c_~start~0 4) c_~queue~0.offset))) (let ((.cse0 (and .cse9 (< c_~v_old~0 (+ (select .cse2 .cse12) 1)))) (.cse3 (+ (* c_~end~0 4) c_~queue~0.offset)) (.cse4 (+ c_~A~0.offset (* c_~i~0 4))) (.cse1 (not (< c_~end~0 c_~n~0))) (.cse5 (not (<= c_~last~0 |c_thread1Thread1of1ForFork0_#t~mem1#1|))) (.cse6 (not (<= 0 c_~end~0))) (.cse7 (and (not (< c_~start~0 c_~end~0)) (not (< c_~i~0 c_~N~0))))) (and (or .cse0 (= (mod |c_thread2Thread1of1ForFork1_~cond~0#1| 256) 0)) (or .cse1 (not (= (select .cse2 .cse3) (select (select |c_#memory_int| c_~A~0.base) .cse4))) .cse5 .cse0 .cse6 .cse7) (or (and (or (forall ((v_ArrVal_196 (Array Int Int))) (not (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (= (select (select .cse8 c_~queue~0.base) .cse3) (select (select .cse8 c_~A~0.base) .cse4))))) .cse9) (forall ((v_ArrVal_196 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (let ((.cse10 (select .cse11 c_~queue~0.base))) (or (not (= (select .cse10 .cse3) (select (select .cse11 c_~A~0.base) .cse4))) (< c_~v_old~0 (+ (select .cse10 .cse12) 1))))))) .cse1 .cse5 .cse6 .cse7)))) is different from false [2022-11-25 18:53:14,242 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (not (= (mod c_~ok~0 256) 0))) (.cse2 (select |c_#memory_int| c_~queue~0.base)) (.cse12 (+ (* c_~start~0 4) c_~queue~0.offset))) (let ((.cse0 (and .cse9 (< c_~v_old~0 (+ (select .cse2 .cse12) 1)))) (.cse3 (+ (* c_~end~0 4) c_~queue~0.offset)) (.cse4 (+ c_~A~0.offset (* c_~i~0 4))) (.cse1 (not (< c_~end~0 c_~n~0))) (.cse5 (not (<= c_~last~0 |c_thread1Thread1of1ForFork0_#t~mem1#1|))) (.cse6 (not (<= 0 c_~end~0))) (.cse7 (and (not (< c_~start~0 c_~end~0)) (not (< c_~i~0 c_~N~0))))) (and (or .cse0 (= (mod |c_thread2Thread1of1ForFork1_~cond~0#1| 256) 0)) (or .cse1 (not (= (select .cse2 .cse3) (select (select |c_#memory_int| c_~A~0.base) .cse4))) .cse5 .cse0 .cse6 .cse7) (= c_~ok~0 1) (or (and (or (forall ((v_ArrVal_196 (Array Int Int))) (not (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (= (select (select .cse8 c_~queue~0.base) .cse3) (select (select .cse8 c_~A~0.base) .cse4))))) .cse9) (forall ((v_ArrVal_196 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (let ((.cse10 (select .cse11 c_~queue~0.base))) (or (not (= (select .cse10 .cse3) (select (select .cse11 c_~A~0.base) .cse4))) (< c_~v_old~0 (+ (select .cse10 .cse12) 1))))))) .cse1 .cse5 .cse6 .cse7)))) is different from false [2022-11-25 18:53:17,335 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-25 18:53:41,512 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-25 18:53:52,080 WARN L233 SmtUtils]: Spent 8.27s on a formula simplification. DAG size of input: 84 DAG size of output: 72 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:53:54,091 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-25 18:53:56,124 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-25 18:53:57,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:54:30,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:54:30,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:54:30,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:54:30,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:54:30,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:54:30,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2022-11-25 18:54:30,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:54:30,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-11-25 18:54:30,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2022-11-25 18:54:30,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-11-25 18:54:30,516 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0fee536-a938-483a-814b-683880ca6bcd/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-25 18:54:30,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0fee536-a938-483a-814b-683880ca6bcd/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:54:30,707 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-25 18:54:30,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:54:30,707 INFO L85 PathProgramCache]: Analyzing trace with hash -704172357, now seen corresponding path program 6 times [2022-11-25 18:54:30,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:54:30,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851926753] [2022-11-25 18:54:30,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:54:30,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:54:30,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:54:36,971 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-25 18:54:36,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:54:36,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851926753] [2022-11-25 18:54:36,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851926753] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:54:36,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378067372] [2022-11-25 18:54:36,972 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-25 18:54:36,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:54:36,972 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0fee536-a938-483a-814b-683880ca6bcd/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:54:36,973 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0fee536-a938-483a-814b-683880ca6bcd/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:54:36,975 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0fee536-a938-483a-814b-683880ca6bcd/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 18:54:37,396 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-11-25 18:54:37,396 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:54:37,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-25 18:54:37,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:54:40,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:54:40,886 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-25 18:54:41,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:54:41,217 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-25 18:54:42,038 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-25 18:54:42,039 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-25 18:54:42,090 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-25 18:54:42,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:54:43,079 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-25 18:54:43,770 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse1 (+ (* c_~end~0 4) c_~queue~0.offset)) (.cse3 (+ c_~A~0.offset (* c_~i~0 4)))) (and (forall ((~queue~0.base Int) (v_ArrVal_267 (Array Int Int)) (v_ArrVal_268 (Array Int Int))) (let ((.cse2 (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 ((.cse0 (select .cse2 ~queue~0.base))) (or (not (= (select .cse0 .cse1) (select (select .cse2 c_~A~0.base) .cse3))) (< |c_ULTIMATE.start_main_#t~mem14#1| (+ (select .cse0 (+ (* c_~start~0 4) c_~queue~0.offset)) 1)))))) (or (forall ((~queue~0.base Int) (v_ArrVal_267 (Array Int Int)) (v_ArrVal_268 (Array Int Int))) (not (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))) (= (select (select .cse4 ~queue~0.base) .cse1) (select (select .cse4 c_~A~0.base) .cse3))))) (not (= (mod c_~ok~0 256) 0))))) (not (< c_~end~0 c_~n~0)) (< c_~start~0 0) (not (<= 0 c_~end~0)) (<= c_~n~0 c_~start~0)) is different from false [2022-11-25 18:54:44,005 INFO L321 Elim1Store]: treesize reduction 15, result has 89.9 percent of original size [2022-11-25 18:54:44,006 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-25 18:54:44,069 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:54:44,070 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-25 18:54:44,125 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:54:44,125 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-25 18:54:44,161 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:54:44,162 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-25 18:54:44,203 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:54:44,204 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-25 18:55:03,794 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-25 18:55:03,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1378067372] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:55:03,794 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:55:03,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 30, 31] total 89 [2022-11-25 18:55:03,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283002125] [2022-11-25 18:55:03,794 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:55:03,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 89 states [2022-11-25 18:55:03,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:55:03,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2022-11-25 18:55:03,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=728, Invalid=6754, Unknown=8, NotChecked=342, Total=7832 [2022-11-25 18:55:03,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:55:03,799 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:55:03,800 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-25 18:55:03,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:55:03,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:55:03,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:55:03,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:55:03,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:55:03,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 151 states. [2022-11-25 18:55:03,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:55:03,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 73 states. [2022-11-25 18:55:03,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 119 states. [2022-11-25 18:55:03,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 102 states. [2022-11-25 18:55:03,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:55:29,666 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-25 18:55:31,705 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-25 18:55:36,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:55:36,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:55:36,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:55:36,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:55:36,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:55:36,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2022-11-25 18:55:36,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:55:36,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2022-11-25 18:55:36,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2022-11-25 18:55:36,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2022-11-25 18:55:36,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2022-11-25 18:55:36,100 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0fee536-a938-483a-814b-683880ca6bcd/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-25 18:55:36,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0fee536-a938-483a-814b-683880ca6bcd/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:55:36,296 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-25 18:55:36,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:55:36,297 INFO L85 PathProgramCache]: Analyzing trace with hash 335291463, now seen corresponding path program 7 times [2022-11-25 18:55:36,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:55:36,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354957255] [2022-11-25 18:55:36,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:55:36,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:55:36,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:55:40,175 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-25 18:55:40,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:55:40,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354957255] [2022-11-25 18:55:40,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354957255] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:55:40,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054162149] [2022-11-25 18:55:40,175 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-25 18:55:40,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:55:40,175 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0fee536-a938-483a-814b-683880ca6bcd/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:55:40,176 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0fee536-a938-483a-814b-683880ca6bcd/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:55:40,179 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0fee536-a938-483a-814b-683880ca6bcd/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 18:55:40,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:55:40,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 57 conjunts are in the unsatisfiable core [2022-11-25 18:55:40,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:55:44,149 INFO L321 Elim1Store]: treesize reduction 104, result has 35.4 percent of original size [2022-11-25 18:55:44,150 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-25 18:55:44,319 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-25 18:55:44,320 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:55:49,582 INFO L321 Elim1Store]: treesize reduction 214, result has 82.6 percent of original size [2022-11-25 18:55:49,583 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-25 18:55:54,458 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:55:55,893 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:56:01,994 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:56:02,662 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:56:02,781 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-25 18:56:02,953 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:56:03,165 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:56:03,626 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:56:04,609 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:56:05,156 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:56:05,262 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-25 18:56:05,407 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:56:05,585 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:56:05,990 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:56:07,462 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:56:20,131 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:56:26,392 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:56:36,855 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:56:43,550 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:56:46,644 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:56:49,215 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:56:57,965 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:56:58,716 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:56:58,866 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-25 18:56:59,066 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:56:59,326 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:56:59,871 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:57:01,163 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:57:02,059 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:57:02,234 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-25 18:57:02,470 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:57:02,765 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:57:03,402 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:57:05,059 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:57:20,562 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:57:27,512 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:57:38,295 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:57:45,485 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:57:54,185 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:57:59,796 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-25 18:58:00,032 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:58:00,325 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:58:00,399 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:58:00,667 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:58:01,075 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:58:02,205 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:58:03,793 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-25 18:58:04,001 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:58:04,233 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:58:04,507 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:58:05,086 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:58:07,905 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:58:10,872 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:58:16,408 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:58:16,665 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:58:16,842 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:58:17,012 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-25 18:58:17,603 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:58:18,021 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:58:18,266 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-25 18:58:18,508 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:58:18,718 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:58:19,045 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:58:19,137 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:58:19,140 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-25 18:58:19,350 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-25 18:58:19,581 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2022-11-25 18:58:19,822 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-25 18:58:20,095 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:58:20,128 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-25 18:58:20,620 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:58:20,990 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:58:21,208 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:58:21,245 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:58:21,470 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-25 18:58:22,357 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:58:22,890 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:58:23,101 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-25 18:58:23,322 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:58:23,553 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:58:23,853 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:58:23,926 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-25 18:58:24,137 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-25 18:58:24,167 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2022-11-25 18:58:24,370 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-25 18:58:24,630 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-25 18:58:26,230 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:58:30,409 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-25 18:58:30,750 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:58:31,438 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:58:44,997 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:58:53,707 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:58:54,366 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:58:54,579 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:58:54,620 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-25 18:58:54,948 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:58:55,384 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:58:56,285 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:58:57,648 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:58:59,311 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:58:59,503 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:58:59,540 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-25 18:58:59,836 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:59:00,224 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:59:01,029 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:59:02,497 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:59:08,343 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:59:23,105 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:59:29,893 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-25 18:59:30,121 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:59:30,349 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:59:30,451 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:59:30,837 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:59:31,399 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:59:32,885 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:59:34,907 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-25 18:59:35,165 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:59:35,420 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:59:35,541 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:59:36,001 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:59:36,680 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:59:37,970 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:59:43,115 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:59:47,397 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 19:00:08,318 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 19:00:17,189 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 19:00:25,612 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 19:00:28,055 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 19:00:36,463 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 19:00:52,358 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 19:00:55,861 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 19:01:14,520 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 19:01:23,081 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 19:01:25,507 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 19:01:30,501 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 19:01:39,722 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 19:01:41,124 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-25 19:01:41,399 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 19:01:41,721 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 19:01:42,131 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 19:01:42,681 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 19:01:47,894 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 19:01:52,799 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-25 19:01:53,087 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 19:01:53,406 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 19:01:53,823 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 19:01:54,445 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 19:01:55,491 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-25 19:01:55,799 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 19:01:56,156 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 19:01:56,601 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 19:01:57,289 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 19:02:00,794 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 19:02:05,332 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-25 19:02:05,583 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 19:02:05,881 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 19:02:06,250 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 19:02:06,761 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 19:02:08,453 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 19:02:14,620 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 19:02:17,565 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 19:02:23,500 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 19:02:26,108 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-25 19:02:26,363 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 19:02:26,442 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 19:02:26,781 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 19:02:27,742 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 19:02:36,308 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 19:02:41,304 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-25 19:02:41,569 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 19:02:41,888 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 19:02:42,280 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 19:02:42,856 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 19:02:44,352 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 19:02:46,719 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts.