./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-more-min-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_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/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_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-min-array-hom.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/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_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/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 ceb4cfb737a49cea9ea1be451c16ebb29f48ae611a8c94fc546ca2e3471f0eb3 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-11-25 19:06:59,604 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-25 19:06:59,606 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-25 19:06:59,636 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-25 19:06:59,637 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-25 19:06:59,638 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-25 19:06:59,640 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-25 19:06:59,643 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-25 19:06:59,645 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-25 19:06:59,646 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-25 19:06:59,647 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-25 19:06:59,649 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-25 19:06:59,649 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-25 19:06:59,650 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-25 19:06:59,652 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-25 19:06:59,654 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-25 19:06:59,655 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-25 19:06:59,656 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-25 19:06:59,658 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-25 19:06:59,661 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-25 19:06:59,663 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-25 19:06:59,664 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-25 19:06:59,666 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-25 19:06:59,667 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-25 19:06:59,671 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-25 19:06:59,671 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-25 19:06:59,672 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-25 19:06:59,673 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-25 19:06:59,673 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-25 19:06:59,675 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-25 19:06:59,675 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-25 19:06:59,676 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-25 19:06:59,677 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-25 19:06:59,678 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-25 19:06:59,679 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-25 19:06:59,679 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-25 19:06:59,680 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-25 19:06:59,681 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-25 19:06:59,681 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-25 19:06:59,682 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-25 19:06:59,683 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-25 19:06:59,684 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-25 19:06:59,725 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-25 19:06:59,726 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-25 19:06:59,727 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-25 19:06:59,727 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-25 19:06:59,734 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-25 19:06:59,734 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-25 19:06:59,734 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-25 19:06:59,734 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-25 19:06:59,735 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-25 19:06:59,735 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-25 19:06:59,735 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-25 19:06:59,735 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-25 19:06:59,735 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-25 19:06:59,735 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-25 19:06:59,736 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-25 19:06:59,736 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-25 19:06:59,736 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-25 19:06:59,736 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-25 19:06:59,737 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-25 19:06:59,737 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-25 19:06:59,737 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-25 19:06:59,737 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-25 19:06:59,738 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-25 19:06:59,738 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-25 19:06:59,738 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-25 19:06:59,738 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-25 19:06:59,738 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-25 19:06:59,738 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-25 19:06:59,739 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-25 19:06:59,739 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-25 19:06:59,739 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-25 19:06:59,739 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-25 19:06:59,739 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 19:06:59,740 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-25 19:06:59,740 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-25 19:06:59,740 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-25 19:06:59,740 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-25 19:06:59,740 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-25 19:06:59,741 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-25 19:06:59,741 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-25 19:06:59,741 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-25 19:06:59,741 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_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/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_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/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 -> ceb4cfb737a49cea9ea1be451c16ebb29f48ae611a8c94fc546ca2e3471f0eb3 [2021-11-25 19:06:59,991 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-25 19:07:00,011 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-25 19:07:00,014 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-25 19:07:00,015 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-25 19:07:00,016 INFO L275 PluginConnector]: CDTParser initialized [2021-11-25 19:07:00,017 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/../../sv-benchmarks/c/weaver/popl20-more-min-array-hom.wvr.c [2021-11-25 19:07:00,103 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/data/8fb6f63d4/30936534812845a2842c46f86f594185/FLAG05d5f379d [2021-11-25 19:07:00,496 INFO L306 CDTParser]: Found 1 translation units. [2021-11-25 19:07:00,500 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/sv-benchmarks/c/weaver/popl20-more-min-array-hom.wvr.c [2021-11-25 19:07:00,510 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/data/8fb6f63d4/30936534812845a2842c46f86f594185/FLAG05d5f379d [2021-11-25 19:07:00,890 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/data/8fb6f63d4/30936534812845a2842c46f86f594185 [2021-11-25 19:07:00,892 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-25 19:07:00,894 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-25 19:07:00,895 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-25 19:07:00,895 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-25 19:07:00,899 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-25 19:07:00,900 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 07:07:00" (1/1) ... [2021-11-25 19:07:00,901 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@490b7a24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:07:00, skipping insertion in model container [2021-11-25 19:07:00,901 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 07:07:00" (1/1) ... [2021-11-25 19:07:00,908 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-25 19:07:00,926 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-25 19:07:01,148 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_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/sv-benchmarks/c/weaver/popl20-more-min-array-hom.wvr.c[2586,2599] [2021-11-25 19:07:01,159 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 19:07:01,176 INFO L203 MainTranslator]: Completed pre-run [2021-11-25 19:07:01,219 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_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/sv-benchmarks/c/weaver/popl20-more-min-array-hom.wvr.c[2586,2599] [2021-11-25 19:07:01,232 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 19:07:01,250 INFO L208 MainTranslator]: Completed translation [2021-11-25 19:07:01,250 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:07:01 WrapperNode [2021-11-25 19:07:01,250 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-25 19:07:01,251 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-25 19:07:01,252 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-25 19:07:01,252 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-25 19:07:01,259 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:07:01" (1/1) ... [2021-11-25 19:07:01,280 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:07:01" (1/1) ... [2021-11-25 19:07:01,318 INFO L137 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 106 [2021-11-25 19:07:01,319 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-25 19:07:01,320 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-25 19:07:01,320 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-25 19:07:01,321 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-25 19:07:01,329 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:07:01" (1/1) ... [2021-11-25 19:07:01,330 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:07:01" (1/1) ... [2021-11-25 19:07:01,346 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:07:01" (1/1) ... [2021-11-25 19:07:01,351 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:07:01" (1/1) ... [2021-11-25 19:07:01,357 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:07:01" (1/1) ... [2021-11-25 19:07:01,370 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:07:01" (1/1) ... [2021-11-25 19:07:01,373 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:07:01" (1/1) ... [2021-11-25 19:07:01,385 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-25 19:07:01,386 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-25 19:07:01,386 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-25 19:07:01,387 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-25 19:07:01,388 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:07:01" (1/1) ... [2021-11-25 19:07:01,396 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 19:07:01,407 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:07:01,421 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-25 19:07:01,442 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-25 19:07:01,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-25 19:07:01,465 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-11-25 19:07:01,465 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-11-25 19:07:01,465 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-11-25 19:07:01,466 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-11-25 19:07:01,466 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-11-25 19:07:01,466 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-11-25 19:07:01,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-25 19:07:01,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-25 19:07:01,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-25 19:07:01,467 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-11-25 19:07:01,467 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-11-25 19:07:01,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-25 19:07:01,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-25 19:07:01,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-25 19:07:01,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-25 19:07:01,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-25 19:07:01,469 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 19:07:01,548 INFO L236 CfgBuilder]: Building ICFG [2021-11-25 19:07:01,549 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-25 19:07:01,776 INFO L277 CfgBuilder]: Performing block encoding [2021-11-25 19:07:01,909 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-25 19:07:01,910 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-25 19:07:01,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 07:07:01 BoogieIcfgContainer [2021-11-25 19:07:01,914 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-25 19:07:01,915 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-25 19:07:01,915 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-25 19:07:01,921 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-25 19:07:01,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 07:07:00" (1/3) ... [2021-11-25 19:07:01,930 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bd479a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 07:07:01, skipping insertion in model container [2021-11-25 19:07:01,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:07:01" (2/3) ... [2021-11-25 19:07:01,931 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bd479a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 07:07:01, skipping insertion in model container [2021-11-25 19:07:01,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 07:07:01" (3/3) ... [2021-11-25 19:07:01,932 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-more-min-array-hom.wvr.c [2021-11-25 19:07:01,937 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-25 19:07:01,937 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-25 19:07:01,938 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-25 19:07:01,938 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-25 19:07:01,986 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:01,987 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:01,987 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:01,987 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:01,988 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:01,988 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:01,988 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:01,988 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:01,988 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:01,989 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:01,989 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:01,989 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:01,989 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:01,990 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:01,990 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:01,990 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:01,990 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:01,990 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:01,991 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:01,991 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:01,991 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:01,992 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:01,992 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:01,992 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:01,992 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:01,992 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:01,993 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:01,993 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:01,993 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:01,994 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:01,994 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:01,994 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:01,994 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:01,995 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:01,995 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:01,995 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:01,995 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:01,996 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:01,996 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:01,996 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:01,996 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:01,996 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:01,997 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:01,997 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:01,997 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:01,997 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:01,998 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:01,998 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:01,998 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:01,998 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:01,999 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:01,999 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:01,999 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:01,999 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:02,000 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:02,000 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:02,000 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:02,000 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:02,001 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:02,001 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:02,001 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:02,001 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:02,002 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:02,002 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:02,002 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:02,002 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:02,003 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:02,003 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:02,003 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:02,003 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:02,004 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:02,004 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:02,004 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:02,004 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:02,005 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:02,005 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:02,005 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:02,005 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:02,006 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:02,006 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:02,006 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:02,006 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:02,006 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:02,007 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:02,010 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:02,010 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:02,010 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:02,011 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:02,011 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:02,011 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:02,013 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:02,013 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:02,013 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:02,013 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:02,013 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:02,014 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:02,015 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:02,015 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:02,015 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:02,015 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:02,016 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:02,016 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:07:02,020 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2021-11-25 19:07:02,065 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-25 19:07:02,072 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 19:07:02,073 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-11-25 19:07:02,090 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-11-25 19:07:02,104 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 159 transitions, 342 flow [2021-11-25 19:07:02,107 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 156 places, 159 transitions, 342 flow [2021-11-25 19:07:02,109 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 156 places, 159 transitions, 342 flow [2021-11-25 19:07:02,209 INFO L129 PetriNetUnfolder]: 13/156 cut-off events. [2021-11-25 19:07:02,209 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-11-25 19:07:02,214 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 19:07:02,218 INFO L116 LiptonReduction]: Number of co-enabled transitions 1320 [2021-11-25 19:07:08,379 INFO L131 LiptonReduction]: Checked pairs total: 1603 [2021-11-25 19:07:08,379 INFO L133 LiptonReduction]: Total number of compositions: 157 [2021-11-25 19:07:08,403 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 28 transitions, 80 flow [2021-11-25 19:07:08,431 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 19:07:08,433 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 19:07:08,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 19:07:08,453 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:07:08,454 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 19:07:08,455 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 19:07:08,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:07:08,460 INFO L85 PathProgramCache]: Analyzing trace with hash -462507299, now seen corresponding path program 1 times [2021-11-25 19:07:08,470 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:07:08,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288350192] [2021-11-25 19:07:08,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:07:08,472 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:07:08,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:07:08,892 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 19:07:08,892 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:07:08,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288350192] [2021-11-25 19:07:08,893 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288350192] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:07:08,894 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:07:08,894 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-25 19:07:08,895 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289700727] [2021-11-25 19:07:08,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:07:08,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 19:07:08,901 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:07:08,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 19:07:08,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 19:07:08,930 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 19:07:09,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:07:09,007 INFO L93 Difference]: Finished difference Result 108 states and 328 transitions. [2021-11-25 19:07:09,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 19:07:09,010 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 19:07:09,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:07:09,024 INFO L225 Difference]: With dead ends: 108 [2021-11-25 19:07:09,025 INFO L226 Difference]: Without dead ends: 108 [2021-11-25 19:07:09,026 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 19:07:09,031 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.0s IncrementalHoareTripleChecker+Time [2021-11-25 19:07:09,033 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.0s Time] [2021-11-25 19:07:09,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-11-25 19:07:09,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2021-11-25 19:07:09,092 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 19:07:09,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 328 transitions. [2021-11-25 19:07:09,100 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 328 transitions. Word has length 20 [2021-11-25 19:07:09,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:07:09,101 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 328 transitions. [2021-11-25 19:07:09,101 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 19:07:09,102 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 328 transitions. [2021-11-25 19:07:09,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-25 19:07:09,107 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:07:09,107 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 19:07:09,108 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-25 19:07:09,108 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 19:07:09,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:07:09,111 INFO L85 PathProgramCache]: Analyzing trace with hash -325894009, now seen corresponding path program 1 times [2021-11-25 19:07:09,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:07:09,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477070572] [2021-11-25 19:07:09,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:07:09,117 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:07:09,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:07:09,311 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 19:07:09,311 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:07:09,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477070572] [2021-11-25 19:07:09,312 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477070572] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:07:09,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138537360] [2021-11-25 19:07:09,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:07:09,312 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:07:09,312 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:07:09,320 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:07:09,348 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-25 19:07:09,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:07:09,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-25 19:07:09,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:07:09,620 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 19:07:09,621 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:07:09,685 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 19:07:09,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1138537360] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-25 19:07:09,685 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-25 19:07:09,686 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2021-11-25 19:07:09,686 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927510817] [2021-11-25 19:07:09,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:07:09,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-25 19:07:09,687 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:07:09,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-25 19:07:09,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-11-25 19:07:09,688 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 19:07:09,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:07:09,804 INFO L93 Difference]: Finished difference Result 134 states and 413 transitions. [2021-11-25 19:07:09,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-25 19:07:09,804 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 19:07:09,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:07:09,807 INFO L225 Difference]: With dead ends: 134 [2021-11-25 19:07:09,807 INFO L226 Difference]: Without dead ends: 134 [2021-11-25 19:07:09,807 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 19:07:09,808 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 33 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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 19:07:09,809 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 19:07:09,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-11-25 19:07:09,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2021-11-25 19:07:09,821 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 19:07:09,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 413 transitions. [2021-11-25 19:07:09,824 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 413 transitions. Word has length 21 [2021-11-25 19:07:09,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:07:09,825 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 413 transitions. [2021-11-25 19:07:09,825 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 19:07:09,825 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 413 transitions. [2021-11-25 19:07:09,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-25 19:07:09,828 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:07:09,828 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 19:07:09,859 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-25 19:07:10,053 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:07:10,053 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 19:07:10,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:07:10,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1868546935, now seen corresponding path program 1 times [2021-11-25 19:07:10,054 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:07:10,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635991021] [2021-11-25 19:07:10,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:07:10,055 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:07:10,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:07:10,213 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 19:07:10,213 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:07:10,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635991021] [2021-11-25 19:07:10,214 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635991021] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:07:10,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596715912] [2021-11-25 19:07:10,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:07:10,215 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:07:10,215 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:07:10,216 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:07:10,239 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-25 19:07:10,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:07:10,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-25 19:07:10,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:07:10,476 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 19:07:10,476 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:07:10,548 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 19:07:10,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596715912] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-25 19:07:10,548 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-25 19:07:10,548 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2021-11-25 19:07:10,549 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552401447] [2021-11-25 19:07:10,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:07:10,549 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-25 19:07:10,550 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:07:10,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-25 19:07:10,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2021-11-25 19:07:10,551 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 19:07:10,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:07:10,726 INFO L93 Difference]: Finished difference Result 166 states and 519 transitions. [2021-11-25 19:07:10,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-25 19:07:10,726 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 19:07:10,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:07:10,729 INFO L225 Difference]: With dead ends: 166 [2021-11-25 19:07:10,729 INFO L226 Difference]: Without dead ends: 166 [2021-11-25 19:07:10,730 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2021-11-25 19:07:10,731 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.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:07:10,732 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.1s Time] [2021-11-25 19:07:10,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2021-11-25 19:07:10,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2021-11-25 19:07:10,746 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 19:07:10,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 519 transitions. [2021-11-25 19:07:10,747 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 519 transitions. Word has length 22 [2021-11-25 19:07:10,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:07:10,748 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 519 transitions. [2021-11-25 19:07:10,748 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 19:07:10,748 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 519 transitions. [2021-11-25 19:07:10,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 19:07:10,750 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:07:10,751 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 19:07:10,783 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-25 19:07:10,972 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:07:10,972 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 19:07:10,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:07:10,972 INFO L85 PathProgramCache]: Analyzing trace with hash -809436699, now seen corresponding path program 1 times [2021-11-25 19:07:10,973 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:07:10,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49873965] [2021-11-25 19:07:10,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:07:10,974 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:07:11,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:07:11,769 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 19:07:11,769 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:07:11,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49873965] [2021-11-25 19:07:11,770 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49873965] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:07:11,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550245410] [2021-11-25 19:07:11,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:07:11,770 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:07:11,770 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:07:11,772 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:07:11,794 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-25 19:07:11,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:07:11,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 38 conjunts are in the unsatisfiable core [2021-11-25 19:07:11,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:07:12,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:07:12,409 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 19:07:12,650 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:07:12,653 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:07:12,653 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 19:07:12,808 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 19:07:12,808 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:07:13,308 WARN L838 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_153 (Array Int Int))) (< (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))) c_~min3~0)) (and (or (< c_~min3~0 c_~min2~0) (= c_~min2~0 c_~min1~0)) (or (<= c_~min2~0 c_~min3~0) (= c_~min3~0 c_~min1~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 (<= c_~min3~0 .cse0) (and (or (= c_~min1~0 .cse0) (<= c_~min2~0 .cse0)) (or (< .cse0 c_~min2~0) (= c_~min2~0 c_~min1~0))))))) is different from false [2021-11-25 19:07:13,429 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:07:13,429 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 19:07:13,437 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 19:07:13,445 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 19:07:14,306 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 19:07:14,306 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550245410] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:07:14,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [357215448] [2021-11-25 19:07:14,313 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 19:07:14,316 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:07:14,316 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 27 [2021-11-25 19:07:14,316 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817551036] [2021-11-25 19:07:14,316 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:07:14,317 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-11-25 19:07:14,317 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:07:14,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-11-25 19:07:14,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=638, Unknown=1, NotChecked=52, Total=812 [2021-11-25 19:07:14,319 INFO L87 Difference]: Start difference. First operand 166 states and 519 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 19:07:16,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:07:16,436 INFO L93 Difference]: Finished difference Result 519 states and 1595 transitions. [2021-11-25 19:07:16,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-25 19:07:16,439 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 19:07:16,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:07:16,445 INFO L225 Difference]: With dead ends: 519 [2021-11-25 19:07:16,449 INFO L226 Difference]: Without dead ends: 498 [2021-11-25 19:07:16,452 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=338, Invalid=1735, Unknown=1, NotChecked=88, Total=2162 [2021-11-25 19:07:16,461 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 225 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 1396 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 1507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 88 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-25 19:07:16,461 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [225 Valid, 135 Invalid, 1507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1396 Invalid, 0 Unknown, 88 Unchecked, 1.0s Time] [2021-11-25 19:07:16,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2021-11-25 19:07:16,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 274. [2021-11-25 19:07:16,505 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 19:07:16,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 842 transitions. [2021-11-25 19:07:16,507 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 842 transitions. Word has length 23 [2021-11-25 19:07:16,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:07:16,508 INFO L470 AbstractCegarLoop]: Abstraction has 274 states and 842 transitions. [2021-11-25 19:07:16,509 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 19:07:16,509 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 842 transitions. [2021-11-25 19:07:16,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 19:07:16,518 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:07:16,519 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 19:07:16,540 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-25 19:07:16,724 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:07:16,724 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 19:07:16,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:07:16,724 INFO L85 PathProgramCache]: Analyzing trace with hash 738460623, now seen corresponding path program 2 times [2021-11-25 19:07:16,725 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:07:16,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064748771] [2021-11-25 19:07:16,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:07:16,725 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:07:16,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:07:17,321 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 19:07:17,322 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:07:17,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064748771] [2021-11-25 19:07:17,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064748771] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:07:17,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764045856] [2021-11-25 19:07:17,322 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 19:07:17,322 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:07:17,322 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:07:17,324 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:07:17,342 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-25 19:07:17,425 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 19:07:17,425 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:07:17,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 38 conjunts are in the unsatisfiable core [2021-11-25 19:07:17,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:07:17,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:07:17,827 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 19:07:18,086 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:07:18,088 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:07:18,089 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 19:07:18,187 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 19:07:18,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:07:18,675 WARN L838 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_198 (Array Int Int))) (< (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))) c_~min3~0)) (and (or (< c_~min3~0 c_~min2~0) (= c_~min2~0 c_~min1~0)) (or (<= c_~min2~0 c_~min3~0) (= c_~min3~0 c_~min1~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 (<= c_~min2~0 .cse0) (= .cse0 c_~min1~0)) (or (< .cse0 c_~min2~0) (= c_~min2~0 c_~min1~0))) (<= c_~min3~0 .cse0))))) is different from false [2021-11-25 19:07:18,730 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:07:18,732 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 19:07:18,740 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 19:07:18,747 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 19:07:19,448 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 19:07:19,449 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764045856] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:07:19,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [183137431] [2021-11-25 19:07:19,449 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 19:07:19,451 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:07:19,451 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 28 [2021-11-25 19:07:19,451 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769438017] [2021-11-25 19:07:19,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:07:19,452 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-11-25 19:07:19,452 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:07:19,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-11-25 19:07:19,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=691, Unknown=1, NotChecked=54, Total=870 [2021-11-25 19:07:19,453 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 19:07:21,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:07:21,008 INFO L93 Difference]: Finished difference Result 445 states and 1260 transitions. [2021-11-25 19:07:21,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-25 19:07:21,009 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 19:07:21,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:07:21,013 INFO L225 Difference]: With dead ends: 445 [2021-11-25 19:07:21,013 INFO L226 Difference]: Without dead ends: 431 [2021-11-25 19:07:21,014 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=276, Invalid=1449, Unknown=1, NotChecked=80, Total=1806 [2021-11-25 19:07:21,015 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 173 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 1342 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 1531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 175 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-25 19:07:21,015 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 61 Invalid, 1531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1342 Invalid, 0 Unknown, 175 Unchecked, 0.9s Time] [2021-11-25 19:07:21,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2021-11-25 19:07:21,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 283. [2021-11-25 19:07:21,030 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 19:07:21,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 873 transitions. [2021-11-25 19:07:21,033 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 873 transitions. Word has length 23 [2021-11-25 19:07:21,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:07:21,033 INFO L470 AbstractCegarLoop]: Abstraction has 283 states and 873 transitions. [2021-11-25 19:07:21,034 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 19:07:21,034 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 873 transitions. [2021-11-25 19:07:21,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 19:07:21,035 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:07:21,035 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 19:07:21,066 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-25 19:07:21,256 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:07:21,256 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 19:07:21,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:07:21,256 INFO L85 PathProgramCache]: Analyzing trace with hash -861527519, now seen corresponding path program 3 times [2021-11-25 19:07:21,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:07:21,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544220811] [2021-11-25 19:07:21,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:07:21,257 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:07:21,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:07:21,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 19:07:21,780 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:07:21,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544220811] [2021-11-25 19:07:21,780 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544220811] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:07:21,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110834738] [2021-11-25 19:07:21,780 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 19:07:21,780 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:07:21,780 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:07:21,781 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:07:21,797 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-25 19:07:21,879 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 19:07:21,879 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:07:21,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 31 conjunts are in the unsatisfiable core [2021-11-25 19:07:21,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:07:22,313 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:07:22,320 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:07:22,320 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 19:07:22,488 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 19:07:22,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:07:22,738 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:07:22,739 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 19:07:23,253 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 19:07:23,253 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110834738] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:07:23,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [317131093] [2021-11-25 19:07:23,254 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 19:07:23,255 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:07:23,256 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 23 [2021-11-25 19:07:23,256 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377514033] [2021-11-25 19:07:23,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:07:23,258 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-25 19:07:23,258 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:07:23,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-25 19:07:23,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2021-11-25 19:07:23,259 INFO L87 Difference]: Start difference. First operand 283 states and 873 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 19:07:24,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:07:24,340 INFO L93 Difference]: Finished difference Result 492 states and 1507 transitions. [2021-11-25 19:07:24,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-25 19:07:24,340 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 19:07:24,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:07:24,344 INFO L225 Difference]: With dead ends: 492 [2021-11-25 19:07:24,344 INFO L226 Difference]: Without dead ends: 478 [2021-11-25 19:07:24,345 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=332, Invalid=1000, Unknown=0, NotChecked=0, Total=1332 [2021-11-25 19:07:24,346 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 179 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 973 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-25 19:07:24,347 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [179 Valid, 78 Invalid, 984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 973 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-25 19:07:24,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2021-11-25 19:07:24,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 303. [2021-11-25 19:07:24,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 302 states have (on average 3.152317880794702) internal successors, (952), 302 states have internal predecessors, (952), 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 19:07:24,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 952 transitions. [2021-11-25 19:07:24,363 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 952 transitions. Word has length 23 [2021-11-25 19:07:24,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:07:24,363 INFO L470 AbstractCegarLoop]: Abstraction has 303 states and 952 transitions. [2021-11-25 19:07:24,363 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 19:07:24,363 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 952 transitions. [2021-11-25 19:07:24,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 19:07:24,365 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:07:24,365 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 19:07:24,404 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-25 19:07:24,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:07:24,588 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 19:07:24,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:07:24,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1282017465, now seen corresponding path program 4 times [2021-11-25 19:07:24,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:07:24,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998953881] [2021-11-25 19:07:24,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:07:24,589 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:07:24,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:07:25,056 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 19:07:25,056 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:07:25,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998953881] [2021-11-25 19:07:25,056 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998953881] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:07:25,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56742335] [2021-11-25 19:07:25,060 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 19:07:25,060 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:07:25,060 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:07:25,061 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:07:25,067 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-25 19:07:25,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:07:25,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-25 19:07:25,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:07:25,636 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:07:25,638 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:07:25,638 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 19:07:25,769 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 19:07:25,770 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:07:26,061 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:07:26,062 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 19:07:26,586 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 19:07:26,586 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56742335] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:07:26,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2107346806] [2021-11-25 19:07:26,587 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 19:07:26,588 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:07:26,588 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 23 [2021-11-25 19:07:26,588 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917573553] [2021-11-25 19:07:26,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:07:26,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-25 19:07:26,589 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:07:26,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-25 19:07:26,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2021-11-25 19:07:26,589 INFO L87 Difference]: Start difference. First operand 303 states and 952 transitions. Second operand has 25 states, 24 states have (on average 2.5833333333333335) internal successors, (62), 24 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 19:07:27,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:07:27,679 INFO L93 Difference]: Finished difference Result 410 states and 1297 transitions. [2021-11-25 19:07:27,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-25 19:07:27,680 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.5833333333333335) internal successors, (62), 24 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 19:07:27,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:07:27,684 INFO L225 Difference]: With dead ends: 410 [2021-11-25 19:07:27,684 INFO L226 Difference]: Without dead ends: 403 [2021-11-25 19:07:27,685 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=307, Invalid=1025, Unknown=0, NotChecked=0, Total=1332 [2021-11-25 19:07:27,685 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 151 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-25 19:07:27,686 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 61 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 463 Invalid, 0 Unknown, 76 Unchecked, 0.4s Time] [2021-11-25 19:07:27,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2021-11-25 19:07:27,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 315. [2021-11-25 19:07:27,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 314 states have (on average 3.178343949044586) internal successors, (998), 314 states have internal predecessors, (998), 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 19:07:27,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 998 transitions. [2021-11-25 19:07:27,702 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 998 transitions. Word has length 23 [2021-11-25 19:07:27,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:07:27,702 INFO L470 AbstractCegarLoop]: Abstraction has 315 states and 998 transitions. [2021-11-25 19:07:27,703 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.5833333333333335) internal successors, (62), 24 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 19:07:27,703 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 998 transitions. [2021-11-25 19:07:27,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 19:07:27,704 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:07:27,705 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 19:07:27,738 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-25 19:07:27,924 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-11-25 19:07:27,924 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 19:07:27,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:07:27,924 INFO L85 PathProgramCache]: Analyzing trace with hash 69283621, now seen corresponding path program 5 times [2021-11-25 19:07:27,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:07:27,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942304257] [2021-11-25 19:07:27,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:07:27,925 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:07:27,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:07:28,409 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 19:07:28,409 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:07:28,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942304257] [2021-11-25 19:07:28,409 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942304257] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:07:28,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958722987] [2021-11-25 19:07:28,409 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 19:07:28,409 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:07:28,410 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:07:28,424 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:07:28,442 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-25 19:07:28,525 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 19:07:28,525 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:07:28,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-25 19:07:28,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:07:29,001 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 59 treesize of output 39 [2021-11-25 19:07:29,167 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 19:07:29,168 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:07:29,447 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:07:29,448 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 19:07:30,013 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 19:07:30,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958722987] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:07:30,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1623372684] [2021-11-25 19:07:30,014 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 19:07:30,014 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:07:30,014 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 21 [2021-11-25 19:07:30,015 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167261620] [2021-11-25 19:07:30,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:07:30,015 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-11-25 19:07:30,015 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:07:30,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-25 19:07:30,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2021-11-25 19:07:30,016 INFO L87 Difference]: Start difference. First operand 315 states and 998 transitions. Second operand has 23 states, 22 states have (on average 3.1363636363636362) internal successors, (69), 22 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 19:07:30,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:07:30,728 INFO L93 Difference]: Finished difference Result 440 states and 1386 transitions. [2021-11-25 19:07:30,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-25 19:07:30,729 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.1363636363636362) internal successors, (69), 22 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 19:07:30,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:07:30,733 INFO L225 Difference]: With dead ends: 440 [2021-11-25 19:07:30,733 INFO L226 Difference]: Without dead ends: 433 [2021-11-25 19:07:30,734 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=153, Invalid=549, Unknown=0, NotChecked=0, Total=702 [2021-11-25 19:07:30,736 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 118 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-25 19:07:30,736 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 66 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-25 19:07:30,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2021-11-25 19:07:30,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 329. [2021-11-25 19:07:30,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 328 states have (on average 3.152439024390244) internal successors, (1034), 328 states have internal predecessors, (1034), 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 19:07:30,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 1034 transitions. [2021-11-25 19:07:30,754 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 1034 transitions. Word has length 23 [2021-11-25 19:07:30,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:07:30,755 INFO L470 AbstractCegarLoop]: Abstraction has 329 states and 1034 transitions. [2021-11-25 19:07:30,755 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.1363636363636362) internal successors, (69), 22 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 19:07:30,755 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 1034 transitions. [2021-11-25 19:07:30,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 19:07:30,757 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:07:30,757 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 19:07:30,791 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-25 19:07:30,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:07:30,980 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 19:07:30,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:07:30,980 INFO L85 PathProgramCache]: Analyzing trace with hash 797678335, now seen corresponding path program 6 times [2021-11-25 19:07:30,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:07:30,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798274178] [2021-11-25 19:07:30,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:07:30,981 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:07:31,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:07:31,365 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 19:07:31,365 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:07:31,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798274178] [2021-11-25 19:07:31,365 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798274178] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:07:31,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111426377] [2021-11-25 19:07:31,365 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 19:07:31,365 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:07:31,365 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:07:31,366 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:07:31,367 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-25 19:07:31,456 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 19:07:31,456 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:07:31,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 25 conjunts are in the unsatisfiable core [2021-11-25 19:07:31,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:07:31,895 INFO L354 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2021-11-25 19:07:31,896 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 19:07:31,999 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 19:07:32,000 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:07:32,395 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:07:32,395 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 19:07:32,891 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 19:07:32,892 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111426377] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:07:32,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [149792490] [2021-11-25 19:07:32,892 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 19:07:32,894 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:07:32,894 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 23 [2021-11-25 19:07:32,894 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407822715] [2021-11-25 19:07:32,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:07:32,895 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-25 19:07:32,895 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:07:32,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-25 19:07:32,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2021-11-25 19:07:32,896 INFO L87 Difference]: Start difference. First operand 329 states and 1034 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 19:07:34,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:07:34,702 INFO L93 Difference]: Finished difference Result 619 states and 1765 transitions. [2021-11-25 19:07:34,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-11-25 19:07:34,705 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 19:07:34,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:07:34,710 INFO L225 Difference]: With dead ends: 619 [2021-11-25 19:07:34,710 INFO L226 Difference]: Without dead ends: 592 [2021-11-25 19:07:34,711 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=359, Invalid=1897, Unknown=0, NotChecked=0, Total=2256 [2021-11-25 19:07:34,711 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 162 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 989 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 1229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 229 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-25 19:07:34,712 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 187 Invalid, 1229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 989 Invalid, 0 Unknown, 229 Unchecked, 0.7s Time] [2021-11-25 19:07:34,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2021-11-25 19:07:34,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 344. [2021-11-25 19:07:34,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 343 states have (on average 3.163265306122449) internal successors, (1085), 343 states have internal predecessors, (1085), 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 19:07:34,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 1085 transitions. [2021-11-25 19:07:34,738 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 1085 transitions. Word has length 23 [2021-11-25 19:07:34,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:07:34,738 INFO L470 AbstractCegarLoop]: Abstraction has 344 states and 1085 transitions. [2021-11-25 19:07:34,739 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 19:07:34,739 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 1085 transitions. [2021-11-25 19:07:34,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 19:07:34,740 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:07:34,741 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 19:07:34,765 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-11-25 19:07:34,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:07:34,952 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 19:07:34,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:07:34,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1788711955, now seen corresponding path program 7 times [2021-11-25 19:07:34,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:07:34,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766444717] [2021-11-25 19:07:34,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:07:34,953 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:07:34,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:07:35,404 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 19:07:35,404 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:07:35,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766444717] [2021-11-25 19:07:35,405 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766444717] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:07:35,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119583392] [2021-11-25 19:07:35,405 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 19:07:35,405 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:07:35,405 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:07:35,410 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:07:35,429 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-25 19:07:35,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:07:35,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-25 19:07:35,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:07:35,929 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:07:35,931 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:07:35,932 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 19:07:36,079 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 19:07:36,079 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:07:36,410 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:07:36,410 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 19:07:36,827 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 19:07:36,828 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119583392] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:07:36,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1243215488] [2021-11-25 19:07:36,828 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 19:07:36,837 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:07:36,837 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 24 [2021-11-25 19:07:36,837 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457891665] [2021-11-25 19:07:36,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:07:36,838 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-11-25 19:07:36,838 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:07:36,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-11-25 19:07:36,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=535, Unknown=0, NotChecked=0, Total=650 [2021-11-25 19:07:36,839 INFO L87 Difference]: Start difference. First operand 344 states and 1085 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 19:07:38,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:07:38,342 INFO L93 Difference]: Finished difference Result 587 states and 1825 transitions. [2021-11-25 19:07:38,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-11-25 19:07:38,343 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 19:07:38,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:07:38,349 INFO L225 Difference]: With dead ends: 587 [2021-11-25 19:07:38,349 INFO L226 Difference]: Without dead ends: 566 [2021-11-25 19:07:38,350 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=359, Invalid=1447, Unknown=0, NotChecked=0, Total=1806 [2021-11-25 19:07:38,350 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 229 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 1060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 57 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-25 19:07:38,351 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [229 Valid, 147 Invalid, 1060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 981 Invalid, 0 Unknown, 57 Unchecked, 0.6s Time] [2021-11-25 19:07:38,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2021-11-25 19:07:38,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 353. [2021-11-25 19:07:38,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 352 states have (on average 3.196022727272727) internal successors, (1125), 352 states have internal predecessors, (1125), 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 19:07:38,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 1125 transitions. [2021-11-25 19:07:38,368 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 1125 transitions. Word has length 23 [2021-11-25 19:07:38,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:07:38,369 INFO L470 AbstractCegarLoop]: Abstraction has 353 states and 1125 transitions. [2021-11-25 19:07:38,369 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 19:07:38,369 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 1125 transitions. [2021-11-25 19:07:38,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 19:07:38,371 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:07:38,371 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 19:07:38,405 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-25 19:07:38,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-11-25 19:07:38,584 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 19:07:38,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:07:38,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1293521497, now seen corresponding path program 8 times [2021-11-25 19:07:38,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:07:38,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304981774] [2021-11-25 19:07:38,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:07:38,585 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:07:38,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:07:38,997 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 19:07:38,997 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:07:38,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304981774] [2021-11-25 19:07:38,997 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304981774] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:07:38,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081951731] [2021-11-25 19:07:38,997 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 19:07:38,997 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:07:38,998 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:07:38,998 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:07:38,999 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-25 19:07:39,094 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 19:07:39,094 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:07:39,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-25 19:07:39,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:07:39,487 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 53 treesize of output 33 [2021-11-25 19:07:39,574 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 19:07:39,574 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:07:39,878 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:07:39,878 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 19:07:40,333 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 19:07:40,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081951731] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:07:40,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1517348257] [2021-11-25 19:07:40,334 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 19:07:40,334 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:07:40,335 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 22 [2021-11-25 19:07:40,335 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513178734] [2021-11-25 19:07:40,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:07:40,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-11-25 19:07:40,335 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:07:40,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-25 19:07:40,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2021-11-25 19:07:40,336 INFO L87 Difference]: Start difference. First operand 353 states and 1125 transitions. Second operand has 24 states, 23 states have (on average 2.652173913043478) internal successors, (61), 23 states have internal predecessors, (61), 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 19:07:41,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:07:41,653 INFO L93 Difference]: Finished difference Result 571 states and 1807 transitions. [2021-11-25 19:07:41,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-11-25 19:07:41,653 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.652173913043478) internal successors, (61), 23 states have internal predecessors, (61), 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 19:07:41,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:07:41,659 INFO L225 Difference]: With dead ends: 571 [2021-11-25 19:07:41,659 INFO L226 Difference]: Without dead ends: 564 [2021-11-25 19:07:41,660 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=290, Invalid=1192, Unknown=0, NotChecked=0, Total=1482 [2021-11-25 19:07:41,660 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 175 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-25 19:07:41,661 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 139 Invalid, 982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 919 Invalid, 0 Unknown, 47 Unchecked, 0.6s Time] [2021-11-25 19:07:41,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2021-11-25 19:07:41,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 353. [2021-11-25 19:07:41,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 352 states have (on average 3.196022727272727) internal successors, (1125), 352 states have internal predecessors, (1125), 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 19:07:41,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 1125 transitions. [2021-11-25 19:07:41,678 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 1125 transitions. Word has length 23 [2021-11-25 19:07:41,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:07:41,678 INFO L470 AbstractCegarLoop]: Abstraction has 353 states and 1125 transitions. [2021-11-25 19:07:41,678 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.652173913043478) internal successors, (61), 23 states have internal predecessors, (61), 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 19:07:41,679 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 1125 transitions. [2021-11-25 19:07:41,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 19:07:41,680 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:07:41,680 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 19:07:41,709 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-25 19:07:41,903 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-11-25 19:07:41,904 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 19:07:41,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:07:41,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1701387339, now seen corresponding path program 9 times [2021-11-25 19:07:41,904 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:07:41,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162110643] [2021-11-25 19:07:41,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:07:41,905 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:07:41,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:07:42,313 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 19:07:42,313 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:07:42,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162110643] [2021-11-25 19:07:42,313 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162110643] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:07:42,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946186545] [2021-11-25 19:07:42,314 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 19:07:42,314 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:07:42,314 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:07:42,315 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:07:42,331 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-25 19:07:42,427 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 19:07:42,427 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:07:42,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 27 conjunts are in the unsatisfiable core [2021-11-25 19:07:42,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:07:42,972 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:07:42,974 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:07:42,975 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 19:07:43,107 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 19:07:43,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:07:43,515 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:07:43,515 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 19:07:43,836 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 19:07:43,837 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [946186545] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:07:43,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [604249741] [2021-11-25 19:07:43,838 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 19:07:43,839 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:07:43,839 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 7] total 24 [2021-11-25 19:07:43,839 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983848068] [2021-11-25 19:07:43,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:07:43,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-11-25 19:07:43,840 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:07:43,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-11-25 19:07:43,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2021-11-25 19:07:43,841 INFO L87 Difference]: Start difference. First operand 353 states and 1125 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 19:07:45,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:07:45,241 INFO L93 Difference]: Finished difference Result 594 states and 1719 transitions. [2021-11-25 19:07:45,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-11-25 19:07:45,241 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 19:07:45,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:07:45,246 INFO L225 Difference]: With dead ends: 594 [2021-11-25 19:07:45,246 INFO L226 Difference]: Without dead ends: 581 [2021-11-25 19:07:45,247 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=344, Invalid=1818, Unknown=0, NotChecked=0, Total=2162 [2021-11-25 19:07:45,248 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 228 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 1126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 222 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-25 19:07:45,248 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [228 Valid, 140 Invalid, 1126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 881 Invalid, 0 Unknown, 222 Unchecked, 0.6s Time] [2021-11-25 19:07:45,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2021-11-25 19:07:45,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 349. [2021-11-25 19:07:45,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 3.1867816091954024) internal successors, (1109), 348 states have internal predecessors, (1109), 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 19:07:45,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 1109 transitions. [2021-11-25 19:07:45,265 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 1109 transitions. Word has length 23 [2021-11-25 19:07:45,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:07:45,266 INFO L470 AbstractCegarLoop]: Abstraction has 349 states and 1109 transitions. [2021-11-25 19:07:45,266 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 19:07:45,266 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 1109 transitions. [2021-11-25 19:07:45,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 19:07:45,268 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:07:45,268 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 19:07:45,302 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-11-25 19:07:45,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:07:45,486 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 19:07:45,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:07:45,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1601233183, now seen corresponding path program 10 times [2021-11-25 19:07:45,486 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:07:45,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850824396] [2021-11-25 19:07:45,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:07:45,486 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:07:45,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:07:46,023 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 19:07:46,023 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:07:46,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850824396] [2021-11-25 19:07:46,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850824396] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:07:46,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294799576] [2021-11-25 19:07:46,024 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 19:07:46,024 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:07:46,024 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:07:46,032 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:07:46,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-25 19:07:46,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:07:46,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-25 19:07:46,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:07:46,663 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:07:46,665 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:07:46,666 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 19:07:46,777 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 19:07:46,777 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:07:47,066 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:07:47,067 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 19:07:47,597 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 19:07:47,597 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294799576] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:07:47,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [476010505] [2021-11-25 19:07:47,598 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 19:07:47,598 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:07:47,598 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 25 [2021-11-25 19:07:47,598 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200653089] [2021-11-25 19:07:47,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:07:47,599 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-11-25 19:07:47,599 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:07:47,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-11-25 19:07:47,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=589, Unknown=0, NotChecked=0, Total=702 [2021-11-25 19:07:47,600 INFO L87 Difference]: Start difference. First operand 349 states and 1109 transitions. Second operand has 27 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 26 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 19:07:49,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:07:49,229 INFO L93 Difference]: Finished difference Result 587 states and 1847 transitions. [2021-11-25 19:07:49,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-11-25 19:07:49,229 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 26 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 19:07:49,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:07:49,234 INFO L225 Difference]: With dead ends: 587 [2021-11-25 19:07:49,234 INFO L226 Difference]: Without dead ends: 581 [2021-11-25 19:07:49,235 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=356, Invalid=1450, Unknown=0, NotChecked=0, Total=1806 [2021-11-25 19:07:49,236 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 222 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 1190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 107 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-25 19:07:49,236 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [222 Valid, 160 Invalid, 1190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1060 Invalid, 0 Unknown, 107 Unchecked, 0.6s Time] [2021-11-25 19:07:49,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2021-11-25 19:07:49,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 339. [2021-11-25 19:07:49,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 338 states have (on average 3.1568047337278107) internal successors, (1067), 338 states have internal predecessors, (1067), 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 19:07:49,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 1067 transitions. [2021-11-25 19:07:49,252 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 1067 transitions. Word has length 23 [2021-11-25 19:07:49,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:07:49,252 INFO L470 AbstractCegarLoop]: Abstraction has 339 states and 1067 transitions. [2021-11-25 19:07:49,252 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 26 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 19:07:49,253 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 1067 transitions. [2021-11-25 19:07:49,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 19:07:49,254 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:07:49,254 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 19:07:49,291 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-11-25 19:07:49,479 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-11-25 19:07:49,480 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 19:07:49,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:07:49,480 INFO L85 PathProgramCache]: Analyzing trace with hash 999476243, now seen corresponding path program 11 times [2021-11-25 19:07:49,480 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:07:49,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025144019] [2021-11-25 19:07:49,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:07:49,480 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:07:49,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:07:49,930 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 19:07:49,930 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:07:49,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025144019] [2021-11-25 19:07:49,930 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025144019] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:07:49,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709722362] [2021-11-25 19:07:49,931 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 19:07:49,931 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:07:49,931 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:07:49,931 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:07:49,932 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-11-25 19:07:50,049 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 19:07:50,050 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:07:50,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 39 conjunts are in the unsatisfiable core [2021-11-25 19:07:50,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:07:50,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:07:50,480 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 19:07:50,675 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:07:50,678 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:07:50,679 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 19:07:50,814 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 19:07:50,815 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:07:51,141 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_595 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_595) c_~A~0.base) (+ c_~A~0.offset (* c_~M~0 4))))) (or (and (or (= c_~min2~0 c_~min1~0) (< .cse0 c_~min2~0)) (or (<= c_~min2~0 .cse0) (= .cse0 c_~min1~0))) (<= c_~min3~0 .cse0)))) (or (and (or (< c_~min3~0 c_~min2~0) (= c_~min2~0 c_~min1~0)) (or (<= c_~min2~0 c_~min3~0) (= c_~min3~0 c_~min1~0))) (forall ((v_ArrVal_595 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_595) c_~A~0.base) (+ c_~A~0.offset (* c_~M~0 4))) c_~min3~0)))) is different from false [2021-11-25 19:07:51,277 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:07:51,277 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 19:07:51,284 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 19:07:51,290 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 19:07:51,911 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 19:07:51,911 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709722362] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:07:51,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1740302166] [2021-11-25 19:07:51,912 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 19:07:51,913 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:07:51,913 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 25 [2021-11-25 19:07:51,913 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778488669] [2021-11-25 19:07:51,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:07:51,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-11-25 19:07:51,914 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:07:51,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-11-25 19:07:51,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=556, Unknown=1, NotChecked=48, Total=702 [2021-11-25 19:07:51,915 INFO L87 Difference]: Start difference. First operand 339 states and 1067 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 19:07:53,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:07:53,008 INFO L93 Difference]: Finished difference Result 578 states and 1781 transitions. [2021-11-25 19:07:53,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-25 19:07:53,008 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 19:07:53,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:07:53,012 INFO L225 Difference]: With dead ends: 578 [2021-11-25 19:07:53,012 INFO L226 Difference]: Without dead ends: 571 [2021-11-25 19:07:53,013 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=200, Invalid=993, Unknown=1, NotChecked=66, Total=1260 [2021-11-25 19:07:53,013 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 209 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 1002 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 1101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 78 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-25 19:07:53,014 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [209 Valid, 91 Invalid, 1101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1002 Invalid, 0 Unknown, 78 Unchecked, 0.5s Time] [2021-11-25 19:07:53,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2021-11-25 19:07:53,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 332. [2021-11-25 19:07:53,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 331 states have (on average 3.1540785498489425) internal successors, (1044), 331 states have internal predecessors, (1044), 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 19:07:53,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 1044 transitions. [2021-11-25 19:07:53,028 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 1044 transitions. Word has length 23 [2021-11-25 19:07:53,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:07:53,029 INFO L470 AbstractCegarLoop]: Abstraction has 332 states and 1044 transitions. [2021-11-25 19:07:53,029 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 19:07:53,029 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 1044 transitions. [2021-11-25 19:07:53,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 19:07:53,031 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:07:53,031 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 19:07:53,072 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-11-25 19:07:53,246 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-11-25 19:07:53,247 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 19:07:53,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:07:53,247 INFO L85 PathProgramCache]: Analyzing trace with hash 339222629, now seen corresponding path program 12 times [2021-11-25 19:07:53,247 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:07:53,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397477904] [2021-11-25 19:07:53,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:07:53,247 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:07:53,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:07:53,820 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 19:07:53,820 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:07:53,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397477904] [2021-11-25 19:07:53,820 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397477904] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:07:53,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064735780] [2021-11-25 19:07:53,820 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 19:07:53,821 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:07:53,821 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:07:53,824 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:07:53,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-11-25 19:07:53,944 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 19:07:53,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:07:53,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 38 conjunts are in the unsatisfiable core [2021-11-25 19:07:53,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:07:54,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:07:54,189 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 19:07:54,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:07:54,393 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 19:07:54,538 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:07:54,540 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:07:54,541 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 19:07:54,644 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 19:07:54,644 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:07:55,005 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_641 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_641) c_~A~0.base) (+ c_~A~0.offset (* c_~M~0 4))))) (or (and (or (< .cse0 c_~min2~0) (= c_~min2~0 c_~min1~0)) (or (<= c_~min2~0 .cse0) (= c_~min1~0 .cse0))) (<= c_~min3~0 .cse0)))) (or (forall ((v_ArrVal_641 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_641) c_~A~0.base) (+ c_~A~0.offset (* c_~M~0 4))) c_~min3~0)) (and (or (< c_~min3~0 c_~min2~0) (= c_~min2~0 c_~min1~0)) (or (<= c_~min2~0 c_~min3~0) (= c_~min3~0 c_~min1~0))))) is different from false [2021-11-25 19:07:55,450 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:07:55,450 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 19:07:55,460 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 365 [2021-11-25 19:07:55,469 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 365 treesize of output 353 [2021-11-25 19:07:55,480 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 19:07:55,489 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 19:07:56,521 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 19:07:56,521 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064735780] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:07:56,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1986491834] [2021-11-25 19:07:56,522 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 19:07:56,522 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:07:56,522 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 29 [2021-11-25 19:07:56,522 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407105177] [2021-11-25 19:07:56,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:07:56,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-11-25 19:07:56,523 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:07:56,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-11-25 19:07:56,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=757, Unknown=2, NotChecked=56, Total=930 [2021-11-25 19:07:56,524 INFO L87 Difference]: Start difference. First operand 332 states and 1044 transitions. Second operand has 31 states, 30 states have (on average 2.3) internal successors, (69), 30 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 19:08:00,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:08:00,382 INFO L93 Difference]: Finished difference Result 897 states and 2615 transitions. [2021-11-25 19:08:00,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-11-25 19:08:00,383 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.3) internal successors, (69), 30 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 19:08:00,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:08:00,388 INFO L225 Difference]: With dead ends: 897 [2021-11-25 19:08:00,389 INFO L226 Difference]: Without dead ends: 876 [2021-11-25 19:08:00,390 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 36 SyntacticMatches, 9 SemanticMatches, 59 ConstructedPredicates, 1 IntricatePredicates, 5 DeprecatedPredicates, 1159 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=606, Invalid=2936, Unknown=2, NotChecked=116, Total=3660 [2021-11-25 19:08:00,391 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 335 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 1721 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 2187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 439 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-25 19:08:00,391 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [335 Valid, 76 Invalid, 2187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1721 Invalid, 0 Unknown, 439 Unchecked, 1.0s Time] [2021-11-25 19:08:00,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2021-11-25 19:08:00,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 390. [2021-11-25 19:08:00,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 389 states have (on average 3.1491002570694087) internal successors, (1225), 389 states have internal predecessors, (1225), 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 19:08:00,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1225 transitions. [2021-11-25 19:08:00,413 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1225 transitions. Word has length 23 [2021-11-25 19:08:00,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:08:00,413 INFO L470 AbstractCegarLoop]: Abstraction has 390 states and 1225 transitions. [2021-11-25 19:08:00,413 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.3) internal successors, (69), 30 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 19:08:00,413 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1225 transitions. [2021-11-25 19:08:00,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-25 19:08:00,415 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:08:00,415 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 19:08:00,459 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-11-25 19:08:00,639 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:08:00,640 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 19:08:00,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:08:00,640 INFO L85 PathProgramCache]: Analyzing trace with hash -780631851, now seen corresponding path program 13 times [2021-11-25 19:08:00,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:08:00,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461786952] [2021-11-25 19:08:00,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:08:00,641 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:08:00,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:08:00,709 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 19:08:00,710 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:08:00,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461786952] [2021-11-25 19:08:00,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461786952] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:08:00,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974539009] [2021-11-25 19:08:00,710 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 19:08:00,710 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:08:00,711 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:08:00,712 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:08:00,736 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-11-25 19:08:00,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:08:00,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-25 19:08:00,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:08:00,900 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 19:08:00,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:08:00,968 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 19:08:00,968 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1974539009] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:08:00,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1634712976] [2021-11-25 19:08:00,968 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 19:08:00,970 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:08:00,970 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2021-11-25 19:08:00,970 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211034595] [2021-11-25 19:08:00,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:08:00,971 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-25 19:08:00,972 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:08:00,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-25 19:08:00,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2021-11-25 19:08:00,972 INFO L87 Difference]: Start difference. First operand 390 states and 1225 transitions. Second operand has 14 states, 14 states have (on average 2.5) internal successors, (35), 13 states have internal predecessors, (35), 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 19:08:01,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:08:01,170 INFO L93 Difference]: Finished difference Result 524 states and 1559 transitions. [2021-11-25 19:08:01,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-25 19:08:01,171 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 13 states have internal predecessors, (35), 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 19:08:01,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:08:01,175 INFO L225 Difference]: With dead ends: 524 [2021-11-25 19:08:01,175 INFO L226 Difference]: Without dead ends: 518 [2021-11-25 19:08:01,175 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2021-11-25 19:08:01,176 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 158 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 19:08:01,176 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [158 Valid, 41 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 19:08:01,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2021-11-25 19:08:01,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 446. [2021-11-25 19:08:01,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 445 states have (on average 3.0741573033707863) internal successors, (1368), 445 states have internal predecessors, (1368), 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 19:08:01,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 1368 transitions. [2021-11-25 19:08:01,193 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 1368 transitions. Word has length 24 [2021-11-25 19:08:01,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:08:01,193 INFO L470 AbstractCegarLoop]: Abstraction has 446 states and 1368 transitions. [2021-11-25 19:08:01,194 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 13 states have internal predecessors, (35), 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 19:08:01,194 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 1368 transitions. [2021-11-25 19:08:01,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-25 19:08:01,195 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:08:01,196 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 19:08:01,236 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-11-25 19:08:01,415 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-11-25 19:08:01,416 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 19:08:01,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:08:01,416 INFO L85 PathProgramCache]: Analyzing trace with hash 2072416567, now seen corresponding path program 14 times [2021-11-25 19:08:01,416 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:08:01,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354272532] [2021-11-25 19:08:01,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:08:01,417 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:08:01,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:08:01,521 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 19:08:01,521 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:08:01,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354272532] [2021-11-25 19:08:01,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354272532] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:08:01,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303852756] [2021-11-25 19:08:01,522 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 19:08:01,522 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:08:01,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:08:01,523 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:08:01,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-11-25 19:08:01,651 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 19:08:01,651 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:08:01,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-25 19:08:01,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:08:01,811 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 19:08:01,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:08:01,903 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 19:08:01,903 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [303852756] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:08:01,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2144421668] [2021-11-25 19:08:01,904 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 19:08:01,905 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:08:01,905 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2021-11-25 19:08:01,905 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073954363] [2021-11-25 19:08:01,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:08:01,906 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 19:08:01,906 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:08:01,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 19:08:01,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2021-11-25 19:08:01,907 INFO L87 Difference]: Start difference. First operand 446 states and 1368 transitions. Second operand has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 14 states have internal predecessors, (56), 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 19:08:02,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:08:02,204 INFO L93 Difference]: Finished difference Result 510 states and 1434 transitions. [2021-11-25 19:08:02,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-25 19:08:02,205 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 14 states have internal predecessors, (56), 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 19:08:02,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:08:02,209 INFO L225 Difference]: With dead ends: 510 [2021-11-25 19:08:02,209 INFO L226 Difference]: Without dead ends: 438 [2021-11-25 19:08:02,209 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2021-11-25 19:08:02,210 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 182 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 19:08:02,210 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [182 Valid, 39 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 19:08:02,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2021-11-25 19:08:02,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 416. [2021-11-25 19:08:02,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 415 states have (on average 2.9253012048192772) internal successors, (1214), 415 states have internal predecessors, (1214), 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 19:08:02,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 1214 transitions. [2021-11-25 19:08:02,227 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 1214 transitions. Word has length 24 [2021-11-25 19:08:02,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:08:02,227 INFO L470 AbstractCegarLoop]: Abstraction has 416 states and 1214 transitions. [2021-11-25 19:08:02,227 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 14 states have internal predecessors, (56), 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 19:08:02,228 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 1214 transitions. [2021-11-25 19:08:02,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-25 19:08:02,229 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:08:02,229 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 19:08:02,268 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-11-25 19:08:02,432 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-11-25 19:08:02,432 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 19:08:02,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:08:02,432 INFO L85 PathProgramCache]: Analyzing trace with hash 433773, now seen corresponding path program 1 times [2021-11-25 19:08:02,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:08:02,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188580149] [2021-11-25 19:08:02,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:08:02,432 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:08:02,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:08:02,515 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 19:08:02,515 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:08:02,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188580149] [2021-11-25 19:08:02,516 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188580149] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:08:02,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343659768] [2021-11-25 19:08:02,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:08:02,516 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:08:02,516 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:08:02,520 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:08:02,538 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-11-25 19:08:02,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:08:02,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-25 19:08:02,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:08:02,735 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 19:08:02,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:08:02,799 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 19:08:02,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [343659768] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:08:02,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1977735621] [2021-11-25 19:08:02,800 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 19:08:02,800 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:08:02,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2021-11-25 19:08:02,800 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43255269] [2021-11-25 19:08:02,800 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:08:02,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-25 19:08:02,801 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:08:02,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-25 19:08:02,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2021-11-25 19:08:02,801 INFO L87 Difference]: Start difference. First operand 416 states and 1214 transitions. Second operand has 16 states, 16 states have (on average 2.875) internal successors, (46), 15 states have internal predecessors, (46), 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 19:08:03,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:08:03,109 INFO L93 Difference]: Finished difference Result 442 states and 1258 transitions. [2021-11-25 19:08:03,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-25 19:08:03,109 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 15 states have internal predecessors, (46), 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 19:08:03,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:08:03,111 INFO L225 Difference]: With dead ends: 442 [2021-11-25 19:08:03,111 INFO L226 Difference]: Without dead ends: 406 [2021-11-25 19:08:03,112 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=146, Invalid=360, Unknown=0, NotChecked=0, Total=506 [2021-11-25 19:08:03,112 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 148 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 19:08:03,113 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 73 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 19:08:03,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2021-11-25 19:08:03,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 394. [2021-11-25 19:08:03,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 393 states have (on average 2.910941475826972) internal successors, (1144), 393 states have internal predecessors, (1144), 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 19:08:03,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1144 transitions. [2021-11-25 19:08:03,127 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1144 transitions. Word has length 24 [2021-11-25 19:08:03,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:08:03,127 INFO L470 AbstractCegarLoop]: Abstraction has 394 states and 1144 transitions. [2021-11-25 19:08:03,128 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 15 states have internal predecessors, (46), 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 19:08:03,128 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1144 transitions. [2021-11-25 19:08:03,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-25 19:08:03,129 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:08:03,129 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 19:08:03,164 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-11-25 19:08:03,352 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-11-25 19:08:03,352 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 19:08:03,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:08:03,352 INFO L85 PathProgramCache]: Analyzing trace with hash -907064467, now seen corresponding path program 2 times [2021-11-25 19:08:03,352 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:08:03,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088252701] [2021-11-25 19:08:03,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:08:03,353 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:08:03,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:08:03,424 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 19:08:03,424 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:08:03,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088252701] [2021-11-25 19:08:03,425 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088252701] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:08:03,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333269323] [2021-11-25 19:08:03,425 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 19:08:03,425 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:08:03,425 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:08:03,426 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:08:03,454 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-11-25 19:08:03,566 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 19:08:03,566 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:08:03,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-25 19:08:03,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:08:03,710 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 19:08:03,710 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:08:03,789 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 19:08:03,789 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333269323] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:08:03,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [717444921] [2021-11-25 19:08:03,789 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 19:08:03,790 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:08:03,790 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 15 [2021-11-25 19:08:03,790 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986959108] [2021-11-25 19:08:03,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:08:03,791 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-25 19:08:03,791 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:08:03,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-25 19:08:03,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2021-11-25 19:08:03,791 INFO L87 Difference]: Start difference. First operand 394 states and 1144 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 19:08:03,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:08:03,983 INFO L93 Difference]: Finished difference Result 376 states and 1036 transitions. [2021-11-25 19:08:03,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-25 19:08:03,983 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 19:08:03,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:08:03,985 INFO L225 Difference]: With dead ends: 376 [2021-11-25 19:08:03,985 INFO L226 Difference]: Without dead ends: 241 [2021-11-25 19:08:03,986 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2021-11-25 19:08:03,987 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 104 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:08:03,987 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 31 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 19:08:03,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2021-11-25 19:08:03,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2021-11-25 19:08:03,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 240 states have (on average 3.05) internal successors, (732), 240 states have internal predecessors, (732), 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 19:08:03,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 732 transitions. [2021-11-25 19:08:03,996 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 732 transitions. Word has length 24 [2021-11-25 19:08:03,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:08:03,997 INFO L470 AbstractCegarLoop]: Abstraction has 241 states and 732 transitions. [2021-11-25 19:08:03,997 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 19:08:03,997 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 732 transitions. [2021-11-25 19:08:03,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-25 19:08:03,998 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:08:03,999 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 19:08:04,035 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-11-25 19:08:04,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:08:04,220 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 19:08:04,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:08:04,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1713190597, now seen corresponding path program 15 times [2021-11-25 19:08:04,220 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:08:04,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438478473] [2021-11-25 19:08:04,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:08:04,221 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:08:04,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:08:04,302 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 19:08:04,303 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:08:04,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438478473] [2021-11-25 19:08:04,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438478473] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:08:04,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842766508] [2021-11-25 19:08:04,303 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 19:08:04,304 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:08:04,304 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:08:04,304 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:08:04,334 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-11-25 19:08:04,436 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 19:08:04,436 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:08:04,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-25 19:08:04,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:08:04,554 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 19:08:04,554 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:08:04,628 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 19:08:04,629 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842766508] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:08:04,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [157972747] [2021-11-25 19:08:04,629 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 19:08:04,629 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:08:04,629 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2021-11-25 19:08:04,630 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521778000] [2021-11-25 19:08:04,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:08:04,630 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-25 19:08:04,630 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:08:04,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-25 19:08:04,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2021-11-25 19:08:04,631 INFO L87 Difference]: Start difference. First operand 241 states and 732 transitions. Second operand has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 18 states have internal predecessors, (42), 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 19:08:04,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:08:04,866 INFO L93 Difference]: Finished difference Result 361 states and 1087 transitions. [2021-11-25 19:08:04,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-25 19:08:04,866 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 18 states have internal predecessors, (42), 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 19:08:04,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:08:04,869 INFO L225 Difference]: With dead ends: 361 [2021-11-25 19:08:04,870 INFO L226 Difference]: Without dead ends: 361 [2021-11-25 19:08:04,870 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=398, Unknown=0, NotChecked=0, Total=552 [2021-11-25 19:08:04,871 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 187 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 19:08:04,871 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 28 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 19:08:04,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2021-11-25 19:08:04,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 217. [2021-11-25 19:08:04,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 3.0925925925925926) internal successors, (668), 216 states have internal predecessors, (668), 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 19:08:04,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 668 transitions. [2021-11-25 19:08:04,881 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 668 transitions. Word has length 24 [2021-11-25 19:08:04,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:08:04,881 INFO L470 AbstractCegarLoop]: Abstraction has 217 states and 668 transitions. [2021-11-25 19:08:04,882 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 18 states have internal predecessors, (42), 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 19:08:04,882 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 668 transitions. [2021-11-25 19:08:04,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-25 19:08:04,883 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:08:04,883 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 19:08:04,921 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2021-11-25 19:08:05,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:08:05,107 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 19:08:05,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:08:05,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1335182815, now seen corresponding path program 16 times [2021-11-25 19:08:05,107 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:08:05,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662800486] [2021-11-25 19:08:05,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:08:05,108 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:08:05,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:08:05,177 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 19:08:05,177 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:08:05,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662800486] [2021-11-25 19:08:05,177 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662800486] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:08:05,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1684149515] [2021-11-25 19:08:05,178 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 19:08:05,178 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:08:05,178 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:08:05,196 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:08:05,214 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-11-25 19:08:05,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:08:05,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-25 19:08:05,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:08:05,395 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 19:08:05,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:08:05,465 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 19:08:05,465 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1684149515] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:08:05,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [750351029] [2021-11-25 19:08:05,466 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 19:08:05,467 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:08:05,467 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2021-11-25 19:08:05,467 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367876006] [2021-11-25 19:08:05,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:08:05,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-25 19:08:05,468 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:08:05,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-25 19:08:05,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2021-11-25 19:08:05,469 INFO L87 Difference]: Start difference. First operand 217 states and 668 transitions. Second operand has 14 states, 14 states have (on average 2.5) internal successors, (35), 13 states have internal predecessors, (35), 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 19:08:05,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:08:05,607 INFO L93 Difference]: Finished difference Result 259 states and 805 transitions. [2021-11-25 19:08:05,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-25 19:08:05,607 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 13 states have internal predecessors, (35), 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 19:08:05,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:08:05,610 INFO L225 Difference]: With dead ends: 259 [2021-11-25 19:08:05,610 INFO L226 Difference]: Without dead ends: 259 [2021-11-25 19:08:05,610 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2021-11-25 19:08:05,611 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 82 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:08:05,611 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 20 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 19:08:05,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-11-25 19:08:05,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2021-11-25 19:08:05,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 258 states have (on average 3.12015503875969) internal successors, (805), 258 states have internal predecessors, (805), 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 19:08:05,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 805 transitions. [2021-11-25 19:08:05,635 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 805 transitions. Word has length 24 [2021-11-25 19:08:05,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:08:05,636 INFO L470 AbstractCegarLoop]: Abstraction has 259 states and 805 transitions. [2021-11-25 19:08:05,636 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 13 states have internal predecessors, (35), 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 19:08:05,637 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 805 transitions. [2021-11-25 19:08:05,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-25 19:08:05,638 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:08:05,638 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 19:08:05,673 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2021-11-25 19:08:05,863 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-11-25 19:08:05,864 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 19:08:05,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:08:05,864 INFO L85 PathProgramCache]: Analyzing trace with hash 419932923, now seen corresponding path program 17 times [2021-11-25 19:08:05,864 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:08:05,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014324369] [2021-11-25 19:08:05,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:08:05,865 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:08:05,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:08:05,940 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 19:08:05,940 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:08:05,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014324369] [2021-11-25 19:08:05,940 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014324369] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:08:05,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221231358] [2021-11-25 19:08:05,941 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 19:08:05,941 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:08:05,941 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:08:05,942 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:08:05,967 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-11-25 19:08:06,076 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 19:08:06,076 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:08:06,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-25 19:08:06,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:08:06,227 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 19:08:06,227 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:08:06,337 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 19:08:06,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1221231358] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:08:06,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [362663025] [2021-11-25 19:08:06,338 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 19:08:06,338 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:08:06,338 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2021-11-25 19:08:06,338 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161835341] [2021-11-25 19:08:06,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:08:06,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-25 19:08:06,339 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:08:06,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-25 19:08:06,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2021-11-25 19:08:06,339 INFO L87 Difference]: Start difference. First operand 259 states and 805 transitions. Second operand has 21 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 20 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 19:08:06,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:08:06,600 INFO L93 Difference]: Finished difference Result 459 states and 1432 transitions. [2021-11-25 19:08:06,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-25 19:08:06,601 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 20 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 25 [2021-11-25 19:08:06,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:08:06,604 INFO L225 Difference]: With dead ends: 459 [2021-11-25 19:08:06,604 INFO L226 Difference]: Without dead ends: 459 [2021-11-25 19:08:06,604 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=178, Invalid=524, Unknown=0, NotChecked=0, Total=702 [2021-11-25 19:08:06,605 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 237 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 19:08:06,605 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [237 Valid, 32 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 19:08:06,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2021-11-25 19:08:06,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 295. [2021-11-25 19:08:06,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 294 states have (on average 3.238095238095238) internal successors, (952), 294 states have internal predecessors, (952), 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 19:08:06,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 952 transitions. [2021-11-25 19:08:06,618 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 952 transitions. Word has length 25 [2021-11-25 19:08:06,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:08:06,618 INFO L470 AbstractCegarLoop]: Abstraction has 295 states and 952 transitions. [2021-11-25 19:08:06,618 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 20 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 19:08:06,619 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 952 transitions. [2021-11-25 19:08:06,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-25 19:08:06,620 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:08:06,620 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 19:08:06,657 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2021-11-25 19:08:06,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-11-25 19:08:06,848 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 19:08:06,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:08:06,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1275239577, now seen corresponding path program 18 times [2021-11-25 19:08:06,848 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:08:06,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428915724] [2021-11-25 19:08:06,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:08:06,848 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:08:06,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:08:06,939 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 19:08:06,939 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:08:06,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428915724] [2021-11-25 19:08:06,939 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428915724] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:08:06,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999199231] [2021-11-25 19:08:06,940 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 19:08:06,940 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:08:06,940 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:08:06,946 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:08:06,947 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-11-25 19:08:07,032 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 19:08:07,032 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:08:07,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-25 19:08:07,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:08:07,170 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 19:08:07,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:08:07,280 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 19:08:07,280 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999199231] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:08:07,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1214067171] [2021-11-25 19:08:07,280 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 19:08:07,281 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:08:07,281 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2021-11-25 19:08:07,281 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407977944] [2021-11-25 19:08:07,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:08:07,281 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-11-25 19:08:07,282 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:08:07,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-25 19:08:07,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2021-11-25 19:08:07,282 INFO L87 Difference]: Start difference. First operand 295 states and 952 transitions. Second operand has 22 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 22 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 19:08:08,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:08:08,413 INFO L93 Difference]: Finished difference Result 1017 states and 3097 transitions. [2021-11-25 19:08:08,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-11-25 19:08:08,414 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 22 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 25 [2021-11-25 19:08:08,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:08:08,422 INFO L225 Difference]: With dead ends: 1017 [2021-11-25 19:08:08,422 INFO L226 Difference]: Without dead ends: 1017 [2021-11-25 19:08:08,423 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 601 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=726, Invalid=2136, Unknown=0, NotChecked=0, Total=2862 [2021-11-25 19:08:08,424 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 372 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-25 19:08:08,424 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [372 Valid, 56 Invalid, 925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-25 19:08:08,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2021-11-25 19:08:08,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 341. [2021-11-25 19:08:08,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 3.429411764705882) internal successors, (1166), 340 states have internal predecessors, (1166), 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 19:08:08,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 1166 transitions. [2021-11-25 19:08:08,445 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 1166 transitions. Word has length 25 [2021-11-25 19:08:08,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:08:08,446 INFO L470 AbstractCegarLoop]: Abstraction has 341 states and 1166 transitions. [2021-11-25 19:08:08,446 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 22 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 19:08:08,446 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 1166 transitions. [2021-11-25 19:08:08,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-25 19:08:08,448 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:08:08,448 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 19:08:08,485 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2021-11-25 19:08:08,662 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:08:08,663 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 19:08:08,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:08:08,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1153703615, now seen corresponding path program 19 times [2021-11-25 19:08:08,663 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:08:08,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544962748] [2021-11-25 19:08:08,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:08:08,663 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:08:08,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:08:08,743 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 19:08:08,743 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:08:08,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544962748] [2021-11-25 19:08:08,744 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544962748] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:08:08,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982921643] [2021-11-25 19:08:08,744 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 19:08:08,744 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:08:08,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:08:08,748 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:08:08,752 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2021-11-25 19:08:08,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:08:08,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-25 19:08:08,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:08:08,992 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 19:08:08,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:08:09,080 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 19:08:09,080 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982921643] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:08:09,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [690690151] [2021-11-25 19:08:09,081 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 19:08:09,082 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:08:09,082 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2021-11-25 19:08:09,082 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479582555] [2021-11-25 19:08:09,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:08:09,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-25 19:08:09,083 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:08:09,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-25 19:08:09,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2021-11-25 19:08:09,084 INFO L87 Difference]: Start difference. First operand 341 states and 1166 transitions. Second operand has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 18 states have internal predecessors, (50), 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 19:08:09,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:08:09,331 INFO L93 Difference]: Finished difference Result 449 states and 1492 transitions. [2021-11-25 19:08:09,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-25 19:08:09,332 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 18 states have internal predecessors, (50), 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 19:08:09,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:08:09,335 INFO L225 Difference]: With dead ends: 449 [2021-11-25 19:08:09,335 INFO L226 Difference]: Without dead ends: 449 [2021-11-25 19:08:09,336 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=149, Invalid=403, Unknown=0, NotChecked=0, Total=552 [2021-11-25 19:08:09,336 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 112 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 19:08:09,337 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 36 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 19:08:09,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2021-11-25 19:08:09,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 341. [2021-11-25 19:08:09,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 3.429411764705882) internal successors, (1166), 340 states have internal predecessors, (1166), 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 19:08:09,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 1166 transitions. [2021-11-25 19:08:09,349 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 1166 transitions. Word has length 25 [2021-11-25 19:08:09,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:08:09,349 INFO L470 AbstractCegarLoop]: Abstraction has 341 states and 1166 transitions. [2021-11-25 19:08:09,349 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 18 states have internal predecessors, (50), 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 19:08:09,350 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 1166 transitions. [2021-11-25 19:08:09,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-25 19:08:09,351 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:08:09,351 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 19:08:09,391 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2021-11-25 19:08:09,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-11-25 19:08:09,580 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 19:08:09,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:08:09,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1145016763, now seen corresponding path program 20 times [2021-11-25 19:08:09,580 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:08:09,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218402772] [2021-11-25 19:08:09,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:08:09,580 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:08:09,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:08:09,681 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 19:08:09,681 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:08:09,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218402772] [2021-11-25 19:08:09,681 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218402772] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:08:09,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877009957] [2021-11-25 19:08:09,682 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 19:08:09,682 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:08:09,682 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:08:09,684 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:08:09,702 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2021-11-25 19:08:09,825 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 19:08:09,825 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:08:09,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-25 19:08:09,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:08:09,956 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 19:08:09,956 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:08:10,073 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 19:08:10,074 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877009957] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:08:10,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [843008906] [2021-11-25 19:08:10,074 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 19:08:10,075 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:08:10,075 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2021-11-25 19:08:10,075 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069161271] [2021-11-25 19:08:10,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:08:10,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-11-25 19:08:10,076 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:08:10,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-25 19:08:10,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2021-11-25 19:08:10,077 INFO L87 Difference]: Start difference. First operand 341 states and 1166 transitions. Second operand has 22 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 21 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 19:08:10,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:08:10,381 INFO L93 Difference]: Finished difference Result 515 states and 1707 transitions. [2021-11-25 19:08:10,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-25 19:08:10,381 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 21 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 19:08:10,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:08:10,385 INFO L225 Difference]: With dead ends: 515 [2021-11-25 19:08:10,385 INFO L226 Difference]: Without dead ends: 515 [2021-11-25 19:08:10,385 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=200, Invalid=612, Unknown=0, NotChecked=0, Total=812 [2021-11-25 19:08:10,386 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 202 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 19:08:10,386 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [202 Valid, 35 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 19:08:10,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2021-11-25 19:08:10,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 365. [2021-11-25 19:08:10,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 364 states have (on average 3.5274725274725274) internal successors, (1284), 364 states have internal predecessors, (1284), 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 19:08:10,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 1284 transitions. [2021-11-25 19:08:10,400 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 1284 transitions. Word has length 25 [2021-11-25 19:08:10,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:08:10,401 INFO L470 AbstractCegarLoop]: Abstraction has 365 states and 1284 transitions. [2021-11-25 19:08:10,401 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 21 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 19:08:10,401 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 1284 transitions. [2021-11-25 19:08:10,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-25 19:08:10,402 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:08:10,403 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 19:08:10,427 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2021-11-25 19:08:10,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-11-25 19:08:10,616 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 19:08:10,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:08:10,616 INFO L85 PathProgramCache]: Analyzing trace with hash 2000323417, now seen corresponding path program 21 times [2021-11-25 19:08:10,616 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:08:10,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842450571] [2021-11-25 19:08:10,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:08:10,616 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:08:10,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:08:10,704 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 19:08:10,704 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:08:10,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842450571] [2021-11-25 19:08:10,704 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842450571] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:08:10,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18111176] [2021-11-25 19:08:10,705 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 19:08:10,705 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:08:10,705 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:08:10,706 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:08:10,727 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2021-11-25 19:08:10,823 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 19:08:10,824 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:08:10,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-25 19:08:10,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:08:10,950 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 19:08:10,950 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:08:11,048 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 19:08:11,048 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18111176] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:08:11,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [318777296] [2021-11-25 19:08:11,049 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 19:08:11,049 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:08:11,049 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2021-11-25 19:08:11,049 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806917517] [2021-11-25 19:08:11,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:08:11,050 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-25 19:08:11,050 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:08:11,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-25 19:08:11,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2021-11-25 19:08:11,051 INFO L87 Difference]: Start difference. First operand 365 states and 1284 transitions. Second operand has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 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 19:08:12,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:08:12,141 INFO L93 Difference]: Finished difference Result 529 states and 1740 transitions. [2021-11-25 19:08:12,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-11-25 19:08:12,141 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 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 19:08:12,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:08:12,145 INFO L225 Difference]: With dead ends: 529 [2021-11-25 19:08:12,145 INFO L226 Difference]: Without dead ends: 529 [2021-11-25 19:08:12,147 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=595, Invalid=1757, Unknown=0, NotChecked=0, Total=2352 [2021-11-25 19:08:12,147 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 214 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-25 19:08:12,147 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [214 Valid, 79 Invalid, 1000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-25 19:08:12,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2021-11-25 19:08:12,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 353. [2021-11-25 19:08:12,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 352 states have (on average 3.4630681818181817) internal successors, (1219), 352 states have internal predecessors, (1219), 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 19:08:12,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 1219 transitions. [2021-11-25 19:08:12,162 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 1219 transitions. Word has length 25 [2021-11-25 19:08:12,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:08:12,163 INFO L470 AbstractCegarLoop]: Abstraction has 353 states and 1219 transitions. [2021-11-25 19:08:12,163 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 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 19:08:12,163 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 1219 transitions. [2021-11-25 19:08:12,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-25 19:08:12,165 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:08:12,165 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 19:08:12,203 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2021-11-25 19:08:12,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:08:12,392 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 19:08:12,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:08:12,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1878787455, now seen corresponding path program 22 times [2021-11-25 19:08:12,392 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:08:12,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635876201] [2021-11-25 19:08:12,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:08:12,392 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:08:12,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:08:12,477 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 19:08:12,478 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:08:12,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635876201] [2021-11-25 19:08:12,478 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635876201] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:08:12,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308386665] [2021-11-25 19:08:12,479 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 19:08:12,479 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:08:12,479 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:08:12,484 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:08:12,488 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2021-11-25 19:08:12,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:08:12,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-25 19:08:12,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:08:12,760 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 19:08:12,760 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:08:12,878 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 19:08:12,878 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [308386665] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:08:12,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1182062280] [2021-11-25 19:08:12,879 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 19:08:12,879 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:08:12,879 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2021-11-25 19:08:12,879 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130704273] [2021-11-25 19:08:12,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:08:12,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-25 19:08:12,880 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:08:12,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-25 19:08:12,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2021-11-25 19:08:12,882 INFO L87 Difference]: Start difference. First operand 353 states and 1219 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 19:08:13,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:08:13,095 INFO L93 Difference]: Finished difference Result 395 states and 1318 transitions. [2021-11-25 19:08:13,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-25 19:08:13,096 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 19:08:13,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:08:13,098 INFO L225 Difference]: With dead ends: 395 [2021-11-25 19:08:13,098 INFO L226 Difference]: Without dead ends: 395 [2021-11-25 19:08:13,099 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 19:08:13,099 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 186 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:08:13,099 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [186 Valid, 37 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 19:08:13,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2021-11-25 19:08:13,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 341. [2021-11-25 19:08:13,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 3.429411764705882) internal successors, (1166), 340 states have internal predecessors, (1166), 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 19:08:13,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 1166 transitions. [2021-11-25 19:08:13,110 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 1166 transitions. Word has length 25 [2021-11-25 19:08:13,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:08:13,111 INFO L470 AbstractCegarLoop]: Abstraction has 341 states and 1166 transitions. [2021-11-25 19:08:13,111 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 19:08:13,111 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 1166 transitions. [2021-11-25 19:08:13,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-25 19:08:13,112 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:08:13,112 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 19:08:13,152 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2021-11-25 19:08:13,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-11-25 19:08:13,340 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 19:08:13,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:08:13,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1491745607, now seen corresponding path program 23 times [2021-11-25 19:08:13,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:08:13,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003563711] [2021-11-25 19:08:13,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:08:13,340 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:08:13,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:08:13,416 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 19:08:13,417 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:08:13,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003563711] [2021-11-25 19:08:13,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003563711] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:08:13,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352424310] [2021-11-25 19:08:13,417 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 19:08:13,418 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:08:13,418 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:08:13,425 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:08:13,443 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2021-11-25 19:08:13,576 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 19:08:13,576 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:08:13,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-25 19:08:13,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:08:13,712 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 19:08:13,713 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:08:13,851 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 19:08:13,852 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352424310] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:08:13,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1247079014] [2021-11-25 19:08:13,852 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 19:08:13,852 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:08:13,852 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2021-11-25 19:08:13,853 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218316493] [2021-11-25 19:08:13,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:08:13,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-25 19:08:13,853 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:08:13,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-25 19:08:13,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2021-11-25 19:08:13,854 INFO L87 Difference]: Start difference. First operand 341 states and 1166 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 19:08:14,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:08:14,289 INFO L93 Difference]: Finished difference Result 685 states and 2264 transitions. [2021-11-25 19:08:14,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-25 19:08:14,290 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 19:08:14,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:08:14,294 INFO L225 Difference]: With dead ends: 685 [2021-11-25 19:08:14,294 INFO L226 Difference]: Without dead ends: 685 [2021-11-25 19:08:14,295 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=277, Invalid=715, Unknown=0, NotChecked=0, Total=992 [2021-11-25 19:08:14,295 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 232 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-25 19:08:14,295 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [232 Valid, 49 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-25 19:08:14,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2021-11-25 19:08:14,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 365. [2021-11-25 19:08:14,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 364 states have (on average 3.5274725274725274) internal successors, (1284), 364 states have internal predecessors, (1284), 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 19:08:14,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 1284 transitions. [2021-11-25 19:08:14,312 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 1284 transitions. Word has length 25 [2021-11-25 19:08:14,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:08:14,313 INFO L470 AbstractCegarLoop]: Abstraction has 365 states and 1284 transitions. [2021-11-25 19:08:14,313 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 19:08:14,313 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 1284 transitions. [2021-11-25 19:08:14,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-25 19:08:14,314 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:08:14,315 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 19:08:14,348 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2021-11-25 19:08:14,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-11-25 19:08:14,528 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 19:08:14,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:08:14,528 INFO L85 PathProgramCache]: Analyzing trace with hash -636438953, now seen corresponding path program 24 times [2021-11-25 19:08:14,528 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:08:14,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404688696] [2021-11-25 19:08:14,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:08:14,528 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:08:14,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:08:14,601 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 19:08:14,601 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:08:14,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404688696] [2021-11-25 19:08:14,602 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404688696] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:08:14,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870662888] [2021-11-25 19:08:14,602 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 19:08:14,602 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:08:14,602 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:08:14,603 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:08:14,615 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2021-11-25 19:08:14,725 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 19:08:14,725 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:08:14,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-25 19:08:14,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:08:14,829 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 19:08:14,829 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:08:14,936 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 19:08:14,937 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870662888] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:08:14,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1257444516] [2021-11-25 19:08:14,937 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 19:08:14,938 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:08:14,939 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 18 [2021-11-25 19:08:14,939 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179030853] [2021-11-25 19:08:14,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:08:14,939 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-25 19:08:14,939 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:08:14,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-25 19:08:14,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2021-11-25 19:08:14,941 INFO L87 Difference]: Start difference. First operand 365 states and 1284 transitions. Second operand has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 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 19:08:16,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:08:16,320 INFO L93 Difference]: Finished difference Result 671 states and 2233 transitions. [2021-11-25 19:08:16,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-11-25 19:08:16,320 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 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 19:08:16,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:08:16,325 INFO L225 Difference]: With dead ends: 671 [2021-11-25 19:08:16,325 INFO L226 Difference]: Without dead ends: 671 [2021-11-25 19:08:16,327 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 921 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=977, Invalid=2563, Unknown=0, NotChecked=0, Total=3540 [2021-11-25 19:08:16,327 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 238 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 1015 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-25 19:08:16,328 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [238 Valid, 92 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1015 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-25 19:08:16,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2021-11-25 19:08:16,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 353. [2021-11-25 19:08:16,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 352 states have (on average 3.4630681818181817) internal successors, (1219), 352 states have internal predecessors, (1219), 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 19:08:16,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 1219 transitions. [2021-11-25 19:08:16,343 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 1219 transitions. Word has length 25 [2021-11-25 19:08:16,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:08:16,343 INFO L470 AbstractCegarLoop]: Abstraction has 353 states and 1219 transitions. [2021-11-25 19:08:16,344 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 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 19:08:16,344 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 1219 transitions. [2021-11-25 19:08:16,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-25 19:08:16,345 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:08:16,345 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 19:08:16,387 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2021-11-25 19:08:16,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-11-25 19:08:16,559 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 19:08:16,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:08:16,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1750304257, now seen corresponding path program 25 times [2021-11-25 19:08:16,560 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:08:16,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778861657] [2021-11-25 19:08:16,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:08:16,560 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:08:16,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:08:16,643 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 19:08:16,643 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:08:16,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778861657] [2021-11-25 19:08:16,644 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778861657] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:08:16,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582401325] [2021-11-25 19:08:16,644 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 19:08:16,644 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:08:16,644 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:08:16,648 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:08:16,683 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2021-11-25 19:08:16,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:08:16,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-25 19:08:16,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:08:16,939 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 19:08:16,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:08:17,062 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 19:08:17,062 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582401325] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:08:17,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1983611719] [2021-11-25 19:08:17,063 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 19:08:17,063 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:08:17,063 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2021-11-25 19:08:17,063 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023236620] [2021-11-25 19:08:17,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:08:17,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-25 19:08:17,064 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:08:17,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-25 19:08:17,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2021-11-25 19:08:17,064 INFO L87 Difference]: Start difference. First operand 353 states and 1219 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 19:08:17,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:08:17,333 INFO L93 Difference]: Finished difference Result 445 states and 1484 transitions. [2021-11-25 19:08:17,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-25 19:08:17,334 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 19:08:17,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:08:17,337 INFO L225 Difference]: With dead ends: 445 [2021-11-25 19:08:17,338 INFO L226 Difference]: Without dead ends: 445 [2021-11-25 19:08:17,338 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 19:08:17,338 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 144 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 19:08:17,339 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 39 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 19:08:17,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2021-11-25 19:08:17,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 365. [2021-11-25 19:08:17,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 364 states have (on average 3.4285714285714284) internal successors, (1248), 364 states have internal predecessors, (1248), 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 19:08:17,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 1248 transitions. [2021-11-25 19:08:17,351 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 1248 transitions. Word has length 25 [2021-11-25 19:08:17,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:08:17,352 INFO L470 AbstractCegarLoop]: Abstraction has 365 states and 1248 transitions. [2021-11-25 19:08:17,352 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 19:08:17,352 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 1248 transitions. [2021-11-25 19:08:17,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-25 19:08:17,353 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:08:17,353 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 19:08:17,390 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2021-11-25 19:08:17,575 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:08:17,576 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 19:08:17,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:08:17,576 INFO L85 PathProgramCache]: Analyzing trace with hash -595372835, now seen corresponding path program 26 times [2021-11-25 19:08:17,576 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:08:17,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078950539] [2021-11-25 19:08:17,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:08:17,576 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:08:17,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:08:18,600 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 19:08:18,601 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:08:18,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078950539] [2021-11-25 19:08:18,601 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078950539] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:08:18,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453369301] [2021-11-25 19:08:18,601 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 19:08:18,601 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:08:18,601 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:08:18,602 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:08:18,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2021-11-25 19:08:18,728 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 19:08:18,728 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:08:18,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 44 conjunts are in the unsatisfiable core [2021-11-25 19:08:18,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:08:19,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:08:19,378 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 19:08:19,784 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:08:19,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:08:19,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:08:19,786 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:08:19,790 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:08:19,790 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 19:08:19,963 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 19:08:19,963 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:08:20,770 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1394 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1394) c_~A~0.base)) (.cse3 (* c_~M~0 4))) (or (let ((.cse0 (select .cse2 (+ c_~A~0.offset .cse3 4))) (.cse1 (= c_~min2~0 c_~min1~0))) (and (or (<= c_~min3~0 .cse0) (and (or (= .cse0 c_~min1~0) (<= c_~min2~0 .cse0)) (or .cse1 (< .cse0 c_~min2~0)))) (or (< .cse0 c_~min3~0) (and (or (< c_~min3~0 c_~min2~0) .cse1) (or (<= c_~min2~0 c_~min3~0) (= c_~min3~0 c_~min1~0)))))) (< (select .cse2 (+ c_~A~0.offset .cse3)) c_~min3~0)))) (forall ((v_ArrVal_1394 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1394) c_~A~0.base)) (.cse8 (* c_~M~0 4))) (let ((.cse4 (select .cse7 (+ c_~A~0.offset .cse8)))) (or (<= c_~min3~0 .cse4) (let ((.cse5 (select .cse7 (+ c_~A~0.offset .cse8 4))) (.cse6 (= c_~min2~0 c_~min1~0))) (and (or (and (or (= .cse5 c_~min1~0) (<= c_~min2~0 .cse5)) (or .cse6 (< .cse5 c_~min2~0))) (<= .cse4 .cse5)) (or (< .cse5 .cse4) (and (or (< .cse4 c_~min2~0) .cse6) (or (<= c_~min2~0 .cse4) (= c_~min1~0 .cse4))))))))))) is different from false [2021-11-25 19:08:21,641 INFO L354 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2021-11-25 19:08:21,642 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 1222 treesize of output 841 [2021-11-25 19:08:21,672 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2021-11-25 19:08:21,672 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 767 treesize of output 726 [2021-11-25 19:08:21,696 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2021-11-25 19:08:21,697 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 726 treesize of output 655 [2021-11-25 19:08:21,722 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2021-11-25 19:08:21,722 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 655 treesize of output 584 [2021-11-25 19:08:21,746 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2021-11-25 19:08:21,747 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 584 treesize of output 543 [2021-11-25 19:08:27,989 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2021-11-25 19:08:27,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453369301] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:08:27,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1658581488] [2021-11-25 19:08:27,990 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 19:08:27,991 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:08:27,991 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 11] total 36 [2021-11-25 19:08:27,991 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673528894] [2021-11-25 19:08:27,991 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:08:27,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-11-25 19:08:27,992 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:08:27,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-11-25 19:08:27,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1195, Unknown=2, NotChecked=70, Total=1406 [2021-11-25 19:08:27,993 INFO L87 Difference]: Start difference. First operand 365 states and 1248 transitions. Second operand has 38 states, 37 states have (on average 1.9189189189189189) internal successors, (71), 37 states have internal predecessors, (71), 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 19:08:32,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:08:32,877 INFO L93 Difference]: Finished difference Result 686 states and 2042 transitions. [2021-11-25 19:08:32,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-11-25 19:08:32,878 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.9189189189189189) internal successors, (71), 37 states have internal predecessors, (71), 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 19:08:32,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:08:32,883 INFO L225 Difference]: With dead ends: 686 [2021-11-25 19:08:32,883 INFO L226 Difference]: Without dead ends: 672 [2021-11-25 19:08:32,885 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 1168 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=572, Invalid=4400, Unknown=2, NotChecked=138, Total=5112 [2021-11-25 19:08:32,886 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 308 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 2526 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 2999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 2526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 428 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-11-25 19:08:32,886 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [308 Valid, 106 Invalid, 2999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 2526 Invalid, 0 Unknown, 428 Unchecked, 1.7s Time] [2021-11-25 19:08:32,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2021-11-25 19:08:32,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 423. [2021-11-25 19:08:32,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 422 states have (on average 3.3175355450236967) internal successors, (1400), 422 states have internal predecessors, (1400), 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 19:08:32,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 1400 transitions. [2021-11-25 19:08:32,899 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 1400 transitions. Word has length 26 [2021-11-25 19:08:32,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:08:32,899 INFO L470 AbstractCegarLoop]: Abstraction has 423 states and 1400 transitions. [2021-11-25 19:08:32,899 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.9189189189189189) internal successors, (71), 37 states have internal predecessors, (71), 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 19:08:32,900 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 1400 transitions. [2021-11-25 19:08:32,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-25 19:08:32,901 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:08:32,901 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 19:08:32,932 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2021-11-25 19:08:33,115 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:08:33,116 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 19:08:33,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:08:33,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1585359257, now seen corresponding path program 27 times [2021-11-25 19:08:33,116 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:08:33,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984245264] [2021-11-25 19:08:33,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:08:33,116 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:08:33,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:08:33,876 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 19:08:33,876 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:08:33,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984245264] [2021-11-25 19:08:33,877 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984245264] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:08:33,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142744253] [2021-11-25 19:08:33,877 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 19:08:33,877 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:08:33,877 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:08:33,878 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:08:33,878 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2021-11-25 19:08:34,004 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 19:08:34,004 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:08:34,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 50 conjunts are in the unsatisfiable core [2021-11-25 19:08:34,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:08:34,122 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 19:08:34,165 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 19:08:34,219 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 19:08:34,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:08:34,448 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 19:08:34,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:08:34,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:08:35,011 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:08:35,012 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 19:08:36,033 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 19:08:36,033 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:08:38,030 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_1447 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1447) c_~A~0.base))) (or (< (select .cse0 (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~A~0.offset)) c_~min1~0) (let ((.cse5 (* c_~M~0 4))) (let ((.cse4 (= c_~min2~0 c_~min1~0)) (.cse2 (select .cse0 (+ c_~A~0.offset .cse5 4)))) (let ((.cse3 (and (or .cse4 (< .cse2 c_~min2~0)) (or (<= c_~min2~0 .cse2) (= c_~min1~0 .cse2)))) (.cse1 (select .cse0 (+ c_~A~0.offset .cse5)))) (and (or (<= c_~min3~0 .cse1) (and (or (<= .cse1 .cse2) .cse3) (or (< .cse2 .cse1) (and (or (<= c_~min2~0 .cse1) (= c_~min1~0 .cse1)) (or (< .cse1 c_~min2~0) .cse4))))) (or (and (or (<= c_~min3~0 .cse2) .cse3) (or (and (or (< c_~min3~0 c_~min2~0) .cse4) (or (<= c_~min2~0 c_~min3~0) (= c_~min3~0 c_~min1~0))) (< .cse2 c_~min3~0))) (< .cse1 c_~min3~0))))))))) (forall ((v_ArrVal_1447 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1447) c_~A~0.base))) (let ((.cse6 (select .cse11 (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~A~0.offset)))) (or (<= c_~min1~0 .cse6) (let ((.cse12 (* c_~M~0 4))) (let ((.cse10 (= c_~min2~0 .cse6)) (.cse8 (select .cse11 (+ c_~A~0.offset .cse12 4)))) (let ((.cse9 (and (or (<= c_~min2~0 .cse8) (= .cse8 .cse6)) (or .cse10 (< .cse8 c_~min2~0)))) (.cse7 (select .cse11 (+ c_~A~0.offset .cse12)))) (and (or (<= c_~min3~0 .cse7) (and (or (<= .cse7 .cse8) .cse9) (or (and (or (<= c_~min2~0 .cse7) (= .cse7 .cse6)) (or .cse10 (< .cse7 c_~min2~0))) (< .cse8 .cse7)))) (or (and (or (and (or (< c_~min3~0 c_~min2~0) .cse10) (or (= c_~min3~0 .cse6) (<= c_~min2~0 c_~min3~0))) (< .cse8 c_~min3~0)) (or (<= c_~min3~0 .cse8) .cse9)) (< .cse7 c_~min3~0))))))))))) (<= (+ 2 c_~M~0) c_thread1Thread1of1ForFork2_~i~0)) is different from false [2021-11-25 19:08:39,497 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_~min1~0) (and (forall ((v_ArrVal_1447 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1447) c_~A~0.base))) (let ((.cse4 (select .cse6 (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~A~0.offset 4)))) (or (let ((.cse7 (* c_~M~0 4))) (let ((.cse5 (= c_~min2~0 .cse4)) (.cse2 (select .cse6 (+ c_~A~0.offset .cse7 4)))) (let ((.cse1 (select .cse6 (+ c_~A~0.offset .cse7))) (.cse3 (and (or .cse5 (< .cse2 c_~min2~0)) (or (<= c_~min2~0 .cse2) (= .cse2 .cse4))))) (and (or (<= c_~min3~0 .cse1) (and (or (<= .cse1 .cse2) .cse3) (or (< .cse2 .cse1) (and (or (= .cse1 .cse4) (<= c_~min2~0 .cse1)) (or (< .cse1 c_~min2~0) .cse5))))) (or (< .cse1 c_~min3~0) (and (or (and (or (= c_~min3~0 .cse4) (<= c_~min2~0 c_~min3~0)) (or (< c_~min3~0 c_~min2~0) .cse5)) (< .cse2 c_~min3~0)) (or .cse3 (<= c_~min3~0 .cse2)))))))) (<= c_~min1~0 .cse4))))) (forall ((v_ArrVal_1447 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1447) c_~A~0.base))) (or (< (select .cse8 (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~A~0.offset 4)) c_~min1~0) (let ((.cse13 (* c_~M~0 4))) (let ((.cse12 (= c_~min2~0 c_~min1~0)) (.cse10 (select .cse8 (+ c_~A~0.offset .cse13 4)))) (let ((.cse11 (and (or .cse12 (< .cse10 c_~min2~0)) (or (<= c_~min2~0 .cse10) (= c_~min1~0 .cse10)))) (.cse9 (select .cse8 (+ c_~A~0.offset .cse13)))) (and (or (<= c_~min3~0 .cse9) (and (or (<= .cse9 .cse10) .cse11) (or (< .cse10 .cse9) (and (or (<= c_~min2~0 .cse9) (= c_~min1~0 .cse9)) (or (< .cse9 c_~min2~0) .cse12))))) (or (and (or (<= c_~min3~0 .cse10) .cse11) (or (and (or (< c_~min3~0 c_~min2~0) .cse12) (or (<= c_~min2~0 c_~min3~0) (= c_~min3~0 c_~min1~0))) (< .cse10 c_~min3~0))) (< .cse9 c_~min3~0))))))))))) (or (and (forall ((v_ArrVal_1447 (Array Int Int))) (let ((.cse19 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1447) c_~A~0.base)) (.cse21 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse17 (select .cse19 (+ .cse21 c_~A~0.offset 4)))) (or (let ((.cse20 (* c_~M~0 4))) (let ((.cse18 (= c_~min2~0 .cse17)) (.cse15 (select .cse19 (+ c_~A~0.offset .cse20 4)))) (let ((.cse14 (select .cse19 (+ c_~A~0.offset .cse20))) (.cse16 (and (or .cse18 (< .cse15 c_~min2~0)) (or (<= c_~min2~0 .cse15) (= .cse15 .cse17))))) (and (or (<= c_~min3~0 .cse14) (and (or (<= .cse14 .cse15) .cse16) (or (< .cse15 .cse14) (and (or (= .cse14 .cse17) (<= c_~min2~0 .cse14)) (or (< .cse14 c_~min2~0) .cse18))))) (or (< .cse14 c_~min3~0) (and (or (and (or (= c_~min3~0 .cse17) (<= c_~min2~0 c_~min3~0)) (or (< c_~min3~0 c_~min2~0) .cse18)) (< .cse15 c_~min3~0)) (or .cse16 (<= c_~min3~0 .cse15)))))))) (<= (select (select |c_#memory_int| c_~A~0.base) (+ .cse21 c_~A~0.offset)) .cse17))))) (forall ((v_ArrVal_1447 (Array Int Int))) (let ((.cse23 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse24 (select (select |c_#memory_int| c_~A~0.base) (+ .cse23 c_~A~0.offset))) (.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1447) c_~A~0.base))) (or (< (select .cse22 (+ .cse23 c_~A~0.offset 4)) .cse24) (let ((.cse29 (* c_~M~0 4))) (let ((.cse27 (select .cse22 (+ c_~A~0.offset .cse29 4))) (.cse28 (= c_~min2~0 .cse24))) (let ((.cse26 (and (or (= .cse27 .cse24) (<= c_~min2~0 .cse27)) (or (< .cse27 c_~min2~0) .cse28))) (.cse25 (select .cse22 (+ c_~A~0.offset .cse29)))) (and (or (<= c_~min3~0 .cse25) (and (or .cse26 (<= .cse25 .cse27)) (or (and (or (= .cse25 .cse24) (<= c_~min2~0 .cse25)) (or (< .cse25 c_~min2~0) .cse28)) (< .cse27 .cse25)))) (or (and (or (and (or (< c_~min3~0 c_~min2~0) .cse28) (or (= c_~min3~0 .cse24) (<= c_~min2~0 c_~min3~0))) (< .cse27 c_~min3~0)) (or .cse26 (<= c_~min3~0 .cse27))) (< .cse25 c_~min3~0))))))))))) (<= c_~min1~0 .cse0)))) (<= (+ c_~M~0 1) c_thread1Thread1of1ForFork2_~i~0)) is different from false [2021-11-25 19:08:40,837 WARN L838 $PredicateComparison]: unable to prove that (or (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (and (or (<= c_~min1~0 .cse0) (and (forall ((v_ArrVal_1447 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1447) c_~A~0.base))) (let ((.cse5 (select .cse6 (+ c_~A~0.offset 4)))) (or (let ((.cse7 (* c_~M~0 4))) (let ((.cse4 (= c_~min2~0 .cse5)) (.cse3 (select .cse6 (+ c_~A~0.offset .cse7 4)))) (let ((.cse1 (and (or .cse4 (< .cse3 c_~min2~0)) (or (<= c_~min2~0 .cse3) (= .cse5 .cse3)))) (.cse2 (select .cse6 (+ c_~A~0.offset .cse7)))) (and (or (and (or .cse1 (<= .cse2 .cse3)) (or (< .cse3 .cse2) (and (or .cse4 (< .cse2 c_~min2~0)) (or (= .cse2 .cse5) (<= c_~min2~0 .cse2))))) (<= c_~min3~0 .cse2)) (or (and (or (and (or (< c_~min3~0 c_~min2~0) .cse4) (or (= c_~min3~0 .cse5) (<= c_~min2~0 c_~min3~0))) (< .cse3 c_~min3~0)) (or .cse1 (<= c_~min3~0 .cse3))) (< .cse2 c_~min3~0)))))) (<= (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) .cse5))))) (forall ((v_ArrVal_1447 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1447) c_~A~0.base)) (.cse9 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (or (< (select .cse8 (+ c_~A~0.offset 4)) .cse9) (let ((.cse14 (* c_~M~0 4))) (let ((.cse13 (= c_~min2~0 .cse9)) (.cse11 (select .cse8 (+ c_~A~0.offset .cse14 4)))) (let ((.cse12 (and (or .cse13 (< .cse11 c_~min2~0)) (or (= .cse9 .cse11) (<= c_~min2~0 .cse11)))) (.cse10 (select .cse8 (+ c_~A~0.offset .cse14)))) (and (or (and (or (<= .cse10 .cse11) .cse12) (or (< .cse11 .cse10) (and (or (= .cse10 .cse9) (<= c_~min2~0 .cse10)) (or (< .cse10 c_~min2~0) .cse13)))) (<= c_~min3~0 .cse10)) (or (and (or (and (or (< c_~min3~0 c_~min2~0) .cse13) (or (<= c_~min2~0 c_~min3~0) (= c_~min3~0 .cse9))) (< .cse11 c_~min3~0)) (or (<= c_~min3~0 .cse11) .cse12)) (< .cse10 c_~min3~0))))))))))) (or (< .cse0 c_~min1~0) (and (forall ((v_ArrVal_1447 (Array Int Int))) (let ((.cse20 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1447) c_~A~0.base))) (let ((.cse19 (select .cse20 (+ c_~A~0.offset 4)))) (or (let ((.cse21 (* c_~M~0 4))) (let ((.cse18 (= c_~min2~0 .cse19)) (.cse17 (select .cse20 (+ c_~A~0.offset .cse21 4)))) (let ((.cse15 (and (or .cse18 (< .cse17 c_~min2~0)) (or (<= c_~min2~0 .cse17) (= .cse19 .cse17)))) (.cse16 (select .cse20 (+ c_~A~0.offset .cse21)))) (and (or (and (or .cse15 (<= .cse16 .cse17)) (or (< .cse17 .cse16) (and (or .cse18 (< .cse16 c_~min2~0)) (or (= .cse16 .cse19) (<= c_~min2~0 .cse16))))) (<= c_~min3~0 .cse16)) (or (and (or (and (or (< c_~min3~0 c_~min2~0) .cse18) (or (= c_~min3~0 .cse19) (<= c_~min2~0 c_~min3~0))) (< .cse17 c_~min3~0)) (or .cse15 (<= c_~min3~0 .cse17))) (< .cse16 c_~min3~0)))))) (<= c_~min1~0 .cse19))))) (forall ((v_ArrVal_1447 (Array Int Int))) (let ((.cse26 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1447) c_~A~0.base))) (or (let ((.cse27 (* c_~M~0 4))) (let ((.cse25 (= c_~min2~0 c_~min1~0)) (.cse23 (select .cse26 (+ c_~A~0.offset .cse27 4)))) (let ((.cse24 (and (or .cse25 (< .cse23 c_~min2~0)) (or (<= c_~min2~0 .cse23) (= c_~min1~0 .cse23)))) (.cse22 (select .cse26 (+ c_~A~0.offset .cse27)))) (and (or (<= c_~min3~0 .cse22) (and (or (<= .cse22 .cse23) .cse24) (or (< .cse23 .cse22) (and (or (<= c_~min2~0 .cse22) (= c_~min1~0 .cse22)) (or (< .cse22 c_~min2~0) .cse25))))) (or (and (or (<= c_~min3~0 .cse23) .cse24) (or (and (or (< c_~min3~0 c_~min2~0) .cse25) (or (<= c_~min2~0 c_~min3~0) (= c_~min3~0 c_~min1~0))) (< .cse23 c_~min3~0))) (< .cse22 c_~min3~0)))))) (< (select .cse26 (+ c_~A~0.offset 4)) c_~min1~0)))))))) (<= (+ c_~M~0 1) 0)) is different from false [2021-11-25 19:09:59,748 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (and (forall ((v_ArrVal_1446 (Array Int Int))) (or (and (forall ((v_ArrVal_1447 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1446) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1447) c_~A~0.base))) (let ((.cse0 (select .cse3 (+ c_~A~0.offset 4)))) (or (let ((.cse4 (* ~M~0 4))) (let ((.cse1 (select .cse3 (+ c_~A~0.offset .cse4 4)))) (and (or (= c_~min2~0 .cse0) (< .cse1 c_~min2~0)) (let ((.cse2 (select .cse3 (+ c_~A~0.offset .cse4)))) (or (< .cse1 .cse2) (= .cse2 .cse0))) (or (< .cse1 c_~min3~0) (= c_~min3~0 .cse0))))) (<= c_~min1~0 .cse0))))) (forall ((v_ArrVal_1447 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1446) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1447) c_~A~0.base))) (or (< (select .cse5 (+ c_~A~0.offset 4)) c_~min1~0) (let ((.cse10 (* ~M~0 4))) (let ((.cse9 (= c_~min2~0 c_~min1~0)) (.cse7 (select .cse5 (+ c_~A~0.offset .cse10 4)))) (let ((.cse6 (select .cse5 (+ c_~A~0.offset .cse10))) (.cse8 (and (or (<= c_~min2~0 .cse7) (= c_~min1~0 .cse7)) (or .cse9 (< .cse7 c_~min2~0))))) (and (or (< .cse6 c_~min3~0) (and (or (<= c_~min3~0 .cse7) .cse8) (or (< .cse7 c_~min3~0) (and (or (< c_~min3~0 c_~min2~0) .cse9) (or (<= c_~min2~0 c_~min3~0) (= c_~min3~0 c_~min1~0)))))) (or (<= c_~min3~0 .cse6) (and (or (< .cse7 .cse6) (and (or (= .cse6 c_~min1~0) (<= c_~min2~0 .cse6)) (or (< .cse6 c_~min2~0) .cse9))) (or (<= .cse6 .cse7) .cse8))))))))))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1446) c_~A~0.base) c_~A~0.offset) c_~min1~0))) (forall ((v_ArrVal_1446 (Array Int Int))) (or (and (forall ((v_ArrVal_1447 (Array Int Int))) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1446))) (let ((.cse16 (select (store .cse18 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1447) c_~A~0.base)) (.cse14 (select (select .cse18 c_~A~0.base) c_~A~0.offset))) (or (let ((.cse17 (* ~M~0 4))) (let ((.cse15 (= c_~min2~0 .cse14)) (.cse13 (select .cse16 (+ c_~A~0.offset .cse17 4)))) (let ((.cse12 (and (or (<= c_~min2~0 .cse13) (= .cse13 .cse14)) (or .cse15 (< .cse13 c_~min2~0)))) (.cse11 (select .cse16 (+ c_~A~0.offset .cse17)))) (and (or (< .cse11 c_~min3~0) (and (or .cse12 (<= c_~min3~0 .cse13)) (or (< .cse13 c_~min3~0) (and (or (<= c_~min2~0 c_~min3~0) (= c_~min3~0 .cse14)) (or (< c_~min3~0 c_~min2~0) .cse15))))) (or (and (or (and (or (< .cse11 c_~min2~0) .cse15) (or (= .cse11 .cse14) (<= c_~min2~0 .cse11))) (< .cse13 .cse11)) (or .cse12 (<= .cse11 .cse13))) (<= c_~min3~0 .cse11)))))) (< (select .cse16 (+ c_~A~0.offset 4)) .cse14))))) (forall ((v_ArrVal_1447 (Array Int Int))) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1446))) (let ((.cse22 (select (store .cse24 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1447) c_~A~0.base))) (let ((.cse19 (select .cse22 (+ c_~A~0.offset 4)))) (or (let ((.cse23 (* ~M~0 4))) (let ((.cse20 (select .cse22 (+ c_~A~0.offset .cse23 4)))) (and (or (= c_~min2~0 .cse19) (< .cse20 c_~min2~0)) (let ((.cse21 (select .cse22 (+ c_~A~0.offset .cse23)))) (or (< .cse20 .cse21) (= .cse21 .cse19))) (or (< .cse20 c_~min3~0) (= c_~min3~0 .cse19))))) (<= (select (select .cse24 c_~A~0.base) c_~A~0.offset) .cse19))))))) (<= c_~min1~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1446) c_~A~0.base) c_~A~0.offset))))) (<= (+ ~M~0 1) 0) (< 0 ~M~0))) is different from false [2021-11-25 19:11:26,116 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (<= (+ ~M~0 1) 0) (< 0 ~M~0) (and (forall ((v_ArrVal_1446 (Array Int Int)) (v_ArrVal_1445 (Array Int Int))) (or (and (forall ((v_ArrVal_1447 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1445) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1446) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1447) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< (select .cse0 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min1~0) (let ((.cse5 (* ~M~0 4))) (let ((.cse2 (select .cse0 (+ .cse5 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse3 (= c_~min2~0 c_~min1~0))) (let ((.cse4 (and (or (<= c_~min2~0 .cse2) (= c_~min1~0 .cse2)) (or (< .cse2 c_~min2~0) .cse3))) (.cse1 (select .cse0 (+ .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (and (or (< .cse1 c_~min3~0) (and (or (< .cse2 c_~min3~0) (and (or (< c_~min3~0 c_~min2~0) .cse3) (or (<= c_~min2~0 c_~min3~0) (= c_~min3~0 c_~min1~0)))) (or .cse4 (<= c_~min3~0 .cse2)))) (or (<= c_~min3~0 .cse1) (and (or (and (or (< .cse1 c_~min2~0) .cse3) (or (<= c_~min2~0 .cse1) (= c_~min1~0 .cse1))) (< .cse2 .cse1)) (or .cse4 (<= .cse1 .cse2))))))))))) (forall ((v_ArrVal_1447 (Array Int Int))) (let ((.cse9 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1445) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1446) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1447) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse6 (select .cse9 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (<= c_~min1~0 .cse6) (let ((.cse10 (* ~M~0 4))) (let ((.cse7 (select .cse9 (+ .cse10 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (and (or (< .cse7 c_~min3~0) (= c_~min3~0 .cse6)) (let ((.cse8 (select .cse9 (+ .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< .cse7 .cse8) (= .cse8 .cse6))) (or (< .cse7 c_~min2~0) (= c_~min2~0 .cse6)))))))))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1445) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1446) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0))) (forall ((v_ArrVal_1446 (Array Int Int)) (v_ArrVal_1445 (Array Int Int))) (or (and (forall ((v_ArrVal_1447 (Array Int Int))) (let ((.cse18 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1445) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1446))) (let ((.cse16 (select (store .cse18 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1447) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse14 (select (select .cse18 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (let ((.cse17 (* ~M~0 4))) (let ((.cse15 (= c_~min2~0 .cse14)) (.cse13 (select .cse16 (+ .cse17 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse11 (and (or (< .cse13 c_~min2~0) .cse15) (or (<= c_~min2~0 .cse13) (= .cse13 .cse14)))) (.cse12 (select .cse16 (+ .cse17 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (and (or (and (or .cse11 (<= .cse12 .cse13)) (or (and (or (<= c_~min2~0 .cse12) (= .cse12 .cse14)) (or (< .cse12 c_~min2~0) .cse15)) (< .cse13 .cse12))) (<= c_~min3~0 .cse12)) (or (and (or (< .cse13 c_~min3~0) (and (or (< c_~min3~0 c_~min2~0) .cse15) (or (<= c_~min2~0 c_~min3~0) (= c_~min3~0 .cse14)))) (or .cse11 (<= c_~min3~0 .cse13))) (< .cse12 c_~min3~0)))))) (< (select .cse16 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse14))))) (forall ((v_ArrVal_1447 (Array Int Int))) (let ((.cse24 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1445) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1446))) (let ((.cse22 (select (store .cse24 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1447) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse20 (select .cse22 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (let ((.cse23 (* ~M~0 4))) (let ((.cse19 (select .cse22 (+ .cse23 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (and (or (< .cse19 c_~min3~0) (= c_~min3~0 .cse20)) (let ((.cse21 (select .cse22 (+ .cse23 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< .cse19 .cse21) (= .cse21 .cse20))) (or (< .cse19 c_~min2~0) (= c_~min2~0 .cse20))))) (<= (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_~min1~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1445) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1446) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) is different from false [2021-11-25 19:11:26,318 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:11:26,318 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 2081 treesize of output 1302 [2021-11-25 19:11:26,629 INFO L354 Elim1Store]: treesize reduction 106, result has 24.8 percent of original size [2021-11-25 19:11:26,634 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 52588 treesize of output 49092 [2021-11-25 19:11:28,882 INFO L354 Elim1Store]: treesize reduction 73, result has 11.0 percent of original size [2021-11-25 19:11:28,886 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 49021 treesize of output 46382 [2021-11-25 19:11:29,728 INFO L354 Elim1Store]: treesize reduction 43, result has 8.5 percent of original size [2021-11-25 19:11:29,732 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 46373 treesize of output 44810 [2021-11-25 19:11:30,629 INFO L354 Elim1Store]: treesize reduction 73, result has 11.0 percent of original size [2021-11-25 19:11:30,632 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 44805 treesize of output 43490 [2021-11-25 19:11:31,487 INFO L354 Elim1Store]: treesize reduction 43, result has 8.5 percent of original size [2021-11-25 19:11:31,490 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 43481 treesize of output 39774 [2021-11-25 19:11:32,368 INFO L354 Elim1Store]: treesize reduction 43, result has 8.5 percent of original size [2021-11-25 19:11:32,371 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 39769 treesize of output 39286 [2021-11-25 19:11:33,233 INFO L354 Elim1Store]: treesize reduction 73, result has 11.0 percent of original size [2021-11-25 19:11:33,237 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 39281 treesize of output 36942 [2021-11-25 19:11:35,459 INFO L354 Elim1Store]: treesize reduction 73, result has 11.0 percent of original size [2021-11-25 19:11:35,462 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 36789 treesize of output 35624 [2021-11-25 19:11:37,611 INFO L354 Elim1Store]: treesize reduction 43, result has 8.5 percent of original size [2021-11-25 19:11:37,614 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 35583 treesize of output 32580 [2021-11-25 19:11:38,325 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-11-25 19:11:38,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [860565883] [2021-11-25 19:11:38,326 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 19:11:38,328 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-25 19:11:38,328 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2021-11-25 19:11:38,328 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480738482] [2021-11-25 19:11:38,328 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-25 19:11:38,329 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-25 19:11:38,329 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:11:38,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-25 19:11:38,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1311, Unknown=9, NotChecked=390, Total=1892 [2021-11-25 19:11:38,331 INFO L87 Difference]: Start difference. First operand 423 states and 1400 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 19:11:40,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:11:40,676 INFO L93 Difference]: Finished difference Result 538 states and 1668 transitions. [2021-11-25 19:11:40,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-25 19:11:40,677 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 19:11:40,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:11:40,682 INFO L225 Difference]: With dead ends: 538 [2021-11-25 19:11:40,682 INFO L226 Difference]: Without dead ends: 531 [2021-11-25 19:11:40,684 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 563 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=335, Invalid=2126, Unknown=9, NotChecked=500, Total=2970 [2021-11-25 19:11:40,684 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 103 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-25 19:11:40,685 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 53 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-25 19:11:40,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2021-11-25 19:11:40,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 427. [2021-11-25 19:11:40,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 426 states have (on average 3.3098591549295775) internal successors, (1410), 426 states have internal predecessors, (1410), 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 19:11:40,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 1410 transitions. [2021-11-25 19:11:40,701 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 1410 transitions. Word has length 26 [2021-11-25 19:11:40,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:11:40,702 INFO L470 AbstractCegarLoop]: Abstraction has 427 states and 1410 transitions. [2021-11-25 19:11:40,702 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 19:11:40,702 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 1410 transitions. [2021-11-25 19:11:40,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-25 19:11:40,704 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:11:40,704 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 19:11:40,751 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2021-11-25 19:11:40,924 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2021-11-25 19:11:40,924 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 19:11:40,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:11:40,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1240404193, now seen corresponding path program 28 times [2021-11-25 19:11:40,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:11:40,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716869837] [2021-11-25 19:11:40,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:11:40,925 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:11:40,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:11:42,091 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 19:11:42,091 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:11:42,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716869837] [2021-11-25 19:11:42,091 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716869837] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:11:42,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481037337] [2021-11-25 19:11:42,092 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 19:11:42,092 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:11:42,092 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:11:42,096 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:11:42,099 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2021-11-25 19:11:42,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:11:42,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 44 conjunts are in the unsatisfiable core [2021-11-25 19:11:42,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:11:42,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:11:42,773 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 19:11:43,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:11:43,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:11:43,340 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:11:43,341 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 19:11:44,955 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 19:11:44,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:11:48,209 INFO L354 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2021-11-25 19:11:48,209 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 19:11:48,254 INFO L354 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2021-11-25 19:11:48,255 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 773 [2021-11-25 19:11:48,302 INFO L354 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2021-11-25 19:11:48,302 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 746 treesize of output 654 [2021-11-25 19:12:04,779 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 19:12:04,779 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481037337] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:12:04,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [635481367] [2021-11-25 19:12:04,780 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 19:12:04,780 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:12:04,780 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 42 [2021-11-25 19:12:04,780 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148193511] [2021-11-25 19:12:04,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:12:04,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2021-11-25 19:12:04,781 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:12:04,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-11-25 19:12:04,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1679, Unknown=1, NotChecked=0, Total=1892 [2021-11-25 19:12:04,783 INFO L87 Difference]: Start difference. First operand 427 states and 1410 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 19:12:07,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:12:07,558 INFO L93 Difference]: Finished difference Result 528 states and 1667 transitions. [2021-11-25 19:12:07,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-25 19:12:07,559 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 19:12:07,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:12:07,562 INFO L225 Difference]: With dead ends: 528 [2021-11-25 19:12:07,562 INFO L226 Difference]: Without dead ends: 521 [2021-11-25 19:12:07,563 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 849 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=472, Invalid=2833, Unknown=1, NotChecked=0, Total=3306 [2021-11-25 19:12:07,563 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 189 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 1534 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 1668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 99 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-11-25 19:12:07,564 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [189 Valid, 89 Invalid, 1668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1534 Invalid, 0 Unknown, 99 Unchecked, 1.5s Time] [2021-11-25 19:12:07,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2021-11-25 19:12:07,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 429. [2021-11-25 19:12:07,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 428 states have (on average 3.30607476635514) internal successors, (1415), 428 states have internal predecessors, (1415), 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 19:12:07,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 1415 transitions. [2021-11-25 19:12:07,579 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 1415 transitions. Word has length 26 [2021-11-25 19:12:07,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:12:07,580 INFO L470 AbstractCegarLoop]: Abstraction has 429 states and 1415 transitions. [2021-11-25 19:12:07,580 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 19:12:07,580 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 1415 transitions. [2021-11-25 19:12:07,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-25 19:12:07,582 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:12:07,582 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 19:12:07,607 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2021-11-25 19:12:07,782 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2021-11-25 19:12:07,783 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 19:12:07,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:12:07,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1029178039, now seen corresponding path program 29 times [2021-11-25 19:12:07,783 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:12:07,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944015893] [2021-11-25 19:12:07,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:12:07,783 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:12:07,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:12:09,067 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 19:12:09,068 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:12:09,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944015893] [2021-11-25 19:12:09,068 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944015893] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:12:09,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884851543] [2021-11-25 19:12:09,068 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 19:12:09,068 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:12:09,068 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:12:09,069 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:12:09,070 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2021-11-25 19:12:09,246 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-11-25 19:12:09,246 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:12:09,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 52 conjunts are in the unsatisfiable core [2021-11-25 19:12:09,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:12:09,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:12:09,861 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 19:12:10,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:12:10,494 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:12:10,520 INFO L354 Elim1Store]: treesize reduction 10, result has 72.2 percent of original size [2021-11-25 19:12:10,520 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 98 [2021-11-25 19:12:11,604 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 19:12:11,604 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:12:12,525 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:12:12,537 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:12:12,549 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:12:12,567 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:12:12,579 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:12:12,591 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:12:28,436 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_thread3Thread1of1ForFork1_~i~2_169 Int)) (or (< (+ v_thread3Thread1of1ForFork1_~i~2_169 1) c_~N~0) (<= c_~N~0 v_thread3Thread1of1ForFork1_~i~2_169) (and (forall ((v_ArrVal_1545 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1545) c_~A~0.base))) (let ((.cse7 (select .cse11 (+ c_~A~0.offset (* c_~M~0 4))))) (or (let ((.cse1 (select .cse11 (+ (* v_thread3Thread1of1ForFork1_~i~2_169 4) c_~A~0.offset)))) (let ((.cse2 (select .cse11 (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~A~0.offset))) (.cse6 (<= c_~min2~0 .cse7)) (.cse8 (< .cse7 c_~min2~0)) (.cse9 (< .cse1 .cse7)) (.cse0 (<= c_~min2~0 .cse1)) (.cse4 (< .cse1 c_~min2~0)) (.cse5 (<= .cse7 .cse1))) (and (or (let ((.cse3 (= c_~min2~0 .cse2))) (and (or (and (or .cse0 (= .cse1 .cse2)) (or .cse3 .cse4)) .cse5) (or (and (or .cse6 (= .cse2 .cse7)) (or .cse3 .cse8)) .cse9))) (<= c_~min1~0 .cse2)) (or (< .cse2 c_~min1~0) (let ((.cse10 (= c_~min2~0 c_~min1~0))) (and (or (and (or .cse6 (= c_~min1~0 .cse7)) (or .cse8 .cse10)) .cse9) (or (and (or .cse0 (= .cse1 c_~min1~0)) (or .cse10 .cse4)) .cse5))))))) (<= c_~min3~0 .cse7))))) (forall ((v_ArrVal_1545 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1545) c_~A~0.base))) (or (< (select .cse12 (+ c_~A~0.offset (* c_~M~0 4))) c_~min3~0) (let ((.cse14 (select .cse12 (+ (* v_thread3Thread1of1ForFork1_~i~2_169 4) c_~A~0.offset)))) (let ((.cse21 (< .cse14 c_~min3~0)) (.cse20 (< c_~min3~0 c_~min2~0)) (.cse19 (<= c_~min2~0 c_~min3~0)) (.cse13 (<= c_~min2~0 .cse14)) (.cse17 (< .cse14 c_~min2~0)) (.cse18 (<= c_~min3~0 .cse14)) (.cse15 (select .cse12 (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~A~0.offset)))) (and (or (let ((.cse16 (= c_~min2~0 .cse15))) (and (or (and (or .cse13 (= .cse14 .cse15)) (or .cse16 .cse17)) .cse18) (or (and (or (= c_~min3~0 .cse15) .cse19) (or .cse20 .cse16)) .cse21))) (<= c_~min1~0 .cse15)) (or (let ((.cse22 (= c_~min2~0 c_~min1~0))) (and (or .cse21 (and (or .cse20 .cse22) (or .cse19 (= c_~min3~0 c_~min1~0)))) (or (and (or .cse13 (= .cse14 c_~min1~0)) (or .cse22 .cse17)) .cse18))) (< .cse15 c_~min1~0))))))))))) is different from false [2021-11-25 19:12:28,652 INFO L354 Elim1Store]: treesize reduction 35, result has 65.0 percent of original size [2021-11-25 19:12:28,653 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 1313 treesize of output 989 [2021-11-25 19:12:28,700 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:12:28,700 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 903 treesize of output 786 [2021-11-25 19:12:28,751 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:12:28,752 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 735 treesize of output 678 [2021-11-25 19:13:19,599 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 19:13:19,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [884851543] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:13:19,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1307918563] [2021-11-25 19:13:19,600 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 19:13:19,600 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:13:19,601 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 42 [2021-11-25 19:13:19,601 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134247747] [2021-11-25 19:13:19,602 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:13:19,602 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2021-11-25 19:13:19,602 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:13:19,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-11-25 19:13:19,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=1596, Unknown=1, NotChecked=82, Total=1892 [2021-11-25 19:13:19,603 INFO L87 Difference]: Start difference. First operand 429 states and 1415 transitions. Second operand has 44 states, 43 states have (on average 1.6511627906976745) internal successors, (71), 43 states have internal predecessors, (71), 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 19:13:26,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:13:26,288 INFO L93 Difference]: Finished difference Result 687 states and 2078 transitions. [2021-11-25 19:13:26,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-11-25 19:13:26,288 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 1.6511627906976745) internal successors, (71), 43 states have internal predecessors, (71), 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 19:13:26,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:13:26,290 INFO L225 Difference]: With dead ends: 687 [2021-11-25 19:13:26,290 INFO L226 Difference]: Without dead ends: 673 [2021-11-25 19:13:26,291 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 73 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 1509 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=783, Invalid=4622, Unknown=1, NotChecked=144, Total=5550 [2021-11-25 19:13:26,292 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 331 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 1193 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 2081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 805 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:13:26,292 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [331 Valid, 113 Invalid, 2081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1193 Invalid, 0 Unknown, 805 Unchecked, 1.1s Time] [2021-11-25 19:13:26,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2021-11-25 19:13:26,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 478. [2021-11-25 19:13:26,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 477 states have (on average 3.280922431865828) internal successors, (1565), 477 states have internal predecessors, (1565), 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 19:13:26,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 1565 transitions. [2021-11-25 19:13:26,307 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 1565 transitions. Word has length 26 [2021-11-25 19:13:26,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:13:26,308 INFO L470 AbstractCegarLoop]: Abstraction has 478 states and 1565 transitions. [2021-11-25 19:13:26,308 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 1.6511627906976745) internal successors, (71), 43 states have internal predecessors, (71), 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 19:13:26,308 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 1565 transitions. [2021-11-25 19:13:26,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-25 19:13:26,310 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:13:26,310 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 19:13:26,349 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2021-11-25 19:13:26,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:13:26,532 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 19:13:26,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:13:26,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1304601805, now seen corresponding path program 30 times [2021-11-25 19:13:26,532 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:13:26,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121886485] [2021-11-25 19:13:26,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:13:26,533 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:13:26,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:13:27,893 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 19:13:27,893 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:13:27,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121886485] [2021-11-25 19:13:27,894 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121886485] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:13:27,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661965170] [2021-11-25 19:13:27,894 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 19:13:27,894 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:13:27,894 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:13:27,895 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:13:27,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2021-11-25 19:13:28,054 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 19:13:28,054 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:13:28,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 50 conjunts are in the unsatisfiable core [2021-11-25 19:13:28,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:13:28,184 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 19:13:28,250 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 19:13:28,312 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 19:13:28,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:13:28,595 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 19:13:29,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:13:29,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:13:29,191 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:13:29,191 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 19:13:30,726 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 19:13:30,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:13:33,682 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_1598 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1598) c_~A~0.base)) (.cse12 (* c_~M~0 4))) (let ((.cse0 (select .cse11 (+ c_~A~0.offset .cse12)))) (or (<= c_~min3~0 .cse0) (let ((.cse7 (select .cse11 (+ c_~A~0.offset .cse12 4)))) (let ((.cse1 (select .cse11 (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~A~0.offset))) (.cse2 (< .cse7 .cse0)) (.cse3 (< .cse0 c_~min2~0)) (.cse5 (<= c_~min2~0 .cse0)) (.cse8 (<= c_~min2~0 .cse7)) (.cse6 (< .cse7 c_~min2~0)) (.cse9 (<= .cse0 .cse7))) (and (or (<= c_~min1~0 .cse1) (let ((.cse4 (= c_~min2~0 .cse1))) (and (or .cse2 (and (or .cse3 .cse4) (or .cse5 (= .cse0 .cse1)))) (or (and (or .cse6 .cse4) (or (= .cse7 .cse1) .cse8)) .cse9)))) (or (< .cse1 c_~min1~0) (let ((.cse10 (= c_~min2~0 c_~min1~0))) (and (or .cse2 (and (or .cse3 .cse10) (or .cse5 (= c_~min1~0 .cse0)))) (or (and (or (= c_~min1~0 .cse7) .cse8) (or .cse10 .cse6)) .cse9))))))))))) (forall ((v_ArrVal_1598 (Array Int Int))) (let ((.cse23 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1598) c_~A~0.base)) (.cse24 (* c_~M~0 4))) (or (let ((.cse13 (select .cse23 (+ c_~A~0.offset .cse24 4)))) (let ((.cse20 (< .cse13 c_~min3~0)) (.cse18 (< c_~min3~0 c_~min2~0)) (.cse19 (<= c_~min2~0 c_~min3~0)) (.cse17 (<= c_~min3~0 .cse13)) (.cse16 (< .cse13 c_~min2~0)) (.cse14 (<= c_~min2~0 .cse13)) (.cse21 (select .cse23 (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~A~0.offset)))) (and (or (let ((.cse15 (= c_~min2~0 c_~min1~0))) (and (or (and (or (= c_~min1~0 .cse13) .cse14) (or .cse15 .cse16)) .cse17) (or (and (or .cse18 .cse15) (or .cse19 (= c_~min3~0 c_~min1~0))) .cse20))) (< .cse21 c_~min1~0)) (or (<= c_~min1~0 .cse21) (let ((.cse22 (= c_~min2~0 .cse21))) (and (or .cse20 (and (or .cse18 .cse22) (or (= c_~min3~0 .cse21) .cse19))) (or .cse17 (and (or .cse16 .cse22) (or (= .cse13 .cse21) .cse14))))))))) (< (select .cse23 (+ c_~A~0.offset .cse24)) c_~min3~0))))) (<= (+ 2 c_~M~0) c_thread1Thread1of1ForFork2_~i~0)) is different from false [2021-11-25 19:13:35,841 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_~min1~0) (and (forall ((v_ArrVal_1598 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1598) c_~A~0.base)) (.cse13 (* c_~M~0 4))) (let ((.cse1 (select .cse12 (+ c_~A~0.offset .cse13)))) (or (<= c_~min3~0 .cse1) (let ((.cse5 (select .cse12 (+ c_~A~0.offset .cse13 4)))) (let ((.cse4 (select .cse12 (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~A~0.offset 4))) (.cse8 (< .cse5 .cse1)) (.cse10 (< .cse1 c_~min2~0)) (.cse9 (<= c_~min2~0 .cse1)) (.cse6 (<= c_~min2~0 .cse5)) (.cse3 (< .cse5 c_~min2~0)) (.cse7 (<= .cse1 .cse5))) (and (or (let ((.cse2 (= c_~min2~0 .cse4))) (and (or (and (or .cse2 .cse3) (or (= .cse4 .cse5) .cse6)) .cse7) (or .cse8 (and (or .cse9 (= .cse1 .cse4)) (or .cse10 .cse2))))) (<= c_~min1~0 .cse4)) (or (< .cse4 c_~min1~0) (let ((.cse11 (= c_~min2~0 c_~min1~0))) (and (or .cse8 (and (or .cse10 .cse11) (or .cse9 (= c_~min1~0 .cse1)))) (or (and (or (= c_~min1~0 .cse5) .cse6) (or .cse11 .cse3)) .cse7))))))))))) (forall ((v_ArrVal_1598 (Array Int Int))) (let ((.cse24 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1598) c_~A~0.base)) (.cse25 (* c_~M~0 4))) (or (let ((.cse14 (select .cse24 (+ c_~A~0.offset .cse25 4)))) (let ((.cse17 (< .cse14 c_~min2~0)) (.cse15 (<= c_~min2~0 .cse14)) (.cse18 (<= c_~min3~0 .cse14)) (.cse19 (< c_~min3~0 c_~min2~0)) (.cse20 (<= c_~min2~0 c_~min3~0)) (.cse21 (< .cse14 c_~min3~0)) (.cse22 (select .cse24 (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~A~0.offset 4)))) (and (or (let ((.cse16 (= c_~min2~0 c_~min1~0))) (and (or (and (or (= c_~min1~0 .cse14) .cse15) (or .cse16 .cse17)) .cse18) (or (and (or .cse19 .cse16) (or .cse20 (= c_~min3~0 c_~min1~0))) .cse21))) (< .cse22 c_~min1~0)) (or (let ((.cse23 (= c_~min2~0 .cse22))) (and (or (and (or .cse23 .cse17) (or (= .cse22 .cse14) .cse15)) .cse18) (or (and (or .cse19 .cse23) (or (= c_~min3~0 .cse22) .cse20)) .cse21))) (<= c_~min1~0 .cse22))))) (< (select .cse24 (+ c_~A~0.offset .cse25)) c_~min3~0)))))) (or (and (forall ((v_ArrVal_1598 (Array Int Int))) (let ((.cse26 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1598) c_~A~0.base)) (.cse27 (* c_~M~0 4))) (or (< (select .cse26 (+ c_~A~0.offset .cse27)) c_~min3~0) (let ((.cse31 (select .cse26 (+ c_~A~0.offset .cse27 4))) (.cse39 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse29 (select (select |c_#memory_int| c_~A~0.base) (+ .cse39 c_~A~0.offset))) (.cse32 (< .cse31 c_~min2~0)) (.cse30 (<= c_~min2~0 .cse31)) (.cse34 (<= c_~min3~0 .cse31)) (.cse35 (< c_~min3~0 c_~min2~0)) (.cse36 (<= c_~min2~0 c_~min3~0)) (.cse37 (< .cse31 c_~min3~0)) (.cse28 (select .cse26 (+ .cse39 c_~A~0.offset 4)))) (and (or (< .cse28 .cse29) (let ((.cse33 (= c_~min2~0 .cse29))) (and (or (and (or .cse30 (= .cse31 .cse29)) (or .cse32 .cse33)) .cse34) (or (and (or .cse35 .cse33) (or (= c_~min3~0 .cse29) .cse36)) .cse37)))) (or (<= .cse29 .cse28) (let ((.cse38 (= c_~min2~0 .cse28))) (and (or (and (or .cse38 .cse32) (or (= .cse28 .cse31) .cse30)) .cse34) (or (and (or .cse35 .cse38) (or (= c_~min3~0 .cse28) .cse36)) .cse37)))))))))) (forall ((v_ArrVal_1598 (Array Int Int))) (let ((.cse53 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1598) c_~A~0.base)) (.cse54 (* c_~M~0 4))) (let ((.cse40 (select .cse53 (+ c_~A~0.offset .cse54)))) (or (<= c_~min3~0 .cse40) (let ((.cse45 (select .cse53 (+ c_~A~0.offset .cse54 4))) (.cse52 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse42 (select .cse53 (+ .cse52 c_~A~0.offset 4))) (.cse46 (<= c_~min2~0 .cse45)) (.cse44 (< .cse45 c_~min2~0)) (.cse47 (<= .cse40 .cse45)) (.cse48 (< .cse45 .cse40)) (.cse49 (<= c_~min2~0 .cse40)) (.cse50 (< .cse40 c_~min2~0)) (.cse41 (select (select |c_#memory_int| c_~A~0.base) (+ .cse52 c_~A~0.offset)))) (and (or (<= .cse41 .cse42) (let ((.cse43 (= c_~min2~0 .cse42))) (and (or (and (or .cse43 .cse44) (or (= .cse42 .cse45) .cse46)) .cse47) (or .cse48 (and (or .cse49 (= .cse40 .cse42)) (or .cse50 .cse43)))))) (or (< .cse42 .cse41) (let ((.cse51 (= c_~min2~0 .cse41))) (and (or (and (or .cse46 (= .cse45 .cse41)) (or .cse44 .cse51)) .cse47) (or .cse48 (and (or .cse49 (= .cse40 .cse41)) (or .cse50 .cse51)))))))))))))) (<= c_~min1~0 .cse0)))) (<= (+ c_~M~0 1) c_thread1Thread1of1ForFork2_~i~0)) is different from false [2021-11-25 19:13:37,762 WARN L838 $PredicateComparison]: unable to prove that (or (<= (+ c_~M~0 1) 0) (let ((.cse25 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (and (or (and (forall ((v_ArrVal_1598 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1598) c_~A~0.base)) (.cse12 (* c_~M~0 4))) (let ((.cse0 (select .cse11 (+ c_~A~0.offset .cse12)))) (or (<= c_~min3~0 .cse0) (let ((.cse7 (select .cse11 (+ c_~A~0.offset .cse12 4)))) (let ((.cse1 (select .cse11 (+ c_~A~0.offset 4))) (.cse5 (< .cse7 .cse0)) (.cse3 (< .cse0 c_~min2~0)) (.cse4 (<= c_~min2~0 .cse0)) (.cse8 (<= c_~min2~0 .cse7)) (.cse6 (< .cse7 c_~min2~0)) (.cse9 (<= .cse0 .cse7))) (and (or (<= c_~min1~0 .cse1) (let ((.cse2 (= c_~min2~0 .cse1))) (and (or (and (or .cse2 .cse3) (or .cse4 (= .cse0 .cse1))) .cse5) (or (and (or .cse2 .cse6) (or (= .cse1 .cse7) .cse8)) .cse9)))) (or (< .cse1 c_~min1~0) (let ((.cse10 (= c_~min2~0 c_~min1~0))) (and (or .cse5 (and (or .cse3 .cse10) (or .cse4 (= c_~min1~0 .cse0)))) (or (and (or (= c_~min1~0 .cse7) .cse8) (or .cse10 .cse6)) .cse9))))))))))) (forall ((v_ArrVal_1598 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1598) c_~A~0.base)) (.cse14 (* c_~M~0 4))) (or (< (select .cse13 (+ c_~A~0.offset .cse14)) c_~min3~0) (let ((.cse21 (select .cse13 (+ c_~A~0.offset .cse14 4)))) (let ((.cse22 (<= c_~min2~0 .cse21)) (.cse20 (< .cse21 c_~min2~0)) (.cse23 (<= c_~min3~0 .cse21)) (.cse16 (< c_~min3~0 c_~min2~0)) (.cse18 (<= c_~min2~0 c_~min3~0)) (.cse19 (< .cse21 c_~min3~0)) (.cse15 (select .cse13 (+ c_~A~0.offset 4)))) (and (or (<= c_~min1~0 .cse15) (let ((.cse17 (= c_~min2~0 .cse15))) (and (or (and (or .cse16 .cse17) (or .cse18 (= c_~min3~0 .cse15))) .cse19) (or (and (or .cse17 .cse20) (or (= .cse15 .cse21) .cse22)) .cse23)))) (or (let ((.cse24 (= c_~min2~0 c_~min1~0))) (and (or (and (or (= c_~min1~0 .cse21) .cse22) (or .cse24 .cse20)) .cse23) (or (and (or .cse16 .cse24) (or .cse18 (= c_~min3~0 c_~min1~0))) .cse19))) (< .cse15 c_~min1~0))))))))) (< .cse25 c_~min1~0)) (or (and (forall ((v_ArrVal_1598 (Array Int Int))) (let ((.cse38 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1598) c_~A~0.base)) (.cse39 (* c_~M~0 4))) (let ((.cse26 (select .cse38 (+ c_~A~0.offset .cse39)))) (or (<= c_~min3~0 .cse26) (let ((.cse34 (select .cse38 (+ c_~A~0.offset .cse39 4)))) (let ((.cse28 (select .cse38 (+ c_~A~0.offset 4))) (.cse33 (< .cse34 c_~min2~0)) (.cse35 (<= c_~min2~0 .cse34)) (.cse36 (<= .cse26 .cse34)) (.cse31 (<= c_~min2~0 .cse26)) (.cse30 (< .cse26 c_~min2~0)) (.cse32 (< .cse34 .cse26)) (.cse27 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (and (or (<= .cse27 .cse28) (let ((.cse29 (= c_~min2~0 .cse28))) (and (or (and (or .cse29 .cse30) (or .cse31 (= .cse26 .cse28))) .cse32) (or (and (or .cse29 .cse33) (or (= .cse28 .cse34) .cse35)) .cse36)))) (or (< .cse28 .cse27) (let ((.cse37 (= c_~min2~0 .cse27))) (and (or (and (or .cse33 .cse37) (or .cse35 (= .cse27 .cse34))) .cse36) (or (and (or .cse31 (= .cse27 .cse26)) (or .cse30 .cse37)) .cse32))))))))))) (forall ((v_ArrVal_1598 (Array Int Int))) (let ((.cse40 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1598) c_~A~0.base)) (.cse41 (* c_~M~0 4))) (or (< (select .cse40 (+ c_~A~0.offset .cse41)) c_~min3~0) (let ((.cse47 (select .cse40 (+ c_~A~0.offset .cse41 4)))) (let ((.cse43 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset)) (.cse49 (< c_~min3~0 c_~min2~0)) (.cse50 (<= c_~min2~0 c_~min3~0)) (.cse51 (< .cse47 c_~min3~0)) (.cse44 (< .cse47 c_~min2~0)) (.cse46 (<= c_~min2~0 .cse47)) (.cse48 (<= c_~min3~0 .cse47)) (.cse42 (select .cse40 (+ c_~A~0.offset 4)))) (and (or (< .cse42 .cse43) (let ((.cse45 (= c_~min2~0 .cse43))) (and (or (and (or .cse44 .cse45) (or .cse46 (= .cse43 .cse47))) .cse48) (or (and (or .cse49 .cse45) (or .cse50 (= c_~min3~0 .cse43))) .cse51)))) (or (<= .cse43 .cse42) (let ((.cse52 (= c_~min2~0 .cse42))) (and (or (and (or .cse49 .cse52) (or .cse50 (= c_~min3~0 .cse42))) .cse51) (or (and (or .cse52 .cse44) (or (= .cse42 .cse47) .cse46)) .cse48))))))))))) (<= c_~min1~0 .cse25))))) is different from false [2021-11-25 19:15:55,290 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (<= (+ ~M~0 1) 0) (< 0 ~M~0) (and (forall ((v_ArrVal_1597 (Array Int Int))) (or (<= c_~min1~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1597) c_~A~0.base) c_~A~0.offset)) (and (forall ((v_ArrVal_1598 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1597))) (let ((.cse7 (select (store .cse8 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1598) c_~A~0.base)) (.cse9 (* ~M~0 4))) (let ((.cse5 (select .cse7 (+ c_~A~0.offset .cse9)))) (or (let ((.cse4 (select .cse7 (+ c_~A~0.offset .cse9 4)))) (let ((.cse1 (select (select .cse8 c_~A~0.base) c_~A~0.offset)) (.cse3 (< .cse4 c_~min2~0)) (.cse6 (< .cse4 .cse5)) (.cse0 (select .cse7 (+ c_~A~0.offset 4)))) (and (or (< .cse0 .cse1) (let ((.cse2 (= c_~min2~0 .cse1))) (and (or (and (or .cse2 .cse3) (or (<= c_~min2~0 .cse4) (= .cse4 .cse1))) (<= .cse5 .cse4)) (or .cse6 (and (or (<= c_~min2~0 .cse5) (= .cse5 .cse1)) (or .cse2 (< .cse5 c_~min2~0))))))) (or (<= .cse1 .cse0) (and (or (= .cse0 c_~min2~0) .cse3) (or .cse6 (= .cse0 .cse5))))))) (<= c_~min3~0 .cse5)))))) (forall ((v_ArrVal_1598 (Array Int Int))) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1597))) (let ((.cse10 (select (store .cse18 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1598) c_~A~0.base)) (.cse11 (* ~M~0 4))) (or (< (select .cse10 (+ c_~A~0.offset .cse11)) c_~min3~0) (let ((.cse14 (select .cse10 (+ c_~A~0.offset .cse11 4)))) (let ((.cse13 (select (select .cse18 c_~A~0.base) c_~A~0.offset)) (.cse16 (< .cse14 c_~min2~0)) (.cse12 (select .cse10 (+ c_~A~0.offset 4))) (.cse17 (< .cse14 c_~min3~0))) (and (or (< .cse12 .cse13) (let ((.cse15 (= c_~min2~0 .cse13))) (and (or (<= c_~min3~0 .cse14) (and (or .cse15 .cse16) (or (<= c_~min2~0 .cse14) (= .cse14 .cse13)))) (or (and (or (< c_~min3~0 c_~min2~0) .cse15) (or (= c_~min3~0 .cse13) (<= c_~min2~0 c_~min3~0))) .cse17)))) (or (<= .cse13 .cse12) (and (or (= .cse12 c_~min2~0) .cse16) (or (= .cse12 c_~min3~0) .cse17))))))))))))) (forall ((v_ArrVal_1597 (Array Int Int))) (or (and (forall ((v_ArrVal_1598 (Array Int Int))) (let ((.cse19 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1597) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1598) c_~A~0.base)) (.cse20 (* ~M~0 4))) (or (< (select .cse19 (+ c_~A~0.offset .cse20)) c_~min3~0) (let ((.cse24 (select .cse19 (+ c_~A~0.offset .cse20 4)))) (let ((.cse23 (< .cse24 c_~min2~0)) (.cse21 (< .cse24 c_~min3~0)) (.cse25 (select .cse19 (+ c_~A~0.offset 4)))) (and (or (let ((.cse22 (= c_~min2~0 c_~min1~0))) (and (or .cse21 (and (or (< c_~min3~0 c_~min2~0) .cse22) (or (<= c_~min2~0 c_~min3~0) (= c_~min3~0 c_~min1~0)))) (or (and (or .cse23 .cse22) (or (<= c_~min2~0 .cse24) (= .cse24 c_~min1~0))) (<= c_~min3~0 .cse24)))) (< .cse25 c_~min1~0)) (or (and (or (= .cse25 c_~min2~0) .cse23) (or (= .cse25 c_~min3~0) .cse21)) (<= c_~min1~0 .cse25)))))))) (forall ((v_ArrVal_1598 (Array Int Int))) (let ((.cse32 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1597) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1598) c_~A~0.base)) (.cse33 (* ~M~0 4))) (let ((.cse29 (select .cse32 (+ c_~A~0.offset .cse33)))) (or (let ((.cse31 (select .cse32 (+ c_~A~0.offset .cse33 4)))) (let ((.cse26 (select .cse32 (+ c_~A~0.offset 4))) (.cse27 (< .cse31 c_~min2~0)) (.cse28 (< .cse31 .cse29))) (and (or (<= c_~min1~0 .cse26) (and (or (= .cse26 c_~min2~0) .cse27) (or .cse28 (= .cse26 .cse29)))) (or (< .cse26 c_~min1~0) (let ((.cse30 (= c_~min2~0 c_~min1~0))) (and (or (and (or .cse27 .cse30) (or (<= c_~min2~0 .cse31) (= .cse31 c_~min1~0))) (<= .cse29 .cse31)) (or .cse28 (and (or (= c_~min1~0 .cse29) (<= c_~min2~0 .cse29)) (or .cse30 (< .cse29 c_~min2~0)))))))))) (<= c_~min3~0 .cse29)))))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1597) c_~A~0.base) c_~A~0.offset) c_~min1~0)))))) is different from false [2021-11-25 19:18:35,072 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (<= (+ ~M~0 1) 0) (< 0 ~M~0) (and (forall ((v_ArrVal_1597 (Array Int Int)) (v_ArrVal_1596 (Array Int Int))) (or (and (forall ((v_ArrVal_1598 (Array Int Int))) (let ((.cse5 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1596) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1597) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1598) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse6 (* ~M~0 4))) (or (let ((.cse3 (select .cse5 (+ .cse6 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse4 (< .cse3 c_~min3~0)) (.cse2 (< .cse3 c_~min2~0)) (.cse0 (select .cse5 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (and (or (< .cse0 c_~min1~0) (let ((.cse1 (= c_~min2~0 c_~min1~0))) (and (or (and (or .cse1 .cse2) (or (= c_~min1~0 .cse3) (<= c_~min2~0 .cse3))) (<= c_~min3~0 .cse3)) (or (and (or (< c_~min3~0 c_~min2~0) .cse1) (or (<= c_~min2~0 c_~min3~0) (= c_~min3~0 c_~min1~0))) .cse4)))) (or (and (or (= c_~min3~0 .cse0) .cse4) (or .cse2 (= c_~min2~0 .cse0))) (<= c_~min1~0 .cse0))))) (< (select .cse5 (+ .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0)))) (forall ((v_ArrVal_1598 (Array Int Int))) (let ((.cse13 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1596) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1597) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1598) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse14 (* ~M~0 4))) (let ((.cse7 (select .cse13 (+ .cse14 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (<= c_~min3~0 .cse7) (let ((.cse8 (select .cse13 (+ .cse14 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse11 (< .cse8 .cse7)) (.cse10 (< .cse8 c_~min2~0)) (.cse12 (select .cse13 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (and (or (let ((.cse9 (= c_~min2~0 c_~min1~0))) (and (or (<= .cse7 .cse8) (and (or .cse9 .cse10) (or (= c_~min1~0 .cse8) (<= c_~min2~0 .cse8)))) (or (and (or .cse9 (< .cse7 c_~min2~0)) (or (= .cse7 c_~min1~0) (<= c_~min2~0 .cse7))) .cse11))) (< .cse12 c_~min1~0)) (or (and (or (= .cse7 .cse12) .cse11) (or .cse10 (= c_~min2~0 .cse12))) (<= c_~min1~0 .cse12)))))))))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1596) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1597) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0))) (forall ((v_ArrVal_1597 (Array Int Int)) (v_ArrVal_1596 (Array Int Int))) (or (<= c_~min1~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1596) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1597) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (and (forall ((v_ArrVal_1598 (Array Int Int))) (let ((.cse22 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1596) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1597))) (let ((.cse21 (select (store .cse22 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1598) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse23 (* ~M~0 4))) (or (let ((.cse15 (select .cse21 (+ .cse23 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse19 (< .cse15 c_~min3~0)) (.cse18 (< .cse15 c_~min2~0)) (.cse16 (select (select .cse22 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse20 (select .cse21 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (and (or (let ((.cse17 (= .cse16 c_~min2~0))) (and (or (<= c_~min3~0 .cse15) (and (or (<= c_~min2~0 .cse15) (= .cse16 .cse15)) (or .cse17 .cse18))) (or (and (or (< c_~min3~0 c_~min2~0) .cse17) (or (= .cse16 c_~min3~0) (<= c_~min2~0 c_~min3~0))) .cse19))) (< .cse20 .cse16)) (or (and (or (= c_~min3~0 .cse20) .cse19) (or .cse18 (= c_~min2~0 .cse20))) (<= .cse16 .cse20))))) (< (select .cse21 (+ .cse23 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0))))) (forall ((v_ArrVal_1598 (Array Int Int))) (let ((.cse31 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1596) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1597))) (let ((.cse32 (select (store .cse31 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1598) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse33 (* ~M~0 4))) (let ((.cse24 (select .cse32 (+ .cse33 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (<= c_~min3~0 .cse24) (let ((.cse30 (select .cse32 (+ .cse33 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse26 (< .cse30 .cse24)) (.cse27 (< .cse30 c_~min2~0)) (.cse25 (select .cse32 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse28 (select (select .cse31 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (or (and (or (= .cse24 .cse25) .cse26) (or .cse27 (= c_~min2~0 .cse25))) (<= .cse28 .cse25)) (or (let ((.cse29 (= .cse28 c_~min2~0))) (and (or (and (or .cse29 (< .cse24 c_~min2~0)) (or (= .cse24 .cse28) (<= c_~min2~0 .cse24))) .cse26) (or (<= .cse24 .cse30) (and (or (<= c_~min2~0 .cse30) (= .cse28 .cse30)) (or .cse29 .cse27))))) (< .cse25 .cse28)))))))))))))))) is different from false [2021-11-25 19:18:35,347 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:18:35,348 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 2381 treesize of output 1482 [2021-11-25 19:18:35,672 INFO L354 Elim1Store]: treesize reduction 106, result has 24.8 percent of original size [2021-11-25 19:18:35,677 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 40524 treesize of output 37550 [2021-11-25 19:18:37,654 INFO L354 Elim1Store]: treesize reduction 43, result has 8.5 percent of original size [2021-11-25 19:18:37,657 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 37479 treesize of output 35628 [2021-11-25 19:18:38,316 INFO L354 Elim1Store]: treesize reduction 73, result has 11.0 percent of original size [2021-11-25 19:18:38,319 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 35623 treesize of output 34004 [2021-11-25 19:18:40,238 INFO L354 Elim1Store]: treesize reduction 73, result has 11.0 percent of original size [2021-11-25 19:18:40,241 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 33963 treesize of output 30716 [2021-11-25 19:18:42,111 INFO L354 Elim1Store]: treesize reduction 43, result has 8.5 percent of original size [2021-11-25 19:18:42,114 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 30563 treesize of output 27752 [2021-11-25 19:18:42,793 INFO L354 Elim1Store]: treesize reduction 73, result has 11.0 percent of original size [2021-11-25 19:18:42,796 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 27747 treesize of output 27016 [2021-11-25 19:18:43,457 INFO L354 Elim1Store]: treesize reduction 43, result has 8.5 percent of original size [2021-11-25 19:18:43,460 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 27007 treesize of output 26444 [2021-11-25 19:18:44,127 INFO L354 Elim1Store]: treesize reduction 73, result has 11.0 percent of original size [2021-11-25 19:18:44,130 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 26439 treesize of output 26078 [2021-11-25 19:18:44,808 INFO L354 Elim1Store]: treesize reduction 43, result has 8.5 percent of original size [2021-11-25 19:18:44,811 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 26069 treesize of output 25170 [2021-11-25 19:18:45,390 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-11-25 19:18:45,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1046174567] [2021-11-25 19:18:45,391 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 19:18:45,391 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-25 19:18:45,391 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2021-11-25 19:18:45,391 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535202333] [2021-11-25 19:18:45,391 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-25 19:18:45,392 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-25 19:18:45,392 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:18:45,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-25 19:18:45,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1317, Unknown=8, NotChecked=390, Total=1892 [2021-11-25 19:18:45,393 INFO L87 Difference]: Start difference. First operand 478 states and 1565 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 19:18:48,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:18:48,247 INFO L93 Difference]: Finished difference Result 619 states and 1892 transitions. [2021-11-25 19:18:48,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-25 19:18:48,248 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 19:18:48,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:18:48,250 INFO L225 Difference]: With dead ends: 619 [2021-11-25 19:18:48,250 INFO L226 Difference]: Without dead ends: 612 [2021-11-25 19:18:48,251 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 665 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=370, Invalid=2398, Unknown=8, NotChecked=530, Total=3306 [2021-11-25 19:18:48,251 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 127 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-25 19:18:48,251 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 45 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-25 19:18:48,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2021-11-25 19:18:48,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 461. [2021-11-25 19:18:48,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 460 states have (on average 3.2934782608695654) internal successors, (1515), 460 states have internal predecessors, (1515), 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 19:18:48,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 1515 transitions. [2021-11-25 19:18:48,266 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 1515 transitions. Word has length 26 [2021-11-25 19:18:48,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:18:48,267 INFO L470 AbstractCegarLoop]: Abstraction has 461 states and 1515 transitions. [2021-11-25 19:18:48,267 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 19:18:48,267 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 1515 transitions. [2021-11-25 19:18:48,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-25 19:18:48,269 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:18:48,269 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 19:18:48,298 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2021-11-25 19:18:48,476 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2021-11-25 19:18:48,476 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 19:18:48,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:18:48,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1114366945, now seen corresponding path program 31 times [2021-11-25 19:18:48,477 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:18:48,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859521322] [2021-11-25 19:18:48,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:18:48,478 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:18:48,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:18:50,337 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 19:18:50,337 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:18:50,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859521322] [2021-11-25 19:18:50,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859521322] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:18:50,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462506681] [2021-11-25 19:18:50,338 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 19:18:50,338 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:18:50,338 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:18:50,339 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:18:50,340 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c1d5ff8-8e62-44a2-ac78-6e3156cc378a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2021-11-25 19:18:50,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:18:50,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 44 conjunts are in the unsatisfiable core [2021-11-25 19:18:50,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:18:51,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:18:51,020 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 19:18:51,721 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:18:51,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:18:51,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:18:51,723 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:18:51,730 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:18:51,730 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 19:18:51,955 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 19:18:51,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:18:54,812 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1647 (Array Int Int))) (let ((.cse1 (* c_~M~0 4)) (.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1647) c_~A~0.base))) (or (< (select .cse0 (+ c_~A~0.offset .cse1)) c_~min3~0) (let ((.cse5 (select .cse0 (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~A~0.offset)))) (let ((.cse3 (<= c_~min1~0 .cse5)) (.cse7 (= c_~min2~0 .cse5)) (.cse8 (= c_~min2~0 c_~min1~0)) (.cse9 (< .cse5 c_~min1~0)) (.cse2 (select .cse0 (+ c_~A~0.offset .cse1 4)))) (and (or (< .cse2 c_~min3~0) (let ((.cse6 (< c_~min3~0 c_~min2~0)) (.cse4 (<= c_~min2~0 c_~min3~0))) (and (or .cse3 (and (or .cse4 (= c_~min3~0 .cse5)) (or .cse6 .cse7))) (or (and (or .cse6 .cse8) (or .cse4 (= c_~min3~0 c_~min1~0))) .cse9)))) (or (<= c_~min3~0 .cse2) (let ((.cse11 (< .cse2 c_~min2~0)) (.cse10 (<= c_~min2~0 .cse2))) (and (or .cse3 (and (or (= .cse2 .cse5) .cse10) (or .cse7 .cse11))) (or (and (or .cse8 .cse11) (or (= .cse2 c_~min1~0) .cse10)) .cse9)))))))))) (forall ((v_ArrVal_1647 (Array Int Int))) (let ((.cse23 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1647) c_~A~0.base)) (.cse24 (* c_~M~0 4))) (let ((.cse12 (select .cse23 (+ c_~A~0.offset .cse24)))) (or (<= c_~min3~0 .cse12) (let ((.cse18 (select .cse23 (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~A~0.offset)))) (let ((.cse20 (<= c_~min1~0 .cse18)) (.cse19 (= c_~min2~0 .cse18)) (.cse16 (= c_~min2~0 c_~min1~0)) (.cse17 (< .cse18 c_~min1~0)) (.cse13 (select .cse23 (+ c_~A~0.offset .cse24 4)))) (and (or (< .cse13 .cse12) (let ((.cse14 (<= c_~min2~0 .cse12)) (.cse15 (< .cse12 c_~min2~0))) (and (or (and (or .cse14 (= .cse12 c_~min1~0)) (or .cse15 .cse16)) .cse17) (or (and (or .cse14 (= .cse12 .cse18)) (or .cse15 .cse19)) .cse20)))) (or (let ((.cse22 (< .cse13 c_~min2~0)) (.cse21 (<= c_~min2~0 .cse13))) (and (or .cse20 (and (or (= .cse13 .cse18) .cse21) (or .cse19 .cse22))) (or (and (or .cse16 .cse22) (or (= .cse13 c_~min1~0) .cse21)) .cse17))) (<= .cse12 .cse13)))))))))) is different from false [2021-11-25 19:18:54,997 INFO L354 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2021-11-25 19:18:54,997 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 1325 treesize of output 985 [2021-11-25 19:18:55,047 INFO L354 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2021-11-25 19:18:55,047 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 911 treesize of output 772 [2021-11-25 19:18:55,098 INFO L354 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2021-11-25 19:18:55,099 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 19:19:10,545 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 19:19:10,545 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462506681] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:19:10,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1924951862] [2021-11-25 19:19:10,546 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 19:19:10,546 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:19:10,546 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 11] total 37 [2021-11-25 19:19:10,546 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799304801] [2021-11-25 19:19:10,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:19:10,547 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-11-25 19:19:10,547 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:19:10,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-11-25 19:19:10,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1265, Unknown=1, NotChecked=72, Total=1482 [2021-11-25 19:19:10,548 INFO L87 Difference]: Start difference. First operand 461 states and 1515 transitions. Second operand has 39 states, 38 states have (on average 1.8421052631578947) internal successors, (70), 38 states have internal predecessors, (70), 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)