./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7 --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 251696ec6cec82b3ac56ff493f8f4412eaff7e5010650cc9da1e4c426de80d8c --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-11-25 18:19:27,424 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-25 18:19:27,427 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-25 18:19:27,481 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-25 18:19:27,482 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-25 18:19:27,484 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-25 18:19:27,486 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-25 18:19:27,489 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-25 18:19:27,493 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-25 18:19:27,494 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-25 18:19:27,496 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-25 18:19:27,498 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-25 18:19:27,499 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-25 18:19:27,501 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-25 18:19:27,503 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-25 18:19:27,505 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-25 18:19:27,507 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-25 18:19:27,509 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-25 18:19:27,513 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-25 18:19:27,516 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-25 18:19:27,520 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-25 18:19:27,522 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-25 18:19:27,524 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-25 18:19:27,526 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-25 18:19:27,532 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-25 18:19:27,533 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-25 18:19:27,533 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-25 18:19:27,535 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-25 18:19:27,536 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-25 18:19:27,538 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-25 18:19:27,539 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-25 18:19:27,540 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-25 18:19:27,542 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-25 18:19:27,543 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-25 18:19:27,545 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-25 18:19:27,546 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-25 18:19:27,547 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-25 18:19:27,547 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-25 18:19:27,548 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-25 18:19:27,550 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-25 18:19:27,551 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-25 18:19:27,552 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-25 18:19:27,586 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-25 18:19:27,587 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-25 18:19:27,588 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-25 18:19:27,588 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-25 18:19:27,589 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-25 18:19:27,595 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-25 18:19:27,596 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-25 18:19:27,596 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-25 18:19:27,597 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-25 18:19:27,597 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-25 18:19:27,598 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-25 18:19:27,598 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-25 18:19:27,598 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-25 18:19:27,599 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-25 18:19:27,599 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-25 18:19:27,599 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-25 18:19:27,600 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-25 18:19:27,600 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-25 18:19:27,601 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-25 18:19:27,602 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-25 18:19:27,604 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-25 18:19:27,604 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-25 18:19:27,604 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-25 18:19:27,605 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-25 18:19:27,605 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-25 18:19:27,605 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-25 18:19:27,608 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-25 18:19:27,608 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-25 18:19:27,608 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-25 18:19:27,609 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-25 18:19:27,609 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-25 18:19:27,609 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-25 18:19:27,610 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 18:19:27,610 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-25 18:19:27,611 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-25 18:19:27,611 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-25 18:19:27,611 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-25 18:19:27,612 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-25 18:19:27,612 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-25 18:19:27,613 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-25 18:19:27,613 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-25 18:19:27,613 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/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_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7 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 -> Taipan 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 -> 251696ec6cec82b3ac56ff493f8f4412eaff7e5010650cc9da1e4c426de80d8c [2021-11-25 18:19:27,982 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-25 18:19:28,012 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-25 18:19:28,015 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-25 18:19:28,016 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-25 18:19:28,017 INFO L275 PluginConnector]: CDTParser initialized [2021-11-25 18:19:28,019 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/../../sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c [2021-11-25 18:19:28,114 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/data/ad7d472b7/00e4f3c708a24bc4a2c8fcf329b0d860/FLAGbd429f100 [2021-11-25 18:19:28,637 INFO L306 CDTParser]: Found 1 translation units. [2021-11-25 18:19:28,638 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c [2021-11-25 18:19:28,647 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/data/ad7d472b7/00e4f3c708a24bc4a2c8fcf329b0d860/FLAGbd429f100 [2021-11-25 18:19:28,992 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/data/ad7d472b7/00e4f3c708a24bc4a2c8fcf329b0d860 [2021-11-25 18:19:28,995 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-25 18:19:28,999 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-25 18:19:29,001 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-25 18:19:29,001 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-25 18:19:29,006 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-25 18:19:29,007 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:19:28" (1/1) ... [2021-11-25 18:19:29,008 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@97d8443 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:19:29, skipping insertion in model container [2021-11-25 18:19:29,009 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:19:28" (1/1) ... [2021-11-25 18:19:29,027 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-25 18:19:29,055 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-25 18:19:29,354 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c[2586,2599] [2021-11-25 18:19:29,378 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 18:19:29,395 INFO L203 MainTranslator]: Completed pre-run [2021-11-25 18:19:29,443 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c[2586,2599] [2021-11-25 18:19:29,463 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 18:19:29,483 INFO L208 MainTranslator]: Completed translation [2021-11-25 18:19:29,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:19:29 WrapperNode [2021-11-25 18:19:29,484 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-25 18:19:29,487 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-25 18:19:29,487 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-25 18:19:29,487 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-25 18:19:29,498 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:19:29" (1/1) ... [2021-11-25 18:19:29,522 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:19:29" (1/1) ... [2021-11-25 18:19:29,568 INFO L137 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 106 [2021-11-25 18:19:29,569 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-25 18:19:29,570 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-25 18:19:29,571 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-25 18:19:29,571 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-25 18:19:29,581 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:19:29" (1/1) ... [2021-11-25 18:19:29,581 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:19:29" (1/1) ... [2021-11-25 18:19:29,602 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:19:29" (1/1) ... [2021-11-25 18:19:29,607 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:19:29" (1/1) ... [2021-11-25 18:19:29,615 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:19:29" (1/1) ... [2021-11-25 18:19:29,632 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:19:29" (1/1) ... [2021-11-25 18:19:29,634 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:19:29" (1/1) ... [2021-11-25 18:19:29,645 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-25 18:19:29,646 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-25 18:19:29,646 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-25 18:19:29,647 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-25 18:19:29,648 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:19:29" (1/1) ... [2021-11-25 18:19:29,665 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 18:19:29,680 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:19:29,695 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-25 18:19:29,719 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-25 18:19:29,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-25 18:19:29,761 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-11-25 18:19:29,761 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-11-25 18:19:29,762 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-11-25 18:19:29,762 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-11-25 18:19:29,762 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-11-25 18:19:29,762 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-11-25 18:19:29,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-25 18:19:29,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-25 18:19:29,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-25 18:19:29,763 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-11-25 18:19:29,765 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-11-25 18:19:29,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-25 18:19:29,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-25 18:19:29,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-25 18:19:29,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-25 18:19:29,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-25 18:19:29,768 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-11-25 18:19:29,885 INFO L236 CfgBuilder]: Building ICFG [2021-11-25 18:19:29,887 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-25 18:19:30,302 INFO L277 CfgBuilder]: Performing block encoding [2021-11-25 18:19:30,383 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-25 18:19:30,384 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-25 18:19:30,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:19:30 BoogieIcfgContainer [2021-11-25 18:19:30,387 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-25 18:19:30,389 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-25 18:19:30,390 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-25 18:19:30,394 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-25 18:19:30,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:19:28" (1/3) ... [2021-11-25 18:19:30,396 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59a592c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:19:30, skipping insertion in model container [2021-11-25 18:19:30,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:19:29" (2/3) ... [2021-11-25 18:19:30,397 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59a592c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:19:30, skipping insertion in model container [2021-11-25 18:19:30,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:19:30" (3/3) ... [2021-11-25 18:19:30,399 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-more-max-array-hom.wvr.c [2021-11-25 18:19:30,406 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-25 18:19:30,406 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-25 18:19:30,406 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-25 18:19:30,406 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-25 18:19:30,449 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,450 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,450 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,451 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,451 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,451 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,452 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,452 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,452 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,453 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,453 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,453 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,453 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,454 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,454 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,454 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,455 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,455 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,455 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,456 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,456 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,456 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,457 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,457 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,457 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,457 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,458 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,458 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,459 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,459 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,459 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,459 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,460 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,460 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,460 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,461 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,461 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,461 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,462 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,462 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,462 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,462 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,463 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,463 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,463 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,463 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,464 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,464 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,465 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,465 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,465 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,465 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,466 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,466 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,466 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,466 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,467 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,467 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,468 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,468 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,468 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,469 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,469 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,469 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,470 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,470 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,470 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,470 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,471 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,471 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,471 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,472 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,472 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,472 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,473 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,473 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,473 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,474 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,474 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,474 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,474 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,475 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,475 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,475 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,479 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,480 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,480 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,480 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,480 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,481 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,482 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,482 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,483 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,483 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,483 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,484 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,485 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,485 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,485 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,486 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,486 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,486 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:19:30,490 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2021-11-25 18:19:30,563 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-25 18:19:30,571 INFO L339 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=FINITE_AUTOMATA, 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-25 18:19:30,571 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-11-25 18:19:30,590 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-11-25 18:19:30,606 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 159 transitions, 342 flow [2021-11-25 18:19:30,610 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 156 places, 159 transitions, 342 flow [2021-11-25 18:19:30,612 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 156 places, 159 transitions, 342 flow [2021-11-25 18:19:30,705 INFO L129 PetriNetUnfolder]: 13/156 cut-off events. [2021-11-25 18:19:30,705 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-11-25 18:19:30,711 INFO L84 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 156 events. 13/156 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 96 event pairs, 0 based on Foata normal form. 0/142 useless extension candidates. Maximal degree in co-relation 113. Up to 2 conditions per place. [2021-11-25 18:19:30,716 INFO L116 LiptonReduction]: Number of co-enabled transitions 1320 [2021-11-25 18:19:38,482 INFO L131 LiptonReduction]: Checked pairs total: 1603 [2021-11-25 18:19:38,483 INFO L133 LiptonReduction]: Total number of compositions: 157 [2021-11-25 18:19:38,493 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 28 transitions, 80 flow [2021-11-25 18:19:38,517 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 107 states, 106 states have (on average 3.0849056603773586) internal successors, (327), 106 states have internal predecessors, (327), 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) [2021-11-25 18:19:38,520 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 106 states have (on average 3.0849056603773586) internal successors, (327), 106 states have internal predecessors, (327), 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) [2021-11-25 18:19:38,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 18:19:38,531 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:19:38,532 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:19:38,533 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 18:19:38,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:19:38,539 INFO L85 PathProgramCache]: Analyzing trace with hash -462507299, now seen corresponding path program 1 times [2021-11-25 18:19:38,551 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:19:38,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328813338] [2021-11-25 18:19:38,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:19:38,553 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:19:38,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:19:38,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:19:38,991 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:19:38,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328813338] [2021-11-25 18:19:38,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328813338] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:19:38,993 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:19:38,993 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-25 18:19:38,995 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806666870] [2021-11-25 18:19:38,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:19:39,001 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 18:19:39,002 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:19:39,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 18:19:39,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 18:19:39,034 INFO L87 Difference]: Start difference. First operand has 107 states, 106 states have (on average 3.0849056603773586) internal successors, (327), 106 states have internal predecessors, (327), 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) Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 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) [2021-11-25 18:19:39,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:19:39,140 INFO L93 Difference]: Finished difference Result 108 states and 328 transitions. [2021-11-25 18:19:39,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 18:19:39,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 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) Word has length 20 [2021-11-25 18:19:39,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:19:39,161 INFO L225 Difference]: With dead ends: 108 [2021-11-25 18:19:39,161 INFO L226 Difference]: Without dead ends: 108 [2021-11-25 18:19:39,163 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 18:19:39,172 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:19:39,174 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 5 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:19:39,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-11-25 18:19:39,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2021-11-25 18:19:39,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 3.0654205607476634) internal successors, (328), 107 states have internal predecessors, (328), 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) [2021-11-25 18:19:39,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 328 transitions. [2021-11-25 18:19:39,264 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 328 transitions. Word has length 20 [2021-11-25 18:19:39,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:19:39,265 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 328 transitions. [2021-11-25 18:19:39,265 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 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) [2021-11-25 18:19:39,267 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 328 transitions. [2021-11-25 18:19:39,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-25 18:19:39,273 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:19:39,273 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:19:39,274 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-25 18:19:39,274 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 18:19:39,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:19:39,278 INFO L85 PathProgramCache]: Analyzing trace with hash -325894009, now seen corresponding path program 1 times [2021-11-25 18:19:39,278 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:19:39,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942282130] [2021-11-25 18:19:39,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:19:39,280 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:19:39,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:19:39,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:19:39,506 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:19:39,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942282130] [2021-11-25 18:19:39,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942282130] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:19:39,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909755765] [2021-11-25 18:19:39,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:19:39,508 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:19:39,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:19:39,510 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:19:39,537 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-25 18:19:39,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:19:39,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-25 18:19:39,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:19:39,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:19:39,816 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:19:39,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:19:39,940 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909755765] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-25 18:19:39,941 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-25 18:19:39,941 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2021-11-25 18:19:39,942 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641160408] [2021-11-25 18:19:39,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:19:39,943 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-25 18:19:39,943 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:19:39,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-25 18:19:39,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-11-25 18:19:39,945 INFO L87 Difference]: Start difference. First operand 108 states and 328 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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) [2021-11-25 18:19:40,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:19:40,089 INFO L93 Difference]: Finished difference Result 134 states and 413 transitions. [2021-11-25 18:19:40,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-25 18:19:40,089 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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) Word has length 21 [2021-11-25 18:19:40,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:19:40,092 INFO L225 Difference]: With dead ends: 134 [2021-11-25 18:19:40,093 INFO L226 Difference]: Without dead ends: 134 [2021-11-25 18:19:40,095 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2021-11-25 18:19:40,102 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 33 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:19:40,103 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 7 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:19:40,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-11-25 18:19:40,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2021-11-25 18:19:40,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 3.1052631578947367) internal successors, (413), 133 states have internal predecessors, (413), 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) [2021-11-25 18:19:40,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 413 transitions. [2021-11-25 18:19:40,123 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 413 transitions. Word has length 21 [2021-11-25 18:19:40,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:19:40,124 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 413 transitions. [2021-11-25 18:19:40,124 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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) [2021-11-25 18:19:40,125 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 413 transitions. [2021-11-25 18:19:40,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-25 18:19:40,128 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:19:40,128 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:19:40,175 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-25 18:19:40,353 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:19:40,354 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 18:19:40,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:19:40,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1868546935, now seen corresponding path program 1 times [2021-11-25 18:19:40,355 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:19:40,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109296056] [2021-11-25 18:19:40,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:19:40,356 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:19:40,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:19:40,558 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:19:40,558 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:19:40,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109296056] [2021-11-25 18:19:40,559 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109296056] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:19:40,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034378006] [2021-11-25 18:19:40,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:19:40,560 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:19:40,561 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:19:40,566 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:19:40,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-25 18:19:40,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:19:40,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-25 18:19:40,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:19:40,927 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:19:40,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:19:41,046 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:19:41,046 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034378006] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-25 18:19:41,047 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-25 18:19:41,047 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2021-11-25 18:19:41,047 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701797506] [2021-11-25 18:19:41,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:19:41,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-25 18:19:41,049 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:19:41,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-25 18:19:41,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2021-11-25 18:19:41,053 INFO L87 Difference]: Start difference. First operand 134 states and 413 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 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) [2021-11-25 18:19:41,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:19:41,293 INFO L93 Difference]: Finished difference Result 166 states and 519 transitions. [2021-11-25 18:19:41,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-25 18:19:41,294 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 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) Word has length 22 [2021-11-25 18:19:41,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:19:41,297 INFO L225 Difference]: With dead ends: 166 [2021-11-25 18:19:41,297 INFO L226 Difference]: Without dead ends: 166 [2021-11-25 18:19:41,298 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2021-11-25 18:19:41,300 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 77 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 18:19:41,300 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 11 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 18:19:41,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2021-11-25 18:19:41,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2021-11-25 18:19:41,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 3.1454545454545455) internal successors, (519), 165 states have internal predecessors, (519), 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) [2021-11-25 18:19:41,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 519 transitions. [2021-11-25 18:19:41,319 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 519 transitions. Word has length 22 [2021-11-25 18:19:41,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:19:41,320 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 519 transitions. [2021-11-25 18:19:41,320 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 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) [2021-11-25 18:19:41,321 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 519 transitions. [2021-11-25 18:19:41,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:19:41,324 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:19:41,324 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:19:41,373 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-25 18:19:41,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-11-25 18:19:41,550 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 18:19:41,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:19:41,551 INFO L85 PathProgramCache]: Analyzing trace with hash -809436699, now seen corresponding path program 1 times [2021-11-25 18:19:41,551 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:19:41,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245427327] [2021-11-25 18:19:41,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:19:41,551 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:19:41,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:19:42,469 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:19:42,469 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:19:42,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245427327] [2021-11-25 18:19:42,469 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245427327] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:19:42,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296511388] [2021-11-25 18:19:42,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:19:42,470 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:19:42,470 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:19:42,472 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:19:42,489 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-25 18:19:42,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:19:42,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 38 conjunts are in the unsatisfiable core [2021-11-25 18:19:42,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:19:43,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:19:43,242 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2021-11-25 18:19:43,541 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:19:43,544 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:19:43,545 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 37 [2021-11-25 18:19:43,719 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:19:43,719 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:19:44,301 WARN L838 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_153 (Array Int Int))) (< c_~max3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_153) c_~A~0.base) (+ c_~A~0.offset (* c_~M~0 4))))) (and (or (= c_~max3~0 c_~max1~0) (<= c_~max3~0 c_~max2~0)) (or (< c_~max2~0 c_~max3~0) (= c_~max2~0 c_~max1~0)))) (forall ((v_ArrVal_153 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_153) c_~A~0.base) (+ c_~A~0.offset (* c_~M~0 4))))) (or (<= .cse0 c_~max3~0) (and (or (<= .cse0 c_~max2~0) (= c_~max1~0 .cse0)) (or (= c_~max2~0 c_~max1~0) (< c_~max2~0 .cse0))))))) is different from false [2021-11-25 18:19:44,443 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:19:44,445 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 215 treesize of output 167 [2021-11-25 18:19:44,455 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 123 [2021-11-25 18:19:44,466 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 99 [2021-11-25 18:19:45,530 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-11-25 18:19:45,530 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296511388] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:19:45,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1350218953] [2021-11-25 18:19:45,539 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:19:45,541 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:19:45,541 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 26 [2021-11-25 18:19:45,541 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211391133] [2021-11-25 18:19:45,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:19:45,542 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-11-25 18:19:45,542 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:19:45,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-11-25 18:19:45,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=599, Unknown=1, NotChecked=50, Total=756 [2021-11-25 18:19:45,544 INFO L87 Difference]: Start difference. First operand 166 states and 519 transitions. Second operand has 28 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 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) [2021-11-25 18:19:47,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:19:47,966 INFO L93 Difference]: Finished difference Result 519 states and 1595 transitions. [2021-11-25 18:19:47,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-25 18:19:47,967 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 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) Word has length 23 [2021-11-25 18:19:47,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:19:47,974 INFO L225 Difference]: With dead ends: 519 [2021-11-25 18:19:47,974 INFO L226 Difference]: Without dead ends: 498 [2021-11-25 18:19:47,976 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=311, Invalid=1672, Unknown=1, NotChecked=86, Total=2070 [2021-11-25 18:19:47,977 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 232 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 1163 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 1277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:19:47,977 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [232 Valid, 122 Invalid, 1277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1163 Invalid, 0 Unknown, 91 Unchecked, 1.1s Time] [2021-11-25 18:19:47,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2021-11-25 18:19:48,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 274. [2021-11-25 18:19:48,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 273 states have (on average 3.0842490842490844) internal successors, (842), 273 states have internal predecessors, (842), 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) [2021-11-25 18:19:48,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 842 transitions. [2021-11-25 18:19:48,011 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 842 transitions. Word has length 23 [2021-11-25 18:19:48,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:19:48,012 INFO L470 AbstractCegarLoop]: Abstraction has 274 states and 842 transitions. [2021-11-25 18:19:48,012 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 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) [2021-11-25 18:19:48,012 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 842 transitions. [2021-11-25 18:19:48,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:19:48,017 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:19:48,017 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:19:48,067 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-25 18:19:48,240 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:19:48,241 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 18:19:48,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:19:48,242 INFO L85 PathProgramCache]: Analyzing trace with hash 738460623, now seen corresponding path program 2 times [2021-11-25 18:19:48,242 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:19:48,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662621286] [2021-11-25 18:19:48,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:19:48,242 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:19:48,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:19:48,844 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:19:48,845 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:19:48,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662621286] [2021-11-25 18:19:48,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662621286] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:19:48,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527621298] [2021-11-25 18:19:48,845 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:19:48,846 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:19:48,846 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:19:48,847 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:19:48,877 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-25 18:19:48,988 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 18:19:48,988 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:19:48,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 36 conjunts are in the unsatisfiable core [2021-11-25 18:19:48,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:19:49,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:19:49,447 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2021-11-25 18:19:49,737 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:19:49,740 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:19:49,741 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 37 [2021-11-25 18:19:49,863 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:19:49,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:19:50,472 WARN L838 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_198 (Array Int Int))) (< c_~max3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~A~0.base) (+ c_~A~0.offset (* c_~M~0 4))))) (and (or (= c_~max3~0 c_~max1~0) (<= c_~max3~0 c_~max2~0)) (or (< c_~max2~0 c_~max3~0) (= c_~max2~0 c_~max1~0)))) (forall ((v_ArrVal_198 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~A~0.base) (+ c_~A~0.offset (* c_~M~0 4))))) (or (and (or (<= .cse0 c_~max2~0) (= .cse0 c_~max1~0)) (or (< c_~max2~0 .cse0) (= c_~max2~0 c_~max1~0))) (<= .cse0 c_~max3~0))))) is different from false [2021-11-25 18:19:50,526 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:19:50,529 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 215 treesize of output 167 [2021-11-25 18:19:50,538 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 123 [2021-11-25 18:19:50,546 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 99 [2021-11-25 18:19:51,434 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:19:51,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1527621298] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:19:51,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1918893032] [2021-11-25 18:19:51,436 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:19:51,437 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:19:51,437 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 28 [2021-11-25 18:19:51,438 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785530462] [2021-11-25 18:19:51,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:19:51,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-11-25 18:19:51,439 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:19:51,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-11-25 18:19:51,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=693, Unknown=1, NotChecked=54, Total=870 [2021-11-25 18:19:51,441 INFO L87 Difference]: Start difference. First operand 274 states and 842 transitions. Second operand has 30 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 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) [2021-11-25 18:19:52,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:19:52,905 INFO L93 Difference]: Finished difference Result 395 states and 1151 transitions. [2021-11-25 18:19:52,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-25 18:19:52,906 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 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) Word has length 23 [2021-11-25 18:19:52,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:19:52,911 INFO L225 Difference]: With dead ends: 395 [2021-11-25 18:19:52,911 INFO L226 Difference]: Without dead ends: 388 [2021-11-25 18:19:52,912 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=238, Invalid=1171, Unknown=1, NotChecked=72, Total=1482 [2021-11-25 18:19:52,919 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 172 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-25 18:19:52,919 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [172 Valid, 53 Invalid, 1039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 981 Invalid, 0 Unknown, 46 Unchecked, 0.8s Time] [2021-11-25 18:19:52,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2021-11-25 18:19:52,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 283. [2021-11-25 18:19:52,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 282 states have (on average 3.095744680851064) internal successors, (873), 282 states have internal predecessors, (873), 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) [2021-11-25 18:19:52,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 873 transitions. [2021-11-25 18:19:52,949 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 873 transitions. Word has length 23 [2021-11-25 18:19:52,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:19:52,950 INFO L470 AbstractCegarLoop]: Abstraction has 283 states and 873 transitions. [2021-11-25 18:19:52,950 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 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) [2021-11-25 18:19:52,950 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 873 transitions. [2021-11-25 18:19:52,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:19:52,954 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:19:52,954 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:19:52,999 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-25 18:19:53,173 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:19:53,174 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 18:19:53,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:19:53,174 INFO L85 PathProgramCache]: Analyzing trace with hash -861527519, now seen corresponding path program 3 times [2021-11-25 18:19:53,175 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:19:53,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138734923] [2021-11-25 18:19:53,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:19:53,175 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:19:53,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:19:53,835 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:19:53,836 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:19:53,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138734923] [2021-11-25 18:19:53,836 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138734923] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:19:53,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285467855] [2021-11-25 18:19:53,836 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 18:19:53,836 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:19:53,837 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:19:53,842 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:19:53,861 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-25 18:19:53,961 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 18:19:53,961 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:19:53,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 31 conjunts are in the unsatisfiable core [2021-11-25 18:19:53,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:19:54,533 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:19:54,536 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:19:54,537 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 37 [2021-11-25 18:19:54,687 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:19:54,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:19:55,065 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:19:55,068 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 77 [2021-11-25 18:19:55,810 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:19:55,810 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285467855] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:19:55,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1733088297] [2021-11-25 18:19:55,811 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:19:55,813 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:19:55,813 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 22 [2021-11-25 18:19:55,814 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361322857] [2021-11-25 18:19:55,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:19:55,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-11-25 18:19:55,815 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:19:55,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-25 18:19:55,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=449, Unknown=0, NotChecked=0, Total=552 [2021-11-25 18:19:55,816 INFO L87 Difference]: Start difference. First operand 283 states and 873 transitions. Second operand has 24 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 23 states have internal predecessors, (62), 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) [2021-11-25 18:19:57,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:19:57,145 INFO L93 Difference]: Finished difference Result 537 states and 1676 transitions. [2021-11-25 18:19:57,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-25 18:19:57,146 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 23 states have internal predecessors, (62), 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) Word has length 23 [2021-11-25 18:19:57,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:19:57,152 INFO L225 Difference]: With dead ends: 537 [2021-11-25 18:19:57,152 INFO L226 Difference]: Without dead ends: 530 [2021-11-25 18:19:57,153 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=310, Invalid=1022, Unknown=0, NotChecked=0, Total=1332 [2021-11-25 18:19:57,159 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 174 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-25 18:19:57,160 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 73 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 841 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-25 18:19:57,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2021-11-25 18:19:57,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 347. [2021-11-25 18:19:57,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 346 states have (on average 3.2283236994219653) internal successors, (1117), 346 states have internal predecessors, (1117), 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) [2021-11-25 18:19:57,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 1117 transitions. [2021-11-25 18:19:57,190 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 1117 transitions. Word has length 23 [2021-11-25 18:19:57,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:19:57,191 INFO L470 AbstractCegarLoop]: Abstraction has 347 states and 1117 transitions. [2021-11-25 18:19:57,191 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 23 states have internal predecessors, (62), 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) [2021-11-25 18:19:57,191 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 1117 transitions. [2021-11-25 18:19:57,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:19:57,193 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:19:57,193 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:19:57,218 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-25 18:19:57,401 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:19:57,406 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 18:19:57,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:19:57,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1282017465, now seen corresponding path program 4 times [2021-11-25 18:19:57,406 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:19:57,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171914809] [2021-11-25 18:19:57,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:19:57,407 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:19:57,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:19:58,016 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:19:58,017 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:19:58,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171914809] [2021-11-25 18:19:58,017 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171914809] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:19:58,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429359855] [2021-11-25 18:19:58,017 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 18:19:58,017 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:19:58,018 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:19:58,019 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:19:58,037 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-25 18:19:58,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:19:58,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-25 18:19:58,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:19:58,630 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:19:58,633 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:19:58,633 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 34 [2021-11-25 18:19:58,797 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:19:58,797 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:19:59,098 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:19:59,098 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 77 [2021-11-25 18:19:59,778 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:19:59,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429359855] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:19:59,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [977423221] [2021-11-25 18:19:59,779 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:19:59,779 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:19:59,779 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 24 [2021-11-25 18:19:59,780 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245867555] [2021-11-25 18:19:59,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:19:59,780 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-11-25 18:19:59,780 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:19:59,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-11-25 18:19:59,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2021-11-25 18:19:59,782 INFO L87 Difference]: Start difference. First operand 347 states and 1117 transitions. Second operand has 26 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 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) [2021-11-25 18:20:02,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:20:02,074 INFO L93 Difference]: Finished difference Result 481 states and 1509 transitions. [2021-11-25 18:20:02,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-11-25 18:20:02,074 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 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) Word has length 23 [2021-11-25 18:20:02,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:20:02,080 INFO L225 Difference]: With dead ends: 481 [2021-11-25 18:20:02,080 INFO L226 Difference]: Without dead ends: 467 [2021-11-25 18:20:02,081 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=485, Invalid=1495, Unknown=0, NotChecked=0, Total=1980 [2021-11-25 18:20:02,082 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 176 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-25 18:20:02,083 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [176 Valid, 104 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 807 Invalid, 0 Unknown, 24 Unchecked, 0.7s Time] [2021-11-25 18:20:02,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2021-11-25 18:20:02,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 365. [2021-11-25 18:20:02,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 364 states have (on average 3.269230769230769) internal successors, (1190), 364 states have internal predecessors, (1190), 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) [2021-11-25 18:20:02,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 1190 transitions. [2021-11-25 18:20:02,105 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 1190 transitions. Word has length 23 [2021-11-25 18:20:02,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:20:02,107 INFO L470 AbstractCegarLoop]: Abstraction has 365 states and 1190 transitions. [2021-11-25 18:20:02,108 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 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) [2021-11-25 18:20:02,108 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 1190 transitions. [2021-11-25 18:20:02,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:20:02,111 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:20:02,111 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:20:02,157 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-25 18:20:02,337 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:20:02,338 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 18:20:02,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:20:02,338 INFO L85 PathProgramCache]: Analyzing trace with hash 69283621, now seen corresponding path program 5 times [2021-11-25 18:20:02,338 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:20:02,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947809783] [2021-11-25 18:20:02,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:20:02,339 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:20:02,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:20:02,975 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:20:02,975 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:20:02,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947809783] [2021-11-25 18:20:02,976 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947809783] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:20:02,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1383202788] [2021-11-25 18:20:02,976 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:20:02,976 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:20:02,976 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:20:02,977 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:20:02,987 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-25 18:20:03,109 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 18:20:03,109 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:20:03,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 32 conjunts are in the unsatisfiable core [2021-11-25 18:20:03,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:20:03,646 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:20:03,648 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:20:03,648 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 30 [2021-11-25 18:20:03,786 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:20:03,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:20:04,075 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:20:04,075 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 77 [2021-11-25 18:20:04,639 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:20:04,639 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1383202788] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:20:04,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1947898125] [2021-11-25 18:20:04,640 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:20:04,641 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:20:04,641 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 22 [2021-11-25 18:20:04,641 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048737889] [2021-11-25 18:20:04,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:20:04,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-11-25 18:20:04,642 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:20:04,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-25 18:20:04,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2021-11-25 18:20:04,643 INFO L87 Difference]: Start difference. First operand 365 states and 1190 transitions. Second operand has 24 states, 23 states have (on average 3.0) internal successors, (69), 23 states have internal predecessors, (69), 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) [2021-11-25 18:20:05,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:20:05,342 INFO L93 Difference]: Finished difference Result 434 states and 1375 transitions. [2021-11-25 18:20:05,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-25 18:20:05,343 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.0) internal successors, (69), 23 states have internal predecessors, (69), 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) Word has length 23 [2021-11-25 18:20:05,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:20:05,351 INFO L225 Difference]: With dead ends: 434 [2021-11-25 18:20:05,351 INFO L226 Difference]: Without dead ends: 427 [2021-11-25 18:20:05,352 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=211, Invalid=719, Unknown=0, NotChecked=0, Total=930 [2021-11-25 18:20:05,354 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 162 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-25 18:20:05,355 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 51 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 328 Invalid, 0 Unknown, 54 Unchecked, 0.3s Time] [2021-11-25 18:20:05,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2021-11-25 18:20:05,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 357. [2021-11-25 18:20:05,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 356 states have (on average 3.241573033707865) internal successors, (1154), 356 states have internal predecessors, (1154), 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) [2021-11-25 18:20:05,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 1154 transitions. [2021-11-25 18:20:05,374 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 1154 transitions. Word has length 23 [2021-11-25 18:20:05,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:20:05,374 INFO L470 AbstractCegarLoop]: Abstraction has 357 states and 1154 transitions. [2021-11-25 18:20:05,374 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.0) internal successors, (69), 23 states have internal predecessors, (69), 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) [2021-11-25 18:20:05,375 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 1154 transitions. [2021-11-25 18:20:05,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:20:05,379 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:20:05,379 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:20:05,421 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-25 18:20:05,597 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:20:05,598 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 18:20:05,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:20:05,598 INFO L85 PathProgramCache]: Analyzing trace with hash 797678335, now seen corresponding path program 6 times [2021-11-25 18:20:05,598 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:20:05,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193395870] [2021-11-25 18:20:05,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:20:05,599 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:20:05,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:20:06,105 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:20:06,106 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:20:06,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193395870] [2021-11-25 18:20:06,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193395870] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:20:06,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947532784] [2021-11-25 18:20:06,106 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 18:20:06,107 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:20:06,107 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:20:06,108 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:20:06,129 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-25 18:20:06,224 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 18:20:06,224 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:20:06,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-25 18:20:06,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:20:06,695 INFO L354 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2021-11-25 18:20:06,696 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 34 [2021-11-25 18:20:06,834 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:20:06,834 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:20:07,290 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:20:07,290 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 73 [2021-11-25 18:20:07,813 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:20:07,813 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [947532784] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:20:07,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [590615679] [2021-11-25 18:20:07,814 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:20:07,816 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:20:07,816 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 23 [2021-11-25 18:20:07,816 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228980792] [2021-11-25 18:20:07,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:20:07,817 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-25 18:20:07,817 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:20:07,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-25 18:20:07,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2021-11-25 18:20:07,818 INFO L87 Difference]: Start difference. First operand 357 states and 1154 transitions. Second operand has 25 states, 24 states have (on average 2.875) internal successors, (69), 24 states have internal predecessors, (69), 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) [2021-11-25 18:20:10,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:20:10,001 INFO L93 Difference]: Finished difference Result 634 states and 1872 transitions. [2021-11-25 18:20:10,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-11-25 18:20:10,002 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.875) internal successors, (69), 24 states have internal predecessors, (69), 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) Word has length 23 [2021-11-25 18:20:10,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:20:10,008 INFO L225 Difference]: With dead ends: 634 [2021-11-25 18:20:10,008 INFO L226 Difference]: Without dead ends: 607 [2021-11-25 18:20:10,009 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=346, Invalid=1816, Unknown=0, NotChecked=0, Total=2162 [2021-11-25 18:20:10,010 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 174 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 1154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 174 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-25 18:20:10,010 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 190 Invalid, 1154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 969 Invalid, 0 Unknown, 174 Unchecked, 0.8s Time] [2021-11-25 18:20:10,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2021-11-25 18:20:10,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 371. [2021-11-25 18:20:10,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 370 states have (on average 3.245945945945946) internal successors, (1201), 370 states have internal predecessors, (1201), 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) [2021-11-25 18:20:10,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1201 transitions. [2021-11-25 18:20:10,030 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1201 transitions. Word has length 23 [2021-11-25 18:20:10,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:20:10,031 INFO L470 AbstractCegarLoop]: Abstraction has 371 states and 1201 transitions. [2021-11-25 18:20:10,031 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.875) internal successors, (69), 24 states have internal predecessors, (69), 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) [2021-11-25 18:20:10,031 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1201 transitions. [2021-11-25 18:20:10,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:20:10,033 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:20:10,033 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:20:10,078 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-25 18:20:10,261 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-11-25 18:20:10,262 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 18:20:10,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:20:10,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1788711955, now seen corresponding path program 7 times [2021-11-25 18:20:10,262 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:20:10,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201989795] [2021-11-25 18:20:10,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:20:10,263 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:20:10,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:20:10,902 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:20:10,902 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:20:10,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201989795] [2021-11-25 18:20:10,903 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201989795] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:20:10,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084100580] [2021-11-25 18:20:10,903 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 18:20:10,903 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:20:10,903 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:20:10,905 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:20:10,933 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-25 18:20:11,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:20:11,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-25 18:20:11,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:20:11,589 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:20:11,593 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:20:11,593 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 34 [2021-11-25 18:20:11,746 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:20:11,746 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:20:12,039 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:20:12,039 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 73 [2021-11-25 18:20:12,571 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:20:12,572 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084100580] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:20:12,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [176165425] [2021-11-25 18:20:12,573 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:20:12,574 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:20:12,575 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 24 [2021-11-25 18:20:12,575 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359045563] [2021-11-25 18:20:12,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:20:12,576 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-11-25 18:20:12,576 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:20:12,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-11-25 18:20:12,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=535, Unknown=0, NotChecked=0, Total=650 [2021-11-25 18:20:12,577 INFO L87 Difference]: Start difference. First operand 371 states and 1201 transitions. Second operand has 26 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 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) [2021-11-25 18:20:14,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:20:14,151 INFO L93 Difference]: Finished difference Result 613 states and 1939 transitions. [2021-11-25 18:20:14,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-11-25 18:20:14,152 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 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) Word has length 23 [2021-11-25 18:20:14,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:20:14,159 INFO L225 Difference]: With dead ends: 613 [2021-11-25 18:20:14,159 INFO L226 Difference]: Without dead ends: 592 [2021-11-25 18:20:14,160 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=351, Invalid=1371, Unknown=0, NotChecked=0, Total=1722 [2021-11-25 18:20:14,161 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 202 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-25 18:20:14,162 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [202 Valid, 142 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 883 Invalid, 0 Unknown, 9 Unchecked, 0.7s Time] [2021-11-25 18:20:14,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2021-11-25 18:20:14,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 379. [2021-11-25 18:20:14,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 378 states have (on average 3.2698412698412698) internal successors, (1236), 378 states have internal predecessors, (1236), 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) [2021-11-25 18:20:14,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1236 transitions. [2021-11-25 18:20:14,185 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1236 transitions. Word has length 23 [2021-11-25 18:20:14,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:20:14,185 INFO L470 AbstractCegarLoop]: Abstraction has 379 states and 1236 transitions. [2021-11-25 18:20:14,185 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 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) [2021-11-25 18:20:14,186 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1236 transitions. [2021-11-25 18:20:14,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:20:14,187 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:20:14,188 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:20:14,230 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-25 18:20:14,400 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-11-25 18:20:14,401 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 18:20:14,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:20:14,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1293521497, now seen corresponding path program 8 times [2021-11-25 18:20:14,401 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:20:14,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673867437] [2021-11-25 18:20:14,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:20:14,402 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:20:14,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:20:14,964 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:20:14,964 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:20:14,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673867437] [2021-11-25 18:20:14,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673867437] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:20:14,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947887238] [2021-11-25 18:20:14,965 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:20:14,965 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:20:14,965 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:20:14,966 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:20:14,967 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-25 18:20:15,091 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 18:20:15,092 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:20:15,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-25 18:20:15,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:20:15,640 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:20:15,643 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:20:15,643 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 34 [2021-11-25 18:20:15,779 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:20:15,779 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:20:16,135 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:20:16,135 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 73 [2021-11-25 18:20:16,641 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:20:16,641 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947887238] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:20:16,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [824574430] [2021-11-25 18:20:16,642 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:20:16,642 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:20:16,642 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 24 [2021-11-25 18:20:16,643 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417136834] [2021-11-25 18:20:16,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:20:16,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-11-25 18:20:16,643 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:20:16,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-11-25 18:20:16,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=542, Unknown=0, NotChecked=0, Total=650 [2021-11-25 18:20:16,644 INFO L87 Difference]: Start difference. First operand 379 states and 1236 transitions. Second operand has 26 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 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) [2021-11-25 18:20:18,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:20:18,394 INFO L93 Difference]: Finished difference Result 690 states and 2135 transitions. [2021-11-25 18:20:18,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-11-25 18:20:18,395 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 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) Word has length 23 [2021-11-25 18:20:18,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:20:18,401 INFO L225 Difference]: With dead ends: 690 [2021-11-25 18:20:18,401 INFO L226 Difference]: Without dead ends: 662 [2021-11-25 18:20:18,403 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=345, Invalid=1547, Unknown=0, NotChecked=0, Total=1892 [2021-11-25 18:20:18,403 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 178 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 874 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-25 18:20:18,404 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [178 Valid, 132 Invalid, 945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 874 Invalid, 0 Unknown, 52 Unchecked, 0.7s Time] [2021-11-25 18:20:18,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2021-11-25 18:20:18,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 390. [2021-11-25 18:20:18,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 389 states have (on average 3.2724935732647813) internal successors, (1273), 389 states have internal predecessors, (1273), 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) [2021-11-25 18:20:18,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1273 transitions. [2021-11-25 18:20:18,425 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1273 transitions. Word has length 23 [2021-11-25 18:20:18,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:20:18,426 INFO L470 AbstractCegarLoop]: Abstraction has 390 states and 1273 transitions. [2021-11-25 18:20:18,426 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 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) [2021-11-25 18:20:18,426 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1273 transitions. [2021-11-25 18:20:18,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:20:18,428 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:20:18,428 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:20:18,471 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2021-11-25 18:20:18,641 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:20:18,642 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 18:20:18,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:20:18,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1466019543, now seen corresponding path program 9 times [2021-11-25 18:20:18,642 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:20:18,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619572237] [2021-11-25 18:20:18,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:20:18,643 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:20:18,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:20:19,090 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:20:19,091 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:20:19,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619572237] [2021-11-25 18:20:19,091 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619572237] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:20:19,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165460459] [2021-11-25 18:20:19,091 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 18:20:19,091 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:20:19,092 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:20:19,092 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:20:19,094 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-25 18:20:19,189 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 18:20:19,190 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:20:19,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 29 conjunts are in the unsatisfiable core [2021-11-25 18:20:19,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:20:19,550 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:20:19,550 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 41 [2021-11-25 18:20:19,915 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:20:19,915 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:20:20,182 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:20:20,183 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 77 [2021-11-25 18:20:20,656 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:20:20,657 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165460459] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:20:20,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1276034976] [2021-11-25 18:20:20,657 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:20:20,659 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:20:20,659 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 7] total 24 [2021-11-25 18:20:20,659 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51117834] [2021-11-25 18:20:20,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:20:20,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-11-25 18:20:20,660 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:20:20,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-11-25 18:20:20,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2021-11-25 18:20:20,662 INFO L87 Difference]: Start difference. First operand 390 states and 1273 transitions. Second operand has 26 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 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) [2021-11-25 18:20:23,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:20:23,236 INFO L93 Difference]: Finished difference Result 663 states and 2101 transitions. [2021-11-25 18:20:23,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-11-25 18:20:23,236 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 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) Word has length 23 [2021-11-25 18:20:23,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:20:23,242 INFO L225 Difference]: With dead ends: 663 [2021-11-25 18:20:23,243 INFO L226 Difference]: Without dead ends: 621 [2021-11-25 18:20:23,244 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 655 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=588, Invalid=2274, Unknown=0, NotChecked=0, Total=2862 [2021-11-25 18:20:23,245 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 258 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 1277 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 1362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 57 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-25 18:20:23,246 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [258 Valid, 126 Invalid, 1362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1277 Invalid, 0 Unknown, 57 Unchecked, 0.9s Time] [2021-11-25 18:20:23,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2021-11-25 18:20:23,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 416. [2021-11-25 18:20:23,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 415 states have (on average 3.378313253012048) internal successors, (1402), 415 states have internal predecessors, (1402), 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) [2021-11-25 18:20:23,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 1402 transitions. [2021-11-25 18:20:23,270 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 1402 transitions. Word has length 23 [2021-11-25 18:20:23,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:20:23,270 INFO L470 AbstractCegarLoop]: Abstraction has 416 states and 1402 transitions. [2021-11-25 18:20:23,270 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 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) [2021-11-25 18:20:23,271 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 1402 transitions. [2021-11-25 18:20:23,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:20:23,273 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:20:23,273 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:20:23,315 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-11-25 18:20:23,489 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-11-25 18:20:23,490 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 18:20:23,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:20:23,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1701387339, now seen corresponding path program 10 times [2021-11-25 18:20:23,490 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:20:23,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699362480] [2021-11-25 18:20:23,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:20:23,491 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:20:23,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:20:24,118 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:20:24,119 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:20:24,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699362480] [2021-11-25 18:20:24,119 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699362480] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:20:24,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186387765] [2021-11-25 18:20:24,119 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 18:20:24,119 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:20:24,119 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:20:24,120 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:20:24,121 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-25 18:20:24,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:20:24,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-25 18:20:24,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:20:24,625 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 31 [2021-11-25 18:20:24,744 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:20:24,744 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:20:25,120 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:20:25,121 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 73 [2021-11-25 18:20:25,616 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:20:25,616 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186387765] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:20:25,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1340530087] [2021-11-25 18:20:25,616 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:20:25,617 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:20:25,617 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 23 [2021-11-25 18:20:25,617 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720168977] [2021-11-25 18:20:25,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:20:25,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-25 18:20:25,618 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:20:25,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-25 18:20:25,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=506, Unknown=0, NotChecked=0, Total=600 [2021-11-25 18:20:25,619 INFO L87 Difference]: Start difference. First operand 416 states and 1402 transitions. Second operand has 25 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 24 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:20:27,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:20:27,072 INFO L93 Difference]: Finished difference Result 651 states and 2115 transitions. [2021-11-25 18:20:27,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-25 18:20:27,074 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 24 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-25 18:20:27,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:20:27,081 INFO L225 Difference]: With dead ends: 651 [2021-11-25 18:20:27,081 INFO L226 Difference]: Without dead ends: 644 [2021-11-25 18:20:27,082 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=243, Invalid=1089, Unknown=0, NotChecked=0, Total=1332 [2021-11-25 18:20:27,083 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 205 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-25 18:20:27,083 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [205 Valid, 125 Invalid, 901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-25 18:20:27,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2021-11-25 18:20:27,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 410. [2021-11-25 18:20:27,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 409 states have (on average 3.374083129584352) internal successors, (1380), 409 states have internal predecessors, (1380), 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) [2021-11-25 18:20:27,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 1380 transitions. [2021-11-25 18:20:27,110 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 1380 transitions. Word has length 23 [2021-11-25 18:20:27,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:20:27,111 INFO L470 AbstractCegarLoop]: Abstraction has 410 states and 1380 transitions. [2021-11-25 18:20:27,111 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 24 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:20:27,111 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 1380 transitions. [2021-11-25 18:20:27,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:20:27,113 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:20:27,113 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:20:27,156 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-11-25 18:20:27,326 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-11-25 18:20:27,326 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 18:20:27,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:20:27,327 INFO L85 PathProgramCache]: Analyzing trace with hash -581305483, now seen corresponding path program 11 times [2021-11-25 18:20:27,327 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:20:27,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949440838] [2021-11-25 18:20:27,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:20:27,328 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:20:27,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:20:27,873 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:20:27,873 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:20:27,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949440838] [2021-11-25 18:20:27,874 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949440838] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:20:27,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038786113] [2021-11-25 18:20:27,874 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:20:27,874 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:20:27,874 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:20:27,875 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:20:27,887 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-11-25 18:20:28,012 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 18:20:28,013 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:20:28,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 32 conjunts are in the unsatisfiable core [2021-11-25 18:20:28,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:20:28,549 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:20:28,552 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:20:28,552 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 30 [2021-11-25 18:20:28,687 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:20:28,687 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:20:28,955 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:20:28,955 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 77 [2021-11-25 18:20:29,438 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:20:29,438 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038786113] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:20:29,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [744877696] [2021-11-25 18:20:29,439 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:20:29,440 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:20:29,440 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 22 [2021-11-25 18:20:29,440 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372752022] [2021-11-25 18:20:29,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:20:29,441 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-11-25 18:20:29,441 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:20:29,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-25 18:20:29,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2021-11-25 18:20:29,442 INFO L87 Difference]: Start difference. First operand 410 states and 1380 transitions. Second operand has 24 states, 23 states have (on average 3.0) internal successors, (69), 23 states have internal predecessors, (69), 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) [2021-11-25 18:20:30,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:20:30,392 INFO L93 Difference]: Finished difference Result 509 states and 1677 transitions. [2021-11-25 18:20:30,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-25 18:20:30,392 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.0) internal successors, (69), 23 states have internal predecessors, (69), 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) Word has length 23 [2021-11-25 18:20:30,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:20:30,396 INFO L225 Difference]: With dead ends: 509 [2021-11-25 18:20:30,396 INFO L226 Difference]: Without dead ends: 503 [2021-11-25 18:20:30,397 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=197, Invalid=733, Unknown=0, NotChecked=0, Total=930 [2021-11-25 18:20:30,398 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 141 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 59 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-25 18:20:30,398 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 70 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 585 Invalid, 0 Unknown, 59 Unchecked, 0.4s Time] [2021-11-25 18:20:30,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2021-11-25 18:20:30,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 407. [2021-11-25 18:20:30,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 406 states have (on average 3.3669950738916254) internal successors, (1367), 406 states have internal predecessors, (1367), 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) [2021-11-25 18:20:30,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 1367 transitions. [2021-11-25 18:20:30,419 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 1367 transitions. Word has length 23 [2021-11-25 18:20:30,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:20:30,419 INFO L470 AbstractCegarLoop]: Abstraction has 407 states and 1367 transitions. [2021-11-25 18:20:30,420 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.0) internal successors, (69), 23 states have internal predecessors, (69), 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) [2021-11-25 18:20:30,420 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 1367 transitions. [2021-11-25 18:20:30,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:20:30,422 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:20:30,422 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:20:30,467 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-11-25 18:20:30,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:20:30,638 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 18:20:30,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:20:30,638 INFO L85 PathProgramCache]: Analyzing trace with hash 999476243, now seen corresponding path program 12 times [2021-11-25 18:20:30,638 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:20:30,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076585380] [2021-11-25 18:20:30,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:20:30,639 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:20:30,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:20:31,309 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:20:31,309 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:20:31,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076585380] [2021-11-25 18:20:31,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076585380] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:20:31,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39227136] [2021-11-25 18:20:31,309 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 18:20:31,309 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:20:31,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:20:31,310 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:20:31,313 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-11-25 18:20:31,431 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 18:20:31,431 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:20:31,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 36 conjunts are in the unsatisfiable core [2021-11-25 18:20:31,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:20:31,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:20:31,868 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2021-11-25 18:20:32,094 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:20:32,098 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:20:32,098 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 37 [2021-11-25 18:20:32,229 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:20:32,230 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:20:32,742 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_639 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_639) c_~A~0.base) (+ c_~A~0.offset (* c_~M~0 4))))) (or (and (or (= c_~max1~0 .cse0) (<= .cse0 c_~max2~0)) (or (< c_~max2~0 .cse0) (= c_~max2~0 c_~max1~0))) (<= .cse0 c_~max3~0)))) (or (forall ((v_ArrVal_639 (Array Int Int))) (< c_~max3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_639) c_~A~0.base) (+ c_~A~0.offset (* c_~M~0 4))))) (and (or (= c_~max3~0 c_~max1~0) (<= c_~max3~0 c_~max2~0)) (or (< c_~max2~0 c_~max3~0) (= c_~max2~0 c_~max1~0))))) is different from false [2021-11-25 18:20:32,966 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:20:32,966 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 215 treesize of output 167 [2021-11-25 18:20:32,973 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 123 [2021-11-25 18:20:32,978 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 99 [2021-11-25 18:20:33,820 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2021-11-25 18:20:33,821 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [39227136] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:20:33,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1953620552] [2021-11-25 18:20:33,821 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:20:33,822 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:20:33,822 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 29 [2021-11-25 18:20:33,822 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587259291] [2021-11-25 18:20:33,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:20:33,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-11-25 18:20:33,823 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:20:33,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-11-25 18:20:33,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=759, Unknown=1, NotChecked=56, Total=930 [2021-11-25 18:20:33,824 INFO L87 Difference]: Start difference. First operand 407 states and 1367 transitions. Second operand has 31 states, 30 states have (on average 2.1) internal successors, (63), 30 states have internal predecessors, (63), 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) [2021-11-25 18:20:35,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:20:35,765 INFO L93 Difference]: Finished difference Result 792 states and 2459 transitions. [2021-11-25 18:20:35,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-25 18:20:35,766 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.1) internal successors, (63), 30 states have internal predecessors, (63), 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) Word has length 23 [2021-11-25 18:20:35,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:20:35,772 INFO L225 Difference]: With dead ends: 792 [2021-11-25 18:20:35,773 INFO L226 Difference]: Without dead ends: 778 [2021-11-25 18:20:35,774 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=292, Invalid=1691, Unknown=1, NotChecked=86, Total=2070 [2021-11-25 18:20:35,775 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 249 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 1318 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 1649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 310 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-25 18:20:35,775 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [249 Valid, 40 Invalid, 1649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1318 Invalid, 0 Unknown, 310 Unchecked, 0.9s Time] [2021-11-25 18:20:35,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2021-11-25 18:20:35,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 451. [2021-11-25 18:20:35,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 450 states have (on average 3.428888888888889) internal successors, (1543), 450 states have internal predecessors, (1543), 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) [2021-11-25 18:20:35,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 1543 transitions. [2021-11-25 18:20:35,813 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 1543 transitions. Word has length 23 [2021-11-25 18:20:35,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:20:35,814 INFO L470 AbstractCegarLoop]: Abstraction has 451 states and 1543 transitions. [2021-11-25 18:20:35,814 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.1) internal successors, (63), 30 states have internal predecessors, (63), 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) [2021-11-25 18:20:35,815 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 1543 transitions. [2021-11-25 18:20:35,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:20:35,817 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:20:35,817 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:20:35,861 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-11-25 18:20:36,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-11-25 18:20:36,040 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 18:20:36,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:20:36,040 INFO L85 PathProgramCache]: Analyzing trace with hash -120833743, now seen corresponding path program 13 times [2021-11-25 18:20:36,040 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:20:36,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682614075] [2021-11-25 18:20:36,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:20:36,041 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:20:36,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:20:36,648 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:20:36,648 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:20:36,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682614075] [2021-11-25 18:20:36,648 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682614075] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:20:36,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974008727] [2021-11-25 18:20:36,649 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 18:20:36,649 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:20:36,649 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:20:36,650 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:20:36,672 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-11-25 18:20:36,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:20:36,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 40 conjunts are in the unsatisfiable core [2021-11-25 18:20:36,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:20:37,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:20:37,302 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2021-11-25 18:20:37,533 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:20:37,536 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:20:37,536 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 37 [2021-11-25 18:20:37,654 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:20:37,654 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:20:38,085 WARN L838 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_684 (Array Int Int))) (< c_~max3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_684) c_~A~0.base) (+ c_~A~0.offset (* c_~M~0 4))))) (and (or (= c_~max3~0 c_~max1~0) (<= c_~max3~0 c_~max2~0)) (or (< c_~max2~0 c_~max3~0) (= c_~max2~0 c_~max1~0)))) (forall ((v_ArrVal_684 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_684) c_~A~0.base) (+ c_~A~0.offset (* c_~M~0 4))))) (or (and (or (< c_~max2~0 .cse0) (= c_~max2~0 c_~max1~0)) (or (= c_~max1~0 .cse0) (<= .cse0 c_~max2~0))) (<= .cse0 c_~max3~0))))) is different from false [2021-11-25 18:20:38,173 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:20:38,173 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 215 treesize of output 167 [2021-11-25 18:20:38,181 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 105 [2021-11-25 18:20:38,191 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 99 [2021-11-25 18:20:38,946 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:20:38,946 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1974008727] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:20:38,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1322429838] [2021-11-25 18:20:38,947 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:20:38,958 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:20:38,958 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 26 [2021-11-25 18:20:38,958 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608427161] [2021-11-25 18:20:38,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:20:38,959 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-11-25 18:20:38,959 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:20:38,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-11-25 18:20:38,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=603, Unknown=1, NotChecked=50, Total=756 [2021-11-25 18:20:38,961 INFO L87 Difference]: Start difference. First operand 451 states and 1543 transitions. Second operand has 28 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 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) [2021-11-25 18:20:40,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:20:40,984 INFO L93 Difference]: Finished difference Result 782 states and 2429 transitions. [2021-11-25 18:20:40,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-25 18:20:40,985 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 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) Word has length 23 [2021-11-25 18:20:40,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:20:40,991 INFO L225 Difference]: With dead ends: 782 [2021-11-25 18:20:40,992 INFO L226 Difference]: Without dead ends: 768 [2021-11-25 18:20:40,992 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=284, Invalid=1525, Unknown=1, NotChecked=82, Total=1892 [2021-11-25 18:20:40,993 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 252 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 1438 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 1603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 139 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-25 18:20:40,994 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [252 Valid, 94 Invalid, 1603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1438 Invalid, 0 Unknown, 139 Unchecked, 1.0s Time] [2021-11-25 18:20:40,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2021-11-25 18:20:41,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 406. [2021-11-25 18:20:41,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 405 states have (on average 3.3555555555555556) internal successors, (1359), 405 states have internal predecessors, (1359), 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) [2021-11-25 18:20:41,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 1359 transitions. [2021-11-25 18:20:41,019 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 1359 transitions. Word has length 23 [2021-11-25 18:20:41,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:20:41,020 INFO L470 AbstractCegarLoop]: Abstraction has 406 states and 1359 transitions. [2021-11-25 18:20:41,020 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 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) [2021-11-25 18:20:41,020 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 1359 transitions. [2021-11-25 18:20:41,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:20:41,022 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:20:41,023 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:20:41,070 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-11-25 18:20:41,237 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-11-25 18:20:41,238 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 18:20:41,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:20:41,238 INFO L85 PathProgramCache]: Analyzing trace with hash 532284175, now seen corresponding path program 14 times [2021-11-25 18:20:41,238 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:20:41,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259104950] [2021-11-25 18:20:41,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:20:41,239 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:20:41,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:20:41,961 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:20:41,961 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:20:41,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259104950] [2021-11-25 18:20:41,961 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259104950] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:20:41,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152524780] [2021-11-25 18:20:41,961 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:20:41,962 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:20:41,962 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:20:41,966 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:20:41,969 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-11-25 18:20:42,121 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 18:20:42,121 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:20:42,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-25 18:20:42,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:20:42,682 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:20:42,685 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:20:42,685 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 34 [2021-11-25 18:20:42,843 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:20:42,843 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:20:43,162 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:20:43,163 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 77 [2021-11-25 18:20:43,783 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:20:43,784 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152524780] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:20:43,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [359885305] [2021-11-25 18:20:43,784 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:20:43,784 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:20:43,785 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 23 [2021-11-25 18:20:43,785 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841301856] [2021-11-25 18:20:43,785 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:20:43,785 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-25 18:20:43,785 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:20:43,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-25 18:20:43,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2021-11-25 18:20:43,787 INFO L87 Difference]: Start difference. First operand 406 states and 1359 transitions. Second operand has 25 states, 24 states have (on average 2.875) internal successors, (69), 24 states have internal predecessors, (69), 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) [2021-11-25 18:20:44,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:20:44,528 INFO L93 Difference]: Finished difference Result 559 states and 1828 transitions. [2021-11-25 18:20:44,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-25 18:20:44,529 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.875) internal successors, (69), 24 states have internal predecessors, (69), 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) Word has length 23 [2021-11-25 18:20:44,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:20:44,533 INFO L225 Difference]: With dead ends: 559 [2021-11-25 18:20:44,533 INFO L226 Difference]: Without dead ends: 545 [2021-11-25 18:20:44,534 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=182, Invalid=688, Unknown=0, NotChecked=0, Total=870 [2021-11-25 18:20:44,534 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 159 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-25 18:20:44,535 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [159 Valid, 75 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 517 Invalid, 0 Unknown, 6 Unchecked, 0.4s Time] [2021-11-25 18:20:44,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2021-11-25 18:20:44,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 413. [2021-11-25 18:20:44,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 412 states have (on average 3.371359223300971) internal successors, (1389), 412 states have internal predecessors, (1389), 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) [2021-11-25 18:20:44,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 1389 transitions. [2021-11-25 18:20:44,554 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 1389 transitions. Word has length 23 [2021-11-25 18:20:44,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:20:44,554 INFO L470 AbstractCegarLoop]: Abstraction has 413 states and 1389 transitions. [2021-11-25 18:20:44,555 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.875) internal successors, (69), 24 states have internal predecessors, (69), 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) [2021-11-25 18:20:44,555 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 1389 transitions. [2021-11-25 18:20:44,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:20:44,557 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:20:44,557 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:20:44,594 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-11-25 18:20:44,770 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-11-25 18:20:44,770 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 18:20:44,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:20:44,771 INFO L85 PathProgramCache]: Analyzing trace with hash 232828109, now seen corresponding path program 15 times [2021-11-25 18:20:44,771 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:20:44,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870064931] [2021-11-25 18:20:44,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:20:44,771 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:20:44,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:20:45,306 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:20:45,306 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:20:45,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870064931] [2021-11-25 18:20:45,306 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870064931] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:20:45,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216308531] [2021-11-25 18:20:45,307 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 18:20:45,307 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:20:45,307 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:20:45,311 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:20:45,312 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-11-25 18:20:45,431 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 18:20:45,431 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:20:45,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 29 conjunts are in the unsatisfiable core [2021-11-25 18:20:45,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:20:45,898 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:20:45,898 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 41 [2021-11-25 18:20:46,293 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:20:46,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:20:46,744 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:20:46,744 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 77 [2021-11-25 18:20:47,209 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:20:47,209 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216308531] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:20:47,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1335714771] [2021-11-25 18:20:47,210 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:20:47,210 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:20:47,210 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 25 [2021-11-25 18:20:47,211 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755429117] [2021-11-25 18:20:47,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:20:47,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-11-25 18:20:47,211 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:20:47,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-11-25 18:20:47,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=572, Unknown=0, NotChecked=0, Total=702 [2021-11-25 18:20:47,212 INFO L87 Difference]: Start difference. First operand 413 states and 1389 transitions. Second operand has 27 states, 26 states have (on average 2.6538461538461537) internal successors, (69), 26 states have internal predecessors, (69), 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) [2021-11-25 18:20:50,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:20:50,867 INFO L93 Difference]: Finished difference Result 888 states and 2681 transitions. [2021-11-25 18:20:50,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-11-25 18:20:50,868 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.6538461538461537) internal successors, (69), 26 states have internal predecessors, (69), 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) Word has length 23 [2021-11-25 18:20:50,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:20:50,875 INFO L225 Difference]: With dead ends: 888 [2021-11-25 18:20:50,875 INFO L226 Difference]: Without dead ends: 861 [2021-11-25 18:20:50,876 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 648 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=574, Invalid=2506, Unknown=0, NotChecked=0, Total=3080 [2021-11-25 18:20:50,877 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 182 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 1725 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 1896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 142 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-25 18:20:50,877 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [182 Valid, 92 Invalid, 1896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1725 Invalid, 0 Unknown, 142 Unchecked, 1.3s Time] [2021-11-25 18:20:50,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2021-11-25 18:20:50,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 438. [2021-11-25 18:20:50,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 437 states have (on average 3.4965675057208236) internal successors, (1528), 437 states have internal predecessors, (1528), 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) [2021-11-25 18:20:50,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1528 transitions. [2021-11-25 18:20:50,900 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1528 transitions. Word has length 23 [2021-11-25 18:20:50,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:20:50,900 INFO L470 AbstractCegarLoop]: Abstraction has 438 states and 1528 transitions. [2021-11-25 18:20:50,901 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.6538461538461537) internal successors, (69), 26 states have internal predecessors, (69), 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) [2021-11-25 18:20:50,901 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1528 transitions. [2021-11-25 18:20:50,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:20:50,903 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:20:50,903 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:20:50,946 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-11-25 18:20:51,117 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-11-25 18:20:51,118 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 18:20:51,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:20:51,118 INFO L85 PathProgramCache]: Analyzing trace with hash 339222629, now seen corresponding path program 16 times [2021-11-25 18:20:51,118 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:20:51,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487235747] [2021-11-25 18:20:51,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:20:51,119 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:20:51,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:20:51,723 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:20:51,724 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:20:51,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487235747] [2021-11-25 18:20:51,724 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487235747] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:20:51,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912605601] [2021-11-25 18:20:51,724 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 18:20:51,724 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:20:51,724 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:20:51,726 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:20:51,726 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-11-25 18:20:51,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:20:51,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 44 conjunts are in the unsatisfiable core [2021-11-25 18:20:51,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:20:51,865 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2021-11-25 18:20:52,157 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2021-11-25 18:20:52,349 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2021-11-25 18:20:52,519 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:20:52,521 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:20:52,521 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 37 [2021-11-25 18:20:52,644 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:20:52,644 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:20:53,040 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_821 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_821) c_~A~0.base) (+ c_~A~0.offset (* c_~M~0 4))))) (or (and (or (< c_~max2~0 .cse0) (= c_~max2~0 c_~max1~0)) (or (= c_~max1~0 .cse0) (<= .cse0 c_~max2~0))) (<= .cse0 c_~max3~0)))) (or (forall ((v_ArrVal_821 (Array Int Int))) (< c_~max3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_821) c_~A~0.base) (+ c_~A~0.offset (* c_~M~0 4))))) (and (or (= c_~max3~0 c_~max1~0) (<= c_~max3~0 c_~max2~0)) (or (< c_~max2~0 c_~max3~0) (= c_~max2~0 c_~max1~0))))) is different from false [2021-11-25 18:20:53,308 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_821 (Array Int Int)) (v_ArrVal_820 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_820) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_821) c_~A~0.base) (+ c_~A~0.offset (* c_~M~0 4))))) (or (<= .cse0 c_~max3~0) (and (or (< c_~max2~0 .cse0) (= c_~max2~0 c_~max1~0)) (or (<= .cse0 c_~max2~0) (= c_~max1~0 .cse0)))))) (or (and (or (= c_~max3~0 c_~max1~0) (<= c_~max3~0 c_~max2~0)) (or (< c_~max2~0 c_~max3~0) (= c_~max2~0 c_~max1~0))) (forall ((v_ArrVal_821 (Array Int Int)) (v_ArrVal_820 (Array Int Int))) (< c_~max3~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_820) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_821) c_~A~0.base) (+ c_~A~0.offset (* c_~M~0 4))))))) is different from false [2021-11-25 18:20:53,344 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:20:53,344 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 483 treesize of output 427 [2021-11-25 18:20:53,352 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 389 treesize of output 341 [2021-11-25 18:20:53,360 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 341 treesize of output 317 [2021-11-25 18:20:53,368 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 317 treesize of output 305 [2021-11-25 18:20:53,380 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 305 treesize of output 281 [2021-11-25 18:20:54,820 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-11-25 18:20:54,820 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912605601] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:20:54,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1362870225] [2021-11-25 18:20:54,821 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:20:54,822 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:20:54,822 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2021-11-25 18:20:54,822 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111009629] [2021-11-25 18:20:54,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:20:54,822 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-11-25 18:20:54,823 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:20:54,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-11-25 18:20:54,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=588, Unknown=2, NotChecked=102, Total=812 [2021-11-25 18:20:54,823 INFO L87 Difference]: Start difference. First operand 438 states and 1528 transitions. Second operand has 29 states, 28 states have (on average 2.4642857142857144) internal successors, (69), 28 states have internal predecessors, (69), 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) [2021-11-25 18:20:56,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:20:56,254 INFO L93 Difference]: Finished difference Result 826 states and 2723 transitions. [2021-11-25 18:20:56,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-25 18:20:56,255 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.4642857142857144) internal successors, (69), 28 states have internal predecessors, (69), 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) Word has length 23 [2021-11-25 18:20:56,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:20:56,261 INFO L225 Difference]: With dead ends: 826 [2021-11-25 18:20:56,261 INFO L226 Difference]: Without dead ends: 812 [2021-11-25 18:20:56,262 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=233, Invalid=1105, Unknown=2, NotChecked=142, Total=1482 [2021-11-25 18:20:56,263 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 198 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 1190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 207 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-25 18:20:56,263 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [198 Valid, 111 Invalid, 1190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 967 Invalid, 0 Unknown, 207 Unchecked, 0.7s Time] [2021-11-25 18:20:56,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2021-11-25 18:20:56,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 517. [2021-11-25 18:20:56,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 516 states have (on average 3.385658914728682) internal successors, (1747), 516 states have internal predecessors, (1747), 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) [2021-11-25 18:20:56,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 1747 transitions. [2021-11-25 18:20:56,289 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 1747 transitions. Word has length 23 [2021-11-25 18:20:56,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:20:56,290 INFO L470 AbstractCegarLoop]: Abstraction has 517 states and 1747 transitions. [2021-11-25 18:20:56,290 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.4642857142857144) internal successors, (69), 28 states have internal predecessors, (69), 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) [2021-11-25 18:20:56,291 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 1747 transitions. [2021-11-25 18:20:56,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:20:56,293 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:20:56,293 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:20:56,325 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-11-25 18:20:56,510 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:20:56,510 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 18:20:56,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:20:56,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1887119951, now seen corresponding path program 17 times [2021-11-25 18:20:56,511 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:20:56,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933506265] [2021-11-25 18:20:56,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:20:56,511 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:20:56,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:20:57,110 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:20:57,110 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:20:57,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933506265] [2021-11-25 18:20:57,110 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933506265] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:20:57,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135977144] [2021-11-25 18:20:57,110 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:20:57,110 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:20:57,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:20:57,111 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:20:57,117 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-11-25 18:20:57,241 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 18:20:57,241 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:20:57,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 42 conjunts are in the unsatisfiable core [2021-11-25 18:20:57,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:20:57,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:20:57,578 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2021-11-25 18:20:57,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:20:57,745 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2021-11-25 18:20:57,931 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:20:57,934 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:20:57,934 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 37 [2021-11-25 18:20:58,025 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:20:58,025 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:20:58,360 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_867 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_867) c_~A~0.base) (+ c_~A~0.offset (* c_~M~0 4))))) (or (and (or (< c_~max2~0 .cse0) (= c_~max2~0 c_~max1~0)) (or (<= .cse0 c_~max2~0) (= c_~max1~0 .cse0))) (<= .cse0 c_~max3~0)))) (or (forall ((v_ArrVal_867 (Array Int Int))) (< c_~max3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_867) c_~A~0.base) (+ c_~A~0.offset (* c_~M~0 4))))) (and (or (= c_~max3~0 c_~max1~0) (<= c_~max3~0 c_~max2~0)) (or (< c_~max2~0 c_~max3~0) (= c_~max2~0 c_~max1~0))))) is different from false [2021-11-25 18:20:58,548 WARN L838 $PredicateComparison]: unable to prove that (and (or (and (or (= c_~max3~0 c_~max1~0) (<= c_~max3~0 c_~max2~0)) (or (< c_~max2~0 c_~max3~0) (= c_~max2~0 c_~max1~0))) (forall ((v_ArrVal_867 (Array Int Int)) (v_ArrVal_866 (Array Int Int))) (< c_~max3~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_866) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_867) c_~A~0.base) (+ c_~A~0.offset (* c_~M~0 4)))))) (forall ((v_ArrVal_867 (Array Int Int)) (v_ArrVal_866 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_866) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_867) c_~A~0.base) (+ c_~A~0.offset (* c_~M~0 4))))) (or (<= .cse0 c_~max3~0) (and (or (< c_~max2~0 .cse0) (= c_~max2~0 c_~max1~0)) (or (<= .cse0 c_~max2~0) (= .cse0 c_~max1~0))))))) is different from false [2021-11-25 18:20:58,582 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:20:58,582 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 483 treesize of output 427 [2021-11-25 18:20:58,589 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 389 treesize of output 377 [2021-11-25 18:20:58,599 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 377 treesize of output 353 [2021-11-25 18:20:58,608 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 353 treesize of output 329 [2021-11-25 18:20:58,616 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 329 treesize of output 281 [2021-11-25 18:20:59,696 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:20:59,696 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2135977144] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:20:59,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [961312908] [2021-11-25 18:20:59,696 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:20:59,697 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:20:59,698 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 28 [2021-11-25 18:20:59,698 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742452749] [2021-11-25 18:20:59,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:20:59,698 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-11-25 18:20:59,698 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:20:59,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-11-25 18:20:59,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=654, Unknown=2, NotChecked=106, Total=870 [2021-11-25 18:20:59,699 INFO L87 Difference]: Start difference. First operand 517 states and 1747 transitions. Second operand has 30 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 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) [2021-11-25 18:21:01,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:21:01,109 INFO L93 Difference]: Finished difference Result 976 states and 3082 transitions. [2021-11-25 18:21:01,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-25 18:21:01,109 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 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) Word has length 23 [2021-11-25 18:21:01,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:21:01,115 INFO L225 Difference]: With dead ends: 976 [2021-11-25 18:21:01,115 INFO L226 Difference]: Without dead ends: 962 [2021-11-25 18:21:01,116 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=251, Invalid=1395, Unknown=2, NotChecked=158, Total=1806 [2021-11-25 18:21:01,116 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 304 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 946 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 156 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-25 18:21:01,117 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [304 Valid, 71 Invalid, 1135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 946 Invalid, 0 Unknown, 156 Unchecked, 0.6s Time] [2021-11-25 18:21:01,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2021-11-25 18:21:01,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 506. [2021-11-25 18:21:01,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 505 states have (on average 3.384158415841584) internal successors, (1709), 505 states have internal predecessors, (1709), 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) [2021-11-25 18:21:01,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 1709 transitions. [2021-11-25 18:21:01,139 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 1709 transitions. Word has length 23 [2021-11-25 18:21:01,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:21:01,140 INFO L470 AbstractCegarLoop]: Abstraction has 506 states and 1709 transitions. [2021-11-25 18:21:01,140 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 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) [2021-11-25 18:21:01,140 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 1709 transitions. [2021-11-25 18:21:01,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-25 18:21:01,142 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:21:01,142 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:21:01,177 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2021-11-25 18:21:01,357 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:21:01,358 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 18:21:01,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:21:01,358 INFO L85 PathProgramCache]: Analyzing trace with hash -780631851, now seen corresponding path program 18 times [2021-11-25 18:21:01,358 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:21:01,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665503639] [2021-11-25 18:21:01,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:21:01,358 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:21:01,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:21:01,408 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:21:01,408 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:21:01,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665503639] [2021-11-25 18:21:01,409 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665503639] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:21:01,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142162432] [2021-11-25 18:21:01,409 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 18:21:01,409 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:21:01,410 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:21:01,426 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:21:01,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-11-25 18:21:01,545 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 18:21:01,546 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:21:01,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-25 18:21:01,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:21:01,674 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:21:01,675 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:21:01,775 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:21:01,775 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2142162432] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:21:01,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1200486356] [2021-11-25 18:21:01,775 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:21:01,776 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:21:01,776 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 19 [2021-11-25 18:21:01,776 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561470649] [2021-11-25 18:21:01,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:21:01,777 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-25 18:21:01,777 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:21:01,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-25 18:21:01,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2021-11-25 18:21:01,778 INFO L87 Difference]: Start difference. First operand 506 states and 1709 transitions. Second operand has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 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) [2021-11-25 18:21:02,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:21:02,544 INFO L93 Difference]: Finished difference Result 816 states and 2462 transitions. [2021-11-25 18:21:02,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-25 18:21:02,544 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 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) Word has length 24 [2021-11-25 18:21:02,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:21:02,549 INFO L225 Difference]: With dead ends: 816 [2021-11-25 18:21:02,549 INFO L226 Difference]: Without dead ends: 810 [2021-11-25 18:21:02,550 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=278, Invalid=1054, Unknown=0, NotChecked=0, Total=1332 [2021-11-25 18:21:02,550 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 300 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-25 18:21:02,551 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [300 Valid, 56 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 925 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-25 18:21:02,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2021-11-25 18:21:02,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 520. [2021-11-25 18:21:02,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 519 states have (on average 3.148362235067437) internal successors, (1634), 519 states have internal predecessors, (1634), 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) [2021-11-25 18:21:02,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 1634 transitions. [2021-11-25 18:21:02,570 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 1634 transitions. Word has length 24 [2021-11-25 18:21:02,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:21:02,570 INFO L470 AbstractCegarLoop]: Abstraction has 520 states and 1634 transitions. [2021-11-25 18:21:02,570 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 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) [2021-11-25 18:21:02,571 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 1634 transitions. [2021-11-25 18:21:02,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-25 18:21:02,573 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:21:02,573 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:21:02,608 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2021-11-25 18:21:02,801 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:21:02,802 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 18:21:02,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:21:02,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1482374003, now seen corresponding path program 19 times [2021-11-25 18:21:02,802 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:21:02,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756641024] [2021-11-25 18:21:02,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:21:02,802 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:21:02,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:21:02,870 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:21:02,871 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:21:02,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756641024] [2021-11-25 18:21:02,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756641024] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:21:02,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552495382] [2021-11-25 18:21:02,871 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 18:21:02,872 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:21:02,872 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:21:02,886 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:21:02,905 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-11-25 18:21:03,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:21:03,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-25 18:21:03,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:21:03,141 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:21:03,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:21:03,204 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:21:03,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [552495382] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:21:03,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [911736189] [2021-11-25 18:21:03,205 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:21:03,206 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:21:03,206 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2021-11-25 18:21:03,206 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143998777] [2021-11-25 18:21:03,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:21:03,207 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-25 18:21:03,207 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:21:03,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-25 18:21:03,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2021-11-25 18:21:03,208 INFO L87 Difference]: Start difference. First operand 520 states and 1634 transitions. Second operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 13 states have internal predecessors, (44), 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) [2021-11-25 18:21:03,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:21:03,395 INFO L93 Difference]: Finished difference Result 551 states and 1589 transitions. [2021-11-25 18:21:03,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-25 18:21:03,395 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 13 states have internal predecessors, (44), 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) Word has length 24 [2021-11-25 18:21:03,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:21:03,398 INFO L225 Difference]: With dead ends: 551 [2021-11-25 18:21:03,398 INFO L226 Difference]: Without dead ends: 479 [2021-11-25 18:21:03,399 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2021-11-25 18:21:03,399 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 119 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:21:03,400 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 44 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:21:03,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2021-11-25 18:21:03,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 413. [2021-11-25 18:21:03,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 412 states have (on average 3.012135922330097) internal successors, (1241), 412 states have internal predecessors, (1241), 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) [2021-11-25 18:21:03,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 1241 transitions. [2021-11-25 18:21:03,415 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 1241 transitions. Word has length 24 [2021-11-25 18:21:03,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:21:03,416 INFO L470 AbstractCegarLoop]: Abstraction has 413 states and 1241 transitions. [2021-11-25 18:21:03,416 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 13 states have internal predecessors, (44), 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) [2021-11-25 18:21:03,416 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 1241 transitions. [2021-11-25 18:21:03,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-25 18:21:03,418 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:21:03,418 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:21:03,457 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2021-11-25 18:21:03,640 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:21:03,641 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 18:21:03,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:21:03,641 INFO L85 PathProgramCache]: Analyzing trace with hash -907064467, now seen corresponding path program 1 times [2021-11-25 18:21:03,641 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:21:03,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959860502] [2021-11-25 18:21:03,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:21:03,642 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:21:03,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:21:03,708 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:21:03,709 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:21:03,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959860502] [2021-11-25 18:21:03,709 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959860502] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:21:03,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415780990] [2021-11-25 18:21:03,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:21:03,710 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:21:03,710 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:21:03,711 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:21:03,736 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-11-25 18:21:03,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:21:03,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-25 18:21:03,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:21:03,989 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:21:03,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:21:04,097 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:21:04,097 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415780990] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:21:04,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [88208003] [2021-11-25 18:21:04,098 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:21:04,100 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:21:04,100 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2021-11-25 18:21:04,100 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853463168] [2021-11-25 18:21:04,101 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:21:04,101 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-25 18:21:04,101 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:21:04,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-25 18:21:04,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2021-11-25 18:21:04,102 INFO L87 Difference]: Start difference. First operand 413 states and 1241 transitions. Second operand has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 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) [2021-11-25 18:21:04,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:21:04,577 INFO L93 Difference]: Finished difference Result 485 states and 1403 transitions. [2021-11-25 18:21:04,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-25 18:21:04,578 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 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) Word has length 24 [2021-11-25 18:21:04,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:21:04,582 INFO L225 Difference]: With dead ends: 485 [2021-11-25 18:21:04,582 INFO L226 Difference]: Without dead ends: 437 [2021-11-25 18:21:04,582 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2021-11-25 18:21:04,583 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 119 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-25 18:21:04,583 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 64 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-25 18:21:04,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2021-11-25 18:21:04,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 395. [2021-11-25 18:21:04,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 394 states have (on average 3.012690355329949) internal successors, (1187), 394 states have internal predecessors, (1187), 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) [2021-11-25 18:21:04,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1187 transitions. [2021-11-25 18:21:04,595 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1187 transitions. Word has length 24 [2021-11-25 18:21:04,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:21:04,596 INFO L470 AbstractCegarLoop]: Abstraction has 395 states and 1187 transitions. [2021-11-25 18:21:04,596 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 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) [2021-11-25 18:21:04,596 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1187 transitions. [2021-11-25 18:21:04,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-25 18:21:04,598 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:21:04,598 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:21:04,633 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2021-11-25 18:21:04,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-11-25 18:21:04,811 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 18:21:04,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:21:04,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1001485969, now seen corresponding path program 2 times [2021-11-25 18:21:04,811 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:21:04,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943193491] [2021-11-25 18:21:04,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:21:04,812 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:21:04,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:21:04,883 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:21:04,883 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:21:04,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943193491] [2021-11-25 18:21:04,884 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943193491] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:21:04,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725334341] [2021-11-25 18:21:04,884 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:21:04,884 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:21:04,884 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:21:04,885 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:21:04,901 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2021-11-25 18:21:05,014 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 18:21:05,014 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:21:05,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-25 18:21:05,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:21:05,149 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-25 18:21:05,149 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:21:05,221 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-25 18:21:05,221 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725334341] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:21:05,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1889872442] [2021-11-25 18:21:05,222 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:21:05,222 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:21:05,222 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 15 [2021-11-25 18:21:05,223 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409559129] [2021-11-25 18:21:05,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:21:05,223 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-25 18:21:05,223 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:21:05,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-25 18:21:05,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2021-11-25 18:21:05,224 INFO L87 Difference]: Start difference. First operand 395 states and 1187 transitions. Second operand has 16 states, 16 states have (on average 3.625) internal successors, (58), 15 states have internal predecessors, (58), 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) [2021-11-25 18:21:05,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:21:05,427 INFO L93 Difference]: Finished difference Result 361 states and 1069 transitions. [2021-11-25 18:21:05,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-25 18:21:05,427 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.625) internal successors, (58), 15 states have internal predecessors, (58), 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) Word has length 24 [2021-11-25 18:21:05,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:21:05,429 INFO L225 Difference]: With dead ends: 361 [2021-11-25 18:21:05,429 INFO L226 Difference]: Without dead ends: 274 [2021-11-25 18:21:05,430 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2021-11-25 18:21:05,430 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 81 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 18:21:05,431 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 41 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 18:21:05,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2021-11-25 18:21:05,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2021-11-25 18:21:05,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 273 states have (on average 3.2051282051282053) internal successors, (875), 273 states have internal predecessors, (875), 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) [2021-11-25 18:21:05,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 875 transitions. [2021-11-25 18:21:05,439 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 875 transitions. Word has length 24 [2021-11-25 18:21:05,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:21:05,440 INFO L470 AbstractCegarLoop]: Abstraction has 274 states and 875 transitions. [2021-11-25 18:21:05,440 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.625) internal successors, (58), 15 states have internal predecessors, (58), 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) [2021-11-25 18:21:05,440 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 875 transitions. [2021-11-25 18:21:05,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-25 18:21:05,441 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:21:05,441 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:21:05,479 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2021-11-25 18:21:05,661 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-11-25 18:21:05,662 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 18:21:05,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:21:05,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1713190597, now seen corresponding path program 20 times [2021-11-25 18:21:05,662 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:21:05,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110328213] [2021-11-25 18:21:05,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:21:05,662 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:21:05,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:21:05,742 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:21:05,742 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:21:05,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110328213] [2021-11-25 18:21:05,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110328213] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:21:05,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860751290] [2021-11-25 18:21:05,743 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:21:05,743 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:21:05,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:21:05,754 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:21:05,776 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2021-11-25 18:21:05,904 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 18:21:05,904 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:21:05,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-25 18:21:05,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:21:06,026 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:21:06,026 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:21:06,128 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:21:06,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860751290] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:21:06,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1218549110] [2021-11-25 18:21:06,128 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:21:06,128 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:21:06,129 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 17 [2021-11-25 18:21:06,129 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894137157] [2021-11-25 18:21:06,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:21:06,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-25 18:21:06,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:21:06,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-25 18:21:06,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2021-11-25 18:21:06,130 INFO L87 Difference]: Start difference. First operand 274 states and 875 transitions. Second operand has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 17 states have internal predecessors, (51), 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) [2021-11-25 18:21:06,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:21:06,769 INFO L93 Difference]: Finished difference Result 456 states and 1427 transitions. [2021-11-25 18:21:06,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-25 18:21:06,770 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 17 states have internal predecessors, (51), 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) Word has length 24 [2021-11-25 18:21:06,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:21:06,774 INFO L225 Difference]: With dead ends: 456 [2021-11-25 18:21:06,774 INFO L226 Difference]: Without dead ends: 456 [2021-11-25 18:21:06,775 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=334, Invalid=722, Unknown=0, NotChecked=0, Total=1056 [2021-11-25 18:21:06,776 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 189 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-25 18:21:06,776 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [189 Valid, 45 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-25 18:21:06,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2021-11-25 18:21:06,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 283. [2021-11-25 18:21:06,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 282 states have (on average 3.2872340425531914) internal successors, (927), 282 states have internal predecessors, (927), 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) [2021-11-25 18:21:06,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 927 transitions. [2021-11-25 18:21:06,787 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 927 transitions. Word has length 24 [2021-11-25 18:21:06,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:21:06,787 INFO L470 AbstractCegarLoop]: Abstraction has 283 states and 927 transitions. [2021-11-25 18:21:06,787 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 17 states have internal predecessors, (51), 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) [2021-11-25 18:21:06,788 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 927 transitions. [2021-11-25 18:21:06,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-25 18:21:06,789 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:21:06,789 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:21:06,823 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2021-11-25 18:21:07,013 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:21:07,014 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 18:21:07,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:21:07,014 INFO L85 PathProgramCache]: Analyzing trace with hash 419932923, now seen corresponding path program 21 times [2021-11-25 18:21:07,014 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:21:07,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6128090] [2021-11-25 18:21:07,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:21:07,015 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:21:07,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:21:07,131 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:21:07,131 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:21:07,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6128090] [2021-11-25 18:21:07,132 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6128090] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:21:07,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312727393] [2021-11-25 18:21:07,132 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 18:21:07,132 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:21:07,133 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:21:07,133 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:21:07,145 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2021-11-25 18:21:07,264 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 18:21:07,264 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:21:07,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-25 18:21:07,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:21:07,414 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:21:07,415 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:21:07,516 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:21:07,516 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312727393] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:21:07,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1530628749] [2021-11-25 18:21:07,516 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:21:07,517 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:21:07,517 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2021-11-25 18:21:07,517 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859783261] [2021-11-25 18:21:07,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:21:07,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-11-25 18:21:07,518 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:21:07,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-25 18:21:07,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2021-11-25 18:21:07,523 INFO L87 Difference]: Start difference. First operand 283 states and 927 transitions. Second operand has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 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) [2021-11-25 18:21:08,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:21:08,386 INFO L93 Difference]: Finished difference Result 997 states and 3144 transitions. [2021-11-25 18:21:08,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-11-25 18:21:08,386 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 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) Word has length 25 [2021-11-25 18:21:08,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:21:08,394 INFO L225 Difference]: With dead ends: 997 [2021-11-25 18:21:08,395 INFO L226 Difference]: Without dead ends: 997 [2021-11-25 18:21:08,396 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=478, Invalid=1502, Unknown=0, NotChecked=0, Total=1980 [2021-11-25 18:21:08,396 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 345 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 886 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-25 18:21:08,397 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [345 Valid, 51 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 886 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-25 18:21:08,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2021-11-25 18:21:08,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 355. [2021-11-25 18:21:08,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 354 states have (on average 3.516949152542373) internal successors, (1245), 354 states have internal predecessors, (1245), 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) [2021-11-25 18:21:08,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 1245 transitions. [2021-11-25 18:21:08,417 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 1245 transitions. Word has length 25 [2021-11-25 18:21:08,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:21:08,417 INFO L470 AbstractCegarLoop]: Abstraction has 355 states and 1245 transitions. [2021-11-25 18:21:08,417 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 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) [2021-11-25 18:21:08,418 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 1245 transitions. [2021-11-25 18:21:08,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-25 18:21:08,419 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:21:08,419 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:21:08,456 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2021-11-25 18:21:08,641 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-11-25 18:21:08,642 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 18:21:08,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:21:08,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1275239577, now seen corresponding path program 22 times [2021-11-25 18:21:08,642 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:21:08,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650168426] [2021-11-25 18:21:08,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:21:08,642 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:21:08,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:21:08,726 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:21:08,726 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:21:08,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650168426] [2021-11-25 18:21:08,726 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650168426] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:21:08,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228078546] [2021-11-25 18:21:08,727 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 18:21:08,727 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:21:08,727 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:21:08,734 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:21:08,753 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2021-11-25 18:21:08,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:21:08,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-25 18:21:08,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:21:09,040 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:21:09,040 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:21:09,175 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:21:09,175 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228078546] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:21:09,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [671494324] [2021-11-25 18:21:09,176 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:21:09,176 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:21:09,176 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2021-11-25 18:21:09,176 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517624740] [2021-11-25 18:21:09,176 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:21:09,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-25 18:21:09,177 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:21:09,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-25 18:21:09,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2021-11-25 18:21:09,178 INFO L87 Difference]: Start difference. First operand 355 states and 1245 transitions. Second operand has 20 states, 20 states have (on average 2.55) internal successors, (51), 19 states have internal predecessors, (51), 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) [2021-11-25 18:21:09,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:21:09,539 INFO L93 Difference]: Finished difference Result 563 states and 1860 transitions. [2021-11-25 18:21:09,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-25 18:21:09,540 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.55) internal successors, (51), 19 states have internal predecessors, (51), 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) Word has length 25 [2021-11-25 18:21:09,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:21:09,545 INFO L225 Difference]: With dead ends: 563 [2021-11-25 18:21:09,545 INFO L226 Difference]: Without dead ends: 563 [2021-11-25 18:21:09,546 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=581, Unknown=0, NotChecked=0, Total=812 [2021-11-25 18:21:09,547 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 210 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 18:21:09,547 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [210 Valid, 36 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 18:21:09,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2021-11-25 18:21:09,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 359. [2021-11-25 18:21:09,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 358 states have (on average 3.516759776536313) internal successors, (1259), 358 states have internal predecessors, (1259), 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) [2021-11-25 18:21:09,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 1259 transitions. [2021-11-25 18:21:09,562 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 1259 transitions. Word has length 25 [2021-11-25 18:21:09,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:21:09,562 INFO L470 AbstractCegarLoop]: Abstraction has 359 states and 1259 transitions. [2021-11-25 18:21:09,563 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.55) internal successors, (51), 19 states have internal predecessors, (51), 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) [2021-11-25 18:21:09,563 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 1259 transitions. [2021-11-25 18:21:09,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-25 18:21:09,565 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:21:09,565 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:21:09,605 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2021-11-25 18:21:09,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-11-25 18:21:09,780 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 18:21:09,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:21:09,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1153703615, now seen corresponding path program 23 times [2021-11-25 18:21:09,780 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:21:09,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239778593] [2021-11-25 18:21:09,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:21:09,781 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:21:09,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:21:09,879 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:21:09,879 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:21:09,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239778593] [2021-11-25 18:21:09,879 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239778593] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:21:09,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235342139] [2021-11-25 18:21:09,880 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:21:09,880 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:21:09,880 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:21:09,881 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:21:09,904 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2021-11-25 18:21:10,040 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 18:21:10,041 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:21:10,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-25 18:21:10,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:21:10,204 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:21:10,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:21:10,323 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:21:10,323 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [235342139] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:21:10,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1361125436] [2021-11-25 18:21:10,323 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:21:10,323 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:21:10,324 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2021-11-25 18:21:10,324 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905000432] [2021-11-25 18:21:10,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:21:10,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-25 18:21:10,324 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:21:10,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-25 18:21:10,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2021-11-25 18:21:10,325 INFO L87 Difference]: Start difference. First operand 359 states and 1259 transitions. Second operand has 20 states, 20 states have (on average 2.55) internal successors, (51), 19 states have internal predecessors, (51), 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) [2021-11-25 18:21:10,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:21:10,632 INFO L93 Difference]: Finished difference Result 473 states and 1599 transitions. [2021-11-25 18:21:10,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-25 18:21:10,633 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.55) internal successors, (51), 19 states have internal predecessors, (51), 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) Word has length 25 [2021-11-25 18:21:10,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:21:10,636 INFO L225 Difference]: With dead ends: 473 [2021-11-25 18:21:10,636 INFO L226 Difference]: Without dead ends: 473 [2021-11-25 18:21:10,636 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2021-11-25 18:21:10,637 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 178 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 18:21:10,637 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [178 Valid, 39 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 18:21:10,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2021-11-25 18:21:10,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 359. [2021-11-25 18:21:10,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 358 states have (on average 3.516759776536313) internal successors, (1259), 358 states have internal predecessors, (1259), 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) [2021-11-25 18:21:10,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 1259 transitions. [2021-11-25 18:21:10,651 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 1259 transitions. Word has length 25 [2021-11-25 18:21:10,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:21:10,651 INFO L470 AbstractCegarLoop]: Abstraction has 359 states and 1259 transitions. [2021-11-25 18:21:10,651 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.55) internal successors, (51), 19 states have internal predecessors, (51), 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) [2021-11-25 18:21:10,651 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 1259 transitions. [2021-11-25 18:21:10,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-25 18:21:10,653 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:21:10,653 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:21:10,680 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2021-11-25 18:21:10,869 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-11-25 18:21:10,870 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 18:21:10,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:21:10,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1145016763, now seen corresponding path program 24 times [2021-11-25 18:21:10,870 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:21:10,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432884163] [2021-11-25 18:21:10,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:21:10,870 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:21:10,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:21:10,993 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:21:10,994 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:21:10,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432884163] [2021-11-25 18:21:10,995 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432884163] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:21:10,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079323787] [2021-11-25 18:21:10,995 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 18:21:10,995 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:21:10,996 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:21:10,996 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:21:10,997 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2021-11-25 18:21:11,095 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 18:21:11,095 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:21:11,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-25 18:21:11,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:21:11,211 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:21:11,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:21:11,305 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:21:11,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079323787] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:21:11,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1990353399] [2021-11-25 18:21:11,306 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:21:11,306 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:21:11,306 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2021-11-25 18:21:11,306 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882933385] [2021-11-25 18:21:11,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:21:11,307 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-25 18:21:11,307 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:21:11,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-25 18:21:11,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2021-11-25 18:21:11,308 INFO L87 Difference]: Start difference. First operand 359 states and 1259 transitions. Second operand has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 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) [2021-11-25 18:21:12,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:21:12,114 INFO L93 Difference]: Finished difference Result 533 states and 1800 transitions. [2021-11-25 18:21:12,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-11-25 18:21:12,115 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 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) Word has length 25 [2021-11-25 18:21:12,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:21:12,117 INFO L225 Difference]: With dead ends: 533 [2021-11-25 18:21:12,117 INFO L226 Difference]: Without dead ends: 533 [2021-11-25 18:21:12,117 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=391, Invalid=1249, Unknown=0, NotChecked=0, Total=1640 [2021-11-25 18:21:12,118 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 219 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-25 18:21:12,118 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [219 Valid, 59 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-25 18:21:12,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2021-11-25 18:21:12,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 371. [2021-11-25 18:21:12,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 370 states have (on average 3.5648648648648646) internal successors, (1319), 370 states have internal predecessors, (1319), 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) [2021-11-25 18:21:12,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1319 transitions. [2021-11-25 18:21:12,131 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1319 transitions. Word has length 25 [2021-11-25 18:21:12,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:21:12,132 INFO L470 AbstractCegarLoop]: Abstraction has 371 states and 1319 transitions. [2021-11-25 18:21:12,132 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 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) [2021-11-25 18:21:12,132 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1319 transitions. [2021-11-25 18:21:12,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-25 18:21:12,134 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:21:12,134 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:21:12,163 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2021-11-25 18:21:12,357 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-11-25 18:21:12,358 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 18:21:12,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:21:12,358 INFO L85 PathProgramCache]: Analyzing trace with hash 2000323417, now seen corresponding path program 25 times [2021-11-25 18:21:12,358 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:21:12,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676015831] [2021-11-25 18:21:12,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:21:12,359 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:21:12,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:21:12,476 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:21:12,476 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:21:12,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676015831] [2021-11-25 18:21:12,477 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676015831] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:21:12,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567621811] [2021-11-25 18:21:12,477 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 18:21:12,477 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:21:12,477 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:21:12,478 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:21:12,504 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2021-11-25 18:21:12,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:21:12,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-25 18:21:12,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:21:12,758 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:21:12,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:21:12,876 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:21:12,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1567621811] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:21:12,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2113005778] [2021-11-25 18:21:12,877 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:21:12,877 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:21:12,877 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2021-11-25 18:21:12,877 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512821483] [2021-11-25 18:21:12,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:21:12,878 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-25 18:21:12,878 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:21:12,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-25 18:21:12,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2021-11-25 18:21:12,879 INFO L87 Difference]: Start difference. First operand 371 states and 1319 transitions. Second operand has 21 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 20 states have internal predecessors, (40), 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) [2021-11-25 18:21:13,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:21:13,347 INFO L93 Difference]: Finished difference Result 547 states and 1833 transitions. [2021-11-25 18:21:13,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-25 18:21:13,347 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 20 states have internal predecessors, (40), 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) Word has length 25 [2021-11-25 18:21:13,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:21:13,350 INFO L225 Difference]: With dead ends: 547 [2021-11-25 18:21:13,350 INFO L226 Difference]: Without dead ends: 547 [2021-11-25 18:21:13,351 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=254, Invalid=676, Unknown=0, NotChecked=0, Total=930 [2021-11-25 18:21:13,352 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 238 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 18:21:13,352 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [238 Valid, 46 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 18:21:13,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2021-11-25 18:21:13,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 371. [2021-11-25 18:21:13,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 370 states have (on average 3.545945945945946) internal successors, (1312), 370 states have internal predecessors, (1312), 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) [2021-11-25 18:21:13,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1312 transitions. [2021-11-25 18:21:13,368 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1312 transitions. Word has length 25 [2021-11-25 18:21:13,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:21:13,368 INFO L470 AbstractCegarLoop]: Abstraction has 371 states and 1312 transitions. [2021-11-25 18:21:13,369 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 20 states have internal predecessors, (40), 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) [2021-11-25 18:21:13,369 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1312 transitions. [2021-11-25 18:21:13,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-25 18:21:13,371 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:21:13,371 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:21:13,405 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2021-11-25 18:21:13,585 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:21:13,586 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 18:21:13,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:21:13,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1878787455, now seen corresponding path program 26 times [2021-11-25 18:21:13,586 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:21:13,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523820548] [2021-11-25 18:21:13,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:21:13,586 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:21:13,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:21:13,670 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:21:13,671 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:21:13,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523820548] [2021-11-25 18:21:13,671 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523820548] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:21:13,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197503281] [2021-11-25 18:21:13,671 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:21:13,671 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:21:13,672 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:21:13,678 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:21:13,694 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2021-11-25 18:21:13,830 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 18:21:13,830 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:21:13,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-25 18:21:13,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:21:13,972 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:21:13,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:21:14,090 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:21:14,091 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197503281] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:21:14,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [98244355] [2021-11-25 18:21:14,091 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:21:14,091 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:21:14,092 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2021-11-25 18:21:14,092 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931347372] [2021-11-25 18:21:14,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:21:14,092 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-25 18:21:14,092 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:21:14,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-25 18:21:14,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2021-11-25 18:21:14,093 INFO L87 Difference]: Start difference. First operand 371 states and 1312 transitions. Second operand has 20 states, 20 states have (on average 1.95) internal successors, (39), 19 states have internal predecessors, (39), 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) [2021-11-25 18:21:14,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:21:14,435 INFO L93 Difference]: Finished difference Result 413 states and 1411 transitions. [2021-11-25 18:21:14,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-25 18:21:14,436 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.95) internal successors, (39), 19 states have internal predecessors, (39), 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) Word has length 25 [2021-11-25 18:21:14,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:21:14,437 INFO L225 Difference]: With dead ends: 413 [2021-11-25 18:21:14,437 INFO L226 Difference]: Without dead ends: 413 [2021-11-25 18:21:14,438 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=158, Invalid=442, Unknown=0, NotChecked=0, Total=600 [2021-11-25 18:21:14,438 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 149 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-25 18:21:14,439 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 48 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-25 18:21:14,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2021-11-25 18:21:14,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 361. [2021-11-25 18:21:14,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 360 states have (on average 3.522222222222222) internal successors, (1268), 360 states have internal predecessors, (1268), 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) [2021-11-25 18:21:14,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 1268 transitions. [2021-11-25 18:21:14,451 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 1268 transitions. Word has length 25 [2021-11-25 18:21:14,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:21:14,452 INFO L470 AbstractCegarLoop]: Abstraction has 361 states and 1268 transitions. [2021-11-25 18:21:14,452 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.95) internal successors, (39), 19 states have internal predecessors, (39), 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) [2021-11-25 18:21:14,452 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 1268 transitions. [2021-11-25 18:21:14,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-25 18:21:14,454 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:21:14,454 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:21:14,491 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2021-11-25 18:21:14,681 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2021-11-25 18:21:14,682 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 18:21:14,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:21:14,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1491745607, now seen corresponding path program 27 times [2021-11-25 18:21:14,682 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:21:14,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234560122] [2021-11-25 18:21:14,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:21:14,682 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:21:14,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:21:14,757 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:21:14,757 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:21:14,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234560122] [2021-11-25 18:21:14,758 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234560122] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:21:14,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380743350] [2021-11-25 18:21:14,758 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 18:21:14,758 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:21:14,758 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:21:14,759 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:21:14,788 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2021-11-25 18:21:14,900 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 18:21:14,900 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:21:14,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-25 18:21:14,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:21:15,019 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:21:15,020 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:21:15,141 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:21:15,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380743350] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:21:15,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [396632439] [2021-11-25 18:21:15,142 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:21:15,142 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:21:15,142 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 19 [2021-11-25 18:21:15,142 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409313299] [2021-11-25 18:21:15,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:21:15,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-25 18:21:15,143 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:21:15,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-25 18:21:15,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2021-11-25 18:21:15,143 INFO L87 Difference]: Start difference. First operand 361 states and 1268 transitions. Second operand has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 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) [2021-11-25 18:21:16,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:21:16,238 INFO L93 Difference]: Finished difference Result 709 states and 2368 transitions. [2021-11-25 18:21:16,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-11-25 18:21:16,238 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 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) Word has length 25 [2021-11-25 18:21:16,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:21:16,240 INFO L225 Difference]: With dead ends: 709 [2021-11-25 18:21:16,241 INFO L226 Difference]: Without dead ends: 709 [2021-11-25 18:21:16,242 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 586 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=701, Invalid=1951, Unknown=0, NotChecked=0, Total=2652 [2021-11-25 18:21:16,242 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 254 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 860 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-25 18:21:16,242 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [254 Valid, 72 Invalid, 894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 860 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-25 18:21:16,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2021-11-25 18:21:16,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 379. [2021-11-25 18:21:16,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 378 states have (on average 3.582010582010582) internal successors, (1354), 378 states have internal predecessors, (1354), 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) [2021-11-25 18:21:16,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1354 transitions. [2021-11-25 18:21:16,254 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1354 transitions. Word has length 25 [2021-11-25 18:21:16,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:21:16,254 INFO L470 AbstractCegarLoop]: Abstraction has 379 states and 1354 transitions. [2021-11-25 18:21:16,254 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 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) [2021-11-25 18:21:16,255 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1354 transitions. [2021-11-25 18:21:16,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-25 18:21:16,256 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:21:16,256 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:21:16,315 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2021-11-25 18:21:16,481 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:21:16,482 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 18:21:16,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:21:16,482 INFO L85 PathProgramCache]: Analyzing trace with hash -636438953, now seen corresponding path program 28 times [2021-11-25 18:21:16,482 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:21:16,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505457478] [2021-11-25 18:21:16,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:21:16,482 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:21:16,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:21:16,573 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:21:16,573 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:21:16,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505457478] [2021-11-25 18:21:16,574 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505457478] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:21:16,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196665199] [2021-11-25 18:21:16,574 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 18:21:16,574 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:21:16,575 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:21:16,578 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:21:16,581 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2021-11-25 18:21:16,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:21:16,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-25 18:21:16,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:21:16,819 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:21:16,820 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:21:16,926 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:21:16,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196665199] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:21:16,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1370770966] [2021-11-25 18:21:16,927 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:21:16,928 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:21:16,928 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2021-11-25 18:21:16,928 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708376950] [2021-11-25 18:21:16,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:21:16,929 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-25 18:21:16,929 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:21:16,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-25 18:21:16,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2021-11-25 18:21:16,930 INFO L87 Difference]: Start difference. First operand 379 states and 1354 transitions. Second operand has 21 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 20 states have internal predecessors, (40), 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) [2021-11-25 18:21:17,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:21:17,528 INFO L93 Difference]: Finished difference Result 695 states and 2337 transitions. [2021-11-25 18:21:17,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-25 18:21:17,529 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 20 states have internal predecessors, (40), 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) Word has length 25 [2021-11-25 18:21:17,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:21:17,530 INFO L225 Difference]: With dead ends: 695 [2021-11-25 18:21:17,531 INFO L226 Difference]: Without dead ends: 695 [2021-11-25 18:21:17,531 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=368, Invalid=822, Unknown=0, NotChecked=0, Total=1190 [2021-11-25 18:21:17,532 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 250 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-25 18:21:17,533 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [250 Valid, 65 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-25 18:21:17,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2021-11-25 18:21:17,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 373. [2021-11-25 18:21:17,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 372 states have (on average 3.5510752688172045) internal successors, (1321), 372 states have internal predecessors, (1321), 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) [2021-11-25 18:21:17,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1321 transitions. [2021-11-25 18:21:17,544 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1321 transitions. Word has length 25 [2021-11-25 18:21:17,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:21:17,544 INFO L470 AbstractCegarLoop]: Abstraction has 373 states and 1321 transitions. [2021-11-25 18:21:17,544 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 20 states have internal predecessors, (40), 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) [2021-11-25 18:21:17,544 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1321 transitions. [2021-11-25 18:21:17,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-25 18:21:17,545 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:21:17,545 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:21:17,565 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2021-11-25 18:21:17,746 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2021-11-25 18:21:17,746 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 18:21:17,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:21:17,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1750304257, now seen corresponding path program 29 times [2021-11-25 18:21:17,746 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:21:17,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779488861] [2021-11-25 18:21:17,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:21:17,747 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:21:17,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:21:17,833 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:21:17,834 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:21:17,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779488861] [2021-11-25 18:21:17,834 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779488861] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:21:17,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436535458] [2021-11-25 18:21:17,834 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:21:17,834 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:21:17,835 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:21:17,835 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:21:17,856 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2021-11-25 18:21:17,976 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 18:21:17,976 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:21:17,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-25 18:21:17,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:21:18,084 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:21:18,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:21:18,212 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:21:18,213 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436535458] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:21:18,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [61130150] [2021-11-25 18:21:18,213 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:21:18,213 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:21:18,214 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2021-11-25 18:21:18,214 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047788346] [2021-11-25 18:21:18,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:21:18,214 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-25 18:21:18,214 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:21:18,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-25 18:21:18,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2021-11-25 18:21:18,215 INFO L87 Difference]: Start difference. First operand 373 states and 1321 transitions. Second operand has 20 states, 20 states have (on average 2.05) internal successors, (41), 19 states have internal predecessors, (41), 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) [2021-11-25 18:21:18,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:21:18,451 INFO L93 Difference]: Finished difference Result 471 states and 1597 transitions. [2021-11-25 18:21:18,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-25 18:21:18,451 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.05) internal successors, (41), 19 states have internal predecessors, (41), 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) Word has length 25 [2021-11-25 18:21:18,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:21:18,453 INFO L225 Difference]: With dead ends: 471 [2021-11-25 18:21:18,453 INFO L226 Difference]: Without dead ends: 471 [2021-11-25 18:21:18,453 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=443, Unknown=0, NotChecked=0, Total=600 [2021-11-25 18:21:18,454 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 161 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 18:21:18,454 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 36 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 18:21:18,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2021-11-25 18:21:18,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 385. [2021-11-25 18:21:18,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 384 states have (on average 3.515625) internal successors, (1350), 384 states have internal predecessors, (1350), 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) [2021-11-25 18:21:18,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1350 transitions. [2021-11-25 18:21:18,464 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1350 transitions. Word has length 25 [2021-11-25 18:21:18,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:21:18,464 INFO L470 AbstractCegarLoop]: Abstraction has 385 states and 1350 transitions. [2021-11-25 18:21:18,464 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.05) internal successors, (41), 19 states have internal predecessors, (41), 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) [2021-11-25 18:21:18,464 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1350 transitions. [2021-11-25 18:21:18,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-25 18:21:18,466 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:21:18,466 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:21:18,491 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2021-11-25 18:21:18,670 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2021-11-25 18:21:18,671 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 18:21:18,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:21:18,671 INFO L85 PathProgramCache]: Analyzing trace with hash -595372835, now seen corresponding path program 30 times [2021-11-25 18:21:18,671 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:21:18,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465518530] [2021-11-25 18:21:18,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:21:18,671 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:21:18,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:21:19,841 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:21:19,841 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:21:19,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465518530] [2021-11-25 18:21:19,841 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465518530] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:21:19,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026074228] [2021-11-25 18:21:19,841 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 18:21:19,842 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:21:19,842 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:21:19,842 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:21:19,843 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2021-11-25 18:21:19,971 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 18:21:19,971 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:21:19,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 50 conjunts are in the unsatisfiable core [2021-11-25 18:21:19,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:21:20,084 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-25 18:21:20,137 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 18:21:20,206 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 18:21:20,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:21:20,619 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 84 [2021-11-25 18:21:21,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:21:21,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:21:21,072 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:21:21,072 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 159 treesize of output 105 [2021-11-25 18:21:22,039 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:21:22,040 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:21:23,930 WARN L838 $PredicateComparison]: unable to prove that (or (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~A~0.offset)))) (and (or (<= .cse0 c_~max1~0) (and (forall ((v_ArrVal_1576 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1576) c_~A~0.base)) (.cse5 (* c_~M~0 4))) (or (let ((.cse2 (select (select |c_#memory_int| c_~A~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~A~0.offset)))) (let ((.cse3 (= c_~max2~0 .cse2)) (.cse1 (select .cse4 (+ c_~A~0.offset .cse5 4)))) (and (or (<= .cse1 c_~max3~0) (and (or (<= .cse1 c_~max2~0) (= .cse1 .cse2)) (or .cse3 (< c_~max2~0 .cse1)))) (or (and (or .cse3 (< c_~max2~0 c_~max3~0)) (or (<= c_~max3~0 c_~max2~0) (= c_~max3~0 .cse2))) (< c_~max3~0 .cse1))))) (< c_~max3~0 (select .cse4 (+ c_~A~0.offset .cse5)))))) (forall ((v_ArrVal_1576 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1576) c_~A~0.base)) (.cse11 (* c_~M~0 4))) (let ((.cse7 (select .cse10 (+ c_~A~0.offset .cse11)))) (or (let ((.cse8 (select (select |c_#memory_int| c_~A~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~A~0.offset)))) (let ((.cse9 (= c_~max2~0 .cse8)) (.cse6 (select .cse10 (+ c_~A~0.offset .cse11 4)))) (and (or (<= .cse6 .cse7) (and (or (<= .cse6 c_~max2~0) (= .cse6 .cse8)) (or .cse9 (< c_~max2~0 .cse6)))) (or (and (or .cse9 (< c_~max2~0 .cse7)) (or (= .cse7 .cse8) (<= .cse7 c_~max2~0))) (< .cse7 .cse6))))) (<= .cse7 c_~max3~0))))))) (or (< c_~max1~0 .cse0) (and (forall ((v_ArrVal_1576 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1576) c_~A~0.base)) (.cse15 (* c_~M~0 4))) (or (let ((.cse12 (= c_~max2~0 c_~max1~0)) (.cse13 (select .cse14 (+ c_~A~0.offset .cse15 4)))) (and (or (and (or (= c_~max3~0 c_~max1~0) (<= c_~max3~0 c_~max2~0)) (or (< c_~max2~0 c_~max3~0) .cse12)) (< c_~max3~0 .cse13)) (or (<= .cse13 c_~max3~0) (and (or (< c_~max2~0 .cse13) .cse12) (or (= c_~max1~0 .cse13) (<= .cse13 c_~max2~0)))))) (< c_~max3~0 (select .cse14 (+ c_~A~0.offset .cse15)))))) (forall ((v_ArrVal_1576 (Array Int Int))) (let ((.cse19 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1576) c_~A~0.base)) (.cse20 (* c_~M~0 4))) (let ((.cse17 (select .cse19 (+ c_~A~0.offset .cse20)))) (or (let ((.cse18 (= c_~max2~0 c_~max1~0)) (.cse16 (select .cse19 (+ c_~A~0.offset .cse20 4)))) (and (or (<= .cse16 .cse17) (and (or (< c_~max2~0 .cse16) .cse18) (or (= c_~max1~0 .cse16) (<= .cse16 c_~max2~0)))) (or (and (or (< c_~max2~0 .cse17) .cse18) (or (= .cse17 c_~max1~0) (<= .cse17 c_~max2~0))) (< .cse17 .cse16)))) (<= .cse17 c_~max3~0))))))))) (<= (+ 2 c_~M~0) c_thread1Thread1of1ForFork2_~i~0)) is different from false [2021-11-25 18:21:25,092 WARN L838 $PredicateComparison]: unable to prove that (or (<= (+ c_~M~0 1) c_thread1Thread1of1ForFork2_~i~0) (let ((.cse23 (select |c_#memory_int| c_~A~0.base)) (.cse24 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse0 (and (forall ((v_ArrVal_1576 (Array Int Int))) (let ((.cse29 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1576) c_~A~0.base)) (.cse30 (* c_~M~0 4))) (let ((.cse25 (select .cse29 (+ c_~A~0.offset .cse30)))) (or (let ((.cse27 (select (select |c_#memory_int| c_~A~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~A~0.offset 4)))) (let ((.cse26 (= c_~max2~0 .cse27)) (.cse28 (select .cse29 (+ c_~A~0.offset .cse30 4)))) (and (or (and (or (< c_~max2~0 .cse25) .cse26) (or (<= .cse25 c_~max2~0) (= .cse25 .cse27))) (< .cse25 .cse28)) (or (<= .cse28 .cse25) (and (or (< c_~max2~0 .cse28) .cse26) (or (<= .cse28 c_~max2~0) (= .cse28 .cse27))))))) (<= .cse25 c_~max3~0))))) (forall ((v_ArrVal_1576 (Array Int Int))) (let ((.cse31 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1576) c_~A~0.base)) (.cse32 (* c_~M~0 4))) (or (< c_~max3~0 (select .cse31 (+ c_~A~0.offset .cse32))) (let ((.cse34 (select (select |c_#memory_int| c_~A~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~A~0.offset 4)))) (let ((.cse33 (= c_~max2~0 .cse34)) (.cse35 (select .cse31 (+ c_~A~0.offset .cse32 4)))) (and (or (and (or (< c_~max2~0 c_~max3~0) .cse33) (or (<= c_~max3~0 c_~max2~0) (= c_~max3~0 .cse34))) (< c_~max3~0 .cse35)) (or (<= .cse35 c_~max3~0) (and (or (< c_~max2~0 .cse35) .cse33) (or (<= .cse35 c_~max2~0) (= .cse35 .cse34)))))))))))) (.cse11 (select .cse23 (+ .cse24 c_~A~0.offset))) (.cse1 (select .cse23 (+ .cse24 c_~A~0.offset 4)))) (and (or (and (or .cse0 (<= .cse1 c_~max1~0)) (or (< c_~max1~0 .cse1) (and (forall ((v_ArrVal_1576 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1576) c_~A~0.base)) (.cse5 (* c_~M~0 4))) (or (let ((.cse2 (= c_~max2~0 c_~max1~0)) (.cse3 (select .cse4 (+ c_~A~0.offset .cse5 4)))) (and (or (and (or (= c_~max3~0 c_~max1~0) (<= c_~max3~0 c_~max2~0)) (or (< c_~max2~0 c_~max3~0) .cse2)) (< c_~max3~0 .cse3)) (or (<= .cse3 c_~max3~0) (and (or (< c_~max2~0 .cse3) .cse2) (or (= c_~max1~0 .cse3) (<= .cse3 c_~max2~0)))))) (< c_~max3~0 (select .cse4 (+ c_~A~0.offset .cse5)))))) (forall ((v_ArrVal_1576 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1576) c_~A~0.base)) (.cse10 (* c_~M~0 4))) (let ((.cse7 (select .cse9 (+ c_~A~0.offset .cse10)))) (or (let ((.cse8 (= c_~max2~0 c_~max1~0)) (.cse6 (select .cse9 (+ c_~A~0.offset .cse10 4)))) (and (or (<= .cse6 .cse7) (and (or (< c_~max2~0 .cse6) .cse8) (or (= c_~max1~0 .cse6) (<= .cse6 c_~max2~0)))) (or (and (or (< c_~max2~0 .cse7) .cse8) (or (= .cse7 c_~max1~0) (<= .cse7 c_~max2~0))) (< .cse7 .cse6)))) (<= .cse7 c_~max3~0)))))))) (< c_~max1~0 .cse11)) (or (<= .cse11 c_~max1~0) (and (or (<= .cse1 .cse11) .cse0) (or (< .cse11 .cse1) (and (forall ((v_ArrVal_1576 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1576) c_~A~0.base)) (.cse16 (* c_~M~0 4))) (or (let ((.cse13 (select (select |c_#memory_int| c_~A~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~A~0.offset)))) (let ((.cse14 (= c_~max2~0 .cse13)) (.cse12 (select .cse15 (+ c_~A~0.offset .cse16 4)))) (and (or (<= .cse12 c_~max3~0) (and (or (<= .cse12 c_~max2~0) (= .cse12 .cse13)) (or .cse14 (< c_~max2~0 .cse12)))) (or (and (or .cse14 (< c_~max2~0 c_~max3~0)) (or (<= c_~max3~0 c_~max2~0) (= c_~max3~0 .cse13))) (< c_~max3~0 .cse12))))) (< c_~max3~0 (select .cse15 (+ c_~A~0.offset .cse16)))))) (forall ((v_ArrVal_1576 (Array Int Int))) (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1576) c_~A~0.base)) (.cse22 (* c_~M~0 4))) (let ((.cse18 (select .cse21 (+ c_~A~0.offset .cse22)))) (or (let ((.cse19 (select (select |c_#memory_int| c_~A~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~A~0.offset)))) (let ((.cse20 (= c_~max2~0 .cse19)) (.cse17 (select .cse21 (+ c_~A~0.offset .cse22 4)))) (and (or (<= .cse17 .cse18) (and (or (<= .cse17 c_~max2~0) (= .cse17 .cse19)) (or .cse20 (< c_~max2~0 .cse17)))) (or (and (or .cse20 (< c_~max2~0 .cse18)) (or (= .cse18 .cse19) (<= .cse18 c_~max2~0))) (< .cse18 .cse17))))) (<= .cse18 c_~max3~0))))))))))))) is different from false [2021-11-25 18:21:26,115 WARN L838 $PredicateComparison]: unable to prove that (or (<= (+ c_~M~0 1) 0) (let ((.cse23 (select |c_#memory_int| c_~A~0.base))) (let ((.cse2 (select .cse23 c_~A~0.offset)) (.cse0 (and (forall ((v_ArrVal_1576 (Array Int Int))) (let ((.cse24 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1576) c_~A~0.base)) (.cse25 (* c_~M~0 4))) (or (< c_~max3~0 (select .cse24 (+ c_~A~0.offset .cse25))) (let ((.cse28 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset 4)))) (let ((.cse27 (= c_~max2~0 .cse28)) (.cse26 (select .cse24 (+ c_~A~0.offset .cse25 4)))) (and (or (<= .cse26 c_~max3~0) (and (or .cse27 (< c_~max2~0 .cse26)) (or (<= .cse26 c_~max2~0) (= .cse26 .cse28)))) (or (and (or (= c_~max3~0 .cse28) (<= c_~max3~0 c_~max2~0)) (or .cse27 (< c_~max2~0 c_~max3~0))) (< c_~max3~0 .cse26)))))))) (forall ((v_ArrVal_1576 (Array Int Int))) (let ((.cse33 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1576) c_~A~0.base)) (.cse34 (* c_~M~0 4))) (let ((.cse30 (select .cse33 (+ c_~A~0.offset .cse34)))) (or (let ((.cse31 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset 4)))) (let ((.cse29 (= c_~max2~0 .cse31)) (.cse32 (select .cse33 (+ c_~A~0.offset .cse34 4)))) (and (or (and (or .cse29 (< c_~max2~0 .cse30)) (or (<= .cse30 c_~max2~0) (= .cse30 .cse31))) (< .cse30 .cse32)) (or (<= .cse32 .cse30) (and (or .cse29 (< c_~max2~0 .cse32)) (or (<= .cse32 c_~max2~0) (= .cse32 .cse31))))))) (<= .cse30 c_~max3~0))))))) (.cse1 (select .cse23 (+ c_~A~0.offset 4)))) (and (or (and (or .cse0 (<= .cse1 .cse2)) (or (and (forall ((v_ArrVal_1576 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1576) c_~A~0.base)) (.cse8 (* c_~M~0 4))) (let ((.cse3 (select .cse7 (+ c_~A~0.offset .cse8)))) (or (let ((.cse5 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (let ((.cse4 (= c_~max2~0 .cse5)) (.cse6 (select .cse7 (+ c_~A~0.offset .cse8 4)))) (and (or (and (or (< c_~max2~0 .cse3) .cse4) (or (<= .cse3 c_~max2~0) (= .cse3 .cse5))) (< .cse3 .cse6)) (or (and (or (<= .cse6 c_~max2~0) (= .cse5 .cse6)) (or (< c_~max2~0 .cse6) .cse4)) (<= .cse6 .cse3))))) (<= .cse3 c_~max3~0))))) (forall ((v_ArrVal_1576 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1576) c_~A~0.base)) (.cse10 (* c_~M~0 4))) (or (< c_~max3~0 (select .cse9 (+ c_~A~0.offset .cse10))) (let ((.cse12 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (let ((.cse13 (= c_~max2~0 .cse12)) (.cse11 (select .cse9 (+ c_~A~0.offset .cse10 4)))) (and (or (and (or (<= .cse11 c_~max2~0) (= .cse12 .cse11)) (or (< c_~max2~0 .cse11) .cse13)) (<= .cse11 c_~max3~0)) (or (and (or (< c_~max2~0 c_~max3~0) .cse13) (or (= c_~max3~0 .cse12) (<= c_~max3~0 c_~max2~0))) (< c_~max3~0 .cse11))))))))) (< .cse2 .cse1))) (<= .cse2 c_~max1~0)) (or (< c_~max1~0 .cse2) (and (or (< c_~max1~0 .cse1) (and (forall ((v_ArrVal_1576 (Array Int Int))) (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1576) c_~A~0.base)) (.cse17 (* c_~M~0 4))) (or (let ((.cse14 (= c_~max2~0 c_~max1~0)) (.cse15 (select .cse16 (+ c_~A~0.offset .cse17 4)))) (and (or (and (or (= c_~max3~0 c_~max1~0) (<= c_~max3~0 c_~max2~0)) (or (< c_~max2~0 c_~max3~0) .cse14)) (< c_~max3~0 .cse15)) (or (<= .cse15 c_~max3~0) (and (or (< c_~max2~0 .cse15) .cse14) (or (= c_~max1~0 .cse15) (<= .cse15 c_~max2~0)))))) (< c_~max3~0 (select .cse16 (+ c_~A~0.offset .cse17)))))) (forall ((v_ArrVal_1576 (Array Int Int))) (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1576) c_~A~0.base)) (.cse22 (* c_~M~0 4))) (let ((.cse19 (select .cse21 (+ c_~A~0.offset .cse22)))) (or (let ((.cse20 (= c_~max2~0 c_~max1~0)) (.cse18 (select .cse21 (+ c_~A~0.offset .cse22 4)))) (and (or (<= .cse18 .cse19) (and (or (< c_~max2~0 .cse18) .cse20) (or (= c_~max1~0 .cse18) (<= .cse18 c_~max2~0)))) (or (and (or (< c_~max2~0 .cse19) .cse20) (or (= .cse19 c_~max1~0) (<= .cse19 c_~max2~0))) (< .cse19 .cse18)))) (<= .cse19 c_~max3~0))))))) (or .cse0 (<= .cse1 c_~max1~0)))))))) is different from false [2021-11-25 18:21:40,206 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (<= (+ ~M~0 1) 0) (let ((.cse23 (select |c_#memory_int| c_~A~0.base))) (let ((.cse2 (select .cse23 c_~A~0.offset)) (.cse0 (and (forall ((v_ArrVal_1576 (Array Int Int))) (let ((.cse24 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1576) c_~A~0.base)) (.cse25 (* ~M~0 4))) (or (< c_~max3~0 (select .cse24 (+ c_~A~0.offset .cse25))) (let ((.cse28 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset 4)))) (let ((.cse27 (= c_~max2~0 .cse28)) (.cse26 (select .cse24 (+ c_~A~0.offset .cse25 4)))) (and (or (<= .cse26 c_~max3~0) (and (or .cse27 (< c_~max2~0 .cse26)) (or (<= .cse26 c_~max2~0) (= .cse26 .cse28)))) (or (and (or (= c_~max3~0 .cse28) (<= c_~max3~0 c_~max2~0)) (or .cse27 (< c_~max2~0 c_~max3~0))) (< c_~max3~0 .cse26)))))))) (forall ((v_ArrVal_1576 (Array Int Int))) (let ((.cse33 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1576) c_~A~0.base)) (.cse34 (* ~M~0 4))) (let ((.cse30 (select .cse33 (+ c_~A~0.offset .cse34)))) (or (let ((.cse31 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset 4)))) (let ((.cse29 (= c_~max2~0 .cse31)) (.cse32 (select .cse33 (+ c_~A~0.offset .cse34 4)))) (and (or (and (or .cse29 (< c_~max2~0 .cse30)) (or (<= .cse30 c_~max2~0) (= .cse30 .cse31))) (< .cse30 .cse32)) (or (<= .cse32 .cse30) (and (or .cse29 (< c_~max2~0 .cse32)) (or (<= .cse32 c_~max2~0) (= .cse32 .cse31))))))) (<= .cse30 c_~max3~0))))))) (.cse1 (select .cse23 (+ c_~A~0.offset 4)))) (and (or (and (or .cse0 (<= .cse1 .cse2)) (or (and (forall ((v_ArrVal_1576 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1576) c_~A~0.base)) (.cse8 (* ~M~0 4))) (let ((.cse3 (select .cse7 (+ c_~A~0.offset .cse8)))) (or (let ((.cse5 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (let ((.cse4 (= c_~max2~0 .cse5)) (.cse6 (select .cse7 (+ c_~A~0.offset .cse8 4)))) (and (or (and (or (< c_~max2~0 .cse3) .cse4) (or (<= .cse3 c_~max2~0) (= .cse3 .cse5))) (< .cse3 .cse6)) (or (and (or (<= .cse6 c_~max2~0) (= .cse5 .cse6)) (or (< c_~max2~0 .cse6) .cse4)) (<= .cse6 .cse3))))) (<= .cse3 c_~max3~0))))) (forall ((v_ArrVal_1576 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1576) c_~A~0.base)) (.cse10 (* ~M~0 4))) (or (< c_~max3~0 (select .cse9 (+ c_~A~0.offset .cse10))) (let ((.cse12 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (let ((.cse13 (= c_~max2~0 .cse12)) (.cse11 (select .cse9 (+ c_~A~0.offset .cse10 4)))) (and (or (and (or (<= .cse11 c_~max2~0) (= .cse12 .cse11)) (or (< c_~max2~0 .cse11) .cse13)) (<= .cse11 c_~max3~0)) (or (and (or (< c_~max2~0 c_~max3~0) .cse13) (or (= c_~max3~0 .cse12) (<= c_~max3~0 c_~max2~0))) (< c_~max3~0 .cse11))))))))) (< .cse2 .cse1))) (<= .cse2 c_~max1~0)) (or (< c_~max1~0 .cse2) (and (or (< c_~max1~0 .cse1) (and (forall ((v_ArrVal_1576 (Array Int Int))) (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1576) c_~A~0.base)) (.cse17 (* ~M~0 4))) (or (let ((.cse14 (= c_~max2~0 c_~max1~0)) (.cse15 (select .cse16 (+ c_~A~0.offset .cse17 4)))) (and (or (and (or (= c_~max3~0 c_~max1~0) (<= c_~max3~0 c_~max2~0)) (or (< c_~max2~0 c_~max3~0) .cse14)) (< c_~max3~0 .cse15)) (or (<= .cse15 c_~max3~0) (and (or (< c_~max2~0 .cse15) .cse14) (or (= c_~max1~0 .cse15) (<= .cse15 c_~max2~0)))))) (< c_~max3~0 (select .cse16 (+ c_~A~0.offset .cse17)))))) (forall ((v_ArrVal_1576 (Array Int Int))) (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1576) c_~A~0.base)) (.cse22 (* ~M~0 4))) (let ((.cse19 (select .cse21 (+ c_~A~0.offset .cse22)))) (or (let ((.cse20 (= c_~max2~0 c_~max1~0)) (.cse18 (select .cse21 (+ c_~A~0.offset .cse22 4)))) (and (or (<= .cse18 .cse19) (and (or (< c_~max2~0 .cse18) .cse20) (or (= c_~max1~0 .cse18) (<= .cse18 c_~max2~0)))) (or (and (or (< c_~max2~0 .cse19) .cse20) (or (= .cse19 c_~max1~0) (<= .cse19 c_~max2~0))) (< .cse19 .cse18)))) (<= .cse19 c_~max3~0))))))) (or .cse0 (<= .cse1 c_~max1~0))))))) (< 0 ~M~0))) is different from false [2021-11-25 18:22:41,530 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (<= (+ ~M~0 1) 0) (< 0 ~M~0) (and (forall ((v_ArrVal_1575 (Array Int Int))) (let ((.cse23 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1575) c_~A~0.base))) (or (let ((.cse0 (select .cse23 (+ c_~A~0.offset 4)))) (and (or (<= .cse0 c_~max1~0) (and (forall ((v_ArrVal_1576 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1575))) (let ((.cse5 (select (store .cse7 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1576) c_~A~0.base)) (.cse6 (* ~M~0 4))) (let ((.cse1 (select .cse5 (+ c_~A~0.offset .cse6)))) (or (<= .cse1 c_~max3~0) (let ((.cse3 (select (select .cse7 c_~A~0.base) (+ c_~A~0.offset 4)))) (let ((.cse2 (= c_~max2~0 .cse3)) (.cse4 (select .cse5 (+ c_~A~0.offset .cse6 4)))) (and (or (and (or (< c_~max2~0 .cse1) .cse2) (or (<= .cse1 c_~max2~0) (= .cse3 .cse1))) (< .cse1 .cse4)) (or (and (or (< c_~max2~0 .cse4) .cse2) (or (<= .cse4 c_~max2~0) (= .cse4 .cse3))) (<= .cse4 .cse1)))))))))) (forall ((v_ArrVal_1576 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1575))) (let ((.cse11 (select (store .cse13 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1576) c_~A~0.base)) (.cse12 (* ~M~0 4))) (or (let ((.cse10 (select (select .cse13 c_~A~0.base) (+ c_~A~0.offset 4)))) (let ((.cse9 (= c_~max2~0 .cse10)) (.cse8 (select .cse11 (+ c_~A~0.offset .cse12 4)))) (and (or (< c_~max3~0 .cse8) (and (or (< c_~max2~0 c_~max3~0) .cse9) (or (= c_~max3~0 .cse10) (<= c_~max3~0 c_~max2~0)))) (or (and (or (< c_~max2~0 .cse8) .cse9) (or (<= .cse8 c_~max2~0) (= .cse8 .cse10))) (<= .cse8 c_~max3~0))))) (< c_~max3~0 (select .cse11 (+ c_~A~0.offset .cse12))))))))) (or (< c_~max1~0 .cse0) (and (forall ((v_ArrVal_1576 (Array Int Int))) (let ((.cse16 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1575) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1576) c_~A~0.base)) (.cse17 (* ~M~0 4))) (or (let ((.cse15 (= c_~max2~0 c_~max1~0)) (.cse14 (select .cse16 (+ c_~A~0.offset .cse17 4)))) (and (or (< c_~max3~0 .cse14) (and (or (= c_~max3~0 c_~max1~0) (<= c_~max3~0 c_~max2~0)) (or (< c_~max2~0 c_~max3~0) .cse15))) (or (<= .cse14 c_~max3~0) (and (or (< c_~max2~0 .cse14) .cse15) (or (= .cse14 c_~max1~0) (<= .cse14 c_~max2~0)))))) (< c_~max3~0 (select .cse16 (+ c_~A~0.offset .cse17)))))) (forall ((v_ArrVal_1576 (Array Int Int))) (let ((.cse21 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1575) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1576) c_~A~0.base)) (.cse22 (* ~M~0 4))) (let ((.cse20 (select .cse21 (+ c_~A~0.offset .cse22)))) (or (let ((.cse19 (= c_~max2~0 c_~max1~0)) (.cse18 (select .cse21 (+ c_~A~0.offset .cse22 4)))) (and (or (and (or (< c_~max2~0 .cse18) .cse19) (or (= .cse18 c_~max1~0) (<= .cse18 c_~max2~0))) (<= .cse18 .cse20)) (or (and (or (< c_~max2~0 .cse20) .cse19) (or (<= .cse20 c_~max2~0) (= c_~max1~0 .cse20))) (< .cse20 .cse18)))) (<= .cse20 c_~max3~0))))))))) (< c_~max1~0 (select .cse23 c_~A~0.offset))))) (forall ((v_ArrVal_1575 (Array Int Int))) (let ((.cse52 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1575) c_~A~0.base))) (let ((.cse25 (select .cse52 c_~A~0.offset))) (or (let ((.cse24 (select .cse52 (+ c_~A~0.offset 4)))) (and (or (<= .cse24 .cse25) (and (forall ((v_ArrVal_1576 (Array Int Int))) (let ((.cse32 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1575))) (let ((.cse30 (select (store .cse32 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1576) c_~A~0.base)) (.cse31 (* ~M~0 4))) (let ((.cse26 (select .cse30 (+ c_~A~0.offset .cse31)))) (or (<= .cse26 c_~max3~0) (let ((.cse28 (select (select .cse32 c_~A~0.base) (+ c_~A~0.offset 4)))) (let ((.cse27 (= c_~max2~0 .cse28)) (.cse29 (select .cse30 (+ c_~A~0.offset .cse31 4)))) (and (or (and (or (< c_~max2~0 .cse26) .cse27) (or (<= .cse26 c_~max2~0) (= .cse28 .cse26))) (< .cse26 .cse29)) (or (and (or (< c_~max2~0 .cse29) .cse27) (or (<= .cse29 c_~max2~0) (= .cse29 .cse28))) (<= .cse29 .cse26)))))))))) (forall ((v_ArrVal_1576 (Array Int Int))) (let ((.cse38 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1575))) (let ((.cse36 (select (store .cse38 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1576) c_~A~0.base)) (.cse37 (* ~M~0 4))) (or (let ((.cse35 (select (select .cse38 c_~A~0.base) (+ c_~A~0.offset 4)))) (let ((.cse34 (= c_~max2~0 .cse35)) (.cse33 (select .cse36 (+ c_~A~0.offset .cse37 4)))) (and (or (< c_~max3~0 .cse33) (and (or (< c_~max2~0 c_~max3~0) .cse34) (or (= c_~max3~0 .cse35) (<= c_~max3~0 c_~max2~0)))) (or (and (or (< c_~max2~0 .cse33) .cse34) (or (<= .cse33 c_~max2~0) (= .cse33 .cse35))) (<= .cse33 c_~max3~0))))) (< c_~max3~0 (select .cse36 (+ c_~A~0.offset .cse37))))))))) (or (and (forall ((v_ArrVal_1576 (Array Int Int))) (let ((.cse44 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1575))) (let ((.cse39 (select (store .cse44 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1576) c_~A~0.base)) (.cse40 (* ~M~0 4))) (or (< c_~max3~0 (select .cse39 (+ c_~A~0.offset .cse40))) (let ((.cse42 (select (select .cse44 c_~A~0.base) c_~A~0.offset))) (let ((.cse43 (select .cse39 (+ c_~A~0.offset .cse40 4))) (.cse41 (= c_~max2~0 .cse42))) (and (or (and (or (< c_~max2~0 c_~max3~0) .cse41) (or (= c_~max3~0 .cse42) (<= c_~max3~0 c_~max2~0))) (< c_~max3~0 .cse43)) (or (<= .cse43 c_~max3~0) (and (or (<= .cse43 c_~max2~0) (= .cse43 .cse42)) (or (< c_~max2~0 .cse43) .cse41)))))))))) (forall ((v_ArrVal_1576 (Array Int Int))) (let ((.cse51 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1575))) (let ((.cse49 (select (store .cse51 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1576) c_~A~0.base)) (.cse50 (* ~M~0 4))) (let ((.cse45 (select .cse49 (+ c_~A~0.offset .cse50)))) (or (let ((.cse46 (select (select .cse51 c_~A~0.base) c_~A~0.offset))) (let ((.cse47 (= c_~max2~0 .cse46)) (.cse48 (select .cse49 (+ c_~A~0.offset .cse50 4)))) (and (or (and (or (<= .cse45 c_~max2~0) (= .cse46 .cse45)) (or (< c_~max2~0 .cse45) .cse47)) (< .cse45 .cse48)) (or (and (or (<= .cse48 c_~max2~0) (= .cse48 .cse46)) (or (< c_~max2~0 .cse48) .cse47)) (<= .cse48 .cse45))))) (<= .cse45 c_~max3~0))))))) (< .cse25 .cse24)))) (<= .cse25 c_~max1~0)))))))) is different from false [2021-11-25 18:24:25,577 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (<= (+ ~M~0 1) 0) (< 0 ~M~0) (and (forall ((v_ArrVal_1575 (Array Int Int)) (v_ArrVal_1574 (Array Int Int))) (let ((.cse28 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1574) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1575) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse13 (select .cse28 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (let ((.cse14 (select .cse28 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (and (or (and (forall ((v_ArrVal_1576 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1574) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1575))) (let ((.cse3 (select (store .cse5 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1576) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse4 (* ~M~0 4))) (or (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse2 (= .cse1 c_~max2~0)) (.cse0 (select .cse3 (+ .cse4 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (and (or (and (or (<= .cse0 c_~max2~0) (= .cse1 .cse0)) (or .cse2 (< c_~max2~0 .cse0))) (<= .cse0 c_~max3~0)) (or (and (or .cse2 (< c_~max2~0 c_~max3~0)) (or (= .cse1 c_~max3~0) (<= c_~max3~0 c_~max2~0))) (< c_~max3~0 .cse0))))) (< c_~max3~0 (select .cse3 (+ .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) (forall ((v_ArrVal_1576 (Array Int Int))) (let ((.cse12 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1574) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1575))) (let ((.cse10 (select (store .cse12 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1576) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse11 (* ~M~0 4))) (let ((.cse6 (select .cse10 (+ .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (let ((.cse8 (select (select .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse7 (= .cse8 c_~max2~0)) (.cse9 (select .cse10 (+ .cse11 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (and (or (and (or (< c_~max2~0 .cse6) .cse7) (or (= .cse8 .cse6) (<= .cse6 c_~max2~0))) (< .cse6 .cse9)) (or (and (or (<= .cse9 c_~max2~0) (= .cse8 .cse9)) (or .cse7 (< c_~max2~0 .cse9))) (<= .cse9 .cse6))))) (<= .cse6 c_~max3~0))))))) (< .cse13 .cse14)) (or (<= .cse14 .cse13) (and (forall ((v_ArrVal_1576 (Array Int Int))) (let ((.cse20 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1574) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1575))) (let ((.cse15 (select (store .cse20 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1576) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse16 (* ~M~0 4))) (or (< c_~max3~0 (select .cse15 (+ .cse16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse18 (select (select .cse20 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse19 (select .cse15 (+ .cse16 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse17 (= .cse18 c_~max2~0))) (and (or (and (or (< c_~max2~0 c_~max3~0) .cse17) (or (<= c_~max3~0 c_~max2~0) (= .cse18 c_~max3~0))) (< c_~max3~0 .cse19)) (or (<= .cse19 c_~max3~0) (and (or (= .cse18 .cse19) (<= .cse19 c_~max2~0)) (or (< c_~max2~0 .cse19) .cse17)))))))))) (forall ((v_ArrVal_1576 (Array Int Int))) (let ((.cse27 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1574) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1575))) (let ((.cse25 (select (store .cse27 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1576) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse26 (* ~M~0 4))) (let ((.cse21 (select .cse25 (+ .cse26 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (<= .cse21 c_~max3~0) (let ((.cse23 (select (select .cse27 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse22 (select .cse25 (+ .cse26 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse24 (= .cse23 c_~max2~0))) (and (or (<= .cse22 .cse21) (and (or (= .cse23 .cse22) (<= .cse22 c_~max2~0)) (or (< c_~max2~0 .cse22) .cse24))) (or (< .cse21 .cse22) (and (or (< c_~max2~0 .cse21) .cse24) (or (<= .cse21 c_~max2~0) (= .cse23 .cse21)))))))))))))))) (<= .cse13 c_~max1~0))))) (forall ((v_ArrVal_1575 (Array Int Int)) (v_ArrVal_1574 (Array Int Int))) (let ((.cse29 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1574) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1575) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< c_~max1~0 (select .cse29 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (let ((.cse30 (select .cse29 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (and (or (< c_~max1~0 .cse30) (and (forall ((v_ArrVal_1576 (Array Int Int))) (let ((.cse33 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1574) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1575) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1576) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse34 (* ~M~0 4))) (or (let ((.cse31 (select .cse33 (+ .cse34 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse32 (= c_~max2~0 c_~max1~0))) (and (or (and (or (<= .cse31 c_~max2~0) (= c_~max1~0 .cse31)) (or .cse32 (< c_~max2~0 .cse31))) (<= .cse31 c_~max3~0)) (or (< c_~max3~0 .cse31) (and (or (= c_~max3~0 c_~max1~0) (<= c_~max3~0 c_~max2~0)) (or (< c_~max2~0 c_~max3~0) .cse32))))) (< c_~max3~0 (select .cse33 (+ .cse34 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (forall ((v_ArrVal_1576 (Array Int Int))) (let ((.cse38 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1574) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1575) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1576) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse39 (* ~M~0 4))) (let ((.cse35 (select .cse38 (+ .cse39 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (<= .cse35 c_~max3~0) (let ((.cse37 (= c_~max2~0 c_~max1~0)) (.cse36 (select .cse38 (+ .cse39 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (and (or (< .cse35 .cse36) (and (or (= c_~max1~0 .cse35) (<= .cse35 c_~max2~0)) (or (< c_~max2~0 .cse35) .cse37))) (or (and (or (<= .cse36 c_~max2~0) (= c_~max1~0 .cse36)) (or .cse37 (< c_~max2~0 .cse36))) (<= .cse36 .cse35)))))))))) (or (<= .cse30 c_~max1~0) (and (forall ((v_ArrVal_1576 (Array Int Int))) (let ((.cse45 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1574) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1575))) (let ((.cse40 (select (store .cse45 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1576) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse41 (* ~M~0 4))) (or (< c_~max3~0 (select .cse40 (+ .cse41 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse43 (select (select .cse45 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse44 (select .cse40 (+ .cse41 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse42 (= .cse43 c_~max2~0))) (and (or (and (or (< c_~max2~0 c_~max3~0) .cse42) (or (<= c_~max3~0 c_~max2~0) (= .cse43 c_~max3~0))) (< c_~max3~0 .cse44)) (or (<= .cse44 c_~max3~0) (and (or (= .cse43 .cse44) (<= .cse44 c_~max2~0)) (or (< c_~max2~0 .cse44) .cse42)))))))))) (forall ((v_ArrVal_1576 (Array Int Int))) (let ((.cse52 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1574) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1575))) (let ((.cse50 (select (store .cse52 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1576) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse51 (* ~M~0 4))) (let ((.cse46 (select .cse50 (+ .cse51 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (<= .cse46 c_~max3~0) (let ((.cse48 (select (select .cse52 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse47 (select .cse50 (+ .cse51 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse49 (= .cse48 c_~max2~0))) (and (or (<= .cse47 .cse46) (and (or (= .cse48 .cse47) (<= .cse47 c_~max2~0)) (or (< c_~max2~0 .cse47) .cse49))) (or (< .cse46 .cse47) (and (or (< c_~max2~0 .cse46) .cse49) (or (<= .cse46 c_~max2~0) (= .cse48 .cse46)))))))))))))))))))))) is different from false [2021-11-25 18:24:25,903 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:24:25,904 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 3131 treesize of output 1944 [2021-11-25 18:24:26,156 INFO L354 Elim1Store]: treesize reduction 110, result has 22.0 percent of original size [2021-11-25 18:24:26,159 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 24212 treesize of output 22224 [2021-11-25 18:24:27,523 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2021-11-25 18:24:27,525 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22125 treesize of output 21877 [2021-11-25 18:24:27,775 INFO L354 Elim1Store]: treesize reduction 73, result has 11.0 percent of original size [2021-11-25 18:24:27,777 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 21877 treesize of output 20190 [2021-11-25 18:24:28,934 INFO L354 Elim1Store]: treesize reduction 73, result has 11.0 percent of original size [2021-11-25 18:24:28,936 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 20005 treesize of output 19166 [2021-11-25 18:24:29,995 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2021-11-25 18:24:29,997 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19117 treesize of output 18237 [2021-11-25 18:24:30,199 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2021-11-25 18:24:30,201 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18237 treesize of output 17357 [2021-11-25 18:24:30,410 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2021-11-25 18:24:30,412 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17357 treesize of output 17109 [2021-11-25 18:24:30,611 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2021-11-25 18:24:30,613 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17109 treesize of output 16229 [2021-11-25 18:24:30,849 INFO L354 Elim1Store]: treesize reduction 73, result has 11.0 percent of original size [2021-11-25 18:24:30,851 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 16229 treesize of output 15070 [2021-11-25 18:24:31,777 INFO L354 Elim1Store]: treesize reduction 73, result has 11.0 percent of original size [2021-11-25 18:24:31,780 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 14957 treesize of output 14382 [2021-11-25 18:24:32,635 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2021-11-25 18:24:32,637 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14349 treesize of output 14101 [2021-11-25 18:24:32,832 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2021-11-25 18:24:32,834 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14101 treesize of output 13817 [2021-11-25 18:24:33,037 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2021-11-25 18:24:33,040 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13817 treesize of output 13653 [2021-11-25 18:24:33,191 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-11-25 18:24:33,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1585656595] [2021-11-25 18:24:33,192 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:24:33,193 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-25 18:24:33,193 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2021-11-25 18:24:33,194 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032358050] [2021-11-25 18:24:33,194 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-25 18:24:33,194 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-25 18:24:33,194 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:24:33,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-25 18:24:33,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1187, Unknown=8, NotChecked=450, Total=1806 [2021-11-25 18:24:33,195 INFO L87 Difference]: Start difference. First operand 385 states and 1350 transitions. Second operand has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 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) [2021-11-25 18:24:35,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:24:35,202 INFO L93 Difference]: Finished difference Result 480 states and 1566 transitions. [2021-11-25 18:24:35,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-25 18:24:35,202 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 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) Word has length 26 [2021-11-25 18:24:35,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:24:35,203 INFO L225 Difference]: With dead ends: 480 [2021-11-25 18:24:35,203 INFO L226 Difference]: Without dead ends: 473 [2021-11-25 18:24:35,204 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 581 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=336, Invalid=2230, Unknown=8, NotChecked=618, Total=3192 [2021-11-25 18:24:35,204 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 109 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-25 18:24:35,205 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 53 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-25 18:24:35,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2021-11-25 18:24:35,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 415. [2021-11-25 18:24:35,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 414 states have (on average 3.427536231884058) internal successors, (1419), 414 states have internal predecessors, (1419), 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) [2021-11-25 18:24:35,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 1419 transitions. [2021-11-25 18:24:35,215 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 1419 transitions. Word has length 26 [2021-11-25 18:24:35,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:24:35,215 INFO L470 AbstractCegarLoop]: Abstraction has 415 states and 1419 transitions. [2021-11-25 18:24:35,215 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 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) [2021-11-25 18:24:35,215 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 1419 transitions. [2021-11-25 18:24:35,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-25 18:24:35,216 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:24:35,216 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:24:35,236 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2021-11-25 18:24:35,417 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:24:35,418 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 18:24:35,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:24:35,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1240404193, now seen corresponding path program 31 times [2021-11-25 18:24:35,418 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:24:35,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550703288] [2021-11-25 18:24:35,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:24:35,418 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:24:35,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:24:36,696 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:24:36,696 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:24:36,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550703288] [2021-11-25 18:24:36,696 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550703288] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:24:36,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579427685] [2021-11-25 18:24:36,697 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 18:24:36,697 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:24:36,697 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:24:36,698 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:24:36,720 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2021-11-25 18:24:36,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:24:36,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 44 conjunts are in the unsatisfiable core [2021-11-25 18:24:36,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:24:37,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:24:37,425 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2021-11-25 18:24:38,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:24:38,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:24:38,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:24:38,216 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:24:38,216 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 171 treesize of output 107 [2021-11-25 18:24:40,838 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:24:40,838 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:24:43,457 INFO L354 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2021-11-25 18:24:43,458 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1349 treesize of output 995 [2021-11-25 18:24:43,519 INFO L354 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2021-11-25 18:24:43,520 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 921 treesize of output 829 [2021-11-25 18:24:43,575 INFO L354 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2021-11-25 18:24:43,575 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 802 treesize of output 654 [2021-11-25 18:24:56,881 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:24:56,881 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579427685] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:24:56,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [131757231] [2021-11-25 18:24:56,881 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:24:56,881 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:24:56,882 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 42 [2021-11-25 18:24:56,882 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737269816] [2021-11-25 18:24:56,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:24:56,882 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2021-11-25 18:24:56,882 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:24:56,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-11-25 18:24:56,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=1639, Unknown=1, NotChecked=0, Total=1892 [2021-11-25 18:24:56,883 INFO L87 Difference]: Start difference. First operand 415 states and 1419 transitions. Second operand has 44 states, 43 states have (on average 1.7674418604651163) internal successors, (76), 43 states have internal predecessors, (76), 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) [2021-11-25 18:24:58,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:24:58,661 INFO L93 Difference]: Finished difference Result 479 states and 1558 transitions. [2021-11-25 18:24:58,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-25 18:24:58,662 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 1.7674418604651163) internal successors, (76), 43 states have internal predecessors, (76), 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) Word has length 26 [2021-11-25 18:24:58,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:24:58,663 INFO L225 Difference]: With dead ends: 479 [2021-11-25 18:24:58,664 INFO L226 Difference]: Without dead ends: 465 [2021-11-25 18:24:58,664 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=475, Invalid=2604, Unknown=1, NotChecked=0, Total=3080 [2021-11-25 18:24:58,665 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 145 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 980 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 1219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 216 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-25 18:24:58,665 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 94 Invalid, 1219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 980 Invalid, 0 Unknown, 216 Unchecked, 0.8s Time] [2021-11-25 18:24:58,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2021-11-25 18:24:58,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 438. [2021-11-25 18:24:58,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 437 states have (on average 3.379862700228833) internal successors, (1477), 437 states have internal predecessors, (1477), 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) [2021-11-25 18:24:58,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1477 transitions. [2021-11-25 18:24:58,677 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1477 transitions. Word has length 26 [2021-11-25 18:24:58,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:24:58,677 INFO L470 AbstractCegarLoop]: Abstraction has 438 states and 1477 transitions. [2021-11-25 18:24:58,678 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 1.7674418604651163) internal successors, (76), 43 states have internal predecessors, (76), 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) [2021-11-25 18:24:58,678 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1477 transitions. [2021-11-25 18:24:58,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-25 18:24:58,679 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:24:58,679 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:24:58,699 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2021-11-25 18:24:58,881 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:24:58,882 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 18:24:58,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:24:58,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1343949795, now seen corresponding path program 32 times [2021-11-25 18:24:58,882 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:24:58,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101609524] [2021-11-25 18:24:58,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:24:58,882 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:24:58,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:25:00,045 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:25:00,045 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:25:00,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101609524] [2021-11-25 18:25:00,046 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101609524] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:25:00,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534891297] [2021-11-25 18:25:00,046 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:25:00,046 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:25:00,046 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:25:00,047 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:25:00,048 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2021-11-25 18:25:00,192 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-11-25 18:25:00,192 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:25:00,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 52 conjunts are in the unsatisfiable core [2021-11-25 18:25:00,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:25:00,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:25:00,693 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2021-11-25 18:25:01,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:25:01,194 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:25:01,215 INFO L354 Elim1Store]: treesize reduction 12, result has 66.7 percent of original size [2021-11-25 18:25:01,216 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 153 treesize of output 96 [2021-11-25 18:25:02,015 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:25:02,015 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:25:02,316 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:25:02,321 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:25:02,326 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:25:02,330 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:25:02,335 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:25:02,339 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:25:14,773 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_thread3Thread1of1ForFork1_~i~2_180 Int)) (or (<= c_~N~0 v_thread3Thread1of1ForFork1_~i~2_180) (< (+ v_thread3Thread1of1ForFork1_~i~2_180 1) c_~N~0) (and (forall ((v_ArrVal_1674 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1674) c_~A~0.base))) (or (< c_~max1~0 (select .cse0 (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~A~0.offset))) (let ((.cse2 (= c_~max2~0 c_~max1~0)) (.cse3 (select .cse0 (+ (* v_thread3Thread1of1ForFork1_~i~2_180 4) c_~A~0.offset)))) (let ((.cse4 (and (or (< c_~max2~0 .cse3) .cse2) (or (= c_~max1~0 .cse3) (<= .cse3 c_~max2~0)))) (.cse1 (select .cse0 (+ c_~A~0.offset (* c_~M~0 4))))) (and (or (< c_~max3~0 .cse1) (and (or (and (or (= c_~max3~0 c_~max1~0) (<= c_~max3~0 c_~max2~0)) (or (< c_~max2~0 c_~max3~0) .cse2)) (< c_~max3~0 .cse3)) (or .cse4 (<= .cse3 c_~max3~0)))) (or (<= .cse1 c_~max3~0) (and (or (<= .cse3 .cse1) .cse4) (or (and (or (<= .cse1 c_~max2~0) (= c_~max1~0 .cse1)) (or (< c_~max2~0 .cse1) .cse2)) (< .cse1 .cse3)))))))))) (forall ((v_ArrVal_1674 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1674) c_~A~0.base))) (let ((.cse5 (select .cse10 (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~A~0.offset)))) (or (<= .cse5 c_~max1~0) (let ((.cse8 (= .cse5 c_~max2~0)) (.cse7 (select .cse10 (+ (* v_thread3Thread1of1ForFork1_~i~2_180 4) c_~A~0.offset)))) (let ((.cse6 (select .cse10 (+ c_~A~0.offset (* c_~M~0 4)))) (.cse9 (and (or (= .cse5 .cse7) (<= .cse7 c_~max2~0)) (or .cse8 (< c_~max2~0 .cse7))))) (and (or (<= .cse6 c_~max3~0) (and (or (< .cse6 .cse7) (and (or (< c_~max2~0 .cse6) .cse8) (or (<= .cse6 c_~max2~0) (= .cse5 .cse6)))) (or (<= .cse7 .cse6) .cse9))) (or (< c_~max3~0 .cse6) (and (or (<= .cse7 c_~max3~0) .cse9) (or (and (or .cse8 (< c_~max2~0 c_~max3~0)) (or (= .cse5 c_~max3~0) (<= c_~max3~0 c_~max2~0))) (< c_~max3~0 .cse7)))))))))))))) is different from false [2021-11-25 18:25:14,938 INFO L354 Elim1Store]: treesize reduction 35, result has 65.0 percent of original size [2021-11-25 18:25:14,938 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1309 treesize of output 987 [2021-11-25 18:25:14,974 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:25:14,974 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 901 treesize of output 787 [2021-11-25 18:25:15,016 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:25:15,016 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 736 treesize of output 678 [2021-11-25 18:26:08,336 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:26:08,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [534891297] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:26:08,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1088533853] [2021-11-25 18:26:08,337 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:26:08,338 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:26:08,338 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 42 [2021-11-25 18:26:08,338 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645875039] [2021-11-25 18:26:08,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:26:08,339 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2021-11-25 18:26:08,339 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:26:08,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-11-25 18:26:08,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=1580, Unknown=1, NotChecked=82, Total=1892 [2021-11-25 18:26:08,340 INFO L87 Difference]: Start difference. First operand 438 states and 1477 transitions. Second operand has 44 states, 43 states have (on average 1.813953488372093) internal successors, (78), 43 states have internal predecessors, (78), 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) [2021-11-25 18:26:10,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:26:10,878 INFO L93 Difference]: Finished difference Result 602 states and 1924 transitions. [2021-11-25 18:26:10,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-25 18:26:10,878 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 1.813953488372093) internal successors, (78), 43 states have internal predecessors, (78), 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) Word has length 26 [2021-11-25 18:26:10,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:26:10,880 INFO L225 Difference]: With dead ends: 602 [2021-11-25 18:26:10,880 INFO L226 Difference]: Without dead ends: 595 [2021-11-25 18:26:10,880 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 942 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=558, Invalid=2867, Unknown=1, NotChecked=114, Total=3540 [2021-11-25 18:26:10,881 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 199 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 1582 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 2261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 648 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-25 18:26:10,881 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [199 Valid, 143 Invalid, 2261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1582 Invalid, 0 Unknown, 648 Unchecked, 1.0s Time] [2021-11-25 18:26:10,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2021-11-25 18:26:10,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 464. [2021-11-25 18:26:10,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 463 states have (on average 3.3390928725701943) internal successors, (1546), 463 states have internal predecessors, (1546), 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) [2021-11-25 18:26:10,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 1546 transitions. [2021-11-25 18:26:10,890 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 1546 transitions. Word has length 26 [2021-11-25 18:26:10,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:26:10,890 INFO L470 AbstractCegarLoop]: Abstraction has 464 states and 1546 transitions. [2021-11-25 18:26:10,890 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 1.813953488372093) internal successors, (78), 43 states have internal predecessors, (78), 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) [2021-11-25 18:26:10,890 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 1546 transitions. [2021-11-25 18:26:10,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-25 18:26:10,891 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:26:10,891 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:26:10,911 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2021-11-25 18:26:11,092 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2021-11-25 18:26:11,092 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 18:26:11,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:26:11,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1029178039, now seen corresponding path program 33 times [2021-11-25 18:26:11,092 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:26:11,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327702242] [2021-11-25 18:26:11,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:26:11,093 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:26:11,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:26:12,117 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:26:12,117 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:26:12,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327702242] [2021-11-25 18:26:12,118 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327702242] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:26:12,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234433069] [2021-11-25 18:26:12,118 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 18:26:12,118 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:26:12,118 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:26:12,120 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:26:12,128 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2021-11-25 18:26:12,261 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 18:26:12,261 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:26:12,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 38 conjunts are in the unsatisfiable core [2021-11-25 18:26:12,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:26:12,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:26:12,587 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2021-11-25 18:26:13,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:26:13,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:26:13,014 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:26:13,015 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 159 treesize of output 105 [2021-11-25 18:26:14,142 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:26:14,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:26:16,409 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_1723 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1723) c_~A~0.base)) (.cse11 (* c_~M~0 4))) (or (let ((.cse2 (select .cse10 (+ c_~A~0.offset .cse11 4)))) (let ((.cse6 (<= c_~max3~0 c_~max2~0)) (.cse7 (< c_~max2~0 c_~max3~0)) (.cse8 (< c_~max3~0 .cse2)) (.cse1 (<= .cse2 c_~max3~0)) (.cse3 (<= .cse2 c_~max2~0)) (.cse5 (< c_~max2~0 .cse2)) (.cse0 (select .cse10 (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~A~0.offset)))) (and (or (<= .cse0 c_~max1~0) (let ((.cse4 (= c_~max2~0 .cse0))) (and (or .cse1 (and (or (= .cse2 .cse0) .cse3) (or .cse4 .cse5))) (or (and (or (= c_~max3~0 .cse0) .cse6) (or .cse4 .cse7)) .cse8)))) (or (let ((.cse9 (= c_~max2~0 c_~max1~0))) (and (or (and (or (= c_~max3~0 c_~max1~0) .cse6) (or .cse7 .cse9)) .cse8) (or .cse1 (and (or (= .cse2 c_~max1~0) .cse3) (or .cse5 .cse9))))) (< c_~max1~0 .cse0))))) (< c_~max3~0 (select .cse10 (+ c_~A~0.offset .cse11)))))) (forall ((v_ArrVal_1723 (Array Int Int))) (let ((.cse23 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1723) c_~A~0.base)) (.cse24 (* c_~M~0 4))) (let ((.cse12 (select .cse23 (+ c_~A~0.offset .cse24)))) (or (<= .cse12 c_~max3~0) (let ((.cse19 (select .cse23 (+ c_~A~0.offset .cse24 4)))) (let ((.cse17 (< .cse12 .cse19)) (.cse16 (<= .cse12 c_~max2~0)) (.cse14 (< c_~max2~0 .cse12)) (.cse18 (<= .cse19 .cse12)) (.cse20 (<= .cse19 c_~max2~0)) (.cse21 (< c_~max2~0 .cse19)) (.cse13 (select .cse23 (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~A~0.offset)))) (and (or (<= .cse13 c_~max1~0) (let ((.cse15 (= c_~max2~0 .cse13))) (and (or (and (or .cse14 .cse15) (or .cse16 (= .cse13 .cse12))) .cse17) (or .cse18 (and (or (= .cse19 .cse13) .cse20) (or .cse15 .cse21)))))) (or (let ((.cse22 (= c_~max2~0 c_~max1~0))) (and (or .cse17 (and (or .cse16 (= c_~max1~0 .cse12)) (or .cse14 .cse22))) (or .cse18 (and (or (= .cse19 c_~max1~0) .cse20) (or .cse21 .cse22))))) (< c_~max1~0 .cse13)))))))))) (<= (+ 2 c_~M~0) c_thread1Thread1of1ForFork2_~i~0)) is different from false [2021-11-25 18:26:16,552 INFO L354 Elim1Store]: treesize reduction 64, result has 37.9 percent of original size [2021-11-25 18:26:16,552 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1353 treesize of output 983 [2021-11-25 18:26:16,588 INFO L354 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2021-11-25 18:26:16,588 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 923 treesize of output 772 [2021-11-25 18:26:16,624 INFO L354 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2021-11-25 18:26:16,625 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 745 treesize of output 654 [2021-11-25 18:26:27,246 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:26:27,246 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234433069] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:26:27,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [425749106] [2021-11-25 18:26:27,246 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:26:27,247 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:26:27,247 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 39 [2021-11-25 18:26:27,247 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700303896] [2021-11-25 18:26:27,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:26:27,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-11-25 18:26:27,248 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:26:27,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-11-25 18:26:27,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=1357, Unknown=1, NotChecked=76, Total=1640 [2021-11-25 18:26:27,249 INFO L87 Difference]: Start difference. First operand 464 states and 1546 transitions. Second operand has 41 states, 40 states have (on average 1.9) internal successors, (76), 40 states have internal predecessors, (76), 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) [2021-11-25 18:26:44,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:26:44,711 INFO L93 Difference]: Finished difference Result 644 states and 2072 transitions. [2021-11-25 18:26:44,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2021-11-25 18:26:44,711 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.9) internal successors, (76), 40 states have internal predecessors, (76), 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) Word has length 26 [2021-11-25 18:26:44,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:26:44,713 INFO L225 Difference]: With dead ends: 644 [2021-11-25 18:26:44,713 INFO L226 Difference]: Without dead ends: 623 [2021-11-25 18:26:44,713 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 26 SyntacticMatches, 5 SemanticMatches, 80 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1739 ImplicationChecksByTransitivity, 17.9s TimeCoverageRelationStatistics Valid=863, Invalid=5619, Unknown=2, NotChecked=158, Total=6642 [2021-11-25 18:26:44,714 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 237 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 1310 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 1310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 208 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:26:44,714 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [237 Valid, 77 Invalid, 1621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 1310 Invalid, 0 Unknown, 208 Unchecked, 1.1s Time] [2021-11-25 18:26:44,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2021-11-25 18:26:44,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 497. [2021-11-25 18:26:44,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 496 states have (on average 3.342741935483871) internal successors, (1658), 496 states have internal predecessors, (1658), 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) [2021-11-25 18:26:44,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 1658 transitions. [2021-11-25 18:26:44,725 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 1658 transitions. Word has length 26 [2021-11-25 18:26:44,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:26:44,725 INFO L470 AbstractCegarLoop]: Abstraction has 497 states and 1658 transitions. [2021-11-25 18:26:44,725 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.9) internal successors, (76), 40 states have internal predecessors, (76), 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) [2021-11-25 18:26:44,725 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 1658 transitions. [2021-11-25 18:26:44,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-25 18:26:44,726 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:26:44,726 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:26:44,748 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2021-11-25 18:26:44,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:26:44,927 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 18:26:44,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:26:44,927 INFO L85 PathProgramCache]: Analyzing trace with hash 681435269, now seen corresponding path program 34 times [2021-11-25 18:26:44,927 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:26:44,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218264118] [2021-11-25 18:26:44,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:26:44,928 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:26:44,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:26:45,849 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:26:45,850 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:26:45,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218264118] [2021-11-25 18:26:45,850 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218264118] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:26:45,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867987394] [2021-11-25 18:26:45,850 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 18:26:45,850 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:26:45,850 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:26:45,851 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:26:45,852 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2021-11-25 18:26:45,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:26:45,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 52 conjunts are in the unsatisfiable core [2021-11-25 18:26:45,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:26:46,089 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-25 18:26:46,148 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 18:26:46,207 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 18:26:46,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:26:46,472 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2021-11-25 18:26:46,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:26:46,890 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:26:46,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:26:46,891 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:26:46,896 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:26:46,896 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 159 treesize of output 79 [2021-11-25 18:26:47,072 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:26:47,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:26:49,278 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1776 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1776) c_~A~0.base)) (.cse1 (* c_~M~0 4))) (or (< c_~max3~0 (select .cse0 (+ c_~A~0.offset .cse1))) (let ((.cse2 (select .cse0 (+ c_~A~0.offset .cse1 4)))) (let ((.cse10 (< c_~max3~0 .cse2)) (.cse9 (<= c_~max3~0 c_~max2~0)) (.cse8 (< c_~max2~0 c_~max3~0)) (.cse5 (< c_~max2~0 .cse2)) (.cse4 (<= .cse2 c_~max2~0)) (.cse7 (<= .cse2 c_~max3~0)) (.cse3 (select .cse0 (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~A~0.offset)))) (and (or (let ((.cse6 (= c_~max2~0 .cse3))) (and (or (and (or (= .cse2 .cse3) .cse4) (or .cse5 .cse6)) .cse7) (or (and (or .cse8 .cse6) (or (= c_~max3~0 .cse3) .cse9)) .cse10))) (<= .cse3 c_~max1~0)) (or (let ((.cse11 (= c_~max2~0 c_~max1~0))) (and (or .cse10 (and (or (= c_~max3~0 c_~max1~0) .cse9) (or .cse8 .cse11))) (or (and (or .cse5 .cse11) (or (= .cse2 c_~max1~0) .cse4)) .cse7))) (< c_~max1~0 .cse3)))))))) (forall ((v_ArrVal_1776 (Array Int Int))) (let ((.cse23 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1776) c_~A~0.base)) (.cse24 (* c_~M~0 4))) (let ((.cse19 (select .cse23 (+ c_~A~0.offset .cse24)))) (or (let ((.cse15 (select .cse23 (+ c_~A~0.offset .cse24 4)))) (let ((.cse18 (< c_~max2~0 .cse19)) (.cse20 (<= .cse19 c_~max2~0)) (.cse17 (< .cse19 .cse15)) (.cse12 (<= .cse15 .cse19)) (.cse16 (<= .cse15 c_~max2~0)) (.cse13 (< c_~max2~0 .cse15)) (.cse21 (select .cse23 (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~A~0.offset)))) (and (or (let ((.cse14 (= c_~max2~0 c_~max1~0))) (and (or .cse12 (and (or .cse13 .cse14) (or (= .cse15 c_~max1~0) .cse16))) (or .cse17 (and (or .cse14 .cse18) (or (= c_~max1~0 .cse19) .cse20))))) (< c_~max1~0 .cse21)) (or (let ((.cse22 (= c_~max2~0 .cse21))) (and (or (and (or .cse18 .cse22) (or (= .cse21 .cse19) .cse20)) .cse17) (or .cse12 (and (or (= .cse15 .cse21) .cse16) (or .cse13 .cse22))))) (<= .cse21 c_~max1~0))))) (<= .cse19 c_~max3~0)))))) is different from false [2021-11-25 18:28:26,963 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (and (forall ((v_ArrVal_1775 (Array Int Int)) (v_ArrVal_1774 (Array Int Int))) (or (and (forall ((v_ArrVal_1776 (Array Int Int))) (let ((.cse5 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1774) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1775) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1776) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse6 (* ~M~0 4))) (or (let ((.cse2 (select .cse5 (+ .cse6 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse0 (< c_~max2~0 .cse2)) (.cse3 (< c_~max3~0 .cse2)) (.cse4 (select .cse5 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (and (or (let ((.cse1 (= c_~max2~0 c_~max1~0))) (and (or (and (or .cse0 .cse1) (or (= c_~max1~0 .cse2) (<= .cse2 c_~max2~0))) (<= .cse2 c_~max3~0)) (or .cse3 (and (or (= c_~max3~0 c_~max1~0) (<= c_~max3~0 c_~max2~0)) (or (< c_~max2~0 c_~max3~0) .cse1))))) (< c_~max1~0 .cse4)) (or (and (or (= c_~max2~0 .cse4) .cse0) (or .cse3 (= c_~max3~0 .cse4))) (<= .cse4 c_~max1~0))))) (< c_~max3~0 (select .cse5 (+ .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (forall ((v_ArrVal_1776 (Array Int Int))) (let ((.cse15 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1774) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1775) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1776) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse16 (* ~M~0 4))) (let ((.cse7 (select .cse15 (+ .cse16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (<= .cse7 c_~max3~0) (let ((.cse11 (select .cse15 (+ .cse16 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse12 (< c_~max2~0 .cse11)) (.cse8 (< .cse7 .cse11)) (.cse10 (< c_~max2~0 .cse7)) (.cse13 (select .cse15 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (and (or (let ((.cse9 (= c_~max2~0 c_~max1~0))) (and (or .cse8 (and (or .cse9 .cse10) (or (= c_~max1~0 .cse7) (<= .cse7 c_~max2~0)))) (or (<= .cse11 .cse7) (and (or .cse12 .cse9) (or (= c_~max1~0 .cse11) (<= .cse11 c_~max2~0)))))) (< c_~max1~0 .cse13)) (or (let ((.cse14 (= c_~max2~0 .cse13))) (and (or .cse14 .cse12) (or .cse8 (and (= .cse7 .cse13) (or .cse14 .cse10))))) (<= .cse13 c_~max1~0)))))))))) (< c_~max1~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1774) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1775) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (forall ((v_ArrVal_1775 (Array Int Int)) (v_ArrVal_1774 (Array Int Int))) (or (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1774) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1775) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~max1~0) (and (forall ((v_ArrVal_1776 (Array Int Int))) (let ((.cse24 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1774) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1775))) (let ((.cse23 (select (store .cse24 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1776) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse25 (* ~M~0 4))) (or (let ((.cse21 (select .cse23 (+ .cse25 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse18 (select (select .cse24 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse20 (< c_~max2~0 .cse21)) (.cse17 (< c_~max3~0 .cse21)) (.cse22 (select .cse23 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (and (or (let ((.cse19 (= c_~max2~0 .cse18))) (and (or .cse17 (and (or (= c_~max3~0 .cse18) (<= c_~max3~0 c_~max2~0)) (or (< c_~max2~0 c_~max3~0) .cse19))) (or (and (or .cse20 .cse19) (or (= .cse18 .cse21) (<= .cse21 c_~max2~0))) (<= .cse21 c_~max3~0)))) (< .cse18 .cse22)) (or (<= .cse22 .cse18) (and (or (= c_~max2~0 .cse22) .cse20) (or .cse17 (= c_~max3~0 .cse22))))))) (< c_~max3~0 (select .cse23 (+ .cse25 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) (forall ((v_ArrVal_1776 (Array Int Int))) (let ((.cse36 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1774) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1775))) (let ((.cse35 (select (store .cse36 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1776) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse37 (* ~M~0 4))) (let ((.cse26 (select .cse35 (+ .cse37 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (<= .cse26 c_~max3~0) (let ((.cse31 (select .cse35 (+ .cse37 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse28 (select (select .cse36 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse32 (< c_~max2~0 .cse31)) (.cse27 (< .cse26 .cse31)) (.cse29 (< c_~max2~0 .cse26)) (.cse33 (select .cse35 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (and (or (let ((.cse30 (= c_~max2~0 .cse28))) (and (or .cse27 (and (or (= .cse28 .cse26) (<= .cse26 c_~max2~0)) (or .cse29 .cse30))) (or (<= .cse31 .cse26) (and (or .cse32 .cse30) (or (= .cse28 .cse31) (<= .cse31 c_~max2~0)))))) (< .cse28 .cse33)) (or (<= .cse33 .cse28) (let ((.cse34 (= c_~max2~0 .cse33))) (and (or .cse34 .cse32) (or .cse27 (and (= .cse26 .cse33) (or .cse34 .cse29)))))))))))))))))) (< 0 ~M~0) (< ~M~0 0))) is different from false [2021-11-25 18:28:27,153 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:28:27,153 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 2509 treesize of output 1562 [2021-11-25 18:28:27,331 INFO L354 Elim1Store]: treesize reduction 106, result has 24.8 percent of original size [2021-11-25 18:28:27,333 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 16146 treesize of output 14996 [2021-11-25 18:28:28,044 INFO L354 Elim1Store]: treesize reduction 43, result has 8.5 percent of original size [2021-11-25 18:28:28,045 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 14949 treesize of output 14670 [2021-11-25 18:28:28,303 INFO L354 Elim1Store]: treesize reduction 73, result has 11.0 percent of original size [2021-11-25 18:28:28,304 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 14665 treesize of output 14478 [2021-11-25 18:28:28,557 INFO L354 Elim1Store]: treesize reduction 73, result has 11.0 percent of original size [2021-11-25 18:28:28,559 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 14469 treesize of output 14086 [2021-11-25 18:28:28,805 INFO L354 Elim1Store]: treesize reduction 43, result has 8.5 percent of original size [2021-11-25 18:28:28,806 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 14077 treesize of output 13590 [2021-11-25 18:28:29,040 INFO L354 Elim1Store]: treesize reduction 43, result has 8.5 percent of original size [2021-11-25 18:28:29,042 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 13585 treesize of output 12662 [2021-11-25 18:28:29,288 INFO L354 Elim1Store]: treesize reduction 73, result has 11.0 percent of original size [2021-11-25 18:28:29,290 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 12657 treesize of output 11486 [2021-11-25 18:28:29,891 INFO L354 Elim1Store]: treesize reduction 73, result has 11.0 percent of original size [2021-11-25 18:28:29,892 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 11445 treesize of output 10864 [2021-11-25 18:28:30,474 INFO L354 Elim1Store]: treesize reduction 43, result has 8.5 percent of original size [2021-11-25 18:28:30,476 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 10847 treesize of output 10108 [2021-11-25 18:28:30,661 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-11-25 18:28:30,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [117916954] [2021-11-25 18:28:30,661 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:28:30,662 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-25 18:28:30,662 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2021-11-25 18:28:30,662 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673688411] [2021-11-25 18:28:30,662 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-25 18:28:30,662 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-25 18:28:30,662 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:28:30,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-25 18:28:30,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1377, Unknown=9, NotChecked=154, Total=1722 [2021-11-25 18:28:30,663 INFO L87 Difference]: Start difference. First operand 497 states and 1658 transitions. Second operand has 17 states, 16 states have (on average 1.625) internal successors, (26), 16 states have internal predecessors, (26), 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) [2021-11-25 18:28:32,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:28:32,267 INFO L93 Difference]: Finished difference Result 619 states and 1948 transitions. [2021-11-25 18:28:32,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-25 18:28:32,268 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.625) internal successors, (26), 16 states have internal predecessors, (26), 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) Word has length 26 [2021-11-25 18:28:32,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:28:32,269 INFO L225 Difference]: With dead ends: 619 [2021-11-25 18:28:32,269 INFO L226 Difference]: Without dead ends: 612 [2021-11-25 18:28:32,270 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 686 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=320, Invalid=2331, Unknown=9, NotChecked=202, Total=2862 [2021-11-25 18:28:32,270 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 116 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-25 18:28:32,270 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 43 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-25 18:28:32,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2021-11-25 18:28:32,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 494. [2021-11-25 18:28:32,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 493 states have (on average 3.3448275862068964) internal successors, (1649), 493 states have internal predecessors, (1649), 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) [2021-11-25 18:28:32,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 1649 transitions. [2021-11-25 18:28:32,280 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 1649 transitions. Word has length 26 [2021-11-25 18:28:32,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:28:32,280 INFO L470 AbstractCegarLoop]: Abstraction has 494 states and 1649 transitions. [2021-11-25 18:28:32,280 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.625) internal successors, (26), 16 states have internal predecessors, (26), 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) [2021-11-25 18:28:32,280 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 1649 transitions. [2021-11-25 18:28:32,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-25 18:28:32,281 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:28:32,281 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:28:32,301 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2021-11-25 18:28:32,482 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2021-11-25 18:28:32,482 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 18:28:32,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:28:32,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1114366945, now seen corresponding path program 35 times [2021-11-25 18:28:32,483 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:28:32,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414357290] [2021-11-25 18:28:32,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:28:32,483 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:28:32,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:28:33,617 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:28:33,617 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:28:33,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414357290] [2021-11-25 18:28:33,617 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414357290] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:28:33,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658389592] [2021-11-25 18:28:33,618 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:28:33,618 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:28:33,618 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:28:33,619 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:28:33,620 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2021-11-25 18:28:33,768 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-11-25 18:28:33,768 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:28:33,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 52 conjunts are in the unsatisfiable core [2021-11-25 18:28:33,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:28:34,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:28:34,279 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2021-11-25 18:28:35,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:28:35,551 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:28:35,572 INFO L354 Elim1Store]: treesize reduction 12, result has 66.7 percent of original size [2021-11-25 18:28:35,572 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 163 treesize of output 96 [2021-11-25 18:28:36,419 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:28:36,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:28:37,054 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:28:37,063 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:28:37,073 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:28:37,082 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:28:37,091 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:28:37,101 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:28:49,366 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_thread3Thread1of1ForFork1_~i~2_204 Int)) (or (< (+ v_thread3Thread1of1ForFork1_~i~2_204 1) c_~N~0) (<= c_~N~0 v_thread3Thread1of1ForFork1_~i~2_204) (and (forall ((v_ArrVal_1825 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1825) c_~A~0.base))) (let ((.cse1 (select .cse11 (+ c_~A~0.offset (* c_~M~0 4))))) (or (let ((.cse3 (select .cse11 (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~A~0.offset)))) (let ((.cse6 (= c_~max2~0 .cse3)) (.cse2 (<= .cse3 c_~max1~0)) (.cse8 (< c_~max1~0 .cse3)) (.cse7 (= c_~max2~0 c_~max1~0)) (.cse0 (select .cse11 (+ (* v_thread3Thread1of1ForFork1_~i~2_204 4) c_~A~0.offset)))) (and (or (<= .cse0 .cse1) (let ((.cse5 (< c_~max2~0 .cse0)) (.cse4 (<= .cse0 c_~max2~0))) (and (or .cse2 (and (or (= .cse3 .cse0) .cse4) (or .cse5 .cse6))) (or (and (or .cse5 .cse7) (or .cse4 (= c_~max1~0 .cse0))) .cse8)))) (or (let ((.cse9 (<= .cse1 c_~max2~0)) (.cse10 (< c_~max2~0 .cse1))) (and (or (and (or .cse9 (= .cse3 .cse1)) (or .cse6 .cse10)) .cse2) (or .cse8 (and (or .cse9 (= c_~max1~0 .cse1)) (or .cse10 .cse7))))) (< .cse1 .cse0))))) (<= .cse1 c_~max3~0))))) (forall ((v_ArrVal_1825 (Array Int Int))) (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1825) c_~A~0.base))) (or (let ((.cse17 (select .cse22 (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~A~0.offset)))) (let ((.cse18 (<= .cse17 c_~max1~0)) (.cse16 (= c_~max2~0 .cse17)) (.cse15 (= c_~max2~0 c_~max1~0)) (.cse12 (< c_~max1~0 .cse17)) (.cse19 (select .cse22 (+ (* v_thread3Thread1of1ForFork1_~i~2_204 4) c_~A~0.offset)))) (and (or (let ((.cse14 (< c_~max2~0 c_~max3~0)) (.cse13 (<= c_~max3~0 c_~max2~0))) (and (or .cse12 (and (or (= c_~max3~0 c_~max1~0) .cse13) (or .cse14 .cse15))) (or (and (or .cse16 .cse14) (or (= c_~max3~0 .cse17) .cse13)) .cse18))) (< c_~max3~0 .cse19)) (or (<= .cse19 c_~max3~0) (let ((.cse21 (< c_~max2~0 .cse19)) (.cse20 (<= .cse19 c_~max2~0))) (and (or .cse18 (and (or (= .cse17 .cse19) .cse20) (or .cse21 .cse16))) (or (and (or .cse21 .cse15) (or .cse20 (= c_~max1~0 .cse19))) .cse12))))))) (< c_~max3~0 (select .cse22 (+ c_~A~0.offset (* c_~M~0 4)))))))))) is different from false [2021-11-25 18:28:49,530 INFO L354 Elim1Store]: treesize reduction 35, result has 65.0 percent of original size [2021-11-25 18:28:49,531 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1293 treesize of output 981 [2021-11-25 18:28:49,565 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:28:49,565 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 895 treesize of output 788 [2021-11-25 18:28:49,603 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:28:49,603 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 737 treesize of output 678 [2021-11-25 18:30:37,562 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:30:37,563 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658389592] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:30:37,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1025824242] [2021-11-25 18:30:37,563 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:30:37,564 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:30:37,564 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 43 [2021-11-25 18:30:37,564 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076217132] [2021-11-25 18:30:37,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:30:37,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2021-11-25 18:30:37,565 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:30:37,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-11-25 18:30:37,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1697, Unknown=1, NotChecked=84, Total=1980 [2021-11-25 18:30:37,565 INFO L87 Difference]: Start difference. First operand 494 states and 1649 transitions. Second operand has 45 states, 44 states have (on average 1.7727272727272727) internal successors, (78), 44 states have internal predecessors, (78), 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) [2021-11-25 18:30:42,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:30:42,909 INFO L93 Difference]: Finished difference Result 790 states and 2414 transitions. [2021-11-25 18:30:42,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-11-25 18:30:42,909 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 1.7727272727272727) internal successors, (78), 44 states have internal predecessors, (78), 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) Word has length 26 [2021-11-25 18:30:42,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:30:42,911 INFO L225 Difference]: With dead ends: 790 [2021-11-25 18:30:42,911 INFO L226 Difference]: Without dead ends: 770 [2021-11-25 18:30:42,912 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 24 SyntacticMatches, 9 SemanticMatches, 78 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1839 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=961, Invalid=5204, Unknown=1, NotChecked=154, Total=6320 [2021-11-25 18:30:42,912 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 377 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 1701 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 2517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 727 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:30:42,913 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [377 Valid, 147 Invalid, 2517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1701 Invalid, 0 Unknown, 727 Unchecked, 1.1s Time] [2021-11-25 18:30:42,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2021-11-25 18:30:42,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 494. [2021-11-25 18:30:42,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 493 states have (on average 3.3448275862068964) internal successors, (1649), 493 states have internal predecessors, (1649), 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) [2021-11-25 18:30:42,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 1649 transitions. [2021-11-25 18:30:42,924 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 1649 transitions. Word has length 26 [2021-11-25 18:30:42,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:30:42,925 INFO L470 AbstractCegarLoop]: Abstraction has 494 states and 1649 transitions. [2021-11-25 18:30:42,925 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 1.7727272727272727) internal successors, (78), 44 states have internal predecessors, (78), 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) [2021-11-25 18:30:42,925 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 1649 transitions. [2021-11-25 18:30:42,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-25 18:30:42,926 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:30:42,926 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:30:42,946 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2021-11-25 18:30:43,126 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2021-11-25 18:30:43,127 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 18:30:43,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:30:43,127 INFO L85 PathProgramCache]: Analyzing trace with hash -98366899, now seen corresponding path program 36 times [2021-11-25 18:30:43,127 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:30:43,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109885596] [2021-11-25 18:30:43,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:30:43,127 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:30:43,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:30:44,356 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:30:44,356 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:30:44,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109885596] [2021-11-25 18:30:44,356 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109885596] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:30:44,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510689771] [2021-11-25 18:30:44,356 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 18:30:44,356 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:30:44,357 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:30:44,357 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:30:44,358 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d0a8149-a670-45e2-9bb2-c330b7cf0984/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2021-11-25 18:30:44,501 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 18:30:44,502 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:30:44,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 50 conjunts are in the unsatisfiable core [2021-11-25 18:30:44,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:30:44,612 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-25 18:30:44,659 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 18:30:44,717 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 18:30:44,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:30:44,962 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2021-11-25 18:30:45,687 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:30:45,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:30:45,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:30:45,689 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:30:45,694 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:30:45,694 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 173 treesize of output 79 [2021-11-25 18:30:45,849 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:30:45,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:30:48,214 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_1878 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1878) c_~A~0.base)) (.cse12 (* c_~M~0 4))) (let ((.cse0 (select .cse11 (+ c_~A~0.offset .cse12)))) (or (<= .cse0 c_~max3~0) (let ((.cse7 (select .cse11 (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~A~0.offset)))) (let ((.cse6 (= c_~max2~0 .cse7)) (.cse8 (<= .cse7 c_~max1~0)) (.cse5 (= c_~max2~0 c_~max1~0)) (.cse2 (< c_~max1~0 .cse7)) (.cse1 (select .cse11 (+ c_~A~0.offset .cse12 4)))) (and (or (<= .cse1 .cse0) (let ((.cse4 (< c_~max2~0 .cse1)) (.cse3 (<= .cse1 c_~max2~0))) (and (or .cse2 (and (or (= c_~max1~0 .cse1) .cse3) (or .cse4 .cse5))) (or (and (or .cse6 .cse4) (or (= .cse7 .cse1) .cse3)) .cse8)))) (or (let ((.cse10 (< c_~max2~0 .cse0)) (.cse9 (<= .cse0 c_~max2~0))) (and (or (and (or (= .cse7 .cse0) .cse9) (or .cse6 .cse10)) .cse8) (or (and (or .cse5 .cse10) (or (= c_~max1~0 .cse0) .cse9)) .cse2))) (< .cse0 .cse1))))))))) (forall ((v_ArrVal_1878 (Array Int Int))) (let ((.cse14 (* c_~M~0 4)) (.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1878) c_~A~0.base))) (or (< c_~max3~0 (select .cse13 (+ c_~A~0.offset .cse14))) (let ((.cse21 (select .cse13 (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~A~0.offset)))) (let ((.cse15 (select .cse13 (+ c_~A~0.offset .cse14 4))) (.cse20 (= c_~max2~0 .cse21)) (.cse22 (<= .cse21 c_~max1~0)) (.cse16 (< c_~max1~0 .cse21)) (.cse19 (= c_~max2~0 c_~max1~0))) (and (or (<= .cse15 c_~max3~0) (let ((.cse18 (< c_~max2~0 .cse15)) (.cse17 (<= .cse15 c_~max2~0))) (and (or .cse16 (and (or (= c_~max1~0 .cse15) .cse17) (or .cse18 .cse19))) (or (and (or .cse20 .cse18) (or (= .cse21 .cse15) .cse17)) .cse22)))) (or (< c_~max3~0 .cse15) (let ((.cse23 (<= c_~max3~0 c_~max2~0)) (.cse24 (< c_~max2~0 c_~max3~0))) (and (or (and (or (= c_~max3~0 .cse21) .cse23) (or .cse20 .cse24)) .cse22) (or .cse16 (and (or (= c_~max3~0 c_~max1~0) .cse23) (or .cse24 .cse19))))))))))))) (<= (+ 2 c_~M~0) c_thread1Thread1of1ForFork2_~i~0)) is different from false [2021-11-25 18:30:49,784 WARN L838 $PredicateComparison]: unable to prove that (or (<= (+ c_~M~0 1) c_thread1Thread1of1ForFork2_~i~0) (let ((.cse25 (select (select |c_#memory_int| c_~A~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~A~0.offset)))) (and (or (and (forall ((v_ArrVal_1878 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1878) c_~A~0.base)) (.cse12 (* c_~M~0 4))) (let ((.cse0 (select .cse11 (+ c_~A~0.offset .cse12)))) (or (<= .cse0 c_~max3~0) (let ((.cse8 (select .cse11 (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~A~0.offset 4)))) (let ((.cse2 (select .cse11 (+ c_~A~0.offset .cse12 4))) (.cse5 (= c_~max2~0 c_~max1~0)) (.cse1 (< c_~max1~0 .cse8)) (.cse7 (= c_~max2~0 .cse8)) (.cse6 (<= .cse8 c_~max1~0))) (and (or (let ((.cse4 (< c_~max2~0 .cse2)) (.cse3 (<= .cse2 c_~max2~0))) (and (or .cse1 (and (or (= c_~max1~0 .cse2) .cse3) (or .cse4 .cse5))) (or .cse6 (and (or .cse4 .cse7) (or (= .cse8 .cse2) .cse3))))) (<= .cse2 .cse0)) (or (< .cse0 .cse2) (let ((.cse10 (<= .cse0 c_~max2~0)) (.cse9 (< c_~max2~0 .cse0))) (and (or (and (or .cse5 .cse9) (or (= c_~max1~0 .cse0) .cse10)) .cse1) (or (and (or (= .cse8 .cse0) .cse10) (or .cse7 .cse9)) .cse6))))))))))) (forall ((v_ArrVal_1878 (Array Int Int))) (let ((.cse23 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1878) c_~A~0.base)) (.cse24 (* c_~M~0 4))) (or (let ((.cse20 (select .cse23 (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~A~0.offset 4)))) (let ((.cse14 (select .cse23 (+ c_~A~0.offset .cse24 4))) (.cse13 (< c_~max1~0 .cse20)) (.cse17 (= c_~max2~0 c_~max1~0)) (.cse18 (<= .cse20 c_~max1~0)) (.cse19 (= c_~max2~0 .cse20))) (and (or (let ((.cse16 (< c_~max2~0 .cse14)) (.cse15 (<= .cse14 c_~max2~0))) (and (or .cse13 (and (or (= c_~max1~0 .cse14) .cse15) (or .cse16 .cse17))) (or .cse18 (and (or .cse16 .cse19) (or (= .cse20 .cse14) .cse15))))) (<= .cse14 c_~max3~0)) (or (< c_~max3~0 .cse14) (let ((.cse21 (<= c_~max3~0 c_~max2~0)) (.cse22 (< c_~max2~0 c_~max3~0))) (and (or .cse13 (and (or (= c_~max3~0 c_~max1~0) .cse21) (or .cse22 .cse17))) (or .cse18 (and (or (= c_~max3~0 .cse20) .cse21) (or .cse22 .cse19))))))))) (< c_~max3~0 (select .cse23 (+ c_~A~0.offset .cse24))))))) (< c_~max1~0 .cse25)) (or (<= .cse25 c_~max1~0) (and (forall ((v_ArrVal_1878 (Array Int Int))) (let ((.cse27 (* c_~M~0 4)) (.cse26 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1878) c_~A~0.base))) (or (< c_~max3~0 (select .cse26 (+ c_~A~0.offset .cse27))) (let ((.cse39 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse34 (select .cse26 (+ .cse39 c_~A~0.offset 4))) (.cse32 (select (select |c_#memory_int| c_~A~0.base) (+ .cse39 c_~A~0.offset)))) (let ((.cse29 (= c_~max2~0 .cse32)) (.cse33 (< .cse32 .cse34)) (.cse35 (= c_~max2~0 .cse34)) (.cse36 (<= .cse34 .cse32)) (.cse28 (select .cse26 (+ c_~A~0.offset .cse27 4)))) (and (or (< c_~max3~0 .cse28) (let ((.cse31 (<= c_~max3~0 c_~max2~0)) (.cse30 (< c_~max2~0 c_~max3~0))) (and (or (and (or .cse29 .cse30) (or .cse31 (= c_~max3~0 .cse32))) .cse33) (or (and (or (= c_~max3~0 .cse34) .cse31) (or .cse30 .cse35)) .cse36)))) (or (let ((.cse37 (< c_~max2~0 .cse28)) (.cse38 (<= .cse28 c_~max2~0))) (and (or (and (or .cse37 .cse29) (or (= .cse28 .cse32) .cse38)) .cse33) (or (and (or .cse37 .cse35) (or (= .cse34 .cse28) .cse38)) .cse36))) (<= .cse28 c_~max3~0))))))))) (forall ((v_ArrVal_1878 (Array Int Int))) (let ((.cse52 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1878) c_~A~0.base)) (.cse53 (* c_~M~0 4))) (let ((.cse40 (select .cse52 (+ c_~A~0.offset .cse53)))) (or (<= .cse40 c_~max3~0) (let ((.cse54 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse42 (select .cse52 (+ .cse54 c_~A~0.offset 4))) (.cse48 (select (select |c_#memory_int| c_~A~0.base) (+ .cse54 c_~A~0.offset)))) (let ((.cse47 (= c_~max2~0 .cse48)) (.cse49 (< .cse48 .cse42)) (.cse44 (= c_~max2~0 .cse42)) (.cse46 (<= .cse42 .cse48)) (.cse41 (select .cse52 (+ c_~A~0.offset .cse53 4)))) (and (or (< .cse40 .cse41) (let ((.cse45 (< c_~max2~0 .cse40)) (.cse43 (<= .cse40 c_~max2~0))) (and (or (and (or (= .cse42 .cse40) .cse43) (or .cse44 .cse45)) .cse46) (or (and (or .cse47 .cse45) (or (= .cse48 .cse40) .cse43)) .cse49)))) (or (let ((.cse50 (< c_~max2~0 .cse41)) (.cse51 (<= .cse41 c_~max2~0))) (and (or (and (or .cse50 .cse47) (or (= .cse41 .cse48) .cse51)) .cse49) (or (and (or .cse50 .cse44) (or (= .cse42 .cse41) .cse51)) .cse46))) (<= .cse41 .cse40))))))))))))))) is different from false [2021-11-25 18:30:51,639 WARN L838 $PredicateComparison]: unable to prove that (or (<= (+ c_~M~0 1) 0) (let ((.cse27 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (and (or (and (forall ((v_ArrVal_1878 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1878) c_~A~0.base)) (.cse13 (* c_~M~0 4))) (let ((.cse0 (select .cse12 (+ c_~A~0.offset .cse13)))) (or (<= .cse0 c_~max3~0) (let ((.cse3 (select .cse12 (+ c_~A~0.offset 4))) (.cse8 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (let ((.cse4 (select .cse12 (+ c_~A~0.offset .cse13 4))) (.cse6 (<= .cse3 .cse8)) (.cse2 (= .cse3 c_~max2~0)) (.cse9 (< .cse8 .cse3)) (.cse7 (= c_~max2~0 .cse8))) (and (or (let ((.cse1 (< c_~max2~0 .cse4)) (.cse5 (<= .cse4 c_~max2~0))) (and (or (and (or .cse1 .cse2) (or (= .cse3 .cse4) .cse5)) .cse6) (or (and (or .cse1 .cse7) (or (= .cse8 .cse4) .cse5)) .cse9))) (<= .cse4 .cse0)) (or (< .cse0 .cse4) (let ((.cse10 (<= .cse0 c_~max2~0)) (.cse11 (< c_~max2~0 .cse0))) (and (or .cse6 (and (or .cse10 (= .cse3 .cse0)) (or .cse2 .cse11))) (or .cse9 (and (or (= .cse8 .cse0) .cse10) (or .cse7 .cse11))))))))))))) (forall ((v_ArrVal_1878 (Array Int Int))) (let ((.cse15 (* c_~M~0 4)) (.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1878) c_~A~0.base))) (or (< c_~max3~0 (select .cse14 (+ c_~A~0.offset .cse15))) (let ((.cse23 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset)) (.cse21 (select .cse14 (+ c_~A~0.offset 4)))) (let ((.cse18 (= .cse21 c_~max2~0)) (.cse17 (<= .cse21 .cse23)) (.cse22 (= c_~max2~0 .cse23)) (.cse24 (< .cse23 .cse21)) (.cse16 (select .cse14 (+ c_~A~0.offset .cse15 4)))) (and (or (< c_~max3~0 .cse16) (let ((.cse19 (< c_~max2~0 c_~max3~0)) (.cse20 (<= c_~max3~0 c_~max2~0))) (and (or .cse17 (and (or .cse18 .cse19) (or .cse20 (= .cse21 c_~max3~0)))) (or (and (or .cse19 .cse22) (or (= c_~max3~0 .cse23) .cse20)) .cse24)))) (or (let ((.cse25 (< c_~max2~0 .cse16)) (.cse26 (<= .cse16 c_~max2~0))) (and (or (and (or .cse25 .cse18) (or (= .cse21 .cse16) .cse26)) .cse17) (or (and (or .cse25 .cse22) (or (= .cse23 .cse16) .cse26)) .cse24))) (<= .cse16 c_~max3~0))))))))) (<= .cse27 c_~max1~0)) (or (< c_~max1~0 .cse27) (and (forall ((v_ArrVal_1878 (Array Int Int))) (let ((.cse29 (* c_~M~0 4)) (.cse28 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1878) c_~A~0.base))) (or (< c_~max3~0 (select .cse28 (+ c_~A~0.offset .cse29))) (let ((.cse37 (select .cse28 (+ c_~A~0.offset 4)))) (let ((.cse31 (select .cse28 (+ c_~A~0.offset .cse29 4))) (.cse30 (< c_~max1~0 .cse37)) (.cse34 (= c_~max2~0 c_~max1~0)) (.cse35 (<= .cse37 c_~max1~0)) (.cse36 (= .cse37 c_~max2~0))) (and (or (let ((.cse33 (< c_~max2~0 .cse31)) (.cse32 (<= .cse31 c_~max2~0))) (and (or .cse30 (and (or (= c_~max1~0 .cse31) .cse32) (or .cse33 .cse34))) (or .cse35 (and (or .cse33 .cse36) (or (= .cse37 .cse31) .cse32))))) (<= .cse31 c_~max3~0)) (or (< c_~max3~0 .cse31) (let ((.cse39 (< c_~max2~0 c_~max3~0)) (.cse38 (<= c_~max3~0 c_~max2~0))) (and (or .cse30 (and (or (= c_~max3~0 c_~max1~0) .cse38) (or .cse39 .cse34))) (or .cse35 (and (or .cse36 .cse39) (or .cse38 (= .cse37 c_~max3~0))))))))))))) (forall ((v_ArrVal_1878 (Array Int Int))) (let ((.cse51 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1878) c_~A~0.base)) (.cse52 (* c_~M~0 4))) (let ((.cse40 (select .cse51 (+ c_~A~0.offset .cse52)))) (or (<= .cse40 c_~max3~0) (let ((.cse48 (select .cse51 (+ c_~A~0.offset 4)))) (let ((.cse42 (< c_~max1~0 .cse48)) (.cse45 (= c_~max2~0 c_~max1~0)) (.cse46 (<= .cse48 c_~max1~0)) (.cse47 (= .cse48 c_~max2~0)) (.cse41 (select .cse51 (+ c_~A~0.offset .cse52 4)))) (and (or (<= .cse41 .cse40) (let ((.cse44 (< c_~max2~0 .cse41)) (.cse43 (<= .cse41 c_~max2~0))) (and (or .cse42 (and (or (= c_~max1~0 .cse41) .cse43) (or .cse44 .cse45))) (or .cse46 (and (or .cse44 .cse47) (or (= .cse48 .cse41) .cse43)))))) (or (let ((.cse50 (<= .cse40 c_~max2~0)) (.cse49 (< c_~max2~0 .cse40))) (and (or .cse42 (and (or .cse45 .cse49) (or (= c_~max1~0 .cse40) .cse50))) (or .cse46 (and (or .cse50 (= .cse48 .cse40)) (or .cse47 .cse49))))) (< .cse40 .cse41)))))))))))))) is different from false [2021-11-25 18:31:20,000 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (<= (+ ~M~0 1) 0) (< 0 ~M~0) (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (and (or (< c_~max1~0 .cse0) (and (forall ((v_ArrVal_1878 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1878) c_~A~0.base)) (.cse11 (* ~M~0 4))) (let ((.cse1 (select .cse10 (+ c_~A~0.offset .cse11)))) (or (<= .cse1 c_~max3~0) (let ((.cse9 (select .cse10 (+ c_~A~0.offset 4)))) (let ((.cse2 (< c_~max1~0 .cse9)) (.cse5 (= c_~max2~0 c_~max1~0)) (.cse6 (<= .cse9 c_~max1~0)) (.cse7 (= .cse9 c_~max2~0)) (.cse3 (select .cse10 (+ c_~A~0.offset .cse11 4)))) (and (or (let ((.cse4 (< c_~max2~0 .cse3))) (and (or .cse2 (and (or (= c_~max1~0 .cse3) (<= .cse3 c_~max2~0)) (or .cse4 .cse5))) (or .cse6 .cse4 .cse7))) (<= .cse3 .cse1)) (or (let ((.cse8 (< c_~max2~0 .cse1))) (and (or .cse2 (and (or .cse5 .cse8) (or (= c_~max1~0 .cse1) (<= .cse1 c_~max2~0)))) (or .cse6 (and (or .cse7 .cse8) (= .cse9 .cse1))))) (< .cse1 .cse3))))))))) (forall ((v_ArrVal_1878 (Array Int Int))) (let ((.cse20 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1878) c_~A~0.base)) (.cse21 (* ~M~0 4))) (or (let ((.cse18 (select .cse20 (+ c_~A~0.offset 4)))) (let ((.cse13 (< c_~max1~0 .cse18)) (.cse15 (= c_~max2~0 c_~max1~0)) (.cse16 (<= .cse18 c_~max1~0)) (.cse17 (= .cse18 c_~max2~0)) (.cse12 (select .cse20 (+ c_~A~0.offset .cse21 4)))) (and (or (< c_~max3~0 .cse12) (let ((.cse14 (< c_~max2~0 c_~max3~0))) (and (or .cse13 (and (or (= c_~max3~0 c_~max1~0) (<= c_~max3~0 c_~max2~0)) (or .cse14 .cse15))) (or .cse16 (and (or .cse17 .cse14) (= .cse18 c_~max3~0)))))) (or (let ((.cse19 (< c_~max2~0 .cse12))) (and (or .cse13 (and (or (= c_~max1~0 .cse12) (<= .cse12 c_~max2~0)) (or .cse19 .cse15))) (or .cse16 .cse19 .cse17))) (<= .cse12 c_~max3~0))))) (< c_~max3~0 (select .cse20 (+ c_~A~0.offset .cse21)))))))) (or (<= .cse0 c_~max1~0) (and (forall ((v_ArrVal_1878 (Array Int Int))) (let ((.cse31 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1878) c_~A~0.base)) (.cse32 (* ~M~0 4))) (or (let ((.cse30 (select .cse31 (+ c_~A~0.offset 4))) (.cse26 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (let ((.cse27 (select .cse31 (+ c_~A~0.offset .cse32 4))) (.cse24 (<= .cse30 .cse26)) (.cse23 (= .cse30 c_~max2~0)) (.cse25 (= c_~max2~0 .cse26)) (.cse28 (< .cse26 .cse30))) (and (or (let ((.cse22 (< c_~max2~0 .cse27))) (and (or .cse22 .cse23 .cse24) (or (and (or .cse22 .cse25) (or (= .cse26 .cse27) (<= .cse27 c_~max2~0))) .cse28))) (<= .cse27 c_~max3~0)) (or (< c_~max3~0 .cse27) (let ((.cse29 (< c_~max2~0 c_~max3~0))) (and (or .cse24 (and (or .cse23 .cse29) (= .cse30 c_~max3~0))) (or (and (or .cse29 .cse25) (or (= c_~max3~0 .cse26) (<= c_~max3~0 c_~max2~0))) .cse28))))))) (< c_~max3~0 (select .cse31 (+ c_~A~0.offset .cse32)))))) (forall ((v_ArrVal_1878 (Array Int Int))) (let ((.cse43 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1878) c_~A~0.base)) (.cse44 (* ~M~0 4))) (let ((.cse33 (select .cse43 (+ c_~A~0.offset .cse44)))) (or (<= .cse33 c_~max3~0) (let ((.cse39 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset)) (.cse37 (select .cse43 (+ c_~A~0.offset 4)))) (let ((.cse35 (= .cse37 c_~max2~0)) (.cse34 (<= .cse37 .cse39)) (.cse40 (= c_~max2~0 .cse39)) (.cse38 (< .cse39 .cse37)) (.cse41 (select .cse43 (+ c_~A~0.offset .cse44 4)))) (and (or (let ((.cse36 (< c_~max2~0 .cse33))) (and (or .cse34 (and (or .cse35 .cse36) (= .cse37 .cse33))) (or .cse38 (and (or (= .cse39 .cse33) (<= .cse33 c_~max2~0)) (or .cse40 .cse36))))) (< .cse33 .cse41)) (or (let ((.cse42 (< c_~max2~0 .cse41))) (and (or .cse42 .cse35 .cse34) (or (and (or .cse42 .cse40) (or (= .cse39 .cse41) (<= .cse41 c_~max2~0))) .cse38))) (<= .cse41 .cse33))))))))))))))) is different from false