./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 4e7fbc69 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_8b2abd36-3e95-4833-9951-61813bea9def/bin/ugemcutter-1C6z4D84am/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b2abd36-3e95-4833-9951-61813bea9def/bin/ugemcutter-1C6z4D84am/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b2abd36-3e95-4833-9951-61813bea9def/bin/ugemcutter-1C6z4D84am/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b2abd36-3e95-4833-9951-61813bea9def/bin/ugemcutter-1C6z4D84am/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_8b2abd36-3e95-4833-9951-61813bea9def/bin/ugemcutter-1C6z4D84am/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b2abd36-3e95-4833-9951-61813bea9def/bin/ugemcutter-1C6z4D84am --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 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-4e7fbc6 [2022-11-23 06:53:59,292 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 06:53:59,295 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 06:53:59,338 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 06:53:59,340 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 06:53:59,344 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 06:53:59,345 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 06:53:59,349 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 06:53:59,351 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 06:53:59,357 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 06:53:59,359 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 06:53:59,361 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 06:53:59,362 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 06:53:59,365 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 06:53:59,367 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 06:53:59,369 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 06:53:59,371 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 06:53:59,373 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 06:53:59,374 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 06:53:59,382 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 06:53:59,384 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 06:53:59,386 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 06:53:59,388 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 06:53:59,389 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 06:53:59,397 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 06:53:59,399 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 06:53:59,400 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 06:53:59,401 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 06:53:59,403 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 06:53:59,405 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 06:53:59,406 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 06:53:59,408 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 06:53:59,409 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 06:53:59,412 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 06:53:59,415 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 06:53:59,415 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 06:53:59,416 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 06:53:59,416 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 06:53:59,416 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 06:53:59,419 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 06:53:59,420 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 06:53:59,421 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b2abd36-3e95-4833-9951-61813bea9def/bin/ugemcutter-1C6z4D84am/config/svcomp-Reach-32bit-GemCutter_Default.epf [2022-11-23 06:53:59,452 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 06:53:59,453 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 06:53:59,454 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 06:53:59,454 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 06:53:59,455 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 06:53:59,455 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 06:53:59,456 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 06:53:59,456 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 06:53:59,456 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 06:53:59,456 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 06:53:59,458 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 06:53:59,458 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 06:53:59,458 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 06:53:59,458 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 06:53:59,459 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 06:53:59,459 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 06:53:59,459 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 06:53:59,459 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 06:53:59,459 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 06:53:59,460 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 06:53:59,460 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 06:53:59,460 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 06:53:59,460 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 06:53:59,461 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 06:53:59,461 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 06:53:59,461 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 06:53:59,461 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 06:53:59,461 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 06:53:59,462 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-23 06:53:59,462 INFO L138 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2022-11-23 06:53:59,463 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 06:53:59,463 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-23 06:53:59,463 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-23 06:53:59,464 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 06:53:59,464 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-23 06:53:59,464 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-23 06:53:59,464 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_8b2abd36-3e95-4833-9951-61813bea9def/bin/ugemcutter-1C6z4D84am/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b2abd36-3e95-4833-9951-61813bea9def/bin/ugemcutter-1C6z4D84am Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ecda181bd3fe1882667151a04232fb9d04292dd6ca3491d98fdc8de5d539856a [2022-11-23 06:53:59,711 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 06:53:59,739 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 06:53:59,741 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 06:53:59,743 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 06:53:59,743 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 06:53:59,744 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b2abd36-3e95-4833-9951-61813bea9def/bin/ugemcutter-1C6z4D84am/../../sv-benchmarks/c/weaver/popl20-more-dec-subseq.wvr.c [2022-11-23 06:54:02,742 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 06:54:03,024 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 06:54:03,025 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b2abd36-3e95-4833-9951-61813bea9def/sv-benchmarks/c/weaver/popl20-more-dec-subseq.wvr.c [2022-11-23 06:54:03,031 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b2abd36-3e95-4833-9951-61813bea9def/bin/ugemcutter-1C6z4D84am/data/c6a3aa9d1/780e03d7300c49a399fdfdc09f09b3e8/FLAG25e90e8a1 [2022-11-23 06:54:03,044 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b2abd36-3e95-4833-9951-61813bea9def/bin/ugemcutter-1C6z4D84am/data/c6a3aa9d1/780e03d7300c49a399fdfdc09f09b3e8 [2022-11-23 06:54:03,047 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 06:54:03,049 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 06:54:03,050 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 06:54:03,050 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 06:54:03,059 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 06:54:03,060 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:54:03" (1/1) ... [2022-11-23 06:54:03,061 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1397423 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:54:03, skipping insertion in model container [2022-11-23 06:54:03,061 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:54:03" (1/1) ... [2022-11-23 06:54:03,070 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 06:54:03,090 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 06:54:03,279 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_8b2abd36-3e95-4833-9951-61813bea9def/sv-benchmarks/c/weaver/popl20-more-dec-subseq.wvr.c[2924,2937] [2022-11-23 06:54:03,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 06:54:03,298 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 06:54:03,319 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_8b2abd36-3e95-4833-9951-61813bea9def/sv-benchmarks/c/weaver/popl20-more-dec-subseq.wvr.c[2924,2937] [2022-11-23 06:54:03,322 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 06:54:03,340 INFO L208 MainTranslator]: Completed translation [2022-11-23 06:54:03,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:54:03 WrapperNode [2022-11-23 06:54:03,340 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 06:54:03,341 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 06:54:03,341 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 06:54:03,342 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 06:54:03,348 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:54:03" (1/1) ... [2022-11-23 06:54:03,356 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:54:03" (1/1) ... [2022-11-23 06:54:03,397 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 191 [2022-11-23 06:54:03,402 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 06:54:03,403 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 06:54:03,403 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 06:54:03,403 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 06:54:03,414 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:54:03" (1/1) ... [2022-11-23 06:54:03,415 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:54:03" (1/1) ... [2022-11-23 06:54:03,430 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:54:03" (1/1) ... [2022-11-23 06:54:03,431 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:54:03" (1/1) ... [2022-11-23 06:54:03,438 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:54:03" (1/1) ... [2022-11-23 06:54:03,442 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:54:03" (1/1) ... [2022-11-23 06:54:03,458 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:54:03" (1/1) ... [2022-11-23 06:54:03,460 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:54:03" (1/1) ... [2022-11-23 06:54:03,463 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 06:54:03,464 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 06:54:03,464 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 06:54:03,464 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 06:54:03,465 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:54:03" (1/1) ... [2022-11-23 06:54:03,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 06:54:03,485 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b2abd36-3e95-4833-9951-61813bea9def/bin/ugemcutter-1C6z4D84am/z3 [2022-11-23 06:54:03,499 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b2abd36-3e95-4833-9951-61813bea9def/bin/ugemcutter-1C6z4D84am/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 06:54:03,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b2abd36-3e95-4833-9951-61813bea9def/bin/ugemcutter-1C6z4D84am/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 06:54:03,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 06:54:03,549 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-23 06:54:03,549 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-23 06:54:03,549 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-23 06:54:03,551 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-23 06:54:03,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 06:54:03,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 06:54:03,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 06:54:03,552 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-23 06:54:03,552 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-23 06:54:03,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-23 06:54:03,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 06:54:03,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 06:54:03,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-23 06:54:03,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 06:54:03,555 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-23 06:54:03,726 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 06:54:03,729 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 06:54:04,135 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 06:54:04,257 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 06:54:04,258 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-23 06:54:04,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:54:04 BoogieIcfgContainer [2022-11-23 06:54:04,261 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 06:54:04,264 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 06:54:04,264 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 06:54:04,267 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 06:54:04,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 06:54:03" (1/3) ... [2022-11-23 06:54:04,269 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a2dab13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:54:04, skipping insertion in model container [2022-11-23 06:54:04,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:54:03" (2/3) ... [2022-11-23 06:54:04,269 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a2dab13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:54:04, skipping insertion in model container [2022-11-23 06:54:04,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:54:04" (3/3) ... [2022-11-23 06:54:04,271 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-dec-subseq.wvr.c [2022-11-23 06:54:04,280 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-23 06:54:04,291 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 06:54:04,292 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-23 06:54:04,292 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 06:54:04,376 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-23 06:54:04,434 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 06:54:04,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-23 06:54:04,434 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b2abd36-3e95-4833-9951-61813bea9def/bin/ugemcutter-1C6z4D84am/z3 [2022-11-23 06:54:04,438 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b2abd36-3e95-4833-9951-61813bea9def/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-23 06:54:04,457 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b2abd36-3e95-4833-9951-61813bea9def/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-11-23 06:54:04,504 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-23 06:54:04,523 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2022-11-23 06:54:04,530 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;@125ae91f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 06:54:04,531 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-11-23 06:54:04,859 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-23 06:54:04,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:54:04,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1885589734, now seen corresponding path program 1 times [2022-11-23 06:54:04,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:54:04,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775997349] [2022-11-23 06:54:04,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:54:04,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:54:05,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:54:05,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 06:54:05,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:54:05,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775997349] [2022-11-23 06:54:05,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775997349] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 06:54:05,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 06:54:05,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 06:54:05,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772771560] [2022-11-23 06:54:05,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 06:54:05,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-23 06:54:05,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:54:05,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-23 06:54:05,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 06:54:05,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:05,275 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:54:05,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 69.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 06:54:05,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:05,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:05,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 06:54:05,351 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-23 06:54:05,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:54:05,352 INFO L85 PathProgramCache]: Analyzing trace with hash 532094629, now seen corresponding path program 1 times [2022-11-23 06:54:05,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:54:05,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564878574] [2022-11-23 06:54:05,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:54:05,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:54:05,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:54:06,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 06:54:06,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:54:06,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564878574] [2022-11-23 06:54:06,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564878574] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 06:54:06,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 06:54:06,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 06:54:06,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668411157] [2022-11-23 06:54:06,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 06:54:06,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 06:54:06,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:54:06,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 06:54:06,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 06:54:06,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:06,149 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:54:06,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 06:54:06,150 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:06,150 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:06,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:06,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 06:54:06,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 06:54:06,305 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-23 06:54:06,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:54:06,305 INFO L85 PathProgramCache]: Analyzing trace with hash 90971035, now seen corresponding path program 1 times [2022-11-23 06:54:06,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:54:06,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648315254] [2022-11-23 06:54:06,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:54:06,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:54:06,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:54:06,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 06:54:06,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:54:06,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648315254] [2022-11-23 06:54:06,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648315254] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 06:54:06,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 06:54:06,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 06:54:06,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897668988] [2022-11-23 06:54:06,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 06:54:06,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 06:54:06,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:54:06,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 06:54:06,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 06:54:06,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:06,875 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:54:06,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 06:54:06,879 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:06,879 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-23 06:54:06,879 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:07,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:07,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 06:54:07,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:54:07,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 06:54:07,104 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-23 06:54:07,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:54:07,106 INFO L85 PathProgramCache]: Analyzing trace with hash 276527094, now seen corresponding path program 1 times [2022-11-23 06:54:07,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:54:07,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928147055] [2022-11-23 06:54:07,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:54:07,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:54:07,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:54:07,368 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 06:54:07,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:54:07,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928147055] [2022-11-23 06:54:07,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928147055] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 06:54:07,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 06:54:07,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 06:54:07,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641510665] [2022-11-23 06:54:07,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 06:54:07,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 06:54:07,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:54:07,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 06:54:07,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-23 06:54:07,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:07,378 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:54:07,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 06:54:07,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:07,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-23 06:54:07,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:54:07,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:07,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:07,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 06:54:07,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:54:07,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:54:07,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 06:54:07,735 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-23 06:54:07,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:54:07,735 INFO L85 PathProgramCache]: Analyzing trace with hash 83365203, now seen corresponding path program 1 times [2022-11-23 06:54:07,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:54:07,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496979255] [2022-11-23 06:54:07,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:54:07,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:54:07,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:54:08,012 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 06:54:08,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:54:08,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496979255] [2022-11-23 06:54:08,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496979255] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 06:54:08,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 06:54:08,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-23 06:54:08,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424018386] [2022-11-23 06:54:08,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 06:54:08,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 06:54:08,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:54:08,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 06:54:08,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-23 06:54:08,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:08,016 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:54:08,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.857142857142858) internal successors, (153), 7 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 06:54:08,017 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:08,017 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-23 06:54:08,017 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:54:08,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:54:08,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:08,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:08,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 06:54:08,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:54:08,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:54:08,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:54:08,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 06:54:08,306 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-23 06:54:08,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:54:08,306 INFO L85 PathProgramCache]: Analyzing trace with hash -732015546, now seen corresponding path program 1 times [2022-11-23 06:54:08,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:54:08,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392445544] [2022-11-23 06:54:08,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:54:08,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:54:08,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:54:11,238 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 06:54:11,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:54:11,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392445544] [2022-11-23 06:54:11,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392445544] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 06:54:11,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792241586] [2022-11-23 06:54:11,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:54:11,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 06:54:11,240 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b2abd36-3e95-4833-9951-61813bea9def/bin/ugemcutter-1C6z4D84am/z3 [2022-11-23 06:54:11,262 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b2abd36-3e95-4833-9951-61813bea9def/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 06:54:11,287 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b2abd36-3e95-4833-9951-61813bea9def/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-23 06:54:11,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:54:11,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-23 06:54:11,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 06:54:13,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-23 06:54:13,809 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 06:54:13,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 06:54:14,489 INFO L321 Elim1Store]: treesize reduction 15, result has 83.9 percent of original size [2022-11-23 06:54:14,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 103 [2022-11-23 06:54:16,510 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 06:54:16,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1792241586] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 06:54:16,513 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 06:54:16,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25, 20] total 57 [2022-11-23 06:54:16,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085806550] [2022-11-23 06:54:16,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 06:54:16,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-11-23 06:54:16,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:54:16,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-11-23 06:54:16,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=529, Invalid=2663, Unknown=0, NotChecked=0, Total=3192 [2022-11-23 06:54:16,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:16,521 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:54:16,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 7.175438596491228) internal successors, (409), 57 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 06:54:16,522 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:16,522 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-23 06:54:16,522 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:54:16,522 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:54:16,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:54:16,527 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:24,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:24,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 06:54:24,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:54:24,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:54:24,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:54:24,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-11-23 06:54:24,627 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b2abd36-3e95-4833-9951-61813bea9def/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-23 06:54:24,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b2abd36-3e95-4833-9951-61813bea9def/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 06:54:24,815 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-23 06:54:24,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:54:24,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1531297126, now seen corresponding path program 2 times [2022-11-23 06:54:24,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:54:24,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637587156] [2022-11-23 06:54:24,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:54:24,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:54:24,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:54:25,191 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 06:54:25,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:54:25,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637587156] [2022-11-23 06:54:25,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637587156] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 06:54:25,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114304615] [2022-11-23 06:54:25,192 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 06:54:25,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 06:54:25,192 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b2abd36-3e95-4833-9951-61813bea9def/bin/ugemcutter-1C6z4D84am/z3 [2022-11-23 06:54:25,193 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b2abd36-3e95-4833-9951-61813bea9def/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 06:54:25,208 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b2abd36-3e95-4833-9951-61813bea9def/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-23 06:54:25,513 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 06:54:25,513 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 06:54:25,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-23 06:54:25,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 06:54:25,718 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 06:54:25,718 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 06:54:25,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114304615] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 06:54:25,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 06:54:25,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2022-11-23 06:54:25,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77265854] [2022-11-23 06:54:25,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 06:54:25,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 06:54:25,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:54:25,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 06:54:25,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-23 06:54:25,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:25,721 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:54:25,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 06:54:25,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:25,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-23 06:54:25,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:54:25,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:54:25,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:54:25,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 76 states. [2022-11-23 06:54:25,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:28,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:28,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 06:54:28,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:54:28,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:54:28,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:54:28,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-11-23 06:54:28,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 06:54:28,552 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b2abd36-3e95-4833-9951-61813bea9def/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-23 06:54:28,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b2abd36-3e95-4833-9951-61813bea9def/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-23 06:54:28,746 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-23 06:54:28,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:54:28,747 INFO L85 PathProgramCache]: Analyzing trace with hash 81772503, now seen corresponding path program 3 times [2022-11-23 06:54:28,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:54:28,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660848714] [2022-11-23 06:54:28,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:54:28,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:54:28,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:54:29,100 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 06:54:29,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:54:29,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660848714] [2022-11-23 06:54:29,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660848714] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 06:54:29,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952277285] [2022-11-23 06:54:29,101 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 06:54:29,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 06:54:29,102 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b2abd36-3e95-4833-9951-61813bea9def/bin/ugemcutter-1C6z4D84am/z3 [2022-11-23 06:54:29,103 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b2abd36-3e95-4833-9951-61813bea9def/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 06:54:29,131 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b2abd36-3e95-4833-9951-61813bea9def/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-23 06:54:29,454 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-23 06:54:29,455 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 06:54:29,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-23 06:54:29,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 06:54:29,764 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 06:54:29,764 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 06:54:30,154 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 06:54:30,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952277285] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 06:54:30,154 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 06:54:30,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 24 [2022-11-23 06:54:30,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934812191] [2022-11-23 06:54:30,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 06:54:30,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-23 06:54:30,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:54:30,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-23 06:54:30,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2022-11-23 06:54:30,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:30,158 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:54:30,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 15.0) internal successors, (360), 24 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 06:54:30,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:30,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-23 06:54:30,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:54:30,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:54:30,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:54:30,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 94 states. [2022-11-23 06:54:30,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-23 06:54:30,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:34,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:34,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 06:54:34,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:54:34,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:54:34,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:54:34,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2022-11-23 06:54:34,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 06:54:34,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-11-23 06:54:34,999 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b2abd36-3e95-4833-9951-61813bea9def/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-23 06:54:35,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b2abd36-3e95-4833-9951-61813bea9def/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 06:54:35,191 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-23 06:54:35,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:54:35,191 INFO L85 PathProgramCache]: Analyzing trace with hash -282215482, now seen corresponding path program 4 times [2022-11-23 06:54:35,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:54:35,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637413951] [2022-11-23 06:54:35,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:54:35,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:54:35,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:54:39,019 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 06:54:39,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:54:39,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637413951] [2022-11-23 06:54:39,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637413951] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 06:54:39,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189974362] [2022-11-23 06:54:39,020 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 06:54:39,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 06:54:39,021 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b2abd36-3e95-4833-9951-61813bea9def/bin/ugemcutter-1C6z4D84am/z3 [2022-11-23 06:54:39,022 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b2abd36-3e95-4833-9951-61813bea9def/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 06:54:39,031 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b2abd36-3e95-4833-9951-61813bea9def/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-23 06:54:39,166 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 06:54:39,166 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 06:54:39,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 64 conjunts are in the unsatisfiable core [2022-11-23 06:54:39,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 06:54:39,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 06:54:40,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 06:54:41,150 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 06:54:41,151 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-23 06:54:41,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 06:54:42,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 06:54:43,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 06:54:43,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-23 06:54:43,853 INFO L321 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-11-23 06:54:43,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 10 [2022-11-23 06:54:43,928 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 06:54:43,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 06:54:46,869 WARN L837 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~end~0) (< c_~end~0 0) (let ((.cse4 (+ (* c_~end~0 4) c_~queue~0.offset))) (and (forall ((~A~0.offset Int) (v_ArrVal_195 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (~i~0 Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195))) (let ((.cse3 (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (let ((.cse2 (+ (* ~i~0 4) ~A~0.offset)) (.cse0 (select .cse3 c_~queue~0.base))) (or (< (select .cse0 (+ (* c_~start~0 4) c_~queue~0.offset)) (+ (select (select .cse1 c_~A~0.base) .cse2) 1)) (not (= (select (select .cse3 c_~A~0.base) .cse2) (select .cse0 .cse4)))))))) (or (not (= (mod c_~ok~0 256) 0)) (forall ((~A~0.offset Int) (v_ArrVal_195 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (~i~0 Int)) (not (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (= (select (select .cse5 c_~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select .cse5 c_~queue~0.base) .cse4))))))))) is different from false [2022-11-23 06:54:53,340 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:54:53,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 123 treesize of output 87 [2022-11-23 06:54:53,398 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:54:53,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 5148 treesize of output 4750 [2022-11-23 06:54:53,492 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:54:53,493 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-23 06:54:53,593 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:54:53,594 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-23 06:54:53,704 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:54:53,705 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-23 06:55:12,329 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:55:12,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 51 [2022-11-23 06:55:12,375 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:55:12,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 217078 treesize of output 200714 [2022-11-23 06:55:13,038 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:55:13,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 200694 treesize of output 176135 [2022-11-23 06:55:13,840 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:55:13,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 176118 treesize of output 163847 [2022-11-23 06:55:14,440 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:55:14,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163830 treesize of output 114695 [2022-11-23 06:55:30,144 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:55:30,145 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 78 [2022-11-23 06:55:31,088 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 06:55:31,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189974362] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 06:55:31,088 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 06:55:31,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 35, 35] total 92 [2022-11-23 06:55:31,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007664820] [2022-11-23 06:55:31,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 06:55:31,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 92 states [2022-11-23 06:55:31,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:55:31,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2022-11-23 06:55:31,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=830, Invalid=7265, Unknown=99, NotChecked=178, Total=8372 [2022-11-23 06:55:31,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:55:31,094 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:55:31,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 92 states, 92 states have (on average 4.5978260869565215) internal successors, (423), 92 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 06:55:31,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:55:31,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-23 06:55:31,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:55:31,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:55:31,096 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:55:31,096 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 110 states. [2022-11-23 06:55:31,096 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-23 06:55:31,096 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2022-11-23 06:55:31,096 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:55:50,194 WARN L233 SmtUtils]: Spent 18.27s on a formula simplification that was a NOOP. DAG size: 302 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 06:55:50,241 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (not (= (mod c_~ok~0 256) 0))) (.cse10 (* c_~end~0 4)) (.cse8 (* c_~start~0 4))) (let ((.cse30 (= .cse10 .cse8)) (.cse29 (let ((.cse50 (+ .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| Int)) (or (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| |c_#StackHeapBarrier|)) (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 ((.cse48 (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| v_ArrVal_194) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195))) (let ((.cse51 (store .cse48 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (let ((.cse47 (select .cse51 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse49 (+ (* ~i~0 4) ~A~0.offset))) (or (< (select .cse47 (+ .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (+ (select (select .cse48 v_~A~0.base_19) .cse49) 1)) (not (= (select .cse47 .cse50) (select (select .cse51 v_~A~0.base_19) .cse49))) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| v_~A~0.base_19)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22|) 0)))) (or .cse2 (forall ((v_~A~0.base_19 Int) (~A~0.offset Int) (v_ArrVal_195 (Array Int Int)) (v_ArrVal_194 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| Int) (v_ArrVal_196 (Array Int Int)) (~i~0 Int)) (or (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| |c_#StackHeapBarrier|)) (not (let ((.cse52 (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| v_ArrVal_194) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (= (select (select .cse52 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse50) (select (select .cse52 v_~A~0.base_19) (+ (* ~i~0 4) ~A~0.offset))))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22|) 0)) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| v_~A~0.base_19))))))) (.cse0 (<= c_~n~0 c_~end~0)) (.cse12 (+ .cse8 c_~queue~0.offset)) (.cse16 (+ .cse10 c_~queue~0.offset)) (.cse1 (< c_~end~0 0))) (and (or .cse0 .cse1 (let ((.cse4 (+ .cse10 |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (and (or .cse2 (forall ((v_~A~0.base_19 Int) (~A~0.offset Int) (v_ArrVal_195 (Array Int Int)) (v_ArrVal_194 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| Int) (v_ArrVal_196 (Array Int Int)) (~i~0 Int)) (or (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| |c_#StackHeapBarrier|)) (not (let ((.cse3 (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| v_ArrVal_194) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (= (select (select .cse3 |c_ULTIMATE.start_main_#t~ret12#1.base|) .cse4) (select (select .cse3 v_~A~0.base_19) (+ (* ~i~0 4) ~A~0.offset))))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22|) 0)) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| v_~A~0.base_19)))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| Int)) (or (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| |c_#StackHeapBarrier|)) (forall ((v_~A~0.base_19 Int) (~A~0.offset Int) (v_ArrVal_195 (Array Int Int)) (v_ArrVal_194 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (~i~0 Int)) (let ((.cse9 (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| v_ArrVal_194) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195))) (let ((.cse6 (store .cse9 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (let ((.cse5 (select .cse6 |c_ULTIMATE.start_main_#t~ret12#1.base|)) (.cse7 (+ (* ~i~0 4) ~A~0.offset))) (or (not (= (select .cse5 .cse4) (select (select .cse6 v_~A~0.base_19) .cse7))) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| v_~A~0.base_19) (< (select .cse5 (+ .cse8 |c_ULTIMATE.start_main_#t~ret12#1.offset|)) (+ (select (select .cse9 v_~A~0.base_19) .cse7) 1))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22|) 0))))))) (or .cse0 .cse1 (and (forall ((v_~A~0.base_19 Int) (~A~0.offset Int) (v_ArrVal_195 (Array Int Int)) (v_ArrVal_194 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (~i~0 Int)) (let ((.cse13 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_194) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195))) (let ((.cse15 (store .cse13 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (let ((.cse14 (+ (* ~i~0 4) ~A~0.offset)) (.cse11 (select .cse15 c_~queue~0.base))) (or (< (select .cse11 .cse12) (+ (select (select .cse13 v_~A~0.base_19) .cse14) 1)) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_~A~0.base_19) (not (= (select (select .cse15 v_~A~0.base_19) .cse14) (select .cse11 .cse16)))))))) (or (forall ((v_~A~0.base_19 Int) (~A~0.offset Int) (v_ArrVal_195 (Array Int Int)) (v_ArrVal_194 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (~i~0 Int)) (or (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_~A~0.base_19) (not (let ((.cse17 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_194) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (= (select (select .cse17 v_~A~0.base_19) (+ (* ~i~0 4) ~A~0.offset)) (select (select .cse17 c_~queue~0.base) .cse16)))))) .cse2))) (or .cse0 .cse1 (let ((.cse19 (+ .cse10 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (or .cse2 (forall ((v_~A~0.base_19 Int) (~A~0.offset Int) (v_ArrVal_195 (Array Int Int)) (v_ArrVal_194 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| Int) (v_ArrVal_196 (Array Int Int)) (~i~0 Int)) (or (not (let ((.cse18 (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| v_ArrVal_194) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (= (select (select .cse18 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse19) (select (select .cse18 v_~A~0.base_19) (+ (* ~i~0 4) ~A~0.offset))))) (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22|) 0)) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| v_~A~0.base_19)))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| Int)) (or (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22|) 0)) (forall ((v_~A~0.base_19 Int) (~A~0.offset Int) (v_ArrVal_195 (Array Int Int)) (v_ArrVal_194 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (~i~0 Int)) (let ((.cse23 (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| v_ArrVal_194) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195))) (let ((.cse21 (store .cse23 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (let ((.cse20 (select .cse21 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (.cse22 (+ (* ~i~0 4) ~A~0.offset))) (or (not (= (select .cse20 .cse19) (select (select .cse21 v_~A~0.base_19) .cse22))) (< (select .cse20 (+ .cse8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (+ (select (select .cse23 v_~A~0.base_19) .cse22) 1)) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| v_~A~0.base_19))))))))))) (or .cse0 .cse1 (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| Int)) (or (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| |c_#StackHeapBarrier|)) (forall ((v_~A~0.base_19 Int) (~A~0.offset Int) (v_ArrVal_195 (Array Int Int)) (v_ArrVal_194 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (~i~0 Int)) (let ((.cse25 (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| v_ArrVal_194) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195))) (let ((.cse27 (store .cse25 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (let ((.cse24 (select .cse27 c_~queue~0.base)) (.cse26 (+ (* ~i~0 4) ~A~0.offset))) (or (< (select .cse24 .cse12) (+ (select (select .cse25 v_~A~0.base_19) .cse26) 1)) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| v_~A~0.base_19) (not (= (select .cse24 .cse16) (select (select .cse27 v_~A~0.base_19) .cse26)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22|) 0)))) (or .cse2 (forall ((v_~A~0.base_19 Int) (~A~0.offset Int) (v_ArrVal_195 (Array Int Int)) (v_ArrVal_194 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| Int) (v_ArrVal_196 (Array Int Int)) (~i~0 Int)) (or (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22|) 0)) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| v_~A~0.base_19) (not (let ((.cse28 (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| v_ArrVal_194) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (= (select (select .cse28 c_~queue~0.base) .cse16) (select (select .cse28 v_~A~0.base_19) (+ (* ~i~0 4) ~A~0.offset)))))))))) (or .cse0 .cse1 .cse29) (or .cse0 .cse1 (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (and (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_main_~#t2~0#1.base| 1)) .cse2 .cse30)) (or .cse0 (let ((.cse31 (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| Int)) (or (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22|) 0)))))) (and (or .cse2 .cse31) (or .cse31 .cse30) (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| Int)) (or (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| |c_ULTIMATE.start_main_~#t2~0#1.base|) (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22|) 0)))))) .cse1 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (or .cse0 .cse1 .cse29 (< (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post22#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (or .cse0 .cse1 (and (or .cse2 (forall ((v_~A~0.base_19 Int) (~A~0.offset Int) (v_ArrVal_195 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (~i~0 Int)) (or (not (let ((.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) .cse16)))) (< |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 ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195))) (let ((.cse33 (store .cse36 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (let ((.cse35 (select .cse33 c_~queue~0.base)) (.cse34 (+ (* ~i~0 4) ~A~0.offset))) (or (not (= (select (select .cse33 v_~A~0.base_19) .cse34) (select .cse35 .cse16))) (< (select .cse35 .cse12) (+ (select (select .cse36 v_~A~0.base_19) .cse34) 1)) (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| v_~A~0.base_19)))))))) (or .cse0 .cse1 (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 ((.cse40 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195))) (let ((.cse37 (store .cse40 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (let ((.cse39 (select .cse37 c_~queue~0.base)) (.cse38 (+ (* ~i~0 4) ~A~0.offset))) (or (not (= (select (select .cse37 v_~A~0.base_19) .cse38) (select .cse39 .cse16))) (< (select .cse39 .cse12) (+ (select (select .cse40 v_~A~0.base_19) .cse38) 1))))))) (not (<= v_~A~0.base_19 |c_ULTIMATE.start_main_#t~ret13#1.base|)))) (or .cse2 (forall ((v_~A~0.base_19 Int) (~A~0.offset Int) (v_ArrVal_195 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (~i~0 Int)) (or (not (let ((.cse41 (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 .cse41 v_~A~0.base_19) (+ (* ~i~0 4) ~A~0.offset)) (select (select .cse41 c_~queue~0.base) .cse16)))) (not (<= v_~A~0.base_19 |c_ULTIMATE.start_main_#t~ret13#1.base|))))))) (or .cse0 (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 ((.cse45 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195))) (let ((.cse42 (store .cse45 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (let ((.cse44 (select .cse42 c_~queue~0.base)) (.cse43 (+ (* ~i~0 4) ~A~0.offset))) (or (not (= (select (select .cse42 v_~A~0.base_19) .cse43) (select .cse44 .cse16))) (< (select .cse44 .cse12) (+ (select (select .cse45 v_~A~0.base_19) .cse43) 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 ((.cse46 (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 .cse46 v_~A~0.base_19) (+ (* ~i~0 4) ~A~0.offset)) (select (select .cse46 c_~queue~0.base) .cse16)))) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_~A~0.base_19))) .cse2)) .cse1)))) is different from false [2022-11-23 06:55:58,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 06:56:15,311 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse44 (* c_~end~0 4)) (.cse11 (+ (* c_~start~0 4) c_~queue~0.offset))) (let ((.cse19 (+ c_~start~0 1)) (.cse18 (<= .cse11 0)) (.cse15 (+ .cse44 c_~queue~0.offset))) (let ((.cse0 (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t2~0#1.base|)) (.cse3 (not (= .cse15 0))) (.cse4 (not (= .cse11 0))) (.cse5 (or (<= (+ c_~start~0 c_~n~0) (+ c_~end~0 1)) .cse18)) (.cse2 (< 0 (+ .cse44 c_~queue~0.offset 1))) (.cse6 (or (<= .cse15 0) (<= c_~n~0 1))) (.cse7 (= c_~queue~0.offset 0)) (.cse1 (<= .cse19 0)) (.cse25 (+ c_~A~0.offset (* c_~i~0 4))) (.cse8 (<= c_~n~0 c_~end~0)) (.cse17 (not (= (mod c_~ok~0 256) 0))) (.cse9 (< 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 .cse8 .cse9 (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 ((.cse12 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_194) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195))) (let ((.cse14 (store .cse12 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (let ((.cse13 (+ (* ~i~0 4) ~A~0.offset)) (.cse10 (select .cse14 c_~queue~0.base))) (or (< (select .cse10 .cse11) (+ (select (select .cse12 v_~A~0.base_19) .cse13) 1)) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_~A~0.base_19) (not (= (select (select .cse14 v_~A~0.base_19) .cse13) (select .cse10 .cse15)))))))) (or (forall ((v_~A~0.base_19 Int) (~A~0.offset Int) (v_ArrVal_195 (Array Int Int)) (v_ArrVal_194 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (~i~0 Int)) (or (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_~A~0.base_19) (not (let ((.cse16 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_194) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (= (select (select .cse16 v_~A~0.base_19) (+ (* ~i~0 4) ~A~0.offset)) (select (select .cse16 c_~queue~0.base) .cse15)))))) .cse17))) (or (not .cse1) (<= c_~end~0 c_~start~0)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) .cse18 (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) (< 0 .cse19) (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 ((.cse21 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| v_ArrVal_194) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195))) (let ((.cse23 (store .cse21 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (let ((.cse22 (+ (* ~i~0 4) ~A~0.offset)) (.cse20 (select .cse23 c_~queue~0.base))) (or (< (select .cse20 .cse11) (+ (select (select .cse21 v_~A~0.base_19) .cse22) 1)) (not (= (select (select .cse23 v_~A~0.base_19) .cse22) (select .cse20 .cse15))) (< |c_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| v_~A~0.base_19)))))) (or .cse17 (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 ((.cse24 (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 .cse24 v_~A~0.base_19) (+ (* ~i~0 4) ~A~0.offset)) (select (select .cse24 c_~queue~0.base) .cse15)))) (< |c_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| v_~A~0.base_19))))) .cse8 .cse9) (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) (<= (select (select |c_#memory_int| c_~queue~0.base) .cse11) c_~v_old~0) .cse7 (or (and .cse2 (or .cse3 (and (or .cse4 (<= (select (select |c_#memory_int| c_~A~0.base) .cse25) c_~v_old~0)) .cse5)) .cse6 .cse7) .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 (not (<= |c_thread1Thread1of1ForFork0_#t~mem1#1| c_~last~0)) (not (< c_~end~0 c_~n~0)) (not (<= 0 c_~end~0)) (and (not (< c_~start~0 c_~end~0)) (not (< c_~i~0 c_~N~0))) (and (or (forall ((v_ArrVal_196 (Array Int Int))) (not (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (= (select (select .cse26 c_~queue~0.base) .cse15) (select (select .cse26 c_~A~0.base) .cse25))))) .cse17) (forall ((v_ArrVal_196 (Array Int Int))) (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (let ((.cse27 (select .cse28 c_~queue~0.base))) (or (not (= (select .cse27 .cse15) (select (select .cse28 c_~A~0.base) .cse25))) (< (select .cse27 .cse11) (+ c_~v_old~0 1)))))))) (or .cse8 .cse9 (and (or .cse17 (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 ((.cse29 (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 .cse29 v_~A~0.base_19) (+ (* ~i~0 4) ~A~0.offset)) (select (select .cse29 c_~queue~0.base) .cse15)))) (< |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 ((.cse33 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195))) (let ((.cse30 (store .cse33 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (let ((.cse32 (select .cse30 c_~queue~0.base)) (.cse31 (+ (* ~i~0 4) ~A~0.offset))) (or (not (= (select (select .cse30 v_~A~0.base_19) .cse31) (select .cse32 .cse15))) (< (select .cse32 .cse11) (+ (select (select .cse33 v_~A~0.base_19) .cse31) 1)) (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| v_~A~0.base_19)))))))) (or .cse8 .cse9 (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 ((.cse37 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195))) (let ((.cse34 (store .cse37 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (let ((.cse36 (select .cse34 c_~queue~0.base)) (.cse35 (+ (* ~i~0 4) ~A~0.offset))) (or (not (= (select (select .cse34 v_~A~0.base_19) .cse35) (select .cse36 .cse15))) (< (select .cse36 .cse11) (+ (select (select .cse37 v_~A~0.base_19) .cse35) 1))))))) (not (<= v_~A~0.base_19 |c_ULTIMATE.start_main_#t~ret13#1.base|)))) (or .cse17 (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 ((.cse38 (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 .cse38 v_~A~0.base_19) (+ (* ~i~0 4) ~A~0.offset)) (select (select .cse38 c_~queue~0.base) .cse15)))) (not (<= v_~A~0.base_19 |c_ULTIMATE.start_main_#t~ret13#1.base|))))))) (or .cse8 (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 ((.cse42 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195))) (let ((.cse39 (store .cse42 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (let ((.cse41 (select .cse39 c_~queue~0.base)) (.cse40 (+ (* ~i~0 4) ~A~0.offset))) (or (not (= (select (select .cse39 v_~A~0.base_19) .cse40) (select .cse41 .cse15))) (< (select .cse41 .cse11) (+ (select (select .cse42 v_~A~0.base_19) .cse40) 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 ((.cse43 (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 .cse43 v_~A~0.base_19) (+ (* ~i~0 4) ~A~0.offset)) (select (select .cse43 c_~queue~0.base) .cse15)))) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_~A~0.base_19))) .cse17)) .cse9) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|))))) is different from false [2022-11-23 06:56:24,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 06:56:34,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 06:56:42,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 06:56:42,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:56:42,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 06:56:42,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:56:42,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:56:42,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:56:42,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2022-11-23 06:56:42,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 06:56:42,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-11-23 06:56:42,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2022-11-23 06:56:42,853 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b2abd36-3e95-4833-9951-61813bea9def/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-23 06:56:43,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b2abd36-3e95-4833-9951-61813bea9def/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 06:56:43,048 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-23 06:56:43,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:56:43,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1182337734, now seen corresponding path program 5 times [2022-11-23 06:56:43,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:56:43,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810011082] [2022-11-23 06:56:43,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:56:43,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:56:43,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:56:45,365 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 06:56:45,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:56:45,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810011082] [2022-11-23 06:56:45,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810011082] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 06:56:45,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900444629] [2022-11-23 06:56:45,366 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-23 06:56:45,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 06:56:45,367 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b2abd36-3e95-4833-9951-61813bea9def/bin/ugemcutter-1C6z4D84am/z3 [2022-11-23 06:56:45,371 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b2abd36-3e95-4833-9951-61813bea9def/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 06:56:45,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b2abd36-3e95-4833-9951-61813bea9def/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-23 06:56:45,507 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 06:56:45,507 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 06:56:45,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-23 06:56:45,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 06:56:45,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 06:56:45,838 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 06:56:45,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-23 06:56:47,184 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-23 06:56:47,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 44 [2022-11-23 06:56:47,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-11-23 06:56:47,669 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-11-23 06:56:47,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2022-11-23 06:56:47,745 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 06:56:47,745 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 06:56:48,786 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:56:48,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 94 treesize of output 139 [2022-11-23 06:56:48,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2022-11-23 06:56:51,565 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 06:56:51,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900444629] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 06:56:51,566 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 06:56:51,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22, 20] total 57 [2022-11-23 06:56:51,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931650762] [2022-11-23 06:56:51,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 06:56:51,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-11-23 06:56:51,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:56:51,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-11-23 06:56:51,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=2812, Unknown=1, NotChecked=0, Total=3192 [2022-11-23 06:56:51,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:56:51,569 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:56:51,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 7.4035087719298245) internal successors, (422), 57 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 06:56:51,570 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:56:51,570 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-23 06:56:51,571 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:56:51,571 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:56:51,571 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:56:51,571 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 112 states. [2022-11-23 06:56:51,571 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-23 06:56:51,571 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2022-11-23 06:56:51,571 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 84 states. [2022-11-23 06:56:51,572 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:56:59,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 06:57:05,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 06:57:12,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 06:57:14,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 06:57:16,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 06:57:18,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 06:57:20,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 06:57:26,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 06:57:28,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 06:57:30,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 06:57:32,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 06:57:34,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 06:57:36,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 06:57:38,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 06:57:41,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 06:57:47,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 06:57:49,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 06:57:58,286 WARN L233 SmtUtils]: Spent 7.92s on a formula simplification. DAG size of input: 202 DAG size of output: 144 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 06:58:00,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 06:58:02,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 06:58:04,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 06:58:06,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 06:58:11,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 06:58:13,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 06:58:16,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 06:58:22,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 06:58:24,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, 1] [2022-11-23 06:58:30,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 06:58:43,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 06:58:45,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 06:58:47,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 06:58:49,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 06:58:51,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 06:58:54,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 06:58:56,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 06:58:58,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 06:59:01,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 06:59:03,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 06:59:06,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 06:59:13,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 06:59:15,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 06:59:19,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 06:59:20,044 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_int| c_~queue~0.base)) (.cse11 (+ (* c_~start~0 4) c_~queue~0.offset)) (.cse12 (+ c_~v_old~0 1)) (.cse8 (not (= (mod c_~ok~0 256) 0)))) (let ((.cse1 (not (<= |c_thread1Thread1of1ForFork0_#t~mem1#1| c_~last~0))) (.cse2 (not (< c_~end~0 c_~n~0))) (.cse6 (+ (* c_~end~0 4) c_~queue~0.offset)) (.cse7 (+ c_~A~0.offset (* c_~i~0 4))) (.cse0 (and (< (select .cse13 .cse11) .cse12) .cse8)) (.cse3 (not (<= 0 c_~end~0))) (.cse4 (and (not (< c_~start~0 c_~end~0)) (not (< c_~i~0 c_~N~0))))) (and (or .cse0 (= (mod |c_thread2Thread1of1ForFork1_~cond~0#1| 256) 0)) (= c_~ok~0 1) (or .cse1 .cse2 .cse3 .cse4 (and (or (forall ((v_ArrVal_196 (Array Int Int))) (not (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (= (select (select .cse5 c_~queue~0.base) .cse6) (select (select .cse5 c_~A~0.base) .cse7))))) .cse8) (forall ((v_ArrVal_196 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (let ((.cse9 (select .cse10 c_~queue~0.base))) (or (not (= (select .cse9 .cse6) (select (select .cse10 c_~A~0.base) .cse7))) (< (select .cse9 .cse11) .cse12))))))) (or .cse1 .cse2 (not (= (select .cse13 .cse6) (select (select |c_#memory_int| c_~A~0.base) .cse7))) .cse0 .cse3 .cse4)))) is different from false [2022-11-23 07:00:05,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 07:00:07,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 07:00:18,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 07:00:18,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 07:00:18,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 07:00:18,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 07:00:18,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 07:00:18,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2022-11-23 07:00:18,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 07:00:18,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-11-23 07:00:18,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2022-11-23 07:00:18,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-11-23 07:00:18,887 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b2abd36-3e95-4833-9951-61813bea9def/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-23 07:00:19,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b2abd36-3e95-4833-9951-61813bea9def/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-23 07:00:19,087 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-23 07:00:19,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 07:00:19,087 INFO L85 PathProgramCache]: Analyzing trace with hash -704172357, now seen corresponding path program 6 times [2022-11-23 07:00:19,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 07:00:19,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58746199] [2022-11-23 07:00:19,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 07:00:19,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 07:00:19,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 07:00:25,806 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 07:00:25,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 07:00:25,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58746199] [2022-11-23 07:00:25,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58746199] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 07:00:25,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794329680] [2022-11-23 07:00:25,807 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-23 07:00:25,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 07:00:25,808 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b2abd36-3e95-4833-9951-61813bea9def/bin/ugemcutter-1C6z4D84am/z3 [2022-11-23 07:00:25,811 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b2abd36-3e95-4833-9951-61813bea9def/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 07:00:25,814 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b2abd36-3e95-4833-9951-61813bea9def/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-23 07:00:26,232 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-11-23 07:00:26,233 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 07:00:26,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-23 07:00:26,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 07:00:29,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 07:00:29,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 07:00:30,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 07:00:30,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 07:00:30,886 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-23 07:00:30,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2022-11-23 07:00:30,960 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 07:00:30,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 07:00:32,008 WARN L837 $PredicateComparison]: unable to prove that (or (not (< c_~end~0 c_~n~0)) (let ((.cse1 (+ (* c_~end~0 4) c_~queue~0.offset)) (.cse2 (+ c_~A~0.offset (* c_~i~0 4)))) (and (or (forall ((~queue~0.base Int) (v_ArrVal_268 (Array Int Int))) (not (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_268))) (= (select (select .cse0 ~queue~0.base) .cse1) (select (select .cse0 c_~A~0.base) .cse2))))) (not (= (mod c_~ok~0 256) 0))) (forall ((~queue~0.base Int) (v_ArrVal_268 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_268))) (let ((.cse3 (select .cse4 ~queue~0.base))) (or (not (= (select .cse3 .cse1) (select (select .cse4 c_~A~0.base) .cse2))) (< (select .cse3 (+ (* c_~start~0 4) c_~queue~0.offset)) (+ c_~v_old~0 1)))))))) (< c_~start~0 0) (not (<= 0 c_~end~0)) (<= c_~n~0 c_~start~0)) is different from false [2022-11-23 07:00:33,393 INFO L321 Elim1Store]: treesize reduction 15, result has 89.9 percent of original size [2022-11-23 07:00:33,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 937 treesize of output 929 [2022-11-23 07:00:33,447 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 07:00:33,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 792 treesize of output 783 [2022-11-23 07:00:33,500 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 07:00:33,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 738 treesize of output 675 [2022-11-23 07:00:33,537 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 07:00:33,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 630 treesize of output 551 [2022-11-23 07:00:33,578 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 07:00:33,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 534 treesize of output 503 [2022-11-23 07:00:54,332 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-11-23 07:00:54,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [794329680] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 07:00:54,332 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 07:00:54,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 30, 31] total 89 [2022-11-23 07:00:54,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395663135] [2022-11-23 07:00:54,333 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 07:00:54,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 89 states [2022-11-23 07:00:54,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 07:00:54,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2022-11-23 07:00:54,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=729, Invalid=6916, Unknown=15, NotChecked=172, Total=7832 [2022-11-23 07:00:54,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 07:00:54,339 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 07:00:54,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 89 states, 89 states have (on average 4.865168539325842) internal successors, (433), 89 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 07:00:54,340 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 07:00:54,340 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-23 07:00:54,340 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 07:00:54,340 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-23 07:00:54,340 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-23 07:00:54,340 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 151 states. [2022-11-23 07:00:54,340 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-23 07:00:54,340 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 73 states. [2022-11-23 07:00:54,340 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 153 states. [2022-11-23 07:00:54,340 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 102 states. [2022-11-23 07:00:54,340 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 07:00:56,611 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse21 (* c_~i~0 4)) (.cse22 (* c_~end~0 4))) (let ((.cse18 (+ |c_#StackHeapBarrier| 1)) (.cse23 (* c_~start~0 4)) (.cse4 (+ .cse22 c_~queue~0.offset)) (.cse6 (+ c_~A~0.offset .cse21)) (.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 ((.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))) (= (select (select .cse24 ~queue~0.base) .cse4) (select (select .cse24 c_~A~0.base) .cse6))))) .cse10)) (.cse7 (+ .cse23 c_~queue~0.offset)) (.cse15 (+ c_~v_old~0 1)) (.cse13 (<= .cse18 |c_ULTIMATE.start_main_~#t1~0#1.base|)) (.cse0 (not (< c_~end~0 c_~n~0))) (.cse1 (< c_~start~0 0)) (.cse11 (= .cse22 .cse23)) (.cse12 (= .cse21 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) (<= .cse18 |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 ((.cse20 (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 ((.cse19 (select .cse20 ~queue~0.base))) (or (not (= (select .cse19 .cse4) (select (select .cse20 c_~A~0.base) .cse6))) (< (select .cse19 .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-23 07:01:00,261 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse22 (* c_~i~0 4)) (.cse23 (* c_~end~0 4))) (let ((.cse19 (+ |c_#StackHeapBarrier| 1)) (.cse24 (* c_~start~0 4)) (.cse4 (+ .cse23 c_~queue~0.offset)) (.cse6 (+ c_~A~0.offset .cse22)) (.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 ((.cse25 (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 .cse25 ~queue~0.base) .cse4) (select (select .cse25 c_~A~0.base) .cse6))))) .cse10)) (.cse7 (+ .cse24 c_~queue~0.offset)) (.cse16 (+ c_~v_old~0 1)) (.cse15 (<= c_~end~0 0)) (.cse14 (* c_~n~0 4)) (.cse13 (<= .cse19 |c_ULTIMATE.start_main_~#t1~0#1.base|)) (.cse0 (not (< c_~end~0 c_~n~0))) (.cse1 (< c_~start~0 0)) (.cse11 (= .cse23 .cse24)) (.cse12 (= .cse22 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) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse19 |c_ULTIMATE.start_main_~#t2~0#1.base|) (= |c_ULTIMATE.start_main_#t~ret12#1.offset| 0) (= 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 ((.cse21 (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 ((.cse20 (select .cse21 ~queue~0.base))) (or (not (= (select .cse20 .cse4) (select (select .cse21 c_~A~0.base) .cse6))) (< (select .cse20 .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-23 07:01:19,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 07:01:21,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 07:01:23,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 07:01:25,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 07:01:27,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 07:01:32,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 07:01:32,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 07:01:32,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 07:01:32,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 07:01:32,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 07:01:32,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2022-11-23 07:01:32,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 07:01:32,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2022-11-23 07:01:32,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2022-11-23 07:01:32,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2022-11-23 07:01:32,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2022-11-23 07:01:32,380 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b2abd36-3e95-4833-9951-61813bea9def/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-23 07:01:32,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b2abd36-3e95-4833-9951-61813bea9def/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 07:01:32,568 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-23 07:01:32,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 07:01:32,569 INFO L85 PathProgramCache]: Analyzing trace with hash 335291463, now seen corresponding path program 7 times [2022-11-23 07:01:32,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 07:01:32,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734213784] [2022-11-23 07:01:32,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 07:01:32,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 07:01:32,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 07:01:36,575 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-23 07:01:36,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 07:01:36,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734213784] [2022-11-23 07:01:36,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734213784] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 07:01:36,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074125588] [2022-11-23 07:01:36,580 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-23 07:01:36,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 07:01:36,580 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b2abd36-3e95-4833-9951-61813bea9def/bin/ugemcutter-1C6z4D84am/z3 [2022-11-23 07:01:36,581 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b2abd36-3e95-4833-9951-61813bea9def/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 07:01:36,587 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b2abd36-3e95-4833-9951-61813bea9def/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-23 07:01:36,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 07:01:36,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 57 conjunts are in the unsatisfiable core [2022-11-23 07:01:36,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 07:01:40,783 INFO L321 Elim1Store]: treesize reduction 104, result has 35.4 percent of original size [2022-11-23 07:01:40,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 82 treesize of output 72 [2022-11-23 07:01:40,921 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-23 07:01:40,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 07:01:46,423 INFO L321 Elim1Store]: treesize reduction 214, result has 82.6 percent of original size [2022-11-23 07:01:46,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 78 case distinctions, treesize of input 262 treesize of output 1098 [2022-11-23 07:04:03,626 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:04:12,260 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:05:51,948 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:05:53,079 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:05:54,446 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:05:58,584 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:05:59,920 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:06:03,875 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:06:05,780 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:06:06,653 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:06:10,021 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:06:10,691 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:06:11,670 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:06:15,484 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:07:03,640 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:07:05,262 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:07:07,973 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:07:08,828 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:07:11,333 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:07:12,324 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:07:14,967 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:07:18,774 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:07:19,915 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:07:22,084 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:07:24,260 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:07:25,850 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:07:28,714 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:07:30,237 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:07:34,047 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:07:41,423 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:07:42,245 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:07:45,319 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:07:47,763 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:07:48,878 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:07:53,933 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:07:55,743 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:08:01,672 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:08:02,792 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:08:06,427 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:08:06,719 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:08:06,925 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 07:08:07,536 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:08:07,976 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:08:08,303 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:08:08,542 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 07:08:09,198 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:08:11,030 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:08:11,330 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:08:11,630 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:08:11,850 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 07:08:12,031 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts.