./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-more-dec-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_682ee30b-15e2-49a9-930c-f7b1d77bc6d6/bin/ugemcutter-syNpU3ikLH/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682ee30b-15e2-49a9-930c-f7b1d77bc6d6/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_682ee30b-15e2-49a9-930c-f7b1d77bc6d6/bin/ugemcutter-syNpU3ikLH/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682ee30b-15e2-49a9-930c-f7b1d77bc6d6/bin/ugemcutter-syNpU3ikLH/config/GemCutterReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-dec-subseq.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682ee30b-15e2-49a9-930c-f7b1d77bc6d6/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_682ee30b-15e2-49a9-930c-f7b1d77bc6d6/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 ecda181bd3fe1882667151a04232fb9d04292dd6ca3491d98fdc8de5d539856a --- 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:37:45,380 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 18:37:45,383 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 18:37:45,425 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 18:37:45,426 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 18:37:45,429 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 18:37:45,432 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 18:37:45,434 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 18:37:45,436 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 18:37:45,437 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 18:37:45,439 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 18:37:45,440 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 18:37:45,441 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 18:37:45,446 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 18:37:45,448 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 18:37:45,449 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 18:37:45,451 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 18:37:45,452 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 18:37:45,453 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 18:37:45,459 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 18:37:45,462 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 18:37:45,465 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 18:37:45,468 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 18:37:45,469 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 18:37:45,473 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 18:37:45,479 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 18:37:45,480 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 18:37:45,481 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 18:37:45,482 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 18:37:45,483 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 18:37:45,485 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 18:37:45,486 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 18:37:45,487 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 18:37:45,488 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 18:37:45,489 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 18:37:45,490 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 18:37:45,490 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 18:37:45,491 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 18:37:45,491 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 18:37:45,493 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 18:37:45,494 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 18:37:45,495 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682ee30b-15e2-49a9-930c-f7b1d77bc6d6/bin/ugemcutter-syNpU3ikLH/config/svcomp-Reach-32bit-GemCutter_Default.epf [2022-11-25 18:37:45,525 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 18:37:45,525 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 18:37:45,525 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 18:37:45,526 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 18:37:45,526 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 18:37:45,527 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 18:37:45,527 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 18:37:45,527 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 18:37:45,528 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 18:37:45,528 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 18:37:45,528 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 18:37:45,529 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 18:37:45,529 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 18:37:45,529 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 18:37:45,529 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 18:37:45,529 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 18:37:45,530 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 18:37:45,530 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 18:37:45,530 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 18:37:45,530 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 18:37:45,531 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 18:37:45,531 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 18:37:45,531 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 18:37:45,531 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 18:37:45,532 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:37:45,532 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 18:37:45,532 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 18:37:45,532 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 18:37:45,533 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 18:37:45,533 INFO L138 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2022-11-25 18:37:45,533 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 18:37:45,533 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-25 18:37:45,534 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-25 18:37:45,534 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 18:37:45,534 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-25 18:37:45,534 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-25 18:37:45,534 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_682ee30b-15e2-49a9-930c-f7b1d77bc6d6/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_682ee30b-15e2-49a9-930c-f7b1d77bc6d6/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 -> ecda181bd3fe1882667151a04232fb9d04292dd6ca3491d98fdc8de5d539856a [2022-11-25 18:37:45,783 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 18:37:45,804 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 18:37:45,806 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 18:37:45,808 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 18:37:45,808 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 18:37:45,809 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682ee30b-15e2-49a9-930c-f7b1d77bc6d6/bin/ugemcutter-syNpU3ikLH/../../sv-benchmarks/c/weaver/popl20-more-dec-subseq.wvr.c [2022-11-25 18:37:48,809 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 18:37:49,103 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 18:37:49,104 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682ee30b-15e2-49a9-930c-f7b1d77bc6d6/sv-benchmarks/c/weaver/popl20-more-dec-subseq.wvr.c [2022-11-25 18:37:49,112 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682ee30b-15e2-49a9-930c-f7b1d77bc6d6/bin/ugemcutter-syNpU3ikLH/data/5596ac927/0979e8da40ed44bfb6453365611b69b8/FLAG0848a9f6b [2022-11-25 18:37:49,129 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682ee30b-15e2-49a9-930c-f7b1d77bc6d6/bin/ugemcutter-syNpU3ikLH/data/5596ac927/0979e8da40ed44bfb6453365611b69b8 [2022-11-25 18:37:49,135 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 18:37:49,138 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 18:37:49,142 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 18:37:49,142 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 18:37:49,148 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 18:37:49,149 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:37:49" (1/1) ... [2022-11-25 18:37:49,150 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7725c1e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:37:49, skipping insertion in model container [2022-11-25 18:37:49,151 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:37:49" (1/1) ... [2022-11-25 18:37:49,160 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 18:37:49,186 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 18:37:49,347 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:37:49,352 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:37:49,353 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:37:49,354 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:37:49,357 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:37:49,358 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:37:49,359 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:37:49,360 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:37:49,379 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:37:49,380 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:37:49,389 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_682ee30b-15e2-49a9-930c-f7b1d77bc6d6/sv-benchmarks/c/weaver/popl20-more-dec-subseq.wvr.c[2924,2937] [2022-11-25 18:37:49,398 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:37:49,409 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 18:37:49,424 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:37:49,426 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:37:49,427 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:37:49,427 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:37:49,428 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:37:49,429 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:37:49,429 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:37:49,430 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:37:49,431 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:37:49,432 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:37:49,437 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_682ee30b-15e2-49a9-930c-f7b1d77bc6d6/sv-benchmarks/c/weaver/popl20-more-dec-subseq.wvr.c[2924,2937] [2022-11-25 18:37:49,441 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:37:49,458 INFO L208 MainTranslator]: Completed translation [2022-11-25 18:37:49,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:37:49 WrapperNode [2022-11-25 18:37:49,459 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 18:37:49,460 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 18:37:49,460 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 18:37:49,461 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 18:37:49,485 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:37:49" (1/1) ... [2022-11-25 18:37:49,494 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:37:49" (1/1) ... [2022-11-25 18:37:49,523 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 191 [2022-11-25 18:37:49,524 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 18:37:49,524 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 18:37:49,525 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 18:37:49,525 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 18:37:49,536 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:37:49" (1/1) ... [2022-11-25 18:37:49,536 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:37:49" (1/1) ... [2022-11-25 18:37:49,539 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:37:49" (1/1) ... [2022-11-25 18:37:49,539 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:37:49" (1/1) ... [2022-11-25 18:37:49,555 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:37:49" (1/1) ... [2022-11-25 18:37:49,562 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:37:49" (1/1) ... [2022-11-25 18:37:49,564 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:37:49" (1/1) ... [2022-11-25 18:37:49,565 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:37:49" (1/1) ... [2022-11-25 18:37:49,568 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 18:37:49,570 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 18:37:49,570 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 18:37:49,570 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 18:37:49,571 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:37:49" (1/1) ... [2022-11-25 18:37:49,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:37:49,610 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682ee30b-15e2-49a9-930c-f7b1d77bc6d6/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:37:49,627 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682ee30b-15e2-49a9-930c-f7b1d77bc6d6/bin/ugemcutter-syNpU3ikLH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 18:37:49,629 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682ee30b-15e2-49a9-930c-f7b1d77bc6d6/bin/ugemcutter-syNpU3ikLH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 18:37:49,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 18:37:49,670 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-25 18:37:49,670 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-25 18:37:49,670 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-25 18:37:49,670 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-25 18:37:49,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 18:37:49,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 18:37:49,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 18:37:49,671 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 18:37:49,671 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 18:37:49,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 18:37:49,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 18:37:49,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 18:37:49,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 18:37:49,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 18:37:49,674 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:37:49,808 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 18:37:49,811 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 18:37:50,229 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 18:37:50,328 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 18:37:50,329 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-25 18:37:50,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:37:50 BoogieIcfgContainer [2022-11-25 18:37:50,332 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 18:37:50,335 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 18:37:50,335 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 18:37:50,339 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 18:37:50,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:37:49" (1/3) ... [2022-11-25 18:37:50,340 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bebb243 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:37:50, skipping insertion in model container [2022-11-25 18:37:50,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:37:49" (2/3) ... [2022-11-25 18:37:50,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bebb243 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:37:50, skipping insertion in model container [2022-11-25 18:37:50,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:37:50" (3/3) ... [2022-11-25 18:37:50,343 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-dec-subseq.wvr.c [2022-11-25 18:37:50,353 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-25 18:37:50,365 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 18:37:50,365 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 18:37:50,365 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 18:37:50,450 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-25 18:37:50,529 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:37:50,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-25 18:37:50,530 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682ee30b-15e2-49a9-930c-f7b1d77bc6d6/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:37:50,538 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682ee30b-15e2-49a9-930c-f7b1d77bc6d6/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-25 18:37:50,559 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682ee30b-15e2-49a9-930c-f7b1d77bc6d6/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-11-25 18:37:50,596 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-25 18:37:50,613 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2022-11-25 18:37:50,620 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;@1c5c7449, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:37:50,621 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-11-25 18:37:50,843 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:37:50,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:37:50,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1885589734, now seen corresponding path program 1 times [2022-11-25 18:37:50,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:37:50,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799541180] [2022-11-25 18:37:50,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:37:50,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:37:51,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:37:51,299 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:37:51,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:37:51,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799541180] [2022-11-25 18:37:51,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799541180] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:37:51,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:37:51,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:37:51,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191684792] [2022-11-25 18:37:51,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:37:51,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 18:37:51,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:37:51,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 18:37:51,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 18:37:51,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:37:51,345 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:37:51,346 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:37:51,346 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:37:51,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:37:51,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 18:37:51,402 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:37:51,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:37:51,403 INFO L85 PathProgramCache]: Analyzing trace with hash 532094629, now seen corresponding path program 1 times [2022-11-25 18:37:51,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:37:51,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600365447] [2022-11-25 18:37:51,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:37:51,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:37:51,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:37:52,256 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:37:52,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:37:52,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600365447] [2022-11-25 18:37:52,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600365447] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:37:52,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:37:52,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:37:52,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891839268] [2022-11-25 18:37:52,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:37:52,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:37:52,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:37:52,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:37:52,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:37:52,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:37:52,262 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:37:52,262 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:37:52,263 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:37:52,263 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:37:52,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:37:52,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:37:52,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 18:37:52,452 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:37:52,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:37:52,453 INFO L85 PathProgramCache]: Analyzing trace with hash 90971035, now seen corresponding path program 1 times [2022-11-25 18:37:52,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:37:52,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901046048] [2022-11-25 18:37:52,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:37:52,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:37:52,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:37:53,026 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:37:53,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:37:53,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901046048] [2022-11-25 18:37:53,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901046048] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:37:53,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:37:53,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:37:53,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18279744] [2022-11-25 18:37:53,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:37:53,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:37:53,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:37:53,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:37:53,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:37:53,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:37:53,031 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:37:53,031 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:37:53,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:37:53,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:37:53,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:37:53,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:37:53,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:37:53,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:37:53,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 18:37:53,304 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:37:53,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:37:53,306 INFO L85 PathProgramCache]: Analyzing trace with hash 276527094, now seen corresponding path program 1 times [2022-11-25 18:37:53,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:37:53,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245644343] [2022-11-25 18:37:53,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:37:53,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:37:53,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:37:53,615 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:37:53,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:37:53,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245644343] [2022-11-25 18:37:53,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245644343] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:37:53,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:37:53,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 18:37:53,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848825860] [2022-11-25 18:37:53,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:37:53,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:37:53,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:37:53,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:37:53,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:37:53,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:37:53,629 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:37:53,629 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:37:53,629 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:37:53,629 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:37:53,630 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:37:53,630 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:37:54,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:37:54,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:37:54,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:37:54,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:37:54,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 18:37:54,066 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:37:54,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:37:54,067 INFO L85 PathProgramCache]: Analyzing trace with hash 83365203, now seen corresponding path program 1 times [2022-11-25 18:37:54,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:37:54,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707105733] [2022-11-25 18:37:54,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:37:54,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:37:54,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:37:54,379 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:37:54,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:37:54,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707105733] [2022-11-25 18:37:54,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707105733] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:37:54,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:37:54,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 18:37:54,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752253763] [2022-11-25 18:37:54,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:37:54,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 18:37:54,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:37:54,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 18:37:54,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:37:54,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:37:54,386 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:37:54,387 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:37:54,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:37:54,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:37:54,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:37:54,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:37:54,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:37:54,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:37:54,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:37:54,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:37:54,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:37:54,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:37:54,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 18:37:54,712 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:37:54,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:37:54,714 INFO L85 PathProgramCache]: Analyzing trace with hash -732015546, now seen corresponding path program 1 times [2022-11-25 18:37:54,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:37:54,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807282191] [2022-11-25 18:37:54,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:37:54,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:37:54,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:37:57,619 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:37:57,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:37:57,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807282191] [2022-11-25 18:37:57,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807282191] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:37:57,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005318667] [2022-11-25 18:37:57,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:37:57,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:37:57,621 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682ee30b-15e2-49a9-930c-f7b1d77bc6d6/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:37:57,658 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682ee30b-15e2-49a9-930c-f7b1d77bc6d6/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:37:57,685 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682ee30b-15e2-49a9-930c-f7b1d77bc6d6/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 18:37:57,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:37:57,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-25 18:37:57,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:38:00,349 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:38:00,392 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:38:00,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:38:01,140 INFO L321 Elim1Store]: treesize reduction 15, result has 83.9 percent of original size [2022-11-25 18:38:01,140 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:38:03,244 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:38:03,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005318667] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:38:03,247 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:38:03,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25, 20] total 57 [2022-11-25 18:38:03,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280345400] [2022-11-25 18:38:03,249 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:38:03,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-11-25 18:38:03,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:38:03,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-11-25 18:38:03,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=529, Invalid=2663, Unknown=0, NotChecked=0, Total=3192 [2022-11-25 18:38:03,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:38:03,262 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:38:03,263 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:38:03,263 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:38:03,263 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:38:03,263 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:38:03,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:38:03,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:38:03,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:38:12,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:38:12,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:38:12,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:38:12,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:38:12,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:38:12,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-11-25 18:38:12,054 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682ee30b-15e2-49a9-930c-f7b1d77bc6d6/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 18:38:12,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682ee30b-15e2-49a9-930c-f7b1d77bc6d6/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-25 18:38:12,250 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:38:12,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:38:12,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1531297126, now seen corresponding path program 2 times [2022-11-25 18:38:12,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:38:12,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915392912] [2022-11-25 18:38:12,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:38:12,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:38:12,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:38:12,690 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:38:12,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:38:12,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915392912] [2022-11-25 18:38:12,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915392912] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:38:12,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344204366] [2022-11-25 18:38:12,691 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 18:38:12,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:38:12,692 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682ee30b-15e2-49a9-930c-f7b1d77bc6d6/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:38:12,693 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682ee30b-15e2-49a9-930c-f7b1d77bc6d6/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:38:12,715 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682ee30b-15e2-49a9-930c-f7b1d77bc6d6/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 18:38:13,142 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 18:38:13,142 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:38:13,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 18:38:13,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:38:13,397 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:38:13,397 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:38:13,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [344204366] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:38:13,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 18:38:13,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2022-11-25 18:38:13,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179075779] [2022-11-25 18:38:13,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:38:13,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:38:13,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:38:13,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:38:13,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:38:13,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:38:13,401 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:38:13,401 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:38:13,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:38:13,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:38:13,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:38:13,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:38:13,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:38:13,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 76 states. [2022-11-25 18:38:13,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:38:16,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:38:16,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:38:16,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:38:16,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:38:16,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:38:16,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-11-25 18:38:16,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:38:16,255 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682ee30b-15e2-49a9-930c-f7b1d77bc6d6/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-25 18:38:16,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682ee30b-15e2-49a9-930c-f7b1d77bc6d6/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:38:16,443 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:38:16,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:38:16,444 INFO L85 PathProgramCache]: Analyzing trace with hash 81772503, now seen corresponding path program 3 times [2022-11-25 18:38:16,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:38:16,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931321377] [2022-11-25 18:38:16,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:38:16,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:38:16,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:38:16,789 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:38:16,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:38:16,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931321377] [2022-11-25 18:38:16,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931321377] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:38:16,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [974340335] [2022-11-25 18:38:16,791 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 18:38:16,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:38:16,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682ee30b-15e2-49a9-930c-f7b1d77bc6d6/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:38:16,792 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682ee30b-15e2-49a9-930c-f7b1d77bc6d6/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:38:16,811 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682ee30b-15e2-49a9-930c-f7b1d77bc6d6/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 18:38:17,124 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-25 18:38:17,125 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:38:17,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-25 18:38:17,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:38:17,475 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:38:17,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:38:17,987 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:38:17,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [974340335] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:38:17,988 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:38:17,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 24 [2022-11-25 18:38:17,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104073888] [2022-11-25 18:38:17,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:38:17,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-25 18:38:17,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:38:17,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-25 18:38:17,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2022-11-25 18:38:17,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:38:17,991 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:38:17,992 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:38:17,992 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:38:17,992 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:38:17,992 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:38:17,992 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:38:17,992 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:38:17,992 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 94 states. [2022-11-25 18:38:17,992 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:38:17,992 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:38:23,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:38:23,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:38:23,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:38:23,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:38:23,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:38:23,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2022-11-25 18:38:23,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:38:23,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-11-25 18:38:23,099 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682ee30b-15e2-49a9-930c-f7b1d77bc6d6/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 18:38:23,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682ee30b-15e2-49a9-930c-f7b1d77bc6d6/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:38:23,295 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:38:23,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:38:23,296 INFO L85 PathProgramCache]: Analyzing trace with hash -282215482, now seen corresponding path program 4 times [2022-11-25 18:38:23,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:38:23,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162132504] [2022-11-25 18:38:23,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:38:23,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:38:23,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:38:27,023 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:38:27,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:38:27,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162132504] [2022-11-25 18:38:27,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162132504] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:38:27,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558812747] [2022-11-25 18:38:27,024 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 18:38:27,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:38:27,025 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682ee30b-15e2-49a9-930c-f7b1d77bc6d6/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:38:27,031 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682ee30b-15e2-49a9-930c-f7b1d77bc6d6/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:38:27,034 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682ee30b-15e2-49a9-930c-f7b1d77bc6d6/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 18:38:27,162 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 18:38:27,162 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:38:27,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 64 conjunts are in the unsatisfiable core [2022-11-25 18:38:27,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:38:27,810 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:38:28,167 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:38:29,262 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 18:38:29,262 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:38:29,555 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:38:30,820 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:38:31,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:38:31,382 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:38:32,154 INFO L321 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-11-25 18:38:32,155 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:38:32,230 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:38:32,230 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:38:34,766 WARN L837 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~end~0) (< c_~end~0 0) (let ((.cse3 (+ (* c_~end~0 4) c_~queue~0.offset))) (and (or (not (= (mod c_~ok~0 256) 0)) (forall ((~A~0.offset Int) (v_ArrVal_195 (Array Int Int)) (~i~0 Int) (v_ArrVal_196 (Array Int Int))) (let ((.cse1 (+ (* ~i~0 4) ~A~0.offset)) (.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195))) (or (< c_~last~0 (select (select .cse0 c_~A~0.base) .cse1)) (not (let ((.cse2 (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (= (select (select .cse2 c_~A~0.base) .cse1) (select (select .cse2 c_~queue~0.base) .cse3)))))))) (forall ((~A~0.offset Int) (v_ArrVal_195 (Array Int Int)) (~i~0 Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195)) (.cse6 (+ (* ~i~0 4) ~A~0.offset))) (or (forall ((v_ArrVal_196 (Array Int Int))) (let ((.cse5 (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (let ((.cse4 (select .cse5 c_~queue~0.base))) (or (< (select .cse4 (+ (* c_~start~0 4) c_~queue~0.offset)) (+ c_~v_old~0 1)) (not (= (select (select .cse5 c_~A~0.base) .cse6) (select .cse4 .cse3))))))) (< c_~last~0 (select (select .cse7 c_~A~0.base) .cse6)))))))) is different from false [2022-11-25 18:38:41,740 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:38:41,741 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:38:41,793 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:38:41,794 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:38:41,868 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:38:41,869 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 3784 [2022-11-25 18:38:41,945 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:38:41,946 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 3740 treesize of output 3112 [2022-11-25 18:38:42,031 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:38:42,032 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 3068 treesize of output 2776 [2022-11-25 18:39:01,106 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:39:01,106 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:39:01,154 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:39:01,156 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:39:01,794 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:39:01,795 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:39:02,330 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:39:02,331 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:39:02,875 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:39:02,876 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:39:17,452 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:39:17,452 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:39:18,445 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:39:18,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558812747] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:39:18,446 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:39:18,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 35, 35] total 92 [2022-11-25 18:39:18,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635360596] [2022-11-25 18:39:18,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:39:18,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 92 states [2022-11-25 18:39:18,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:39:18,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2022-11-25 18:39:18,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=833, Invalid=7242, Unknown=119, NotChecked=178, Total=8372 [2022-11-25 18:39:18,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:39:18,454 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:39:18,454 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:39:18,454 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:39:18,455 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:39:18,455 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:39:18,455 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:39:18,455 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:39:18,455 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 110 states. [2022-11-25 18:39:18,455 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:39:18,455 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2022-11-25 18:39:18,456 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:39:49,556 WARN L233 SmtUtils]: Spent 30.43s on a formula simplification that was a NOOP. DAG size: 299 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:40:23,065 WARN L233 SmtUtils]: Spent 30.58s on a formula simplification that was a NOOP. DAG size: 265 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:40:34,093 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:41:00,261 WARN L233 SmtUtils]: Spent 11.18s on a formula simplification. DAG size of input: 206 DAG size of output: 139 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:41:12,416 WARN L233 SmtUtils]: Spent 5.92s on a formula simplification. DAG size of input: 231 DAG size of output: 134 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:41:25,108 WARN L233 SmtUtils]: Spent 12.16s on a formula simplification. DAG size of input: 193 DAG size of output: 130 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:41:40,486 WARN L233 SmtUtils]: Spent 8.80s on a formula simplification. DAG size of input: 233 DAG size of output: 158 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:41:46,460 WARN L233 SmtUtils]: Spent 5.50s on a formula simplification. DAG size of input: 237 DAG size of output: 158 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:41:53,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:41:53,215 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse33 (* c_~end~0 4))) (let ((.cse9 (+ (* c_~start~0 4) c_~queue~0.offset)) (.cse13 (+ .cse33 c_~queue~0.offset))) (let ((.cse0 (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t2~0#1.base|)) (.cse3 (not (= .cse13 0))) (.cse4 (not (= .cse9 0))) (.cse5 (or (<= (+ c_~start~0 c_~n~0) (+ c_~end~0 1)) (<= .cse9 0))) (.cse2 (< 0 (+ .cse33 c_~queue~0.offset 1))) (.cse6 (or (<= .cse13 0) (<= c_~n~0 1))) (.cse7 (= c_~queue~0.offset 0)) (.cse1 (<= (+ c_~start~0 1) 0)) (.cse16 (<= c_~n~0 c_~end~0)) (.cse14 (not (= (mod c_~ok~0 256) 0))) (.cse17 (< c_~end~0 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 (not .cse1) (<= c_~end~0 c_~start~0)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (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 (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 ((.cse10 (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 ((.cse12 (store .cse10 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (let ((.cse11 (+ (* ~i~0 4) ~A~0.offset)) (.cse8 (select .cse12 c_~queue~0.base))) (or (< (select .cse8 .cse9) (+ (select (select .cse10 v_~A~0.base_19) .cse11) 1)) (not (= (select (select .cse12 v_~A~0.base_19) .cse11) (select .cse8 .cse13))) (< |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 ((.cse15 (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 .cse15 v_~A~0.base_19) (+ (* ~i~0 4) ~A~0.offset)) (select (select .cse15 c_~queue~0.base) .cse13)))) (< |c_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| v_~A~0.base_19))))) .cse16 .cse17) (<= c_~new~0 c_~v_old~0) (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) (or (and (or .cse3 (and (or (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~A~0.base)) .cse4) .cse5)) .cse2 .cse6 .cse7) .cse1) (or .cse16 .cse17 (and (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 ((.cse18 (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 .cse18 v_~A~0.base_19) (+ (* ~i~0 4) ~A~0.offset)) (select (select .cse18 c_~queue~0.base) .cse13)))) (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| v_~A~0.base_19)))) (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 ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195))) (let ((.cse19 (store .cse22 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (let ((.cse21 (select .cse19 c_~queue~0.base)) (.cse20 (+ (* ~i~0 4) ~A~0.offset))) (or (not (= (select (select .cse19 v_~A~0.base_19) .cse20) (select .cse21 .cse13))) (< (select .cse21 .cse9) (+ (select (select .cse22 v_~A~0.base_19) .cse20) 1)) (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| v_~A~0.base_19)))))))) (or .cse16 .cse17 (and (forall ((v_~A~0.base_19 Int)) (or (forall ((~A~0.offset Int) (v_ArrVal_195 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (~i~0 Int)) (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195))) (let ((.cse23 (store .cse26 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (let ((.cse25 (select .cse23 c_~queue~0.base)) (.cse24 (+ (* ~i~0 4) ~A~0.offset))) (or (not (= (select (select .cse23 v_~A~0.base_19) .cse24) (select .cse25 .cse13))) (< (select .cse25 .cse9) (+ (select (select .cse26 v_~A~0.base_19) .cse24) 1))))))) (not (<= v_~A~0.base_19 |c_ULTIMATE.start_main_#t~ret13#1.base|)))) (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 ((.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 v_~A~0.base_19) (+ (* ~i~0 4) ~A~0.offset)) (select (select .cse27 c_~queue~0.base) .cse13)))) (not (<= v_~A~0.base_19 |c_ULTIMATE.start_main_#t~ret13#1.base|))))))) (or .cse16 (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 ((.cse30 (select .cse28 c_~queue~0.base)) (.cse29 (+ (* ~i~0 4) ~A~0.offset))) (or (not (= (select (select .cse28 v_~A~0.base_19) .cse29) (select .cse30 .cse13))) (< (select .cse30 .cse9) (+ (select (select .cse31 v_~A~0.base_19) .cse29) 1)) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_~A~0.base_19)))))) (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 ((.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) .cse13)))) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_~A~0.base_19))) .cse14)) .cse17) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|))))) is different from false [2022-11-25 18:42:11,783 WARN L233 SmtUtils]: Spent 9.89s on a formula simplification. DAG size of input: 183 DAG size of output: 129 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:42:13,798 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:42:16,092 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:42:18,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:42:20,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 [1] [2022-11-25 18:42:33,739 WARN L233 SmtUtils]: Spent 8.22s on a formula simplification. DAG size of input: 235 DAG size of output: 160 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:42:46,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:43:07,163 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:43:08,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:43:08,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:43:08,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:43:08,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:43:08,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:43:08,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2022-11-25 18:43:08,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:43:08,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-11-25 18:43:08,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2022-11-25 18:43:08,131 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682ee30b-15e2-49a9-930c-f7b1d77bc6d6/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 18:43:08,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682ee30b-15e2-49a9-930c-f7b1d77bc6d6/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-25 18:43:08,326 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:43:08,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:43:08,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1182337734, now seen corresponding path program 5 times [2022-11-25 18:43:08,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:43:08,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470588087] [2022-11-25 18:43:08,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:43:08,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:43:08,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:43:10,780 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:43:10,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:43:10,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470588087] [2022-11-25 18:43:10,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470588087] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:43:10,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192551707] [2022-11-25 18:43:10,781 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-25 18:43:10,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:43:10,782 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682ee30b-15e2-49a9-930c-f7b1d77bc6d6/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:43:10,783 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682ee30b-15e2-49a9-930c-f7b1d77bc6d6/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:43:10,796 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682ee30b-15e2-49a9-930c-f7b1d77bc6d6/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 18:43:10,917 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 18:43:10,917 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:43:10,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-25 18:43:10,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:43:10,928 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:43:11,269 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 18:43:11,269 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:43:12,700 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-25 18:43:12,701 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:43:12,714 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:43:13,266 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-11-25 18:43:13,266 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:43:13,360 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:43:13,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:43:14,594 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:43:14,595 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:43:14,606 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:43:17,863 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:43:17,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192551707] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:43:17,863 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:43:17,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22, 20] total 57 [2022-11-25 18:43:17,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535344542] [2022-11-25 18:43:17,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:43:17,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-11-25 18:43:17,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:43:17,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-11-25 18:43:17,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=2812, Unknown=1, NotChecked=0, Total=3192 [2022-11-25 18:43:17,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:43:17,869 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:43:17,870 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:43:17,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:43:17,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:43:17,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:43:17,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:43:17,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:43:17,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 112 states. [2022-11-25 18:43:17,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:43:17,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2022-11-25 18:43:17,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 85 states. [2022-11-25 18:43:17,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:43:26,912 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:43:33,157 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:43:40,670 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:43:42,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:43:44,724 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:43:46,733 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:43:48,772 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:43:57,178 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:43:59,192 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:44:01,198 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:44:03,236 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:44:05,248 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:44:07,409 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:44:09,568 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:44:23,708 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:44:25,871 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:44:28,119 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:44:30,129 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:44:32,136 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:44:38,961 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:44:41,012 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:45:02,254 WARN L233 SmtUtils]: Spent 11.67s on a formula simplification. DAG size of input: 223 DAG size of output: 152 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:45:04,268 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:45:10,566 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:45:13,434 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:45:16,079 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:45:18,085 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:45:20,386 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:45:22,691 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:45:24,736 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:45:27,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:45:29,683 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:45:31,707 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:45:35,878 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:45:37,904 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:45:41,083 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:45:49,376 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:45:51,709 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:45:57,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:46:21,549 WARN L233 SmtUtils]: Spent 7.48s on a formula simplification. DAG size of input: 81 DAG size of output: 69 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:47:01,361 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:47:03,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 18:47:10,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:47:10,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:47:10,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:47:10,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:47:10,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:47:10,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2022-11-25 18:47:10,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:47:10,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-11-25 18:47:10,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2022-11-25 18:47:10,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2022-11-25 18:47:10,615 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682ee30b-15e2-49a9-930c-f7b1d77bc6d6/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-25 18:47:10,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682ee30b-15e2-49a9-930c-f7b1d77bc6d6/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-25 18:47:10,806 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:47:10,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:47:10,807 INFO L85 PathProgramCache]: Analyzing trace with hash -704172357, now seen corresponding path program 6 times [2022-11-25 18:47:10,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:47:10,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974578556] [2022-11-25 18:47:10,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:47:10,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:47:10,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:47:17,607 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:47:17,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:47:17,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974578556] [2022-11-25 18:47:17,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974578556] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:47:17,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530325780] [2022-11-25 18:47:17,608 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-25 18:47:17,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:47:17,608 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682ee30b-15e2-49a9-930c-f7b1d77bc6d6/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:47:17,609 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682ee30b-15e2-49a9-930c-f7b1d77bc6d6/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:47:17,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682ee30b-15e2-49a9-930c-f7b1d77bc6d6/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 18:47:18,040 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-11-25 18:47:18,040 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:47:18,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-25 18:47:18,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:47:21,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:47:21,822 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:47:22,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:47:22,109 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:47:23,056 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-25 18:47:23,057 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:47:23,137 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:47:23,139 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:47:26,191 INFO L321 Elim1Store]: treesize reduction 15, result has 89.9 percent of original size [2022-11-25 18:47:26,192 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:47:26,256 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:47:26,257 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:47:26,321 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:47:26,322 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:47:26,360 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:47:26,360 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:47:26,399 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:47:26,400 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:47:47,192 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:47:47,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530325780] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:47:47,192 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:47:47,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 30, 31] total 89 [2022-11-25 18:47:47,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910913625] [2022-11-25 18:47:47,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:47:47,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 89 states [2022-11-25 18:47:47,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:47:47,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2022-11-25 18:47:47,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=731, Invalid=7083, Unknown=18, NotChecked=0, Total=7832 [2022-11-25 18:47:47,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:47:47,198 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:47:47,199 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:47:47,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:47:47,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:47:47,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:47:47,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:47:47,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:47:47,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 151 states. [2022-11-25 18:47:47,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:47:47,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 73 states. [2022-11-25 18:47:47,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 150 states. [2022-11-25 18:47:47,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 103 states. [2022-11-25 18:47:47,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:47:50,287 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse24 (* c_~i~0 4)) (.cse25 (* c_~end~0 4))) (let ((.cse21 (+ |c_#StackHeapBarrier| 1)) (.cse26 (* c_~start~0 4)) (.cse4 (+ .cse25 c_~queue~0.offset)) (.cse6 (+ c_~A~0.offset .cse24)) (.cse10 (not (= (mod c_~ok~0 256) 0)))) (let ((.cse14 (not (<= 0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|))) (.cse8 (or (forall ((~queue~0.base Int) (v_ArrVal_267 (Array Int Int)) (v_ArrVal_268 (Array Int Int))) (not (let ((.cse27 (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 .cse27 ~queue~0.base) .cse4) (select (select .cse27 c_~A~0.base) .cse6))))) .cse10)) (.cse7 (+ .cse26 c_~queue~0.offset)) (.cse15 (+ c_~v_old~0 1)) (.cse13 (<= .cse21 |c_ULTIMATE.start_main_~#t1~0#1.base|)) (.cse0 (not (< c_~end~0 c_~n~0))) (.cse1 (< c_~start~0 0)) (.cse11 (= .cse25 .cse26)) (.cse12 (= .cse24 0)) (.cse2 (not (<= 0 c_~end~0))) (.cse9 (<= c_~n~0 c_~start~0))) (and (or .cse0 .cse1 .cse2 (and (forall ((~queue~0.base Int) (v_ArrVal_267 (Array Int Int)) (v_ArrVal_268 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_267) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_268))) (let ((.cse3 (select .cse5 ~queue~0.base))) (or (not (= (select .cse3 .cse4) (select (select .cse5 c_~A~0.base) .cse6))) (< (select .cse3 .cse7) (+ |c_ULTIMATE.start_main_#t~mem14#1| 1)))))) .cse8) .cse9) (= c_~i~0 0) (<= c_~n~0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (or (and (not (<= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_main_#t~ret13#1.base|)) .cse10 .cse11 (not (<= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_main_#t~ret13#1.base|)) .cse12) .cse0 .cse1 .cse2 .cse9) .cse13 (or .cse0 (and .cse10 (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|) .cse11 (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse12) .cse1 .cse2 .cse9) (or (= |c_ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) .cse14) (or (and (< (select (select |c_#memory_int| c_~queue~0.base) .cse7) .cse15) .cse10) .cse1 .cse9) (= c_~ok~0 1) (or .cse0 (let ((.cse17 (select (select |c_#memory_int| c_~A~0.base) .cse6))) (and (forall ((~queue~0.base Int)) (let ((.cse16 (select |c_#memory_int| ~queue~0.base))) (or (not (= (select .cse16 .cse4) .cse17)) (< (select .cse16 .cse7) .cse15)))) (or (forall ((~queue~0.base Int)) (not (= (select (select |c_#memory_int| ~queue~0.base) .cse4) .cse17))) .cse10))) .cse1 .cse2 .cse9) (or .cse0 (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| c_~A~0.base)) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~A~0.base)) .cse10 .cse11 .cse12) .cse1 .cse2 .cse9) (<= c_~n~0 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or .cse0 .cse1 .cse2 (and (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|) .cse10 .cse11 (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse12) .cse9) (<= c_~start~0 c_~end~0) (or (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse14) (<= c_~end~0 c_~start~0) (or .cse0 (and (or (forall ((~queue~0.base Int) (v_ArrVal_268 (Array Int Int))) (not (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_268))) (= (select (select .cse18 ~queue~0.base) .cse4) (select (select .cse18 c_~A~0.base) .cse6))))) .cse10) (forall ((~queue~0.base Int) (v_ArrVal_268 (Array Int Int))) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_268))) (let ((.cse19 (select .cse20 ~queue~0.base))) (or (not (= (select .cse19 .cse4) (select (select .cse20 c_~A~0.base) .cse6))) (< (select .cse19 .cse7) .cse15)))))) .cse1 .cse2 .cse9) (<= .cse21 |c_ULTIMATE.start_main_~#t2~0#1.base|) (= c_~start~0 c_~end~0) (or .cse0 .cse1 .cse2 (and .cse8 (forall ((~queue~0.base Int) (v_ArrVal_267 (Array Int Int)) (v_ArrVal_268 (Array Int Int))) (let ((.cse23 (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 ((.cse22 (select .cse23 ~queue~0.base))) (or (not (= (select .cse22 .cse4) (select (select .cse23 c_~A~0.base) .cse6))) (< (select .cse22 .cse7) .cse15)))))) .cse9) (or (<= c_~end~0 0) (and (<= (* c_~n~0 4) (* |c_ULTIMATE.start_create_fresh_int_array_~size#1| 4)) .cse13)) (<= c_~n~0 2) (or .cse0 .cse1 (and (< |c_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|) .cse10 .cse11 (< |c_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse12) .cse2 .cse9))))) is different from false [2022-11-25 18:47:53,229 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse25 (* c_~i~0 4)) (.cse26 (* c_~end~0 4))) (let ((.cse22 (+ |c_#StackHeapBarrier| 1)) (.cse27 (* c_~start~0 4)) (.cse4 (+ .cse26 c_~queue~0.offset)) (.cse6 (+ c_~A~0.offset .cse25)) (.cse10 (not (= (mod c_~ok~0 256) 0)))) (let ((.cse8 (or (forall ((~queue~0.base Int) (v_ArrVal_267 (Array Int Int)) (v_ArrVal_268 (Array Int Int))) (not (let ((.cse28 (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 .cse28 ~queue~0.base) .cse4) (select (select .cse28 c_~A~0.base) .cse6))))) .cse10)) (.cse7 (+ .cse27 c_~queue~0.offset)) (.cse16 (+ c_~v_old~0 1)) (.cse15 (<= c_~end~0 0)) (.cse14 (* c_~n~0 4)) (.cse13 (<= .cse22 |c_ULTIMATE.start_main_~#t1~0#1.base|)) (.cse0 (not (< c_~end~0 c_~n~0))) (.cse1 (< c_~start~0 0)) (.cse11 (= .cse26 .cse27)) (.cse12 (= .cse25 0)) (.cse2 (not (<= 0 c_~end~0))) (.cse9 (<= c_~n~0 c_~start~0))) (and (or .cse0 .cse1 .cse2 (and (forall ((~queue~0.base Int) (v_ArrVal_267 (Array Int Int)) (v_ArrVal_268 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_267) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_268))) (let ((.cse3 (select .cse5 ~queue~0.base))) (or (not (= (select .cse3 .cse4) (select (select .cse5 c_~A~0.base) .cse6))) (< (select .cse3 .cse7) (+ |c_ULTIMATE.start_main_#t~mem14#1| 1)))))) .cse8) .cse9) (= c_~i~0 0) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) (<= c_~n~0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (or (and (not (<= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_main_#t~ret13#1.base|)) .cse10 .cse11 (not (<= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_main_#t~ret13#1.base|)) .cse12) .cse0 .cse1 .cse2 .cse9) .cse13 (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (or .cse0 (and .cse10 (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|) .cse11 (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse12) .cse1 .cse2 .cse9) (or (and .cse13 (<= .cse14 8)) .cse15) (or (and (< (select (select |c_#memory_int| c_~queue~0.base) .cse7) .cse16) .cse10) .cse1 .cse9) (= c_~ok~0 1) (or .cse0 (let ((.cse18 (select (select |c_#memory_int| c_~A~0.base) .cse6))) (and (forall ((~queue~0.base Int)) (let ((.cse17 (select |c_#memory_int| ~queue~0.base))) (or (not (= (select .cse17 .cse4) .cse18)) (< (select .cse17 .cse7) .cse16)))) (or (forall ((~queue~0.base Int)) (not (= (select (select |c_#memory_int| ~queue~0.base) .cse4) .cse18))) .cse10))) .cse1 .cse2 .cse9) (or .cse0 (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| c_~A~0.base)) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~A~0.base)) .cse10 .cse11 .cse12) .cse1 .cse2 .cse9) (<= c_~n~0 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or .cse0 .cse1 .cse2 (and (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|) .cse10 .cse11 (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse12) .cse9) (<= c_~start~0 c_~end~0) (<= c_~end~0 c_~start~0) (or .cse0 (and (or (forall ((~queue~0.base Int) (v_ArrVal_268 (Array Int Int))) (not (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_268))) (= (select (select .cse19 ~queue~0.base) .cse4) (select (select .cse19 c_~A~0.base) .cse6))))) .cse10) (forall ((~queue~0.base Int) (v_ArrVal_268 (Array Int Int))) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_268))) (let ((.cse20 (select .cse21 ~queue~0.base))) (or (not (= (select .cse20 .cse4) (select (select .cse21 c_~A~0.base) .cse6))) (< (select .cse20 .cse7) .cse16)))))) .cse1 .cse2 .cse9) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse22 |c_ULTIMATE.start_main_~#t2~0#1.base|) (= c_~start~0 c_~end~0) (or .cse0 .cse1 .cse2 (and .cse8 (forall ((~queue~0.base Int) (v_ArrVal_267 (Array Int Int)) (v_ArrVal_268 (Array Int Int))) (let ((.cse24 (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 ((.cse23 (select .cse24 ~queue~0.base))) (or (not (= (select .cse23 .cse4) (select (select .cse24 c_~A~0.base) .cse6))) (< (select .cse23 .cse7) .cse16)))))) .cse9) (or .cse15 (and (<= .cse14 (* |c_ULTIMATE.start_create_fresh_int_array_~size#1| 4)) .cse13)) (<= c_~n~0 2) (or .cse0 .cse1 (and (< |c_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|) .cse10 .cse11 (< |c_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse12) .cse2 .cse9))))) is different from false [2022-11-25 18:48:15,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] [2022-11-25 18:48:18,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 18:48:20,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 18:48:22,426 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:48:24,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 18:48:29,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:48:29,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:48:29,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:48:29,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:48:29,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:48:29,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2022-11-25 18:48:29,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:48:29,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2022-11-25 18:48:29,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2022-11-25 18:48:29,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2022-11-25 18:48:29,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2022-11-25 18:48:29,587 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682ee30b-15e2-49a9-930c-f7b1d77bc6d6/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-25 18:48:29,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682ee30b-15e2-49a9-930c-f7b1d77bc6d6/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-25 18:48:29,783 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:48:29,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:48:29,783 INFO L85 PathProgramCache]: Analyzing trace with hash 335291463, now seen corresponding path program 7 times [2022-11-25 18:48:29,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:48:29,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628336366] [2022-11-25 18:48:29,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:48:29,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:48:29,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:48:33,891 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:48:33,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:48:33,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628336366] [2022-11-25 18:48:33,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628336366] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:48:33,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674591452] [2022-11-25 18:48:33,892 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-25 18:48:33,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:48:33,892 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682ee30b-15e2-49a9-930c-f7b1d77bc6d6/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:48:33,893 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682ee30b-15e2-49a9-930c-f7b1d77bc6d6/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:48:33,895 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682ee30b-15e2-49a9-930c-f7b1d77bc6d6/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 18:48:34,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:48:34,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 57 conjunts are in the unsatisfiable core [2022-11-25 18:48:34,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:48:38,888 INFO L321 Elim1Store]: treesize reduction 104, result has 35.4 percent of original size [2022-11-25 18:48:38,889 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:48:39,055 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:48:39,055 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:48:45,059 INFO L321 Elim1Store]: treesize reduction 214, result has 82.6 percent of original size [2022-11-25 18:48:45,060 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:51:22,305 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 18:51:31,464 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts.