./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-bad-counter-queue2.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_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/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_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/popl20-bad-counter-queue2.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/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_180815bd-2339-43bd-b931-d65548a7688a/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 7c615a04683f0f8050243ec529c03e20511a5c93f5e823175650f11e9fefc562 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-11-25 18:31:57,459 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-25 18:31:57,460 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-25 18:31:57,496 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-25 18:31:57,497 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-25 18:31:57,498 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-25 18:31:57,500 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-25 18:31:57,502 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-25 18:31:57,505 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-25 18:31:57,506 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-25 18:31:57,507 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-25 18:31:57,509 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-25 18:31:57,509 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-25 18:31:57,511 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-25 18:31:57,512 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-25 18:31:57,514 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-25 18:31:57,515 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-25 18:31:57,517 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-25 18:31:57,519 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-25 18:31:57,522 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-25 18:31:57,524 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-25 18:31:57,526 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-25 18:31:57,528 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-25 18:31:57,529 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-25 18:31:57,533 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-25 18:31:57,534 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-25 18:31:57,534 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-25 18:31:57,536 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-25 18:31:57,536 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-25 18:31:57,538 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-25 18:31:57,538 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-25 18:31:57,539 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-25 18:31:57,540 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-25 18:31:57,541 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-25 18:31:57,543 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-25 18:31:57,543 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-25 18:31:57,544 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-25 18:31:57,545 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-25 18:31:57,545 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-25 18:31:57,546 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-25 18:31:57,547 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-25 18:31:57,548 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-25 18:31:57,576 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-25 18:31:57,577 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-25 18:31:57,577 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-25 18:31:57,577 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-25 18:31:57,578 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-25 18:31:57,578 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-25 18:31:57,578 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-25 18:31:57,579 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-25 18:31:57,579 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-25 18:31:57,579 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-25 18:31:57,579 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-25 18:31:57,579 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-25 18:31:57,580 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-25 18:31:57,580 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-25 18:31:57,580 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-25 18:31:57,580 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-25 18:31:57,581 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-25 18:31:57,581 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-25 18:31:57,581 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-25 18:31:57,582 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-25 18:31:57,582 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-25 18:31:57,582 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-25 18:31:57,582 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-25 18:31:57,582 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-25 18:31:57,583 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-25 18:31:57,583 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-25 18:31:57,583 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-25 18:31:57,583 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-25 18:31:57,583 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-25 18:31:57,584 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-25 18:31:57,584 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-25 18:31:57,584 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-25 18:31:57,584 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 18:31:57,585 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-25 18:31:57,585 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-25 18:31:57,585 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-25 18:31:57,585 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-25 18:31:57,585 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-25 18:31:57,586 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-25 18:31:57,586 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-25 18:31:57,586 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-25 18:31:57,586 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_180815bd-2339-43bd-b931-d65548a7688a/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_180815bd-2339-43bd-b931-d65548a7688a/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 -> 7c615a04683f0f8050243ec529c03e20511a5c93f5e823175650f11e9fefc562 [2021-11-25 18:31:57,939 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-25 18:31:57,967 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-25 18:31:57,970 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-25 18:31:57,971 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-25 18:31:57,973 INFO L275 PluginConnector]: CDTParser initialized [2021-11-25 18:31:57,974 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/../../sv-benchmarks/c/weaver/popl20-bad-counter-queue2.wvr.c [2021-11-25 18:31:58,055 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/data/5c2ad4370/df1af271628c4cf59b59a5d47727bf9a/FLAG7d815f45f [2021-11-25 18:31:58,613 INFO L306 CDTParser]: Found 1 translation units. [2021-11-25 18:31:58,614 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/sv-benchmarks/c/weaver/popl20-bad-counter-queue2.wvr.c [2021-11-25 18:31:58,628 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/data/5c2ad4370/df1af271628c4cf59b59a5d47727bf9a/FLAG7d815f45f [2021-11-25 18:31:58,948 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/data/5c2ad4370/df1af271628c4cf59b59a5d47727bf9a [2021-11-25 18:31:58,951 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-25 18:31:58,952 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-25 18:31:58,967 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-25 18:31:58,967 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-25 18:31:58,970 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-25 18:31:58,971 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:31:58" (1/1) ... [2021-11-25 18:31:58,972 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cbea017 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:31:58, skipping insertion in model container [2021-11-25 18:31:58,972 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:31:58" (1/1) ... [2021-11-25 18:31:58,979 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-25 18:31:59,001 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-25 18:31:59,281 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_180815bd-2339-43bd-b931-d65548a7688a/sv-benchmarks/c/weaver/popl20-bad-counter-queue2.wvr.c[2271,2284] [2021-11-25 18:31:59,303 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 18:31:59,311 INFO L203 MainTranslator]: Completed pre-run [2021-11-25 18:31:59,356 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_180815bd-2339-43bd-b931-d65548a7688a/sv-benchmarks/c/weaver/popl20-bad-counter-queue2.wvr.c[2271,2284] [2021-11-25 18:31:59,361 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 18:31:59,379 INFO L208 MainTranslator]: Completed translation [2021-11-25 18:31:59,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:31:59 WrapperNode [2021-11-25 18:31:59,379 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-25 18:31:59,381 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-25 18:31:59,381 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-25 18:31:59,381 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-25 18:31:59,388 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:31:59" (1/1) ... [2021-11-25 18:31:59,409 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:31:59" (1/1) ... [2021-11-25 18:31:59,446 INFO L137 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 138 [2021-11-25 18:31:59,447 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-25 18:31:59,448 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-25 18:31:59,448 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-25 18:31:59,448 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-25 18:31:59,456 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:31:59" (1/1) ... [2021-11-25 18:31:59,457 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:31:59" (1/1) ... [2021-11-25 18:31:59,472 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:31:59" (1/1) ... [2021-11-25 18:31:59,473 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:31:59" (1/1) ... [2021-11-25 18:31:59,479 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:31:59" (1/1) ... [2021-11-25 18:31:59,483 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:31:59" (1/1) ... [2021-11-25 18:31:59,484 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:31:59" (1/1) ... [2021-11-25 18:31:59,500 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-25 18:31:59,501 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-25 18:31:59,501 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-25 18:31:59,501 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-25 18:31:59,509 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:31:59" (1/1) ... [2021-11-25 18:31:59,517 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 18:31:59,528 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:31:59,547 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-25 18:31:59,577 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-25 18:31:59,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-25 18:31:59,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-25 18:31:59,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-25 18:31:59,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-25 18:31:59,599 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-11-25 18:31:59,600 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-11-25 18:31:59,600 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-11-25 18:31:59,600 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-11-25 18:31:59,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-25 18:31:59,600 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-11-25 18:31:59,600 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-11-25 18:31:59,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-25 18:31:59,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-25 18:31:59,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-25 18:31:59,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-25 18:31:59,602 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-11-25 18:31:59,722 INFO L236 CfgBuilder]: Building ICFG [2021-11-25 18:31:59,725 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-25 18:32:00,087 INFO L277 CfgBuilder]: Performing block encoding [2021-11-25 18:32:00,206 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-25 18:32:00,207 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-11-25 18:32:00,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:32:00 BoogieIcfgContainer [2021-11-25 18:32:00,209 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-25 18:32:00,211 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-25 18:32:00,211 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-25 18:32:00,215 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-25 18:32:00,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:31:58" (1/3) ... [2021-11-25 18:32:00,216 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22df7a11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:32:00, skipping insertion in model container [2021-11-25 18:32:00,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:31:59" (2/3) ... [2021-11-25 18:32:00,217 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22df7a11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:32:00, skipping insertion in model container [2021-11-25 18:32:00,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:32:00" (3/3) ... [2021-11-25 18:32:00,230 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-bad-counter-queue2.wvr.c [2021-11-25 18:32:00,235 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-25 18:32:00,236 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-25 18:32:00,236 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-25 18:32:00,236 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-25 18:32:00,298 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,305 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,306 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,306 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,306 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,306 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,307 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,307 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,307 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,307 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,307 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,308 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,308 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,308 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,308 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,308 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,309 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,309 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,309 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,309 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,309 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,321 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,321 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,321 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,321 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,322 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,322 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,322 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,322 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,322 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,323 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,323 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,323 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,323 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,323 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,323 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,324 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,324 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,324 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,324 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,324 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,325 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,325 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,325 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,325 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,325 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,326 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,326 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,326 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,326 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,326 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,326 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,327 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,327 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,327 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,327 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,327 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,327 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,327 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,328 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,328 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,328 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,328 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,328 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,329 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,329 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,329 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,329 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,329 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,329 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,330 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,330 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,330 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,330 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,330 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,331 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,331 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,331 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,331 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,331 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,357 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,358 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,358 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,358 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,358 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,358 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,359 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,359 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,359 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,359 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,360 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,360 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,360 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,362 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,362 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,362 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,362 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,362 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,363 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,363 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,363 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,363 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,363 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,364 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,364 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,364 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:00,370 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2021-11-25 18:32:00,433 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-25 18:32:00,440 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-25 18:32:00,440 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-11-25 18:32:00,461 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-11-25 18:32:00,478 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 117 transitions, 250 flow [2021-11-25 18:32:00,486 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 117 transitions, 250 flow [2021-11-25 18:32:00,489 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 115 places, 117 transitions, 250 flow [2021-11-25 18:32:00,557 INFO L129 PetriNetUnfolder]: 9/115 cut-off events. [2021-11-25 18:32:00,557 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-11-25 18:32:00,561 INFO L84 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 115 events. 9/115 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 63 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2021-11-25 18:32:00,564 INFO L116 LiptonReduction]: Number of co-enabled transitions 500 [2021-11-25 18:32:05,253 INFO L131 LiptonReduction]: Checked pairs total: 596 [2021-11-25 18:32:05,254 INFO L133 LiptonReduction]: Total number of compositions: 114 [2021-11-25 18:32:05,262 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 24 places, 20 transitions, 56 flow [2021-11-25 18:32:05,274 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 35 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 34 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:05,276 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 34 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:05,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-25 18:32:05,282 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:32:05,283 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:32:05,283 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:32:05,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:32:05,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1628212080, now seen corresponding path program 1 times [2021-11-25 18:32:05,297 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:32:05,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025276301] [2021-11-25 18:32:05,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:32:05,299 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:32:05,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:32:05,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:32:05,618 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:32:05,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025276301] [2021-11-25 18:32:05,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025276301] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:32:05,619 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:32:05,619 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-11-25 18:32:05,621 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119549693] [2021-11-25 18:32:05,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:32:05,626 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 18:32:05,626 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:32:05,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 18:32:05,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 18:32:05,651 INFO L87 Difference]: Start difference. First operand has 35 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 34 states have internal predecessors, (75), 0 states have call successors, (0), 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, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:05,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:32:05,715 INFO L93 Difference]: Finished difference Result 62 states and 136 transitions. [2021-11-25 18:32:05,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 18:32:05,717 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2021-11-25 18:32:05,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:32:05,727 INFO L225 Difference]: With dead ends: 62 [2021-11-25 18:32:05,728 INFO L226 Difference]: Without dead ends: 57 [2021-11-25 18:32:05,729 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 18:32:05,732 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 1 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-25 18:32:05,734 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 4 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 18:32:05,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-11-25 18:32:05,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2021-11-25 18:32:05,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 2.25) internal successors, (126), 56 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:05,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 126 transitions. [2021-11-25 18:32:05,772 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 126 transitions. Word has length 14 [2021-11-25 18:32:05,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:32:05,773 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 126 transitions. [2021-11-25 18:32:05,773 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:05,774 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 126 transitions. [2021-11-25 18:32:05,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-25 18:32:05,775 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:32:05,775 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:32:05,776 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-25 18:32:05,776 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:32:05,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:32:05,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1985475477, now seen corresponding path program 1 times [2021-11-25 18:32:05,777 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:32:05,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113555126] [2021-11-25 18:32:05,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:32:05,778 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:32:05,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:32:05,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:32:05,879 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:32:05,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113555126] [2021-11-25 18:32:05,880 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113555126] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:32:05,880 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:32:05,880 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 18:32:05,880 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411848741] [2021-11-25 18:32:05,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:32:05,883 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-25 18:32:05,883 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:32:05,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-25 18:32:05,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-25 18:32:05,885 INFO L87 Difference]: Start difference. First operand 57 states and 126 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:05,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:32:05,969 INFO L93 Difference]: Finished difference Result 109 states and 227 transitions. [2021-11-25 18:32:05,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-25 18:32:05,970 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2021-11-25 18:32:05,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:32:05,972 INFO L225 Difference]: With dead ends: 109 [2021-11-25 18:32:05,973 INFO L226 Difference]: Without dead ends: 99 [2021-11-25 18:32:05,973 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-25 18:32:05,975 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 31 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:32:05,975 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 8 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:32:05,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-11-25 18:32:05,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 87. [2021-11-25 18:32:05,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 2.244186046511628) internal successors, (193), 86 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:05,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 193 transitions. [2021-11-25 18:32:05,989 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 193 transitions. Word has length 15 [2021-11-25 18:32:05,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:32:05,990 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 193 transitions. [2021-11-25 18:32:05,990 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:05,990 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 193 transitions. [2021-11-25 18:32:05,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-25 18:32:05,991 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:32:05,992 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:32:05,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-25 18:32:05,992 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:32:05,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:32:05,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1573371461, now seen corresponding path program 1 times [2021-11-25 18:32:05,993 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:32:05,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129449092] [2021-11-25 18:32:05,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:32:05,994 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:32:06,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:32:06,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:32:06,062 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:32:06,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129449092] [2021-11-25 18:32:06,062 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129449092] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:32:06,062 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:32:06,062 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 18:32:06,063 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117435143] [2021-11-25 18:32:06,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:32:06,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-25 18:32:06,063 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:32:06,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-25 18:32:06,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-25 18:32:06,064 INFO L87 Difference]: Start difference. First operand 87 states and 193 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:06,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:32:06,127 INFO L93 Difference]: Finished difference Result 75 states and 155 transitions. [2021-11-25 18:32:06,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-25 18:32:06,128 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2021-11-25 18:32:06,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:32:06,129 INFO L225 Difference]: With dead ends: 75 [2021-11-25 18:32:06,129 INFO L226 Difference]: Without dead ends: 58 [2021-11-25 18:32:06,129 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-25 18:32:06,131 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 19 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-25 18:32:06,132 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 8 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 18:32:06,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-11-25 18:32:06,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2021-11-25 18:32:06,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 2.2280701754385963) internal successors, (127), 57 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:06,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 127 transitions. [2021-11-25 18:32:06,140 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 127 transitions. Word has length 15 [2021-11-25 18:32:06,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:32:06,140 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 127 transitions. [2021-11-25 18:32:06,141 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:06,141 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 127 transitions. [2021-11-25 18:32:06,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-25 18:32:06,147 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:32:06,147 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:32:06,147 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-25 18:32:06,148 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:32:06,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:32:06,148 INFO L85 PathProgramCache]: Analyzing trace with hash 268474802, now seen corresponding path program 1 times [2021-11-25 18:32:06,149 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:32:06,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428574144] [2021-11-25 18:32:06,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:32:06,149 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:32:06,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:32:06,255 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:32:06,255 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:32:06,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428574144] [2021-11-25 18:32:06,256 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428574144] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:32:06,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377713516] [2021-11-25 18:32:06,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:32:06,256 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:32:06,256 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:32:06,258 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:32:06,269 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-25 18:32:06,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:32:06,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-25 18:32:06,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:32:06,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:32:06,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:32:06,487 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:32:06,487 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [377713516] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-25 18:32:06,487 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-25 18:32:06,487 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2021-11-25 18:32:06,488 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631999443] [2021-11-25 18:32:06,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:32:06,488 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-25 18:32:06,488 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:32:06,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-25 18:32:06,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-11-25 18:32:06,489 INFO L87 Difference]: Start difference. First operand 58 states and 127 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:06,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:32:06,564 INFO L93 Difference]: Finished difference Result 52 states and 115 transitions. [2021-11-25 18:32:06,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-25 18:32:06,565 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2021-11-25 18:32:06,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:32:06,566 INFO L225 Difference]: With dead ends: 52 [2021-11-25 18:32:06,566 INFO L226 Difference]: Without dead ends: 52 [2021-11-25 18:32:06,567 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-25 18:32:06,568 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 34 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:32:06,581 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 4 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:32:06,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-11-25 18:32:06,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 44. [2021-11-25 18:32:06,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 2.2093023255813953) internal successors, (95), 43 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:06,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 95 transitions. [2021-11-25 18:32:06,588 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 95 transitions. Word has length 16 [2021-11-25 18:32:06,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:32:06,589 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 95 transitions. [2021-11-25 18:32:06,589 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:06,589 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 95 transitions. [2021-11-25 18:32:06,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-25 18:32:06,590 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:32:06,590 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:32:06,657 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-25 18:32:06,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:32:06,792 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:32:06,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:32:06,792 INFO L85 PathProgramCache]: Analyzing trace with hash 680578818, now seen corresponding path program 1 times [2021-11-25 18:32:06,792 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:32:06,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188568253] [2021-11-25 18:32:06,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:32:06,793 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:32:06,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:32:06,858 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:32:06,858 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:32:06,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188568253] [2021-11-25 18:32:06,859 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188568253] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:32:06,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022445046] [2021-11-25 18:32:06,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:32:06,859 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:32:06,859 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:32:06,860 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:32:06,888 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-25 18:32:06,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:32:06,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-25 18:32:06,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:32:07,030 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:32:07,034 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:32:07,114 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:32:07,114 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022445046] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-25 18:32:07,114 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-25 18:32:07,114 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2021-11-25 18:32:07,115 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489465982] [2021-11-25 18:32:07,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:32:07,116 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-25 18:32:07,116 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:32:07,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-25 18:32:07,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-11-25 18:32:07,117 INFO L87 Difference]: Start difference. First operand 44 states and 95 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:07,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:32:07,171 INFO L93 Difference]: Finished difference Result 54 states and 119 transitions. [2021-11-25 18:32:07,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-25 18:32:07,171 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2021-11-25 18:32:07,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:32:07,173 INFO L225 Difference]: With dead ends: 54 [2021-11-25 18:32:07,173 INFO L226 Difference]: Without dead ends: 54 [2021-11-25 18:32:07,174 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-25 18:32:07,178 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 29 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-25 18:32:07,180 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 4 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 18:32:07,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2021-11-25 18:32:07,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2021-11-25 18:32:07,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 2.2452830188679247) internal successors, (119), 53 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:07,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 119 transitions. [2021-11-25 18:32:07,196 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 119 transitions. Word has length 16 [2021-11-25 18:32:07,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:32:07,197 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 119 transitions. [2021-11-25 18:32:07,197 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:07,197 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 119 transitions. [2021-11-25 18:32:07,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-25 18:32:07,198 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:32:07,198 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:32:07,239 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-25 18:32:07,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:32:07,429 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:32:07,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:32:07,430 INFO L85 PathProgramCache]: Analyzing trace with hash 867565625, now seen corresponding path program 1 times [2021-11-25 18:32:07,430 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:32:07,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948565251] [2021-11-25 18:32:07,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:32:07,430 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:32:07,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:32:07,726 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:32:07,727 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:32:07,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948565251] [2021-11-25 18:32:07,731 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948565251] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:32:07,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11821267] [2021-11-25 18:32:07,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:32:07,731 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:32:07,732 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:32:07,733 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:32:07,759 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-25 18:32:07,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:32:07,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 54 conjunts are in the unsatisfiable core [2021-11-25 18:32:07,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:32:07,911 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 11 treesize of output 7 [2021-11-25 18:32:07,990 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 18:32:08,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:32:08,104 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 14 treesize of output 16 [2021-11-25 18:32:08,186 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:32:08,186 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:32:08,293 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_133 (Array Int Int))) (<= c_~counter~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_133) c_~A~0.base) c_~A~0.offset))) (forall ((v_ArrVal_133 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_133) c_~A~0.base) c_~A~0.offset) (+ c_~counter~0 1)))) is different from false [2021-11-25 18:32:08,332 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_133 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_133) c_~A~0.base) c_~A~0.offset) (+ c_~counter~0 1 (select (select |c_#memory_int| c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) c_~A~0.offset))))) (forall ((v_ArrVal_133 (Array Int Int))) (<= (+ c_~counter~0 (select (select |c_#memory_int| c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) c_~A~0.offset))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_133) c_~A~0.base) c_~A~0.offset)))) is different from false [2021-11-25 18:32:08,354 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_133 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_133) c_~A~0.base) c_~A~0.offset) (+ c_~counter~0 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) 1))) (forall ((v_ArrVal_133 (Array Int Int))) (<= (+ c_~counter~0 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_133) c_~A~0.base) c_~A~0.offset)))) is different from false [2021-11-25 18:32:08,390 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_133 (Array Int Int)) (v_ArrVal_132 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_132))) (<= (+ c_~counter~0 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_133) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (forall ((v_ArrVal_133 (Array Int Int)) (v_ArrVal_132 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_132))) (< (select (select (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_133) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ c_~counter~0 (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1))))) is different from false [2021-11-25 18:32:08,412 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:32:08,412 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 46 treesize of output 35 [2021-11-25 18:32:08,427 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 286 treesize of output 254 [2021-11-25 18:32:08,438 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 254 treesize of output 238 [2021-11-25 18:32:08,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 238 treesize of output 222 [2021-11-25 18:32:08,575 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:32:08,576 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 36 [2021-11-25 18:32:08,579 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:32:08,582 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 64 treesize of output 56 [2021-11-25 18:32:08,586 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 56 treesize of output 52 [2021-11-25 18:32:08,652 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-11-25 18:32:08,653 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11821267] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:32:08,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [228498674] [2021-11-25 18:32:08,660 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:32:08,663 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:32:08,663 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 19 [2021-11-25 18:32:08,663 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078017235] [2021-11-25 18:32:08,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:32:08,664 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-25 18:32:08,665 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:32:08,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-25 18:32:08,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=217, Unknown=4, NotChecked=132, Total=420 [2021-11-25 18:32:08,667 INFO L87 Difference]: Start difference. First operand 54 states and 119 transitions. Second operand has 21 states, 20 states have (on average 1.8) internal successors, (36), 20 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:09,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:32:09,071 INFO L93 Difference]: Finished difference Result 89 states and 198 transitions. [2021-11-25 18:32:09,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-25 18:32:09,071 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.8) internal successors, (36), 20 states have internal predecessors, (36), 0 states have call successors, (0), 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 17 [2021-11-25 18:32:09,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:32:09,073 INFO L225 Difference]: With dead ends: 89 [2021-11-25 18:32:09,073 INFO L226 Difference]: Without dead ends: 84 [2021-11-25 18:32:09,073 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 18 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=328, Unknown=4, NotChecked=164, Total=600 [2021-11-25 18:32:09,074 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 42 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 186 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 18:32:09,074 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 36 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 306 Invalid, 0 Unknown, 186 Unchecked, 0.2s Time] [2021-11-25 18:32:09,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-11-25 18:32:09,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 72. [2021-11-25 18:32:09,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 2.3098591549295775) internal successors, (164), 71 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:09,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 164 transitions. [2021-11-25 18:32:09,082 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 164 transitions. Word has length 17 [2021-11-25 18:32:09,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:32:09,083 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 164 transitions. [2021-11-25 18:32:09,083 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.8) internal successors, (36), 20 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:09,083 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 164 transitions. [2021-11-25 18:32:09,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-25 18:32:09,084 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:32:09,084 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:32:09,125 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-25 18:32:09,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-11-25 18:32:09,309 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:32:09,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:32:09,310 INFO L85 PathProgramCache]: Analyzing trace with hash 607128157, now seen corresponding path program 2 times [2021-11-25 18:32:09,310 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:32:09,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267928993] [2021-11-25 18:32:09,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:32:09,310 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:32:09,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:32:09,526 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:32:09,526 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:32:09,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267928993] [2021-11-25 18:32:09,527 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267928993] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:32:09,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913316834] [2021-11-25 18:32:09,527 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:32:09,527 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:32:09,527 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:32:09,528 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:32:09,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-25 18:32:09,616 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 18:32:09,616 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:32:09,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 41 conjunts are in the unsatisfiable core [2021-11-25 18:32:09,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:32:09,788 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:32:09,788 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:32:09,870 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:32:09,870 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 22 treesize of output 23 [2021-11-25 18:32:09,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:32:09,888 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:32:09,889 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 21 treesize of output 10 [2021-11-25 18:32:09,955 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:32:09,955 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913316834] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:32:09,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [812232516] [2021-11-25 18:32:09,956 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:32:09,957 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:32:09,957 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 4] total 9 [2021-11-25 18:32:09,958 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804377474] [2021-11-25 18:32:09,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:32:09,958 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-25 18:32:09,959 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:32:09,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-25 18:32:09,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-11-25 18:32:09,959 INFO L87 Difference]: Start difference. First operand 72 states and 164 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:10,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:32:10,121 INFO L93 Difference]: Finished difference Result 91 states and 208 transitions. [2021-11-25 18:32:10,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-25 18:32:10,121 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 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 17 [2021-11-25 18:32:10,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:32:10,122 INFO L225 Difference]: With dead ends: 91 [2021-11-25 18:32:10,123 INFO L226 Difference]: Without dead ends: 86 [2021-11-25 18:32:10,123 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2021-11-25 18:32:10,124 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 23 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:32:10,124 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 11 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:32:10,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-11-25 18:32:10,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 78. [2021-11-25 18:32:10,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 2.324675324675325) internal successors, (179), 77 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:10,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 179 transitions. [2021-11-25 18:32:10,131 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 179 transitions. Word has length 17 [2021-11-25 18:32:10,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:32:10,132 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 179 transitions. [2021-11-25 18:32:10,132 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:10,132 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 179 transitions. [2021-11-25 18:32:10,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-25 18:32:10,133 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:32:10,133 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:32:10,171 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-25 18:32:10,349 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:32:10,349 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:32:10,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:32:10,350 INFO L85 PathProgramCache]: Analyzing trace with hash -801199277, now seen corresponding path program 3 times [2021-11-25 18:32:10,350 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:32:10,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938902461] [2021-11-25 18:32:10,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:32:10,350 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:32:10,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:32:10,544 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:32:10,544 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:32:10,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938902461] [2021-11-25 18:32:10,544 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938902461] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:32:10,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18559015] [2021-11-25 18:32:10,545 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 18:32:10,545 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:32:10,545 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:32:10,546 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:32:10,563 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-25 18:32:10,629 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 18:32:10,629 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:32:10,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 54 conjunts are in the unsatisfiable core [2021-11-25 18:32:10,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:32:10,678 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 11 treesize of output 7 [2021-11-25 18:32:10,725 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 18:32:10,797 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 18:32:10,902 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:32:10,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:32:11,045 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_197 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_197) c_~A~0.base))) (<= (+ c_~counter~0 (select .cse0 (+ (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) c_~A~0.offset))) (select .cse0 c_~A~0.offset)))) (forall ((v_ArrVal_197 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_197) c_~A~0.base))) (< (select .cse1 c_~A~0.offset) (+ c_~counter~0 (select .cse1 (+ (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) c_~A~0.offset)) 1))))) is different from false [2021-11-25 18:32:11,072 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:32:11,072 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18559015] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:32:11,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1582588452] [2021-11-25 18:32:11,073 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:32:11,073 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:32:11,073 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 5] total 14 [2021-11-25 18:32:11,073 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847469552] [2021-11-25 18:32:11,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:32:11,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-25 18:32:11,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:32:11,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-25 18:32:11,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=161, Unknown=1, NotChecked=26, Total=240 [2021-11-25 18:32:11,075 INFO L87 Difference]: Start difference. First operand 78 states and 179 transitions. Second operand has 16 states, 15 states have (on average 2.2) internal successors, (33), 15 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:11,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:32:11,317 INFO L93 Difference]: Finished difference Result 97 states and 222 transitions. [2021-11-25 18:32:11,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-25 18:32:11,318 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.2) internal successors, (33), 15 states have internal predecessors, (33), 0 states have call successors, (0), 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 17 [2021-11-25 18:32:11,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:32:11,319 INFO L225 Difference]: With dead ends: 97 [2021-11-25 18:32:11,319 INFO L226 Difference]: Without dead ends: 92 [2021-11-25 18:32:11,320 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=252, Unknown=1, NotChecked=34, Total=380 [2021-11-25 18:32:11,320 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 47 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:32:11,321 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 13 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 192 Invalid, 0 Unknown, 37 Unchecked, 0.1s Time] [2021-11-25 18:32:11,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-11-25 18:32:11,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 78. [2021-11-25 18:32:11,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 2.324675324675325) internal successors, (179), 77 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:11,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 179 transitions. [2021-11-25 18:32:11,333 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 179 transitions. Word has length 17 [2021-11-25 18:32:11,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:32:11,333 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 179 transitions. [2021-11-25 18:32:11,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.2) internal successors, (33), 15 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:11,334 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 179 transitions. [2021-11-25 18:32:11,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-25 18:32:11,339 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:32:11,340 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:32:11,381 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-25 18:32:11,561 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:32:11,561 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:32:11,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:32:11,562 INFO L85 PathProgramCache]: Analyzing trace with hash -321917229, now seen corresponding path program 4 times [2021-11-25 18:32:11,562 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:32:11,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472616051] [2021-11-25 18:32:11,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:32:11,562 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:32:11,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:32:11,755 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:32:11,756 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:32:11,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472616051] [2021-11-25 18:32:11,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472616051] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:32:11,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945471729] [2021-11-25 18:32:11,756 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 18:32:11,756 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:32:11,757 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:32:11,761 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:32:11,781 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-25 18:32:11,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:32:11,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 54 conjunts are in the unsatisfiable core [2021-11-25 18:32:11,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:32:11,907 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 11 treesize of output 7 [2021-11-25 18:32:11,940 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 18:32:11,973 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 18:32:12,078 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:32:12,079 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:32:12,236 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:32:12,237 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945471729] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:32:12,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1622611215] [2021-11-25 18:32:12,237 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:32:12,237 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:32:12,238 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 4] total 12 [2021-11-25 18:32:12,238 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80600901] [2021-11-25 18:32:12,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:32:12,239 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-25 18:32:12,239 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:32:12,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-25 18:32:12,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2021-11-25 18:32:12,240 INFO L87 Difference]: Start difference. First operand 78 states and 179 transitions. Second operand has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:12,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:32:12,455 INFO L93 Difference]: Finished difference Result 95 states and 218 transitions. [2021-11-25 18:32:12,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-25 18:32:12,455 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 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 17 [2021-11-25 18:32:12,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:32:12,456 INFO L225 Difference]: With dead ends: 95 [2021-11-25 18:32:12,456 INFO L226 Difference]: Without dead ends: 90 [2021-11-25 18:32:12,457 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2021-11-25 18:32:12,458 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 36 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:32:12,458 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 14 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:32:12,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-11-25 18:32:12,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 78. [2021-11-25 18:32:12,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 2.324675324675325) internal successors, (179), 77 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:12,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 179 transitions. [2021-11-25 18:32:12,464 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 179 transitions. Word has length 17 [2021-11-25 18:32:12,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:32:12,464 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 179 transitions. [2021-11-25 18:32:12,465 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:12,465 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 179 transitions. [2021-11-25 18:32:12,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-25 18:32:12,466 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:32:12,466 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:32:12,501 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-25 18:32:12,681 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:32:12,681 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:32:12,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:32:12,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1730244663, now seen corresponding path program 5 times [2021-11-25 18:32:12,682 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:32:12,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114084687] [2021-11-25 18:32:12,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:32:12,682 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:32:12,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:32:12,898 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:32:12,898 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:32:12,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114084687] [2021-11-25 18:32:12,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114084687] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:32:12,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609015967] [2021-11-25 18:32:12,899 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:32:12,899 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:32:12,899 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:32:12,901 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:32:12,927 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-25 18:32:13,002 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-11-25 18:32:13,002 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:32:13,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 41 conjunts are in the unsatisfiable core [2021-11-25 18:32:13,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:32:13,144 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:32:13,144 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:32:13,212 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:32:13,212 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 22 treesize of output 23 [2021-11-25 18:32:13,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:32:13,229 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:32:13,230 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 21 treesize of output 10 [2021-11-25 18:32:13,304 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:32:13,304 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609015967] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:32:13,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [388526485] [2021-11-25 18:32:13,306 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:32:13,308 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:32:13,308 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 4] total 9 [2021-11-25 18:32:13,311 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716527808] [2021-11-25 18:32:13,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:32:13,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-25 18:32:13,312 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:32:13,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-25 18:32:13,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-11-25 18:32:13,313 INFO L87 Difference]: Start difference. First operand 78 states and 179 transitions. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:13,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:32:13,469 INFO L93 Difference]: Finished difference Result 97 states and 222 transitions. [2021-11-25 18:32:13,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-25 18:32:13,470 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 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 17 [2021-11-25 18:32:13,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:32:13,471 INFO L225 Difference]: With dead ends: 97 [2021-11-25 18:32:13,471 INFO L226 Difference]: Without dead ends: 92 [2021-11-25 18:32:13,471 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2021-11-25 18:32:13,472 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 26 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:32:13,472 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 12 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:32:13,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-11-25 18:32:13,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 76. [2021-11-25 18:32:13,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 2.32) internal successors, (174), 75 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:13,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 174 transitions. [2021-11-25 18:32:13,477 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 174 transitions. Word has length 17 [2021-11-25 18:32:13,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:32:13,477 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 174 transitions. [2021-11-25 18:32:13,477 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:13,478 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 174 transitions. [2021-11-25 18:32:13,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-25 18:32:13,478 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:32:13,479 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:32:13,514 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-11-25 18:32:13,697 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-11-25 18:32:13,697 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:32:13,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:32:13,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1535257289, now seen corresponding path program 6 times [2021-11-25 18:32:13,698 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:32:13,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355835530] [2021-11-25 18:32:13,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:32:13,698 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:32:13,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:32:13,831 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:32:13,832 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:32:13,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355835530] [2021-11-25 18:32:13,832 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355835530] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:32:13,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214258004] [2021-11-25 18:32:13,833 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 18:32:13,833 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:32:13,833 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:32:13,834 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:32:13,855 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-25 18:32:13,923 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 18:32:13,924 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:32:13,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 54 conjunts are in the unsatisfiable core [2021-11-25 18:32:13,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:32:13,970 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 11 treesize of output 7 [2021-11-25 18:32:14,002 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 18:32:14,030 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 18:32:14,142 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:32:14,143 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:32:14,266 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:32:14,267 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214258004] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:32:14,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1613051108] [2021-11-25 18:32:14,267 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:32:14,269 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:32:14,269 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 4] total 12 [2021-11-25 18:32:14,269 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471765994] [2021-11-25 18:32:14,269 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:32:14,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-25 18:32:14,270 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:32:14,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-25 18:32:14,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2021-11-25 18:32:14,271 INFO L87 Difference]: Start difference. First operand 76 states and 174 transitions. Second operand has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:14,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:32:14,508 INFO L93 Difference]: Finished difference Result 97 states and 223 transitions. [2021-11-25 18:32:14,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-25 18:32:14,508 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 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 17 [2021-11-25 18:32:14,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:32:14,509 INFO L225 Difference]: With dead ends: 97 [2021-11-25 18:32:14,509 INFO L226 Difference]: Without dead ends: 92 [2021-11-25 18:32:14,510 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2021-11-25 18:32:14,510 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 31 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 18:32:14,511 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 27 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 18:32:14,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-11-25 18:32:14,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 80. [2021-11-25 18:32:14,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 2.329113924050633) internal successors, (184), 79 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:14,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 184 transitions. [2021-11-25 18:32:14,515 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 184 transitions. Word has length 17 [2021-11-25 18:32:14,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:32:14,515 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 184 transitions. [2021-11-25 18:32:14,515 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:14,515 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 184 transitions. [2021-11-25 18:32:14,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-25 18:32:14,516 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:32:14,516 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:32:14,541 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-11-25 18:32:14,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-11-25 18:32:14,729 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:32:14,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:32:14,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1925777950, now seen corresponding path program 7 times [2021-11-25 18:32:14,730 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:32:14,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718585043] [2021-11-25 18:32:14,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:32:14,730 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:32:14,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:32:14,819 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:32:14,819 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:32:14,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718585043] [2021-11-25 18:32:14,819 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718585043] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:32:14,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859683526] [2021-11-25 18:32:14,820 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 18:32:14,820 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:32:14,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:32:14,825 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:32:14,844 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-25 18:32:14,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:32:14,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-25 18:32:14,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:32:15,005 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:32:15,006 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:32:15,063 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:32:15,064 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [859683526] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:32:15,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [818538155] [2021-11-25 18:32:15,064 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:32:15,065 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:32:15,066 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2021-11-25 18:32:15,066 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109693016] [2021-11-25 18:32:15,066 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:32:15,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-25 18:32:15,068 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:32:15,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-25 18:32:15,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2021-11-25 18:32:15,069 INFO L87 Difference]: Start difference. First operand 80 states and 184 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:15,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:32:15,203 INFO L93 Difference]: Finished difference Result 156 states and 340 transitions. [2021-11-25 18:32:15,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-25 18:32:15,204 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 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 18 [2021-11-25 18:32:15,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:32:15,205 INFO L225 Difference]: With dead ends: 156 [2021-11-25 18:32:15,205 INFO L226 Difference]: Without dead ends: 142 [2021-11-25 18:32:15,206 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 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 18:32:15,206 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 88 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:32:15,207 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 20 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:32:15,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-11-25 18:32:15,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 128. [2021-11-25 18:32:15,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 2.3149606299212597) internal successors, (294), 127 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:15,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 294 transitions. [2021-11-25 18:32:15,213 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 294 transitions. Word has length 18 [2021-11-25 18:32:15,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:32:15,213 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 294 transitions. [2021-11-25 18:32:15,214 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:15,214 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 294 transitions. [2021-11-25 18:32:15,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-25 18:32:15,215 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:32:15,215 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:32:15,239 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-25 18:32:15,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:32:15,429 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:32:15,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:32:15,430 INFO L85 PathProgramCache]: Analyzing trace with hash -2035455342, now seen corresponding path program 8 times [2021-11-25 18:32:15,430 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:32:15,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011178593] [2021-11-25 18:32:15,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:32:15,430 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:32:15,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:32:15,491 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:32:15,491 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:32:15,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011178593] [2021-11-25 18:32:15,491 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011178593] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:32:15,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232933305] [2021-11-25 18:32:15,492 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:32:15,492 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:32:15,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:32:15,493 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:32:15,527 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-25 18:32:15,614 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 18:32:15,614 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:32:15,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-25 18:32:15,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:32:15,686 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:32:15,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:32:15,768 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:32:15,768 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [232933305] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:32:15,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [846385929] [2021-11-25 18:32:15,769 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:32:15,769 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:32:15,769 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2021-11-25 18:32:15,769 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223534315] [2021-11-25 18:32:15,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:32:15,770 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-25 18:32:15,770 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:32:15,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-25 18:32:15,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2021-11-25 18:32:15,771 INFO L87 Difference]: Start difference. First operand 128 states and 294 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:15,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:32:15,896 INFO L93 Difference]: Finished difference Result 112 states and 243 transitions. [2021-11-25 18:32:15,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-25 18:32:15,897 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 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 18 [2021-11-25 18:32:15,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:32:15,898 INFO L225 Difference]: With dead ends: 112 [2021-11-25 18:32:15,898 INFO L226 Difference]: Without dead ends: 81 [2021-11-25 18:32:15,898 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2021-11-25 18:32:15,899 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 68 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:32:15,899 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 23 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:32:15,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-11-25 18:32:15,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2021-11-25 18:32:15,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 2.3125) internal successors, (185), 80 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:15,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 185 transitions. [2021-11-25 18:32:15,903 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 185 transitions. Word has length 18 [2021-11-25 18:32:15,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:32:15,903 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 185 transitions. [2021-11-25 18:32:15,903 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:15,903 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 185 transitions. [2021-11-25 18:32:15,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-25 18:32:15,904 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:32:15,904 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:32:15,938 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-25 18:32:16,117 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:32:16,117 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:32:16,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:32:16,117 INFO L85 PathProgramCache]: Analyzing trace with hash -2011721925, now seen corresponding path program 9 times [2021-11-25 18:32:16,118 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:32:16,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054937780] [2021-11-25 18:32:16,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:32:16,118 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:32:16,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:32:16,188 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:32:16,188 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:32:16,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054937780] [2021-11-25 18:32:16,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054937780] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:32:16,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436477355] [2021-11-25 18:32:16,189 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 18:32:16,189 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:32:16,189 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:32:16,190 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:32:16,191 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-25 18:32:16,264 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 18:32:16,264 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:32:16,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-25 18:32:16,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:32:16,342 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:32:16,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:32:16,428 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:32:16,429 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436477355] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:32:16,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2070458353] [2021-11-25 18:32:16,429 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:32:16,429 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:32:16,429 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2021-11-25 18:32:16,430 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290067021] [2021-11-25 18:32:16,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:32:16,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 18:32:16,430 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:32:16,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 18:32:16,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-11-25 18:32:16,431 INFO L87 Difference]: Start difference. First operand 81 states and 185 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:16,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:32:16,542 INFO L93 Difference]: Finished difference Result 77 states and 174 transitions. [2021-11-25 18:32:16,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-25 18:32:16,542 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 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 19 [2021-11-25 18:32:16,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:32:16,543 INFO L225 Difference]: With dead ends: 77 [2021-11-25 18:32:16,543 INFO L226 Difference]: Without dead ends: 77 [2021-11-25 18:32:16,543 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2021-11-25 18:32:16,544 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 76 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:32:16,544 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 10 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:32:16,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-11-25 18:32:16,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 65. [2021-11-25 18:32:16,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 2.25) internal successors, (144), 64 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:16,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 144 transitions. [2021-11-25 18:32:16,547 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 144 transitions. Word has length 19 [2021-11-25 18:32:16,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:32:16,548 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 144 transitions. [2021-11-25 18:32:16,548 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:16,548 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 144 transitions. [2021-11-25 18:32:16,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-25 18:32:16,549 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:32:16,549 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:32:16,586 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-11-25 18:32:16,765 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-11-25 18:32:16,765 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:32:16,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:32:16,766 INFO L85 PathProgramCache]: Analyzing trace with hash -2121399317, now seen corresponding path program 10 times [2021-11-25 18:32:16,766 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:32:16,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240491541] [2021-11-25 18:32:16,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:32:16,766 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:32:16,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:32:16,838 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:32:16,838 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:32:16,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240491541] [2021-11-25 18:32:16,839 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240491541] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:32:16,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839620954] [2021-11-25 18:32:16,839 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 18:32:16,839 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:32:16,839 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:32:16,850 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:32:16,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-25 18:32:16,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:32:16,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-25 18:32:16,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:32:17,027 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:32:17,027 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:32:17,128 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:32:17,129 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1839620954] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:32:17,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1312576642] [2021-11-25 18:32:17,129 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:32:17,130 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:32:17,131 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2021-11-25 18:32:17,131 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624008879] [2021-11-25 18:32:17,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:32:17,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 18:32:17,132 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:32:17,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 18:32:17,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-11-25 18:32:17,133 INFO L87 Difference]: Start difference. First operand 65 states and 144 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:17,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:32:17,253 INFO L93 Difference]: Finished difference Result 77 states and 173 transitions. [2021-11-25 18:32:17,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-25 18:32:17,253 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 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 19 [2021-11-25 18:32:17,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:32:17,254 INFO L225 Difference]: With dead ends: 77 [2021-11-25 18:32:17,254 INFO L226 Difference]: Without dead ends: 77 [2021-11-25 18:32:17,254 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2021-11-25 18:32:17,255 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 99 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:32:17,255 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 10 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:32:17,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-11-25 18:32:17,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2021-11-25 18:32:17,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 2.276315789473684) internal successors, (173), 76 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:17,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 173 transitions. [2021-11-25 18:32:17,259 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 173 transitions. Word has length 19 [2021-11-25 18:32:17,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:32:17,259 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 173 transitions. [2021-11-25 18:32:17,259 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:17,259 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 173 transitions. [2021-11-25 18:32:17,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 18:32:17,260 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:32:17,260 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:32:17,296 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-11-25 18:32:17,461 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:32:17,461 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:32:17,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:32:17,461 INFO L85 PathProgramCache]: Analyzing trace with hash -94410640, now seen corresponding path program 11 times [2021-11-25 18:32:17,461 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:32:17,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112022530] [2021-11-25 18:32:17,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:32:17,462 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:32:17,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:32:17,874 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:32:17,874 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:32:17,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112022530] [2021-11-25 18:32:17,874 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112022530] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:32:17,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937041609] [2021-11-25 18:32:17,874 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:32:17,875 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:32:17,875 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:32:17,877 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:32:17,903 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-11-25 18:32:17,980 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 18:32:17,980 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:32:17,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 76 conjunts are in the unsatisfiable core [2021-11-25 18:32:17,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:32:18,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:32:18,180 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 22 treesize of output 22 [2021-11-25 18:32:18,287 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:32:18,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:32:18,416 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_458 (Array Int Int))) (< (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_458) c_~A~0.base))) (+ (select .cse0 c_~A~0.offset) (select .cse0 (+ c_~A~0.offset 4)))) (+ c_~counter~0 1))) (forall ((v_ArrVal_458 (Array Int Int))) (<= c_~counter~0 (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_458) c_~A~0.base))) (+ (select .cse1 c_~A~0.offset) (select .cse1 (+ c_~A~0.offset 4))))))) is different from false [2021-11-25 18:32:18,445 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_458 (Array Int Int))) (< (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_458) c_~A~0.base))) (+ (select .cse0 c_~A~0.offset) (select .cse0 (+ c_~A~0.offset 4)))) (+ c_~counter~0 1 (select (select |c_#memory_int| c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) c_~A~0.offset))))) (forall ((v_ArrVal_458 (Array Int Int))) (<= (+ c_~counter~0 (select (select |c_#memory_int| c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) c_~A~0.offset))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_458) c_~A~0.base))) (+ (select .cse1 c_~A~0.offset) (select .cse1 (+ c_~A~0.offset 4))))))) is different from false [2021-11-25 18:32:18,484 INFO L354 Elim1Store]: treesize reduction 39, result has 52.4 percent of original size [2021-11-25 18:32:18,484 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 76 treesize of output 74 [2021-11-25 18:32:18,490 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-25 18:32:18,490 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 18 treesize of output 12 [2021-11-25 18:32:18,641 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:32:18,656 INFO L354 Elim1Store]: treesize reduction 73, result has 11.0 percent of original size [2021-11-25 18:32:18,657 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 36 treesize of output 18 [2021-11-25 18:32:18,752 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 3 not checked. [2021-11-25 18:32:18,753 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937041609] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:32:18,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1206206679] [2021-11-25 18:32:18,753 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:32:18,753 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:32:18,753 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 24 [2021-11-25 18:32:18,754 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476582015] [2021-11-25 18:32:18,754 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:32:18,754 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-11-25 18:32:18,754 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:32:18,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-11-25 18:32:18,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=469, Unknown=2, NotChecked=90, Total=650 [2021-11-25 18:32:18,755 INFO L87 Difference]: Start difference. First operand 77 states and 173 transitions. Second operand has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 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 18:32:19,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:32:19,287 INFO L93 Difference]: Finished difference Result 122 states and 276 transitions. [2021-11-25 18:32:19,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-25 18:32:19,287 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 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 20 [2021-11-25 18:32:19,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:32:19,288 INFO L225 Difference]: With dead ends: 122 [2021-11-25 18:32:19,289 INFO L226 Difference]: Without dead ends: 117 [2021-11-25 18:32:19,289 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 20 SyntacticMatches, 7 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=146, Invalid=730, Unknown=2, NotChecked=114, Total=992 [2021-11-25 18:32:19,290 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 59 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 99 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-25 18:32:19,290 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 36 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 489 Invalid, 0 Unknown, 99 Unchecked, 0.3s Time] [2021-11-25 18:32:19,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-11-25 18:32:19,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 97. [2021-11-25 18:32:19,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 2.34375) internal successors, (225), 96 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:19,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 225 transitions. [2021-11-25 18:32:19,295 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 225 transitions. Word has length 20 [2021-11-25 18:32:19,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:32:19,295 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 225 transitions. [2021-11-25 18:32:19,295 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 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 18:32:19,295 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 225 transitions. [2021-11-25 18:32:19,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 18:32:19,296 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:32:19,296 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:32:19,332 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-11-25 18:32:19,497 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-11-25 18:32:19,497 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:32:19,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:32:19,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1962568016, now seen corresponding path program 12 times [2021-11-25 18:32:19,497 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:32:19,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494138187] [2021-11-25 18:32:19,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:32:19,498 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:32:19,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:32:19,958 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:32:19,959 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:32:19,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494138187] [2021-11-25 18:32:19,959 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494138187] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:32:19,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828228644] [2021-11-25 18:32:19,959 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 18:32:19,959 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:32:19,959 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:32:19,961 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:32:19,985 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-11-25 18:32:20,067 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 18:32:20,067 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:32:20,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 78 conjunts are in the unsatisfiable core [2021-11-25 18:32:20,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:32:20,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:32:20,237 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 19 treesize of output 21 [2021-11-25 18:32:20,434 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 18:32:20,434 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:32:20,651 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_493 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_493) c_~A~0.base))) (<= (+ c_~counter~0 (select .cse0 (+ (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) c_~A~0.offset))) (+ (select .cse0 (+ c_~A~0.offset 4)) (select .cse0 c_~A~0.offset))))) (forall ((v_ArrVal_493 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_493) c_~A~0.base))) (< (+ (select .cse1 (+ c_~A~0.offset 4)) (select .cse1 c_~A~0.offset)) (+ c_~counter~0 (select .cse1 (+ (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) c_~A~0.offset)) 1))))) is different from false [2021-11-25 18:32:20,705 INFO L354 Elim1Store]: treesize reduction 39, result has 52.4 percent of original size [2021-11-25 18:32:20,705 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 76 treesize of output 83 [2021-11-25 18:32:20,723 INFO L354 Elim1Store]: treesize reduction 16, result has 59.0 percent of original size [2021-11-25 18:32:20,724 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 26 treesize of output 36 [2021-11-25 18:32:20,956 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:32:20,974 INFO L354 Elim1Store]: treesize reduction 73, result has 11.0 percent of original size [2021-11-25 18:32:20,975 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 35 treesize of output 17 [2021-11-25 18:32:21,088 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:32:21,088 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828228644] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:32:21,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1702048445] [2021-11-25 18:32:21,089 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:32:21,089 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:32:21,089 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 9] total 29 [2021-11-25 18:32:21,089 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707506429] [2021-11-25 18:32:21,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:32:21,090 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-11-25 18:32:21,090 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:32:21,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-11-25 18:32:21,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=772, Unknown=1, NotChecked=56, Total=930 [2021-11-25 18:32:21,091 INFO L87 Difference]: Start difference. First operand 97 states and 225 transitions. Second operand has 31 states, 30 states have (on average 1.5666666666666667) internal successors, (47), 30 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:22,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:32:22,285 INFO L93 Difference]: Finished difference Result 175 states and 403 transitions. [2021-11-25 18:32:22,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-25 18:32:22,286 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.5666666666666667) internal successors, (47), 30 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-11-25 18:32:22,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:32:22,287 INFO L225 Difference]: With dead ends: 175 [2021-11-25 18:32:22,287 INFO L226 Difference]: Without dead ends: 170 [2021-11-25 18:32:22,288 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=263, Invalid=1720, Unknown=1, NotChecked=86, Total=2070 [2021-11-25 18:32:22,289 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 93 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 130 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-25 18:32:22,289 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 35 Invalid, 950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 787 Invalid, 0 Unknown, 130 Unchecked, 0.5s Time] [2021-11-25 18:32:22,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-11-25 18:32:22,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 111. [2021-11-25 18:32:22,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 110 states have (on average 2.4727272727272727) internal successors, (272), 110 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:22,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 272 transitions. [2021-11-25 18:32:22,295 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 272 transitions. Word has length 20 [2021-11-25 18:32:22,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:32:22,296 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 272 transitions. [2021-11-25 18:32:22,296 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.5666666666666667) internal successors, (47), 30 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:22,296 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 272 transitions. [2021-11-25 18:32:22,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 18:32:22,297 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:32:22,297 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:32:22,320 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-11-25 18:32:22,505 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-11-25 18:32:22,505 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:32:22,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:32:22,506 INFO L85 PathProgramCache]: Analyzing trace with hash 924071846, now seen corresponding path program 13 times [2021-11-25 18:32:22,506 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:32:22,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604178914] [2021-11-25 18:32:22,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:32:22,506 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:32:22,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:32:23,077 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:32:23,078 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:32:23,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604178914] [2021-11-25 18:32:23,078 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604178914] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:32:23,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489980089] [2021-11-25 18:32:23,078 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 18:32:23,078 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:32:23,078 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:32:23,081 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:32:23,086 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-11-25 18:32:23,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:32:23,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 74 conjunts are in the unsatisfiable core [2021-11-25 18:32:23,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:32:23,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:32:23,318 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 14 treesize of output 16 [2021-11-25 18:32:23,473 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:32:23,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:32:23,650 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_528 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_528) c_~A~0.base))) (<= (+ c_~counter~0 (select .cse0 (+ (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) c_~A~0.offset))) (+ (select .cse0 c_~A~0.offset) (select .cse0 (+ c_~A~0.offset 4)))))) (forall ((v_ArrVal_528 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_528) c_~A~0.base))) (< (+ (select .cse1 c_~A~0.offset) (select .cse1 (+ c_~A~0.offset 4))) (+ c_~counter~0 (select .cse1 (+ (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) c_~A~0.offset)) 1))))) is different from false [2021-11-25 18:32:23,697 INFO L354 Elim1Store]: treesize reduction 39, result has 52.4 percent of original size [2021-11-25 18:32:23,697 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 74 treesize of output 81 [2021-11-25 18:32:23,720 INFO L354 Elim1Store]: treesize reduction 16, result has 59.0 percent of original size [2021-11-25 18:32:23,720 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 25 treesize of output 35 [2021-11-25 18:32:23,845 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:32:23,858 INFO L354 Elim1Store]: treesize reduction 73, result has 11.0 percent of original size [2021-11-25 18:32:23,858 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 36 treesize of output 18 [2021-11-25 18:32:23,992 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:32:23,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [489980089] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:32:23,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1857802705] [2021-11-25 18:32:23,992 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:32:23,993 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:32:23,993 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 27 [2021-11-25 18:32:23,993 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510666274] [2021-11-25 18:32:23,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:32:23,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-11-25 18:32:23,994 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:32:23,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-11-25 18:32:23,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=647, Unknown=1, NotChecked=52, Total=812 [2021-11-25 18:32:23,995 INFO L87 Difference]: Start difference. First operand 111 states and 272 transitions. Second operand has 29 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 28 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:25,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:32:25,118 INFO L93 Difference]: Finished difference Result 177 states and 415 transitions. [2021-11-25 18:32:25,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-25 18:32:25,121 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 28 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-11-25 18:32:25,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:32:25,122 INFO L225 Difference]: With dead ends: 177 [2021-11-25 18:32:25,122 INFO L226 Difference]: Without dead ends: 167 [2021-11-25 18:32:25,123 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 21 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=302, Invalid=1593, Unknown=1, NotChecked=84, Total=1980 [2021-11-25 18:32:25,124 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 123 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 73 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-25 18:32:25,124 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 23 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 661 Invalid, 0 Unknown, 73 Unchecked, 0.4s Time] [2021-11-25 18:32:25,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-11-25 18:32:25,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 117. [2021-11-25 18:32:25,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 2.5172413793103448) internal successors, (292), 116 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:25,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 292 transitions. [2021-11-25 18:32:25,130 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 292 transitions. Word has length 20 [2021-11-25 18:32:25,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:32:25,131 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 292 transitions. [2021-11-25 18:32:25,131 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 28 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:25,131 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 292 transitions. [2021-11-25 18:32:25,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 18:32:25,132 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:32:25,132 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:32:25,164 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-11-25 18:32:25,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-11-25 18:32:25,347 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:32:25,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:32:25,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1222098914, now seen corresponding path program 14 times [2021-11-25 18:32:25,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:32:25,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686191262] [2021-11-25 18:32:25,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:32:25,348 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:32:25,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:32:25,827 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:32:25,827 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:32:25,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686191262] [2021-11-25 18:32:25,827 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686191262] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:32:25,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648863772] [2021-11-25 18:32:25,828 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:32:25,828 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:32:25,828 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:32:25,833 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:32:25,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-11-25 18:32:25,947 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-11-25 18:32:25,947 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:32:25,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 80 conjunts are in the unsatisfiable core [2021-11-25 18:32:25,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:32:26,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:32:26,132 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 19 treesize of output 21 [2021-11-25 18:32:26,341 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 18:32:26,341 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:32:26,520 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_563 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_563) c_~A~0.base))) (< (+ (select .cse0 (+ c_~A~0.offset 4)) (select .cse0 c_~A~0.offset)) (+ c_~counter~0 (select .cse0 (+ (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) c_~A~0.offset)) 1)))) (forall ((v_ArrVal_563 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_563) c_~A~0.base))) (<= (+ c_~counter~0 (select .cse1 (+ (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) c_~A~0.offset))) (+ (select .cse1 (+ c_~A~0.offset 4)) (select .cse1 c_~A~0.offset)))))) is different from false [2021-11-25 18:32:26,561 INFO L354 Elim1Store]: treesize reduction 39, result has 52.4 percent of original size [2021-11-25 18:32:26,562 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 76 treesize of output 83 [2021-11-25 18:32:26,585 INFO L354 Elim1Store]: treesize reduction 16, result has 59.0 percent of original size [2021-11-25 18:32:26,586 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 26 treesize of output 36 [2021-11-25 18:32:26,722 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:32:26,735 INFO L354 Elim1Store]: treesize reduction 73, result has 11.0 percent of original size [2021-11-25 18:32:26,735 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 35 treesize of output 17 [2021-11-25 18:32:26,859 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:32:26,860 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648863772] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:32:26,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2084825245] [2021-11-25 18:32:26,860 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:32:26,861 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:32:26,861 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 9] total 29 [2021-11-25 18:32:26,861 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279947114] [2021-11-25 18:32:26,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:32:26,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-11-25 18:32:26,862 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:32:26,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-11-25 18:32:26,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=756, Unknown=1, NotChecked=56, Total=930 [2021-11-25 18:32:26,863 INFO L87 Difference]: Start difference. First operand 117 states and 292 transitions. Second operand has 31 states, 30 states have (on average 1.5333333333333334) internal successors, (46), 30 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 18:32:27,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:32:27,928 INFO L93 Difference]: Finished difference Result 164 states and 401 transitions. [2021-11-25 18:32:27,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-25 18:32:27,928 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.5333333333333334) internal successors, (46), 30 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 20 [2021-11-25 18:32:27,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:32:27,930 INFO L225 Difference]: With dead ends: 164 [2021-11-25 18:32:27,930 INFO L226 Difference]: Without dead ends: 159 [2021-11-25 18:32:27,931 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=285, Invalid=1698, Unknown=1, NotChecked=86, Total=2070 [2021-11-25 18:32:27,932 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 113 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-25 18:32:27,932 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 51 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 696 Invalid, 0 Unknown, 96 Unchecked, 0.4s Time] [2021-11-25 18:32:27,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-11-25 18:32:27,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 117. [2021-11-25 18:32:27,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 2.5172413793103448) internal successors, (292), 116 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:27,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 292 transitions. [2021-11-25 18:32:27,938 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 292 transitions. Word has length 20 [2021-11-25 18:32:27,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:32:27,938 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 292 transitions. [2021-11-25 18:32:27,938 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.5333333333333334) internal successors, (46), 30 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 18:32:27,939 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 292 transitions. [2021-11-25 18:32:27,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 18:32:27,939 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:32:27,939 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:32:27,961 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-11-25 18:32:28,145 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:32:28,145 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:32:28,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:32:28,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1234822282, now seen corresponding path program 15 times [2021-11-25 18:32:28,146 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:32:28,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730422521] [2021-11-25 18:32:28,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:32:28,146 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:32:28,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:32:28,594 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:32:28,594 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:32:28,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730422521] [2021-11-25 18:32:28,594 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730422521] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:32:28,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836627073] [2021-11-25 18:32:28,594 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 18:32:28,595 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:32:28,595 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:32:28,595 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:32:28,596 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-11-25 18:32:28,695 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 18:32:28,695 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:32:28,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 73 conjunts are in the unsatisfiable core [2021-11-25 18:32:28,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:32:28,987 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 18:32:28,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:32:29,154 INFO L354 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2021-11-25 18:32:29,155 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 42 treesize of output 61 [2021-11-25 18:32:29,241 INFO L354 Elim1Store]: treesize reduction 94, result has 8.7 percent of original size [2021-11-25 18:32:29,241 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 43 treesize of output 18 [2021-11-25 18:32:29,326 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:32:29,326 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836627073] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:32:29,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2034177405] [2021-11-25 18:32:29,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 18:32:29,327 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:32:29,327 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 6] total 24 [2021-11-25 18:32:29,327 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204707326] [2021-11-25 18:32:29,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:32:29,328 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-11-25 18:32:29,328 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:32:29,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-11-25 18:32:29,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2021-11-25 18:32:29,329 INFO L87 Difference]: Start difference. First operand 117 states and 292 transitions. Second operand has 26 states, 25 states have (on average 1.88) internal successors, (47), 25 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:30,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:32:30,001 INFO L93 Difference]: Finished difference Result 179 states and 435 transitions. [2021-11-25 18:32:30,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-25 18:32:30,002 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.88) internal successors, (47), 25 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-11-25 18:32:30,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:32:30,003 INFO L225 Difference]: With dead ends: 179 [2021-11-25 18:32:30,003 INFO L226 Difference]: Without dead ends: 169 [2021-11-25 18:32:30,003 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=190, Invalid=1000, Unknown=0, NotChecked=0, Total=1190 [2021-11-25 18:32:30,004 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 66 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-25 18:32:30,005 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 21 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-25 18:32:30,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2021-11-25 18:32:30,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 133. [2021-11-25 18:32:30,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 2.5303030303030303) internal successors, (334), 132 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:30,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 334 transitions. [2021-11-25 18:32:30,011 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 334 transitions. Word has length 20 [2021-11-25 18:32:30,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:32:30,012 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 334 transitions. [2021-11-25 18:32:30,012 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.88) internal successors, (47), 25 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:30,012 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 334 transitions. [2021-11-25 18:32:30,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 18:32:30,013 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:32:30,013 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:32:30,050 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-11-25 18:32:30,237 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:32:30,237 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:32:30,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:32:30,238 INFO L85 PathProgramCache]: Analyzing trace with hash 943340086, now seen corresponding path program 16 times [2021-11-25 18:32:30,238 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:32:30,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312519367] [2021-11-25 18:32:30,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:32:30,238 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:32:30,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:32:30,481 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:32:30,481 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:32:30,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312519367] [2021-11-25 18:32:30,482 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312519367] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:32:30,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184925416] [2021-11-25 18:32:30,482 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 18:32:30,482 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:32:30,482 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:32:30,483 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:32:30,484 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-11-25 18:32:30,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:32:30,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 71 conjunts are in the unsatisfiable core [2021-11-25 18:32:30,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:32:30,784 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 18:32:30,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:32:30,938 INFO L354 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2021-11-25 18:32:30,939 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 42 treesize of output 61 [2021-11-25 18:32:31,070 INFO L354 Elim1Store]: treesize reduction 94, result has 8.7 percent of original size [2021-11-25 18:32:31,071 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 43 treesize of output 18 [2021-11-25 18:32:31,133 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:32:31,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1184925416] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:32:31,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1615983136] [2021-11-25 18:32:31,134 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:32:31,134 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:32:31,135 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 6] total 18 [2021-11-25 18:32:31,135 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938518587] [2021-11-25 18:32:31,135 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:32:31,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-25 18:32:31,136 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:32:31,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-25 18:32:31,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2021-11-25 18:32:31,137 INFO L87 Difference]: Start difference. First operand 133 states and 334 transitions. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:31,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:32:31,514 INFO L93 Difference]: Finished difference Result 193 states and 468 transitions. [2021-11-25 18:32:31,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-25 18:32:31,515 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.0526315789473686) 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 20 [2021-11-25 18:32:31,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:32:31,516 INFO L225 Difference]: With dead ends: 193 [2021-11-25 18:32:31,516 INFO L226 Difference]: Without dead ends: 183 [2021-11-25 18:32:31,517 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2021-11-25 18:32:31,518 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 48 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-25 18:32:31,518 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 14 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-25 18:32:31,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2021-11-25 18:32:31,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 135. [2021-11-25 18:32:31,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 2.5597014925373136) internal successors, (343), 134 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:31,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 343 transitions. [2021-11-25 18:32:31,533 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 343 transitions. Word has length 20 [2021-11-25 18:32:31,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:32:31,535 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 343 transitions. [2021-11-25 18:32:31,535 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:31,535 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 343 transitions. [2021-11-25 18:32:31,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 18:32:31,536 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:32:31,537 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:32:31,561 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-11-25 18:32:31,757 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-11-25 18:32:31,757 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:32:31,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:32:31,758 INFO L85 PathProgramCache]: Analyzing trace with hash 244883400, now seen corresponding path program 17 times [2021-11-25 18:32:31,758 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:32:31,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829882488] [2021-11-25 18:32:31,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:32:31,758 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:32:31,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:32:32,068 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:32:32,068 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:32:32,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829882488] [2021-11-25 18:32:32,068 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829882488] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:32:32,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959865433] [2021-11-25 18:32:32,068 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:32:32,068 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:32:32,069 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:32:32,069 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:32:32,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-11-25 18:32:32,177 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-11-25 18:32:32,177 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:32:32,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 73 conjunts are in the unsatisfiable core [2021-11-25 18:32:32,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:32:32,434 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 18:32:32,434 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:32:32,585 INFO L354 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2021-11-25 18:32:32,585 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 42 treesize of output 61 [2021-11-25 18:32:32,693 INFO L354 Elim1Store]: treesize reduction 94, result has 8.7 percent of original size [2021-11-25 18:32:32,693 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 43 treesize of output 18 [2021-11-25 18:32:32,794 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:32:32,795 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959865433] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:32:32,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [679508080] [2021-11-25 18:32:32,795 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:32:32,795 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:32:32,796 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 6] total 24 [2021-11-25 18:32:32,796 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721141951] [2021-11-25 18:32:32,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:32:32,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-11-25 18:32:32,796 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:32:32,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-11-25 18:32:32,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2021-11-25 18:32:32,797 INFO L87 Difference]: Start difference. First operand 135 states and 343 transitions. Second operand has 26 states, 25 states have (on average 1.88) internal successors, (47), 25 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:33,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:32:33,678 INFO L93 Difference]: Finished difference Result 209 states and 509 transitions. [2021-11-25 18:32:33,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-25 18:32:33,678 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.88) internal successors, (47), 25 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-11-25 18:32:33,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:32:33,680 INFO L225 Difference]: With dead ends: 209 [2021-11-25 18:32:33,680 INFO L226 Difference]: Without dead ends: 199 [2021-11-25 18:32:33,680 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=194, Invalid=996, Unknown=0, NotChecked=0, Total=1190 [2021-11-25 18:32:33,681 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 63 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-25 18:32:33,681 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 22 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-25 18:32:33,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-11-25 18:32:33,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 143. [2021-11-25 18:32:33,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 2.5985915492957745) internal successors, (369), 142 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:33,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 369 transitions. [2021-11-25 18:32:33,689 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 369 transitions. Word has length 20 [2021-11-25 18:32:33,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:32:33,689 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 369 transitions. [2021-11-25 18:32:33,689 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.88) internal successors, (47), 25 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:33,690 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 369 transitions. [2021-11-25 18:32:33,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 18:32:33,690 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:32:33,691 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:32:33,714 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2021-11-25 18:32:33,897 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-11-25 18:32:33,897 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:32:33,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:32:33,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1163444034, now seen corresponding path program 18 times [2021-11-25 18:32:33,898 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:32:33,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992899097] [2021-11-25 18:32:33,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:32:33,898 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:32:33,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:32:34,134 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:32:34,134 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:32:34,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992899097] [2021-11-25 18:32:34,135 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992899097] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:32:34,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005820380] [2021-11-25 18:32:34,135 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 18:32:34,135 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:32:34,135 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:32:34,141 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:32:34,164 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-11-25 18:32:34,257 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 18:32:34,258 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:32:34,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 73 conjunts are in the unsatisfiable core [2021-11-25 18:32:34,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:32:34,463 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 18:32:34,463 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:32:34,611 INFO L354 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2021-11-25 18:32:34,611 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 42 treesize of output 61 [2021-11-25 18:32:34,719 INFO L354 Elim1Store]: treesize reduction 94, result has 8.7 percent of original size [2021-11-25 18:32:34,719 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 43 treesize of output 18 [2021-11-25 18:32:34,794 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:32:34,794 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005820380] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:32:34,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1137577] [2021-11-25 18:32:34,795 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:32:34,795 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:32:34,795 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 6] total 14 [2021-11-25 18:32:34,796 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120219259] [2021-11-25 18:32:34,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:32:34,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-25 18:32:34,796 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:32:34,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-25 18:32:34,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2021-11-25 18:32:34,797 INFO L87 Difference]: Start difference. First operand 143 states and 369 transitions. Second operand has 16 states, 15 states have (on average 2.2) internal successors, (33), 15 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:35,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:32:35,181 INFO L93 Difference]: Finished difference Result 185 states and 455 transitions. [2021-11-25 18:32:35,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-25 18:32:35,181 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.2) internal successors, (33), 15 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-11-25 18:32:35,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:32:35,186 INFO L225 Difference]: With dead ends: 185 [2021-11-25 18:32:35,186 INFO L226 Difference]: Without dead ends: 175 [2021-11-25 18:32:35,186 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2021-11-25 18:32:35,187 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 47 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-25 18:32:35,187 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 16 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-25 18:32:35,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-11-25 18:32:35,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 137. [2021-11-25 18:32:35,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 2.5588235294117645) internal successors, (348), 136 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:35,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 348 transitions. [2021-11-25 18:32:35,199 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 348 transitions. Word has length 20 [2021-11-25 18:32:35,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:32:35,201 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 348 transitions. [2021-11-25 18:32:35,201 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.2) internal successors, (33), 15 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:35,201 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 348 transitions. [2021-11-25 18:32:35,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 18:32:35,206 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:32:35,206 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:32:35,227 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2021-11-25 18:32:35,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:32:35,407 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:32:35,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:32:35,407 INFO L85 PathProgramCache]: Analyzing trace with hash 985352502, now seen corresponding path program 19 times [2021-11-25 18:32:35,407 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:32:35,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721521546] [2021-11-25 18:32:35,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:32:35,408 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:32:35,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:32:35,755 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:32:35,756 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:32:35,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721521546] [2021-11-25 18:32:35,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721521546] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:32:35,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825382251] [2021-11-25 18:32:35,756 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 18:32:35,756 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:32:35,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:32:35,757 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:32:35,759 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-11-25 18:32:35,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:32:35,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 69 conjunts are in the unsatisfiable core [2021-11-25 18:32:35,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:32:36,068 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:32:36,069 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:32:36,210 INFO L354 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2021-11-25 18:32:36,210 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 42 treesize of output 61 [2021-11-25 18:32:36,296 INFO L354 Elim1Store]: treesize reduction 94, result has 8.7 percent of original size [2021-11-25 18:32:36,297 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 43 treesize of output 18 [2021-11-25 18:32:36,367 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:32:36,367 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1825382251] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:32:36,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [38614451] [2021-11-25 18:32:36,368 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:32:36,368 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:32:36,368 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 6] total 23 [2021-11-25 18:32:36,368 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389847464] [2021-11-25 18:32:36,368 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:32:36,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-25 18:32:36,369 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:32:36,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-25 18:32:36,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=495, Unknown=0, NotChecked=0, Total=600 [2021-11-25 18:32:36,370 INFO L87 Difference]: Start difference. First operand 137 states and 348 transitions. Second operand has 25 states, 24 states have (on average 1.875) internal successors, (45), 24 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:37,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:32:37,110 INFO L93 Difference]: Finished difference Result 223 states and 544 transitions. [2021-11-25 18:32:37,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-25 18:32:37,111 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.875) internal successors, (45), 24 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-11-25 18:32:37,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:32:37,112 INFO L225 Difference]: With dead ends: 223 [2021-11-25 18:32:37,113 INFO L226 Difference]: Without dead ends: 213 [2021-11-25 18:32:37,113 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=244, Invalid=1162, Unknown=0, NotChecked=0, Total=1406 [2021-11-25 18:32:37,114 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 124 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-25 18:32:37,114 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 20 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-25 18:32:37,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-11-25 18:32:37,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 147. [2021-11-25 18:32:37,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 146 states have (on average 2.5616438356164384) internal successors, (374), 146 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:37,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 374 transitions. [2021-11-25 18:32:37,122 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 374 transitions. Word has length 20 [2021-11-25 18:32:37,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:32:37,122 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 374 transitions. [2021-11-25 18:32:37,123 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.875) internal successors, (45), 24 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:37,123 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 374 transitions. [2021-11-25 18:32:37,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 18:32:37,123 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:32:37,124 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:32:37,165 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2021-11-25 18:32:37,349 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:32:37,349 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:32:37,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:32:37,350 INFO L85 PathProgramCache]: Analyzing trace with hash -694240660, now seen corresponding path program 20 times [2021-11-25 18:32:37,350 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:32:37,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083503706] [2021-11-25 18:32:37,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:32:37,350 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:32:37,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:32:37,761 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:32:37,761 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:32:37,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083503706] [2021-11-25 18:32:37,761 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083503706] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:32:37,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359087673] [2021-11-25 18:32:37,761 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:32:37,761 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:32:37,762 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:32:37,763 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:32:37,763 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-11-25 18:32:37,853 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 18:32:37,853 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:32:37,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 69 conjunts are in the unsatisfiable core [2021-11-25 18:32:37,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:32:38,106 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:32:38,106 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:32:38,243 INFO L354 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2021-11-25 18:32:38,244 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 42 treesize of output 61 [2021-11-25 18:32:38,322 INFO L354 Elim1Store]: treesize reduction 94, result has 8.7 percent of original size [2021-11-25 18:32:38,323 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 43 treesize of output 18 [2021-11-25 18:32:38,403 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:32:38,404 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1359087673] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:32:38,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1079276719] [2021-11-25 18:32:38,405 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:32:38,406 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:32:38,406 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 6] total 23 [2021-11-25 18:32:38,406 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224337479] [2021-11-25 18:32:38,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:32:38,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-25 18:32:38,407 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:32:38,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-25 18:32:38,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=522, Unknown=0, NotChecked=0, Total=600 [2021-11-25 18:32:38,407 INFO L87 Difference]: Start difference. First operand 147 states and 374 transitions. Second operand has 25 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 24 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 18:32:39,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:32:39,184 INFO L93 Difference]: Finished difference Result 220 states and 541 transitions. [2021-11-25 18:32:39,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-25 18:32:39,184 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 24 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 20 [2021-11-25 18:32:39,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:32:39,186 INFO L225 Difference]: With dead ends: 220 [2021-11-25 18:32:39,186 INFO L226 Difference]: Without dead ends: 205 [2021-11-25 18:32:39,187 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=169, Invalid=1021, Unknown=0, NotChecked=0, Total=1190 [2021-11-25 18:32:39,187 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 79 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-25 18:32:39,188 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 21 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-25 18:32:39,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2021-11-25 18:32:39,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 153. [2021-11-25 18:32:39,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 152 states have (on average 2.5723684210526314) internal successors, (391), 152 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:39,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 391 transitions. [2021-11-25 18:32:39,203 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 391 transitions. Word has length 20 [2021-11-25 18:32:39,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:32:39,205 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 391 transitions. [2021-11-25 18:32:39,205 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 24 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 18:32:39,206 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 391 transitions. [2021-11-25 18:32:39,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 18:32:39,206 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:32:39,207 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:32:39,241 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2021-11-25 18:32:39,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-11-25 18:32:39,429 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:32:39,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:32:39,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1483921708, now seen corresponding path program 21 times [2021-11-25 18:32:39,430 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:32:39,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012689535] [2021-11-25 18:32:39,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:32:39,430 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:32:39,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:32:39,724 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:32:39,724 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:32:39,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012689535] [2021-11-25 18:32:39,724 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012689535] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:32:39,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742774266] [2021-11-25 18:32:39,725 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 18:32:39,725 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:32:39,725 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:32:39,725 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:32:39,726 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2021-11-25 18:32:39,817 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 18:32:39,817 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:32:39,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 69 conjunts are in the unsatisfiable core [2021-11-25 18:32:39,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:32:40,025 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:32:40,025 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:32:40,158 INFO L354 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2021-11-25 18:32:40,159 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 42 treesize of output 61 [2021-11-25 18:32:40,230 INFO L354 Elim1Store]: treesize reduction 94, result has 8.7 percent of original size [2021-11-25 18:32:40,230 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 43 treesize of output 18 [2021-11-25 18:32:40,295 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:32:40,295 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742774266] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:32:40,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [455017543] [2021-11-25 18:32:40,295 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:32:40,295 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:32:40,296 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 6] total 23 [2021-11-25 18:32:40,296 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223974346] [2021-11-25 18:32:40,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:32:40,296 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-25 18:32:40,296 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:32:40,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-25 18:32:40,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2021-11-25 18:32:40,297 INFO L87 Difference]: Start difference. First operand 153 states and 391 transitions. Second operand has 25 states, 24 states have (on average 1.875) internal successors, (45), 24 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:40,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:32:40,881 INFO L93 Difference]: Finished difference Result 211 states and 520 transitions. [2021-11-25 18:32:40,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-25 18:32:40,881 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.875) internal successors, (45), 24 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-11-25 18:32:40,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:32:40,883 INFO L225 Difference]: With dead ends: 211 [2021-11-25 18:32:40,883 INFO L226 Difference]: Without dead ends: 201 [2021-11-25 18:32:40,884 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=203, Invalid=919, Unknown=0, NotChecked=0, Total=1122 [2021-11-25 18:32:40,885 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 73 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 710 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-25 18:32:40,885 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 19 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 710 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-25 18:32:40,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-11-25 18:32:40,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 147. [2021-11-25 18:32:40,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 146 states have (on average 2.5616438356164384) internal successors, (374), 146 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:40,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 374 transitions. [2021-11-25 18:32:40,892 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 374 transitions. Word has length 20 [2021-11-25 18:32:40,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:32:40,893 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 374 transitions. [2021-11-25 18:32:40,893 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.875) internal successors, (45), 24 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:40,893 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 374 transitions. [2021-11-25 18:32:40,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 18:32:40,894 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:32:40,894 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:32:40,945 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2021-11-25 18:32:41,117 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:32:41,117 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:32:41,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:32:41,118 INFO L85 PathProgramCache]: Analyzing trace with hash 785465022, now seen corresponding path program 22 times [2021-11-25 18:32:41,118 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:32:41,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92997736] [2021-11-25 18:32:41,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:32:41,118 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:32:41,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:32:41,446 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:32:41,446 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:32:41,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92997736] [2021-11-25 18:32:41,447 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92997736] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:32:41,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068993506] [2021-11-25 18:32:41,447 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 18:32:41,447 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:32:41,447 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:32:41,448 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:32:41,449 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2021-11-25 18:32:41,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:32:41,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 69 conjunts are in the unsatisfiable core [2021-11-25 18:32:41,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:32:41,740 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:32:41,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:32:41,875 INFO L354 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2021-11-25 18:32:41,875 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 42 treesize of output 61 [2021-11-25 18:32:41,948 INFO L354 Elim1Store]: treesize reduction 94, result has 8.7 percent of original size [2021-11-25 18:32:41,948 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 43 treesize of output 18 [2021-11-25 18:32:42,014 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:32:42,015 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068993506] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:32:42,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [646821463] [2021-11-25 18:32:42,015 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:32:42,015 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:32:42,016 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 6] total 23 [2021-11-25 18:32:42,016 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964767734] [2021-11-25 18:32:42,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:32:42,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-25 18:32:42,016 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:32:42,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-25 18:32:42,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2021-11-25 18:32:42,017 INFO L87 Difference]: Start difference. First operand 147 states and 374 transitions. Second operand has 25 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 24 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 18:32:42,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:32:42,589 INFO L93 Difference]: Finished difference Result 223 states and 545 transitions. [2021-11-25 18:32:42,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-25 18:32:42,589 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 24 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 20 [2021-11-25 18:32:42,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:32:42,590 INFO L225 Difference]: With dead ends: 223 [2021-11-25 18:32:42,591 INFO L226 Difference]: Without dead ends: 213 [2021-11-25 18:32:42,591 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=179, Invalid=877, Unknown=0, NotChecked=0, Total=1056 [2021-11-25 18:32:42,591 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 62 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-25 18:32:42,592 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 21 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-25 18:32:42,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-11-25 18:32:42,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 153. [2021-11-25 18:32:42,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 152 states have (on average 2.598684210526316) internal successors, (395), 152 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:42,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 395 transitions. [2021-11-25 18:32:42,599 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 395 transitions. Word has length 20 [2021-11-25 18:32:42,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:32:42,599 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 395 transitions. [2021-11-25 18:32:42,599 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 24 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 18:32:42,599 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 395 transitions. [2021-11-25 18:32:42,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 18:32:42,600 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:32:42,600 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:32:42,652 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2021-11-25 18:32:42,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-11-25 18:32:42,817 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:32:42,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:32:42,818 INFO L85 PathProgramCache]: Analyzing trace with hash -622862412, now seen corresponding path program 23 times [2021-11-25 18:32:42,818 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:32:42,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131905310] [2021-11-25 18:32:42,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:32:42,818 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:32:42,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:32:43,204 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:32:43,204 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:32:43,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131905310] [2021-11-25 18:32:43,204 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131905310] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:32:43,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572676287] [2021-11-25 18:32:43,205 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:32:43,205 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:32:43,205 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:32:43,209 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:32:43,225 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2021-11-25 18:32:43,333 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-11-25 18:32:43,333 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:32:43,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 73 conjunts are in the unsatisfiable core [2021-11-25 18:32:43,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:32:43,606 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 18:32:43,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:32:43,764 INFO L354 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2021-11-25 18:32:43,764 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 42 treesize of output 61 [2021-11-25 18:32:43,853 INFO L354 Elim1Store]: treesize reduction 94, result has 8.7 percent of original size [2021-11-25 18:32:43,853 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 43 treesize of output 18 [2021-11-25 18:32:43,927 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:32:43,927 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572676287] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:32:43,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [42705255] [2021-11-25 18:32:43,927 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:32:43,928 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:32:43,929 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 6] total 25 [2021-11-25 18:32:43,929 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367556300] [2021-11-25 18:32:43,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:32:43,929 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-11-25 18:32:43,929 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:32:43,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-11-25 18:32:43,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=595, Unknown=0, NotChecked=0, Total=702 [2021-11-25 18:32:43,930 INFO L87 Difference]: Start difference. First operand 153 states and 395 transitions. Second operand has 27 states, 26 states have (on average 1.7692307692307692) internal successors, (46), 26 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 18:32:44,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:32:44,658 INFO L93 Difference]: Finished difference Result 225 states and 551 transitions. [2021-11-25 18:32:44,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-25 18:32:44,659 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.7692307692307692) internal successors, (46), 26 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 20 [2021-11-25 18:32:44,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:32:44,660 INFO L225 Difference]: With dead ends: 225 [2021-11-25 18:32:44,661 INFO L226 Difference]: Without dead ends: 215 [2021-11-25 18:32:44,661 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=244, Invalid=1316, Unknown=0, NotChecked=0, Total=1560 [2021-11-25 18:32:44,662 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 119 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-25 18:32:44,662 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 24 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-25 18:32:44,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2021-11-25 18:32:44,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 147. [2021-11-25 18:32:44,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 146 states have (on average 2.5616438356164384) internal successors, (374), 146 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:44,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 374 transitions. [2021-11-25 18:32:44,668 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 374 transitions. Word has length 20 [2021-11-25 18:32:44,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:32:44,669 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 374 transitions. [2021-11-25 18:32:44,669 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.7692307692307692) internal successors, (46), 26 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 18:32:44,670 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 374 transitions. [2021-11-25 18:32:44,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 18:32:44,670 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:32:44,671 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:32:44,701 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2021-11-25 18:32:44,892 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-11-25 18:32:44,892 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:32:44,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:32:44,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1525934124, now seen corresponding path program 24 times [2021-11-25 18:32:44,893 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:32:44,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708244101] [2021-11-25 18:32:44,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:32:44,893 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:32:44,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:32:45,239 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:32:45,239 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:32:45,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708244101] [2021-11-25 18:32:45,247 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708244101] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:32:45,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748850158] [2021-11-25 18:32:45,247 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 18:32:45,247 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:32:45,247 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:32:45,249 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:32:45,273 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2021-11-25 18:32:45,369 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 18:32:45,369 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:32:45,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 73 conjunts are in the unsatisfiable core [2021-11-25 18:32:45,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:32:45,572 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 18:32:45,572 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:32:45,699 INFO L354 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2021-11-25 18:32:45,699 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 42 treesize of output 61 [2021-11-25 18:32:45,813 INFO L354 Elim1Store]: treesize reduction 94, result has 8.7 percent of original size [2021-11-25 18:32:45,814 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 43 treesize of output 18 [2021-11-25 18:32:45,897 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:32:45,897 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748850158] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:32:45,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1304314268] [2021-11-25 18:32:45,898 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:32:45,898 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:32:45,898 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 6] total 24 [2021-11-25 18:32:45,898 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329496038] [2021-11-25 18:32:45,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:32:45,899 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-11-25 18:32:45,899 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:32:45,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-11-25 18:32:45,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2021-11-25 18:32:45,900 INFO L87 Difference]: Start difference. First operand 147 states and 374 transitions. Second operand has 26 states, 25 states have (on average 1.84) internal successors, (46), 25 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 18:32:46,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:32:46,576 INFO L93 Difference]: Finished difference Result 233 states and 570 transitions. [2021-11-25 18:32:46,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-25 18:32:46,577 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.84) internal successors, (46), 25 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 20 [2021-11-25 18:32:46,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:32:46,578 INFO L225 Difference]: With dead ends: 233 [2021-11-25 18:32:46,578 INFO L226 Difference]: Without dead ends: 223 [2021-11-25 18:32:46,579 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=222, Invalid=1110, Unknown=0, NotChecked=0, Total=1332 [2021-11-25 18:32:46,585 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 110 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-25 18:32:46,585 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 24 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 647 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-25 18:32:46,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2021-11-25 18:32:46,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 143. [2021-11-25 18:32:46,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 2.563380281690141) internal successors, (364), 142 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:46,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 364 transitions. [2021-11-25 18:32:46,591 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 364 transitions. Word has length 20 [2021-11-25 18:32:46,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:32:46,592 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 364 transitions. [2021-11-25 18:32:46,592 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.84) internal successors, (46), 25 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 18:32:46,592 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 364 transitions. [2021-11-25 18:32:46,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 18:32:46,593 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:32:46,593 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:32:46,622 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2021-11-25 18:32:46,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-11-25 18:32:46,812 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:32:46,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:32:46,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1756346214, now seen corresponding path program 25 times [2021-11-25 18:32:46,813 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:32:46,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345003539] [2021-11-25 18:32:46,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:32:46,813 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:32:46,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:32:47,153 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:32:47,154 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:32:47,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345003539] [2021-11-25 18:32:47,154 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345003539] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:32:47,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453329924] [2021-11-25 18:32:47,154 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 18:32:47,154 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:32:47,155 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:32:47,161 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:32:47,177 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2021-11-25 18:32:47,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:32:47,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 71 conjunts are in the unsatisfiable core [2021-11-25 18:32:47,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:32:47,553 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 18:32:47,553 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:32:47,756 INFO L354 Elim1Store]: treesize reduction 39, result has 52.4 percent of original size [2021-11-25 18:32:47,756 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 36 treesize of output 52 [2021-11-25 18:32:47,852 INFO L354 Elim1Store]: treesize reduction 73, result has 11.0 percent of original size [2021-11-25 18:32:47,852 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 35 treesize of output 17 [2021-11-25 18:32:47,900 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:32:47,901 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453329924] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:32:47,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1099312325] [2021-11-25 18:32:47,901 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:32:47,902 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:32:47,902 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 6] total 22 [2021-11-25 18:32:47,902 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291111551] [2021-11-25 18:32:47,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:32:47,902 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-11-25 18:32:47,902 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:32:47,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-25 18:32:47,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2021-11-25 18:32:47,903 INFO L87 Difference]: Start difference. First operand 143 states and 364 transitions. Second operand has 24 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 23 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:48,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:32:48,635 INFO L93 Difference]: Finished difference Result 186 states and 467 transitions. [2021-11-25 18:32:48,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-25 18:32:48,636 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 23 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-11-25 18:32:48,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:32:48,637 INFO L225 Difference]: With dead ends: 186 [2021-11-25 18:32:48,638 INFO L226 Difference]: Without dead ends: 181 [2021-11-25 18:32:48,638 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=146, Invalid=846, Unknown=0, NotChecked=0, Total=992 [2021-11-25 18:32:48,641 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 44 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-25 18:32:48,642 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 25 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-25 18:32:48,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2021-11-25 18:32:48,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 143. [2021-11-25 18:32:48,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 2.563380281690141) internal successors, (364), 142 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:48,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 364 transitions. [2021-11-25 18:32:48,647 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 364 transitions. Word has length 20 [2021-11-25 18:32:48,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:32:48,648 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 364 transitions. [2021-11-25 18:32:48,648 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 23 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:48,648 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 364 transitions. [2021-11-25 18:32:48,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 18:32:48,649 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:32:48,649 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:32:48,678 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2021-11-25 18:32:48,873 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:32:48,873 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:32:48,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:32:48,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1047868720, now seen corresponding path program 26 times [2021-11-25 18:32:48,874 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:32:48,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062866904] [2021-11-25 18:32:48,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:32:48,874 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:32:48,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:32:49,285 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:32:49,285 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:32:49,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062866904] [2021-11-25 18:32:49,285 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062866904] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:32:49,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856076536] [2021-11-25 18:32:49,285 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:32:49,285 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:32:49,286 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:32:49,289 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:32:49,307 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2021-11-25 18:32:49,414 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 18:32:49,414 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:32:49,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 69 conjunts are in the unsatisfiable core [2021-11-25 18:32:49,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:32:49,672 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:32:49,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:32:49,830 INFO L354 Elim1Store]: treesize reduction 39, result has 52.4 percent of original size [2021-11-25 18:32:49,830 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 36 treesize of output 52 [2021-11-25 18:32:49,917 INFO L354 Elim1Store]: treesize reduction 73, result has 11.0 percent of original size [2021-11-25 18:32:49,917 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 35 treesize of output 17 [2021-11-25 18:32:49,963 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:32:49,963 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [856076536] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:32:49,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [615822026] [2021-11-25 18:32:49,964 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:32:49,965 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:32:49,965 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 6] total 24 [2021-11-25 18:32:49,965 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085446273] [2021-11-25 18:32:49,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:32:49,966 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-11-25 18:32:49,966 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:32:49,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-11-25 18:32:49,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=556, Unknown=0, NotChecked=0, Total=650 [2021-11-25 18:32:49,967 INFO L87 Difference]: Start difference. First operand 143 states and 364 transitions. Second operand has 26 states, 25 states have (on average 1.84) internal successors, (46), 25 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 18:32:50,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:32:50,559 INFO L93 Difference]: Finished difference Result 217 states and 534 transitions. [2021-11-25 18:32:50,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-25 18:32:50,561 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.84) internal successors, (46), 25 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 20 [2021-11-25 18:32:50,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:32:50,562 INFO L225 Difference]: With dead ends: 217 [2021-11-25 18:32:50,562 INFO L226 Difference]: Without dead ends: 207 [2021-11-25 18:32:50,563 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=187, Invalid=1073, Unknown=0, NotChecked=0, Total=1260 [2021-11-25 18:32:50,563 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 94 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-25 18:32:50,563 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 19 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-25 18:32:50,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2021-11-25 18:32:50,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 155. [2021-11-25 18:32:50,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 154 states have (on average 2.6103896103896105) internal successors, (402), 154 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:50,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 402 transitions. [2021-11-25 18:32:50,569 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 402 transitions. Word has length 20 [2021-11-25 18:32:50,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:32:50,569 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 402 transitions. [2021-11-25 18:32:50,569 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.84) internal successors, (46), 25 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 18:32:50,569 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 402 transitions. [2021-11-25 18:32:50,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 18:32:50,570 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:32:50,570 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:32:50,605 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2021-11-25 18:32:50,785 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2021-11-25 18:32:50,785 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:32:50,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:32:50,786 INFO L85 PathProgramCache]: Analyzing trace with hash -360458714, now seen corresponding path program 27 times [2021-11-25 18:32:50,786 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:32:50,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283938259] [2021-11-25 18:32:50,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:32:50,786 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:32:50,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:32:51,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 18:32:51,092 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:32:51,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283938259] [2021-11-25 18:32:51,092 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283938259] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:32:51,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430956147] [2021-11-25 18:32:51,092 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 18:32:51,092 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:32:51,092 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:32:51,093 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:32:51,094 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2021-11-25 18:32:51,200 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 18:32:51,200 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:32:51,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 73 conjunts are in the unsatisfiable core [2021-11-25 18:32:51,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:32:51,434 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 18:32:51,434 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:32:51,595 INFO L354 Elim1Store]: treesize reduction 39, result has 52.4 percent of original size [2021-11-25 18:32:51,596 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 36 treesize of output 52 [2021-11-25 18:32:51,681 INFO L354 Elim1Store]: treesize reduction 73, result has 11.0 percent of original size [2021-11-25 18:32:51,682 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 35 treesize of output 17 [2021-11-25 18:32:51,728 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:32:51,728 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1430956147] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:32:51,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [257419882] [2021-11-25 18:32:51,729 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:32:51,729 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:32:51,729 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 6] total 24 [2021-11-25 18:32:51,729 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015483965] [2021-11-25 18:32:51,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:32:51,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-11-25 18:32:51,730 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:32:51,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-11-25 18:32:51,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2021-11-25 18:32:51,731 INFO L87 Difference]: Start difference. First operand 155 states and 402 transitions. Second operand has 26 states, 25 states have (on average 1.84) internal successors, (46), 25 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 18:32:52,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:32:52,457 INFO L93 Difference]: Finished difference Result 213 states and 527 transitions. [2021-11-25 18:32:52,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-25 18:32:52,461 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.84) internal successors, (46), 25 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 20 [2021-11-25 18:32:52,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:32:52,463 INFO L225 Difference]: With dead ends: 213 [2021-11-25 18:32:52,463 INFO L226 Difference]: Without dead ends: 203 [2021-11-25 18:32:52,464 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=198, Invalid=1062, Unknown=0, NotChecked=0, Total=1260 [2021-11-25 18:32:52,465 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 81 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-25 18:32:52,465 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 25 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-25 18:32:52,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2021-11-25 18:32:52,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 153. [2021-11-25 18:32:52,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 152 states have (on average 2.585526315789474) internal successors, (393), 152 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:52,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 393 transitions. [2021-11-25 18:32:52,472 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 393 transitions. Word has length 20 [2021-11-25 18:32:52,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:32:52,472 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 393 transitions. [2021-11-25 18:32:52,472 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.84) internal successors, (46), 25 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 18:32:52,472 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 393 transitions. [2021-11-25 18:32:52,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 18:32:52,473 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:32:52,473 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:32:52,509 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2021-11-25 18:32:52,688 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2021-11-25 18:32:52,688 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:32:52,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:32:52,689 INFO L85 PathProgramCache]: Analyzing trace with hash -800785872, now seen corresponding path program 28 times [2021-11-25 18:32:52,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:32:52,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093414713] [2021-11-25 18:32:52,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:32:52,689 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:32:52,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:32:53,045 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:32:53,045 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:32:53,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093414713] [2021-11-25 18:32:53,045 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093414713] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:32:53,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948668784] [2021-11-25 18:32:53,045 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 18:32:53,046 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:32:53,046 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:32:53,046 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:32:53,047 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2021-11-25 18:32:53,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:32:53,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 69 conjunts are in the unsatisfiable core [2021-11-25 18:32:53,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:32:53,337 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:32:53,338 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:32:53,496 INFO L354 Elim1Store]: treesize reduction 39, result has 52.4 percent of original size [2021-11-25 18:32:53,496 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 36 treesize of output 52 [2021-11-25 18:32:53,570 INFO L354 Elim1Store]: treesize reduction 73, result has 11.0 percent of original size [2021-11-25 18:32:53,570 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 35 treesize of output 17 [2021-11-25 18:32:53,612 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:32:53,612 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948668784] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:32:53,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1429299055] [2021-11-25 18:32:53,613 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:32:53,613 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:32:53,613 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 6] total 22 [2021-11-25 18:32:53,613 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165114395] [2021-11-25 18:32:53,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:32:53,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-11-25 18:32:53,614 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:32:53,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-25 18:32:53,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2021-11-25 18:32:53,615 INFO L87 Difference]: Start difference. First operand 153 states and 393 transitions. Second operand has 24 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 23 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:54,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:32:54,094 INFO L93 Difference]: Finished difference Result 178 states and 452 transitions. [2021-11-25 18:32:54,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-25 18:32:54,095 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 23 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-11-25 18:32:54,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:32:54,096 INFO L225 Difference]: With dead ends: 178 [2021-11-25 18:32:54,096 INFO L226 Difference]: Without dead ends: 173 [2021-11-25 18:32:54,096 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=144, Invalid=912, Unknown=0, NotChecked=0, Total=1056 [2021-11-25 18:32:54,097 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 68 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-25 18:32:54,097 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 48 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-25 18:32:54,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-11-25 18:32:54,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 157. [2021-11-25 18:32:54,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 2.5833333333333335) internal successors, (403), 156 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:54,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 403 transitions. [2021-11-25 18:32:54,103 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 403 transitions. Word has length 20 [2021-11-25 18:32:54,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:32:54,103 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 403 transitions. [2021-11-25 18:32:54,103 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 23 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:54,104 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 403 transitions. [2021-11-25 18:32:54,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-25 18:32:54,104 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:32:54,105 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:32:54,139 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2021-11-25 18:32:54,325 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2021-11-25 18:32:54,325 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:32:54,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:32:54,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1682271093, now seen corresponding path program 29 times [2021-11-25 18:32:54,326 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:32:54,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971985381] [2021-11-25 18:32:54,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:32:54,326 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:32:54,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:32:54,391 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:32:54,391 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:32:54,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971985381] [2021-11-25 18:32:54,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971985381] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:32:54,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485895742] [2021-11-25 18:32:54,392 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:32:54,392 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:32:54,393 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:32:54,393 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:32:54,415 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2021-11-25 18:32:54,531 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-11-25 18:32:54,531 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:32:54,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-25 18:32:54,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:32:54,641 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:32:54,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:32:54,709 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:32:54,709 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485895742] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:32:54,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [498045917] [2021-11-25 18:32:54,710 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:32:54,710 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:32:54,710 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2021-11-25 18:32:54,710 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545726601] [2021-11-25 18:32:54,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:32:54,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-25 18:32:54,711 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:32:54,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-25 18:32:54,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2021-11-25 18:32:54,711 INFO L87 Difference]: Start difference. First operand 157 states and 403 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 18 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:54,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:32:54,874 INFO L93 Difference]: Finished difference Result 303 states and 735 transitions. [2021-11-25 18:32:54,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-25 18:32:54,874 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 18 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-11-25 18:32:54,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:32:54,877 INFO L225 Difference]: With dead ends: 303 [2021-11-25 18:32:54,877 INFO L226 Difference]: Without dead ends: 285 [2021-11-25 18:32:54,877 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=146, Invalid=360, Unknown=0, NotChecked=0, Total=506 [2021-11-25 18:32:54,878 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 88 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:32:54,878 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 35 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:32:54,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2021-11-25 18:32:54,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 227. [2021-11-25 18:32:54,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 226 states have (on average 2.504424778761062) internal successors, (566), 226 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:54,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 566 transitions. [2021-11-25 18:32:54,887 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 566 transitions. Word has length 21 [2021-11-25 18:32:54,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:32:54,887 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 566 transitions. [2021-11-25 18:32:54,887 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 18 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:54,887 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 566 transitions. [2021-11-25 18:32:54,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-25 18:32:54,888 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:32:54,888 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:32:54,926 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2021-11-25 18:32:55,093 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:32:55,093 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:32:55,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:32:55,093 INFO L85 PathProgramCache]: Analyzing trace with hash -787302949, now seen corresponding path program 30 times [2021-11-25 18:32:55,094 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:32:55,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270980110] [2021-11-25 18:32:55,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:32:55,094 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:32:55,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:32:55,159 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:32:55,159 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:32:55,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270980110] [2021-11-25 18:32:55,160 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270980110] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:32:55,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066551102] [2021-11-25 18:32:55,160 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 18:32:55,160 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:32:55,160 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:32:55,161 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:32:55,184 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2021-11-25 18:32:55,297 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 18:32:55,297 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:32:55,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-25 18:32:55,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:32:55,411 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:32:55,411 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:32:55,494 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:32:55,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066551102] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:32:55,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1363889209] [2021-11-25 18:32:55,495 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:32:55,495 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:32:55,495 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2021-11-25 18:32:55,495 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885432330] [2021-11-25 18:32:55,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:32:55,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-25 18:32:55,496 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:32:55,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-25 18:32:55,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2021-11-25 18:32:55,497 INFO L87 Difference]: Start difference. First operand 227 states and 566 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 18 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:55,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:32:55,637 INFO L93 Difference]: Finished difference Result 207 states and 502 transitions. [2021-11-25 18:32:55,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-25 18:32:55,638 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 18 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-11-25 18:32:55,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:32:55,639 INFO L225 Difference]: With dead ends: 207 [2021-11-25 18:32:55,639 INFO L226 Difference]: Without dead ends: 158 [2021-11-25 18:32:55,639 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=146, Invalid=360, Unknown=0, NotChecked=0, Total=506 [2021-11-25 18:32:55,640 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 91 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:32:55,640 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 22 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:32:55,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-11-25 18:32:55,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2021-11-25 18:32:55,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 2.573248407643312) internal successors, (404), 157 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:55,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 404 transitions. [2021-11-25 18:32:55,644 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 404 transitions. Word has length 21 [2021-11-25 18:32:55,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:32:55,644 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 404 transitions. [2021-11-25 18:32:55,644 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 18 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:55,645 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 404 transitions. [2021-11-25 18:32:55,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-25 18:32:55,645 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:32:55,645 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:32:55,683 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2021-11-25 18:32:55,857 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:32:55,857 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:32:55,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:32:55,857 INFO L85 PathProgramCache]: Analyzing trace with hash 2056245394, now seen corresponding path program 31 times [2021-11-25 18:32:55,858 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:32:55,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011488145] [2021-11-25 18:32:55,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:32:55,858 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:32:55,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:32:55,926 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 18:32:55,926 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:32:55,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011488145] [2021-11-25 18:32:55,927 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011488145] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:32:55,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942740464] [2021-11-25 18:32:55,927 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 18:32:55,927 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:32:55,927 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:32:55,938 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:32:55,949 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2021-11-25 18:32:56,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:32:56,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-25 18:32:56,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:32:56,166 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 18:32:56,166 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:32:56,267 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 18:32:56,267 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942740464] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:32:56,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1692452263] [2021-11-25 18:32:56,267 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:32:56,268 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:32:56,268 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2021-11-25 18:32:56,268 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771032754] [2021-11-25 18:32:56,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:32:56,268 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-25 18:32:56,269 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:32:56,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-25 18:32:56,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2021-11-25 18:32:56,269 INFO L87 Difference]: Start difference. First operand 158 states and 404 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 18 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:56,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:32:56,401 INFO L93 Difference]: Finished difference Result 160 states and 394 transitions. [2021-11-25 18:32:56,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-25 18:32:56,402 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 18 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-11-25 18:32:56,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:32:56,403 INFO L225 Difference]: With dead ends: 160 [2021-11-25 18:32:56,403 INFO L226 Difference]: Without dead ends: 160 [2021-11-25 18:32:56,403 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=158, Invalid=348, Unknown=0, NotChecked=0, Total=506 [2021-11-25 18:32:56,404 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 115 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:32:56,404 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 13 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:32:56,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-11-25 18:32:56,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 138. [2021-11-25 18:32:56,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 2.5182481751824817) internal successors, (345), 137 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:56,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 345 transitions. [2021-11-25 18:32:56,409 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 345 transitions. Word has length 22 [2021-11-25 18:32:56,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:32:56,409 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 345 transitions. [2021-11-25 18:32:56,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 18 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:56,409 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 345 transitions. [2021-11-25 18:32:56,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-25 18:32:56,410 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:32:56,410 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:32:56,445 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2021-11-25 18:32:56,610 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2021-11-25 18:32:56,611 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:32:56,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:32:56,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1343753758, now seen corresponding path program 32 times [2021-11-25 18:32:56,611 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:32:56,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023008338] [2021-11-25 18:32:56,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:32:56,612 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:32:56,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:32:56,707 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 18:32:56,708 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:32:56,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023008338] [2021-11-25 18:32:56,708 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023008338] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:32:56,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054900599] [2021-11-25 18:32:56,708 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:32:56,709 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:32:56,709 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:32:56,713 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:32:56,744 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2021-11-25 18:32:56,872 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-11-25 18:32:56,873 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:32:56,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-25 18:32:56,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:32:56,998 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 18:32:56,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:32:57,099 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 18:32:57,100 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054900599] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:32:57,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [212760040] [2021-11-25 18:32:57,100 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:32:57,100 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:32:57,101 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2021-11-25 18:32:57,101 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3996949] [2021-11-25 18:32:57,101 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:32:57,101 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-25 18:32:57,101 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:32:57,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-25 18:32:57,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2021-11-25 18:32:57,102 INFO L87 Difference]: Start difference. First operand 138 states and 345 transitions. Second operand has 20 states, 20 states have (on average 1.75) internal successors, (35), 19 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 18:32:57,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:32:57,240 INFO L93 Difference]: Finished difference Result 156 states and 370 transitions. [2021-11-25 18:32:57,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-25 18:32:57,241 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.75) internal successors, (35), 19 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 22 [2021-11-25 18:32:57,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:32:57,242 INFO L225 Difference]: With dead ends: 156 [2021-11-25 18:32:57,242 INFO L226 Difference]: Without dead ends: 156 [2021-11-25 18:32:57,242 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2021-11-25 18:32:57,243 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 101 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:32:57,243 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 10 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:32:57,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-11-25 18:32:57,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 144. [2021-11-25 18:32:57,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 2.4405594405594404) internal successors, (349), 143 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:32:57,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 349 transitions. [2021-11-25 18:32:57,249 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 349 transitions. Word has length 22 [2021-11-25 18:32:57,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:32:57,249 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 349 transitions. [2021-11-25 18:32:57,249 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.75) internal successors, (35), 19 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 18:32:57,249 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 349 transitions. [2021-11-25 18:32:57,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:32:57,250 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:32:57,250 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:32:57,287 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2021-11-25 18:32:57,469 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:32:57,469 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:32:57,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:32:57,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1757202087, now seen corresponding path program 33 times [2021-11-25 18:32:57,470 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:32:57,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012139609] [2021-11-25 18:32:57,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:32:57,470 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:32:57,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:32:57,966 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:32:57,966 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:32:57,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012139609] [2021-11-25 18:32:57,966 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012139609] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:32:57,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728739433] [2021-11-25 18:32:57,967 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 18:32:57,967 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:32:57,967 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:32:57,968 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:32:57,969 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2021-11-25 18:32:58,082 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 18:32:58,082 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:32:58,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 116 conjunts are in the unsatisfiable core [2021-11-25 18:32:58,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:32:58,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:32:58,441 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 29 treesize of output 27 [2021-11-25 18:32:58,674 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:32:58,674 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 15 treesize of output 16 [2021-11-25 18:32:58,786 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:32:58,787 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:32:58,934 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:32:59,283 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread2Thread1of1ForFork1_~i~1#1_219| Int)) (or (< (+ |v_thread2Thread1of1ForFork1_~i~1#1_219| 1) c_~N~0) (<= c_~N~0 |v_thread2Thread1of1ForFork1_~i~1#1_219|) (and (forall ((v_ArrVal_1222 (Array Int Int))) (< (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1222) c_~A~0.base))) (+ (select .cse0 (+ (* |v_thread2Thread1of1ForFork1_~i~1#1_219| 4) c_~A~0.offset)) (select .cse0 (+ c_~A~0.offset 4)) (select .cse0 c_~A~0.offset))) (+ c_~counter~0 1))) (forall ((v_ArrVal_1222 (Array Int Int))) (<= c_~counter~0 (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1222) c_~A~0.base))) (+ (select .cse1 (+ (* |v_thread2Thread1of1ForFork1_~i~1#1_219| 4) c_~A~0.offset)) (select .cse1 (+ c_~A~0.offset 4)) (select .cse1 c_~A~0.offset)))))))) is different from false [2021-11-25 18:32:59,373 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread2Thread1of1ForFork1_~i~1#1_219| Int)) (or (< (+ |v_thread2Thread1of1ForFork1_~i~1#1_219| 1) c_~N~0) (and (forall ((v_ArrVal_1222 (Array Int Int))) (<= (+ c_~counter~0 (select (select |c_#memory_int| c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) c_~A~0.offset))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1222) c_~A~0.base))) (+ (select .cse0 (+ (* |v_thread2Thread1of1ForFork1_~i~1#1_219| 4) c_~A~0.offset)) (select .cse0 (+ c_~A~0.offset 4)) (select .cse0 c_~A~0.offset))))) (forall ((v_ArrVal_1222 (Array Int Int))) (< (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1222) c_~A~0.base))) (+ (select .cse1 (+ (* |v_thread2Thread1of1ForFork1_~i~1#1_219| 4) c_~A~0.offset)) (select .cse1 (+ c_~A~0.offset 4)) (select .cse1 c_~A~0.offset))) (+ c_~counter~0 1 (select (select |c_#memory_int| c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) c_~A~0.offset)))))) (<= c_~N~0 |v_thread2Thread1of1ForFork1_~i~1#1_219|))) is different from false [2021-11-25 18:32:59,412 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread2Thread1of1ForFork1_~i~1#1_219| Int)) (or (< (+ |v_thread2Thread1of1ForFork1_~i~1#1_219| 1) c_~N~0) (<= c_~N~0 |v_thread2Thread1of1ForFork1_~i~1#1_219|) (and (forall ((v_ArrVal_1222 (Array Int Int))) (< (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1222) c_~A~0.base))) (+ (select .cse0 (+ (* |v_thread2Thread1of1ForFork1_~i~1#1_219| 4) c_~A~0.offset)) (select .cse0 (+ c_~A~0.offset 4)) (select .cse0 c_~A~0.offset))) (let ((.cse1 (select |c_#memory_int| c_~A~0.base)) (.cse2 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse1 (+ .cse2 c_~A~0.offset 4)) 1 (select .cse1 (+ .cse2 c_~A~0.offset)))))) (forall ((v_ArrVal_1222 (Array Int Int))) (<= (let ((.cse3 (select |c_#memory_int| c_~A~0.base)) (.cse4 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse3 (+ .cse4 c_~A~0.offset 4)) (select .cse3 (+ .cse4 c_~A~0.offset)))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1222) c_~A~0.base))) (+ (select .cse5 (+ (* |v_thread2Thread1of1ForFork1_~i~1#1_219| 4) c_~A~0.offset)) (select .cse5 (+ c_~A~0.offset 4)) (select .cse5 c_~A~0.offset)))))))) is different from false [2021-11-25 18:32:59,528 INFO L354 Elim1Store]: treesize reduction 94, result has 57.5 percent of original size [2021-11-25 18:32:59,528 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 227 treesize of output 214 [2021-11-25 18:32:59,575 INFO L354 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2021-11-25 18:32:59,575 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 96 [2021-11-25 18:32:59,612 INFO L354 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2021-11-25 18:32:59,612 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 75 treesize of output 84 [2021-11-25 18:33:03,113 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2021-11-25 18:33:03,113 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728739433] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:33:03,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1891581483] [2021-11-25 18:33:03,114 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:33:03,115 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:33:03,115 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 43 [2021-11-25 18:33:03,115 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157996230] [2021-11-25 18:33:03,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:33:03,116 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2021-11-25 18:33:03,116 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:33:03,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-11-25 18:33:03,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1565, Unknown=3, NotChecked=246, Total=1980 [2021-11-25 18:33:03,117 INFO L87 Difference]: Start difference. First operand 144 states and 349 transitions. Second operand has 45 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 44 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:33:04,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:33:04,850 INFO L93 Difference]: Finished difference Result 282 states and 655 transitions. [2021-11-25 18:33:04,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-11-25 18:33:04,851 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 44 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-25 18:33:04,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:33:04,853 INFO L225 Difference]: With dead ends: 282 [2021-11-25 18:33:04,853 INFO L226 Difference]: Without dead ends: 272 [2021-11-25 18:33:04,854 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 14 SyntacticMatches, 6 SemanticMatches, 60 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1007 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=368, Invalid=3063, Unknown=3, NotChecked=348, Total=3782 [2021-11-25 18:33:04,855 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 207 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 1360 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 2067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 637 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-25 18:33:04,856 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 124 Invalid, 2067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1360 Invalid, 0 Unknown, 637 Unchecked, 0.8s Time] [2021-11-25 18:33:04,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2021-11-25 18:33:04,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 182. [2021-11-25 18:33:04,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 181 states have (on average 2.414364640883978) internal successors, (437), 181 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:33:04,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 437 transitions. [2021-11-25 18:33:04,862 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 437 transitions. Word has length 23 [2021-11-25 18:33:04,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:33:04,863 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 437 transitions. [2021-11-25 18:33:04,863 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 44 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:33:04,863 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 437 transitions. [2021-11-25 18:33:04,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:33:04,863 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:33:04,864 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:33:04,893 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2021-11-25 18:33:05,064 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2021-11-25 18:33:05,064 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:33:05,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:33:05,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1925069059, now seen corresponding path program 34 times [2021-11-25 18:33:05,065 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:33:05,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190387355] [2021-11-25 18:33:05,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:33:05,065 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:33:05,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:33:05,627 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:33:05,628 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:33:05,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190387355] [2021-11-25 18:33:05,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190387355] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:33:05,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202753180] [2021-11-25 18:33:05,628 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 18:33:05,628 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:33:05,629 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:33:05,633 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:33:05,634 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2021-11-25 18:33:05,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:33:05,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 102 conjunts are in the unsatisfiable core [2021-11-25 18:33:05,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:33:05,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:33:05,931 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 22 treesize of output 22 [2021-11-25 18:33:06,137 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 18:33:06,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:33:06,367 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1261 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1261) c_~A~0.base))) (<= (+ c_~counter~0 (select .cse0 (+ (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) c_~A~0.offset))) (+ (select .cse0 c_~A~0.offset) (select .cse0 (+ c_~A~0.offset 4)) (select .cse0 (+ c_~A~0.offset 8)))))) (forall ((v_ArrVal_1261 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1261) c_~A~0.base))) (< (+ (select .cse1 c_~A~0.offset) (select .cse1 (+ c_~A~0.offset 4)) (select .cse1 (+ c_~A~0.offset 8))) (+ c_~counter~0 (select .cse1 (+ (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) c_~A~0.offset)) 1))))) is different from false [2021-11-25 18:33:06,378 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1261 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1261) c_~A~0.base))) (<= (let ((.cse1 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse0 (+ .cse1 c_~A~0.offset 4)) (select (select |c_#memory_int| c_~A~0.base) (+ .cse1 c_~A~0.offset)))) (+ (select .cse0 c_~A~0.offset) (select .cse0 (+ c_~A~0.offset 4)) (select .cse0 (+ c_~A~0.offset 8)))))) (forall ((v_ArrVal_1261 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1261) c_~A~0.base))) (< (+ (select .cse2 c_~A~0.offset) (select .cse2 (+ c_~A~0.offset 4)) (select .cse2 (+ c_~A~0.offset 8))) (let ((.cse3 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse2 (+ .cse3 c_~A~0.offset 4)) 1 (select (select |c_#memory_int| c_~A~0.base) (+ .cse3 c_~A~0.offset)))))))) is different from false [2021-11-25 18:33:06,461 INFO L354 Elim1Store]: treesize reduction 114, result has 46.0 percent of original size [2021-11-25 18:33:06,461 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 106 treesize of output 143 [2021-11-25 18:33:06,491 INFO L354 Elim1Store]: treesize reduction 41, result has 46.1 percent of original size [2021-11-25 18:33:06,491 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 31 treesize of output 49 [2021-11-25 18:33:07,456 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:33:07,487 INFO L354 Elim1Store]: treesize reduction 198, result has 6.2 percent of original size [2021-11-25 18:33:07,488 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 53 treesize of output 24 [2021-11-25 18:33:07,612 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 3 not checked. [2021-11-25 18:33:07,612 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [202753180] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:33:07,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1747987593] [2021-11-25 18:33:07,613 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:33:07,613 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:33:07,613 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 35 [2021-11-25 18:33:07,613 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043336790] [2021-11-25 18:33:07,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:33:07,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-11-25 18:33:07,614 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:33:07,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-11-25 18:33:07,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1088, Unknown=2, NotChecked=134, Total=1332 [2021-11-25 18:33:07,615 INFO L87 Difference]: Start difference. First operand 182 states and 437 transitions. Second operand has 37 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 36 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:33:09,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:33:09,995 INFO L93 Difference]: Finished difference Result 292 states and 693 transitions. [2021-11-25 18:33:09,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-11-25 18:33:09,995 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 36 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-25 18:33:09,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:33:09,997 INFO L225 Difference]: With dead ends: 292 [2021-11-25 18:33:09,997 INFO L226 Difference]: Without dead ends: 287 [2021-11-25 18:33:09,998 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 22 SyntacticMatches, 6 SemanticMatches, 63 ConstructedPredicates, 2 IntricatePredicates, 2 DeprecatedPredicates, 987 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=410, Invalid=3502, Unknown=2, NotChecked=246, Total=4160 [2021-11-25 18:33:09,998 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 111 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 1703 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 1942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 196 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-25 18:33:09,999 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 74 Invalid, 1942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1703 Invalid, 0 Unknown, 196 Unchecked, 0.9s Time] [2021-11-25 18:33:10,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2021-11-25 18:33:10,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 198. [2021-11-25 18:33:10,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 197 states have (on average 2.482233502538071) internal successors, (489), 197 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:33:10,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 489 transitions. [2021-11-25 18:33:10,006 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 489 transitions. Word has length 23 [2021-11-25 18:33:10,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:33:10,007 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 489 transitions. [2021-11-25 18:33:10,007 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 36 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:33:10,007 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 489 transitions. [2021-11-25 18:33:10,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:33:10,008 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:33:10,008 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:33:10,054 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2021-11-25 18:33:10,233 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2021-11-25 18:33:10,233 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:33:10,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:33:10,234 INFO L85 PathProgramCache]: Analyzing trace with hash 961570803, now seen corresponding path program 35 times [2021-11-25 18:33:10,234 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:33:10,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759750368] [2021-11-25 18:33:10,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:33:10,234 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:33:10,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:33:10,724 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:33:10,725 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:33:10,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759750368] [2021-11-25 18:33:10,725 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759750368] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:33:10,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050797668] [2021-11-25 18:33:10,725 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:33:10,725 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:33:10,726 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:33:10,728 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:33:10,730 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2021-11-25 18:33:10,883 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-11-25 18:33:10,883 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:33:10,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 117 conjunts are in the unsatisfiable core [2021-11-25 18:33:10,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:33:11,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:33:11,186 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 22 treesize of output 22 [2021-11-25 18:33:11,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:33:11,482 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:33:11,482 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 32 treesize of output 67 [2021-11-25 18:33:11,847 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:33:11,847 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:33:12,250 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:33:13,017 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread2Thread1of1ForFork1_~i~1#1_237| Int) (|thread1Thread1of1ForFork0_~i~0#1| Int)) (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0) (<= c_~N~0 (+ |v_thread2Thread1of1ForFork1_~i~1#1_237| 1)) (<= c_~N~0 |thread1Thread1of1ForFork0_~i~0#1|) (and (forall ((v_ArrVal_1300 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1300) c_~A~0.base))) (<= (+ c_~counter~0 (select .cse0 (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) c_~A~0.offset))) (let ((.cse1 (* |v_thread2Thread1of1ForFork1_~i~1#1_237| 4))) (+ (select .cse0 (+ .cse1 c_~A~0.offset 4)) (select .cse0 (+ .cse1 c_~A~0.offset)) (select .cse0 c_~A~0.offset)))))) (forall ((v_ArrVal_1300 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1300) c_~A~0.base))) (< (let ((.cse3 (* |v_thread2Thread1of1ForFork1_~i~1#1_237| 4))) (+ (select .cse2 (+ .cse3 c_~A~0.offset 4)) (select .cse2 (+ .cse3 c_~A~0.offset)) (select .cse2 c_~A~0.offset))) (+ c_~counter~0 (select .cse2 (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) c_~A~0.offset)) 1))))) (< (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_237|) c_~N~0))) is different from false [2021-11-25 18:33:13,020 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:33:13,179 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread2Thread1of1ForFork1_~i~1#1_237| Int) (|v_thread1Thread1of1ForFork0_~i~0#1_251| Int)) (or (and (forall ((v_ArrVal_1300 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1300) c_~A~0.base))) (< (let ((.cse1 (* |v_thread2Thread1of1ForFork1_~i~1#1_237| 4))) (+ (select .cse0 (+ .cse1 c_~A~0.offset 4)) (select .cse0 (+ .cse1 c_~A~0.offset)) (select .cse0 c_~A~0.offset))) (+ c_~counter~0 (select .cse0 (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_251| 4) c_~A~0.offset)) 1 (select (select |c_#memory_int| c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) c_~A~0.offset)))))) (forall ((v_ArrVal_1300 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1300) c_~A~0.base))) (<= (+ c_~counter~0 (select .cse2 (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_251| 4) c_~A~0.offset)) (select (select |c_#memory_int| c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) c_~A~0.offset))) (let ((.cse3 (* |v_thread2Thread1of1ForFork1_~i~1#1_237| 4))) (+ (select .cse2 (+ .cse3 c_~A~0.offset 4)) (select .cse2 (+ .cse3 c_~A~0.offset)) (select .cse2 c_~A~0.offset))))))) (<= c_~N~0 (+ |v_thread2Thread1of1ForFork1_~i~1#1_237| 1)) (< (+ |v_thread1Thread1of1ForFork0_~i~0#1_251| 1) c_~N~0) (<= c_~N~0 |v_thread1Thread1of1ForFork0_~i~0#1_251|) (< (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_237|) c_~N~0))) is different from false [2021-11-25 18:33:13,287 INFO L354 Elim1Store]: treesize reduction 130, result has 43.7 percent of original size [2021-11-25 18:33:13,287 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 231 treesize of output 206 [2021-11-25 18:33:13,334 INFO L354 Elim1Store]: treesize reduction 63, result has 28.4 percent of original size [2021-11-25 18:33:13,334 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 101 treesize of output 105 [2021-11-25 18:33:13,373 INFO L354 Elim1Store]: treesize reduction 63, result has 28.4 percent of original size [2021-11-25 18:33:13,373 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 78 treesize of output 82 [2021-11-25 18:33:14,774 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2021-11-25 18:33:14,775 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1050797668] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:33:14,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [70834688] [2021-11-25 18:33:14,775 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:33:14,776 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:33:14,776 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 16] total 45 [2021-11-25 18:33:14,777 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550945231] [2021-11-25 18:33:14,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:33:14,777 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2021-11-25 18:33:14,777 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:33:14,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-11-25 18:33:14,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=1752, Unknown=2, NotChecked=174, Total=2162 [2021-11-25 18:33:14,778 INFO L87 Difference]: Start difference. First operand 198 states and 489 transitions. Second operand has 47 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 46 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:33:19,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:33:19,520 INFO L93 Difference]: Finished difference Result 421 states and 1006 transitions. [2021-11-25 18:33:19,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2021-11-25 18:33:19,521 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 46 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-25 18:33:19,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:33:19,523 INFO L225 Difference]: With dead ends: 421 [2021-11-25 18:33:19,523 INFO L226 Difference]: Without dead ends: 411 [2021-11-25 18:33:19,525 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 19 SyntacticMatches, 6 SemanticMatches, 90 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 2279 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1165, Invalid=6851, Unknown=2, NotChecked=354, Total=8372 [2021-11-25 18:33:19,526 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 288 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 1062 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 1923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 1062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 738 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-25 18:33:19,526 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [288 Valid, 128 Invalid, 1923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1062 Invalid, 0 Unknown, 738 Unchecked, 0.7s Time] [2021-11-25 18:33:19,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2021-11-25 18:33:19,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 202. [2021-11-25 18:33:19,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 201 states have (on average 2.512437810945274) internal successors, (505), 201 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:33:19,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 505 transitions. [2021-11-25 18:33:19,534 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 505 transitions. Word has length 23 [2021-11-25 18:33:19,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:33:19,534 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 505 transitions. [2021-11-25 18:33:19,534 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 46 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:33:19,534 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 505 transitions. [2021-11-25 18:33:19,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:33:19,535 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:33:19,535 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:33:19,566 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2021-11-25 18:33:19,757 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2021-11-25 18:33:19,757 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:33:19,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:33:19,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1184599957, now seen corresponding path program 36 times [2021-11-25 18:33:19,758 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:33:19,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531431196] [2021-11-25 18:33:19,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:33:19,758 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:33:19,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:33:20,426 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:33:20,426 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:33:20,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531431196] [2021-11-25 18:33:20,426 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531431196] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:33:20,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609052955] [2021-11-25 18:33:20,426 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 18:33:20,427 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:33:20,427 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:33:20,427 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:33:20,428 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2021-11-25 18:33:20,545 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 18:33:20,545 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:33:20,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 104 conjunts are in the unsatisfiable core [2021-11-25 18:33:20,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:33:20,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:33:20,741 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 22 treesize of output 22 [2021-11-25 18:33:20,953 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 18:33:20,953 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:33:21,193 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1339 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1339) c_~A~0.base))) (<= (+ c_~counter~0 (select .cse0 (+ (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) c_~A~0.offset))) (+ (select .cse0 (+ c_~A~0.offset 8)) (select .cse0 c_~A~0.offset) (select .cse0 (+ c_~A~0.offset 4)))))) (forall ((v_ArrVal_1339 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1339) c_~A~0.base))) (< (+ (select .cse1 (+ c_~A~0.offset 8)) (select .cse1 c_~A~0.offset) (select .cse1 (+ c_~A~0.offset 4))) (+ c_~counter~0 (select .cse1 (+ (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) c_~A~0.offset)) 1))))) is different from false [2021-11-25 18:33:21,203 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1339 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1339) c_~A~0.base))) (<= (let ((.cse1 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse0 (+ .cse1 c_~A~0.offset 4)) (select (select |c_#memory_int| c_~A~0.base) (+ .cse1 c_~A~0.offset)))) (+ (select .cse0 (+ c_~A~0.offset 8)) (select .cse0 c_~A~0.offset) (select .cse0 (+ c_~A~0.offset 4)))))) (forall ((v_ArrVal_1339 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1339) c_~A~0.base))) (< (+ (select .cse2 (+ c_~A~0.offset 8)) (select .cse2 c_~A~0.offset) (select .cse2 (+ c_~A~0.offset 4))) (let ((.cse3 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse2 (+ .cse3 c_~A~0.offset 4)) 1 (select (select |c_#memory_int| c_~A~0.base) (+ .cse3 c_~A~0.offset)))))))) is different from false [2021-11-25 18:33:21,288 INFO L354 Elim1Store]: treesize reduction 114, result has 46.0 percent of original size [2021-11-25 18:33:21,288 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 106 treesize of output 143 [2021-11-25 18:33:21,322 INFO L354 Elim1Store]: treesize reduction 41, result has 46.1 percent of original size [2021-11-25 18:33:21,322 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 31 treesize of output 49 [2021-11-25 18:33:21,939 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:33:21,965 INFO L354 Elim1Store]: treesize reduction 198, result has 6.2 percent of original size [2021-11-25 18:33:21,965 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 53 treesize of output 24 [2021-11-25 18:33:22,081 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 3 not checked. [2021-11-25 18:33:22,081 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609052955] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:33:22,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1248644974] [2021-11-25 18:33:22,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 18:33:22,082 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:33:22,082 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 35 [2021-11-25 18:33:22,082 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285214032] [2021-11-25 18:33:22,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:33:22,082 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-11-25 18:33:22,082 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:33:22,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-11-25 18:33:22,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1076, Unknown=2, NotChecked=134, Total=1332 [2021-11-25 18:33:22,083 INFO L87 Difference]: Start difference. First operand 202 states and 505 transitions. Second operand has 37 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 36 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:33:24,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:33:24,652 INFO L93 Difference]: Finished difference Result 341 states and 834 transitions. [2021-11-25 18:33:24,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-11-25 18:33:24,653 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 36 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 23 [2021-11-25 18:33:24,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:33:24,655 INFO L225 Difference]: With dead ends: 341 [2021-11-25 18:33:24,655 INFO L226 Difference]: Without dead ends: 336 [2021-11-25 18:33:24,655 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 2 IntricatePredicates, 5 DeprecatedPredicates, 825 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=449, Invalid=3339, Unknown=2, NotChecked=242, Total=4032 [2021-11-25 18:33:24,656 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 132 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 1610 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 2136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 487 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-25 18:33:24,656 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 88 Invalid, 2136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1610 Invalid, 0 Unknown, 487 Unchecked, 0.9s Time] [2021-11-25 18:33:24,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2021-11-25 18:33:24,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 234. [2021-11-25 18:33:24,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 233 states have (on average 2.536480686695279) internal successors, (591), 233 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:33:24,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 591 transitions. [2021-11-25 18:33:24,664 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 591 transitions. Word has length 23 [2021-11-25 18:33:24,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:33:24,665 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 591 transitions. [2021-11-25 18:33:24,665 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 36 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:33:24,665 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 591 transitions. [2021-11-25 18:33:24,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:33:24,666 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:33:24,666 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:33:24,689 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2021-11-25 18:33:24,866 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:33:24,867 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:33:24,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:33:24,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1003583219, now seen corresponding path program 37 times [2021-11-25 18:33:24,867 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:33:24,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667401831] [2021-11-25 18:33:24,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:33:24,867 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:33:24,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:33:25,433 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:33:25,434 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:33:25,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667401831] [2021-11-25 18:33:25,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667401831] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:33:25,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380579922] [2021-11-25 18:33:25,434 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 18:33:25,434 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:33:25,434 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:33:25,435 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:33:25,436 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2021-11-25 18:33:25,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:33:25,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 102 conjunts are in the unsatisfiable core [2021-11-25 18:33:25,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:33:25,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:33:25,729 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 30 treesize of output 30 [2021-11-25 18:33:25,936 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 18:33:25,936 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:33:26,169 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1378 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1378) c_~A~0.base))) (<= (+ c_~counter~0 (select .cse0 (+ (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) c_~A~0.offset))) (+ (select .cse0 c_~A~0.offset) (select .cse0 (+ c_~A~0.offset 8)) (select .cse0 (+ c_~A~0.offset 4)))))) (forall ((v_ArrVal_1378 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1378) c_~A~0.base))) (< (+ (select .cse1 c_~A~0.offset) (select .cse1 (+ c_~A~0.offset 8)) (select .cse1 (+ c_~A~0.offset 4))) (+ c_~counter~0 (select .cse1 (+ (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) c_~A~0.offset)) 1))))) is different from false [2021-11-25 18:33:26,179 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1378 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1378) c_~A~0.base))) (< (+ (select .cse0 c_~A~0.offset) (select .cse0 (+ c_~A~0.offset 8)) (select .cse0 (+ c_~A~0.offset 4))) (let ((.cse1 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse0 (+ .cse1 c_~A~0.offset 4)) 1 (select (select |c_#memory_int| c_~A~0.base) (+ .cse1 c_~A~0.offset))))))) (forall ((v_ArrVal_1378 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1378) c_~A~0.base))) (<= (let ((.cse3 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse2 (+ .cse3 c_~A~0.offset 4)) (select (select |c_#memory_int| c_~A~0.base) (+ .cse3 c_~A~0.offset)))) (+ (select .cse2 c_~A~0.offset) (select .cse2 (+ c_~A~0.offset 8)) (select .cse2 (+ c_~A~0.offset 4))))))) is different from false [2021-11-25 18:33:26,263 INFO L354 Elim1Store]: treesize reduction 114, result has 46.0 percent of original size [2021-11-25 18:33:26,263 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 106 treesize of output 143 [2021-11-25 18:33:26,295 INFO L354 Elim1Store]: treesize reduction 41, result has 46.1 percent of original size [2021-11-25 18:33:26,295 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 31 treesize of output 49 [2021-11-25 18:33:26,599 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:33:26,627 INFO L354 Elim1Store]: treesize reduction 198, result has 6.2 percent of original size [2021-11-25 18:33:26,627 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 53 treesize of output 24 [2021-11-25 18:33:26,755 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 3 not checked. [2021-11-25 18:33:26,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380579922] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:33:26,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1918335410] [2021-11-25 18:33:26,756 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:33:26,757 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:33:26,758 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 35 [2021-11-25 18:33:26,758 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385193755] [2021-11-25 18:33:26,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:33:26,758 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-11-25 18:33:26,758 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:33:26,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-11-25 18:33:26,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1069, Unknown=2, NotChecked=134, Total=1332 [2021-11-25 18:33:26,759 INFO L87 Difference]: Start difference. First operand 234 states and 591 transitions. Second operand has 37 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 36 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:33:28,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:33:28,496 INFO L93 Difference]: Finished difference Result 339 states and 838 transitions. [2021-11-25 18:33:28,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-11-25 18:33:28,497 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 36 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 23 [2021-11-25 18:33:28,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:33:28,499 INFO L225 Difference]: With dead ends: 339 [2021-11-25 18:33:28,499 INFO L226 Difference]: Without dead ends: 334 [2021-11-25 18:33:28,499 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 2 IntricatePredicates, 3 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=357, Invalid=2955, Unknown=2, NotChecked=226, Total=3540 [2021-11-25 18:33:28,499 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 106 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 1151 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 1358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 186 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-25 18:33:28,499 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 93 Invalid, 1358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1151 Invalid, 0 Unknown, 186 Unchecked, 0.6s Time] [2021-11-25 18:33:28,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2021-11-25 18:33:28,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 234. [2021-11-25 18:33:28,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 233 states have (on average 2.536480686695279) internal successors, (591), 233 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:33:28,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 591 transitions. [2021-11-25 18:33:28,508 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 591 transitions. Word has length 23 [2021-11-25 18:33:28,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:33:28,508 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 591 transitions. [2021-11-25 18:33:28,508 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 36 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:33:28,509 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 591 transitions. [2021-11-25 18:33:28,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:33:28,510 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:33:28,510 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:33:28,540 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2021-11-25 18:33:28,737 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:33:28,737 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:33:28,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:33:28,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1487507995, now seen corresponding path program 38 times [2021-11-25 18:33:28,738 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:33:28,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404724581] [2021-11-25 18:33:28,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:33:28,738 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:33:28,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:33:29,308 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:33:29,308 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:33:29,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404724581] [2021-11-25 18:33:29,308 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404724581] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:33:29,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637573393] [2021-11-25 18:33:29,308 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:33:29,308 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:33:29,308 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:33:29,309 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:33:29,310 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2021-11-25 18:33:29,438 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-11-25 18:33:29,438 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:33:29,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 121 conjunts are in the unsatisfiable core [2021-11-25 18:33:29,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:33:29,530 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 15 treesize of output 11 [2021-11-25 18:33:29,574 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 18:33:29,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:33:29,669 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 19 treesize of output 21 [2021-11-25 18:33:29,973 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:33:29,973 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 17 treesize of output 18 [2021-11-25 18:33:30,072 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:33:30,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:33:30,237 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:33:30,572 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:33:31,527 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread2Thread1of1ForFork1_~i~1#1_261| Int) (|v_thread1Thread1of1ForFork0_~i~0#1_276| Int)) (or (<= c_~N~0 |v_thread1Thread1of1ForFork0_~i~0#1_276|) (< (+ |v_thread2Thread1of1ForFork1_~i~1#1_261| 1) c_~N~0) (<= c_~N~0 |v_thread2Thread1of1ForFork1_~i~1#1_261|) (and (forall ((v_ArrVal_1420 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1420) c_~A~0.base))) (<= (+ c_~counter~0 (select .cse0 (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_276| 4) c_~A~0.offset)) (select .cse0 (+ (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) c_~A~0.offset))) (+ (select .cse0 (+ c_~A~0.offset 4)) (select .cse0 (+ (* |v_thread2Thread1of1ForFork1_~i~1#1_261| 4) c_~A~0.offset)) (select .cse0 c_~A~0.offset))))) (forall ((v_ArrVal_1420 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1420) c_~A~0.base))) (< (+ (select .cse1 (+ c_~A~0.offset 4)) (select .cse1 (+ (* |v_thread2Thread1of1ForFork1_~i~1#1_261| 4) c_~A~0.offset)) (select .cse1 c_~A~0.offset)) (+ c_~counter~0 (select .cse1 (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_276| 4) c_~A~0.offset)) (select .cse1 (+ (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) c_~A~0.offset)) 1))))) (< (+ |v_thread1Thread1of1ForFork0_~i~0#1_276| 1) c_~N~0))) is different from false [2021-11-25 18:33:31,731 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread2Thread1of1ForFork1_~i~1#1_261| Int) (|v_thread1Thread1of1ForFork0_~i~0#1_276| Int)) (or (<= c_~N~0 |v_thread1Thread1of1ForFork0_~i~0#1_276|) (< (+ |v_thread2Thread1of1ForFork1_~i~1#1_261| 1) c_~N~0) (<= c_~N~0 |v_thread2Thread1of1ForFork1_~i~1#1_261|) (and (forall ((v_ArrVal_1420 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1420) c_~A~0.base))) (< (+ (select .cse0 (+ c_~A~0.offset 4)) (select .cse0 (+ (* |v_thread2Thread1of1ForFork1_~i~1#1_261| 4) c_~A~0.offset)) (select .cse0 c_~A~0.offset)) (let ((.cse1 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse0 (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_276| 4) c_~A~0.offset)) (select .cse0 (+ .cse1 c_~A~0.offset 4)) 1 (select (select |c_#memory_int| c_~A~0.base) (+ .cse1 c_~A~0.offset))))))) (forall ((v_ArrVal_1420 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1420) c_~A~0.base))) (<= (let ((.cse3 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse2 (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_276| 4) c_~A~0.offset)) (select .cse2 (+ .cse3 c_~A~0.offset 4)) (select (select |c_#memory_int| c_~A~0.base) (+ .cse3 c_~A~0.offset)))) (+ (select .cse2 (+ c_~A~0.offset 4)) (select .cse2 (+ (* |v_thread2Thread1of1ForFork1_~i~1#1_261| 4) c_~A~0.offset)) (select .cse2 c_~A~0.offset)))))) (< (+ |v_thread1Thread1of1ForFork0_~i~0#1_276| 1) c_~N~0))) is different from false [2021-11-25 18:33:31,904 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread2Thread1of1ForFork1_~i~1#1_261| Int) (|v_thread1Thread1of1ForFork0_~i~0#1_276| Int)) (or (and (forall ((v_ArrVal_1420 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1420) c_~A~0.base))) (< (+ (select .cse0 (+ (* |v_thread2Thread1of1ForFork1_~i~1#1_261| 4) c_~A~0.offset)) (select .cse0 c_~A~0.offset)) (+ c_~counter~0 (select .cse0 (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_276| 4) c_~A~0.offset)) (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) 1)))) (forall ((v_ArrVal_1420 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1420) c_~A~0.base))) (<= (+ c_~counter~0 (select .cse1 (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_276| 4) c_~A~0.offset)) (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset)) (+ (select .cse1 (+ (* |v_thread2Thread1of1ForFork1_~i~1#1_261| 4) c_~A~0.offset)) (select .cse1 c_~A~0.offset)))))) (<= c_~N~0 |v_thread1Thread1of1ForFork0_~i~0#1_276|) (< (+ |v_thread2Thread1of1ForFork1_~i~1#1_261| 1) c_~N~0) (<= c_~N~0 |v_thread2Thread1of1ForFork1_~i~1#1_261|) (< (+ |v_thread1Thread1of1ForFork0_~i~0#1_276| 1) c_~N~0))) is different from false [2021-11-25 18:33:32,478 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:33:32,479 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 204 treesize of output 121 [2021-11-25 18:33:32,534 INFO L354 Elim1Store]: treesize reduction 48, result has 43.5 percent of original size [2021-11-25 18:33:32,535 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 832 treesize of output 716 [2021-11-25 18:33:32,581 INFO L354 Elim1Store]: treesize reduction 26, result has 36.6 percent of original size [2021-11-25 18:33:32,582 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 662 treesize of output 621 [2021-11-25 18:33:32,626 INFO L354 Elim1Store]: treesize reduction 26, result has 36.6 percent of original size [2021-11-25 18:33:32,627 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 594 treesize of output 577 [2021-11-25 18:33:32,675 INFO L354 Elim1Store]: treesize reduction 26, result has 36.6 percent of original size [2021-11-25 18:33:32,676 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 557 treesize of output 460 [2021-11-25 18:33:32,720 INFO L354 Elim1Store]: treesize reduction 26, result has 36.6 percent of original size [2021-11-25 18:33:32,721 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 421 treesize of output 372 [2021-11-25 18:33:33,217 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 3 not checked. [2021-11-25 18:33:33,218 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637573393] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:33:33,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [191340370] [2021-11-25 18:33:33,218 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:33:33,218 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:33:33,218 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 14] total 42 [2021-11-25 18:33:33,219 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820277346] [2021-11-25 18:33:33,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:33:33,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2021-11-25 18:33:33,219 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:33:33,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-11-25 18:33:33,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1489, Unknown=3, NotChecked=240, Total=1892 [2021-11-25 18:33:33,220 INFO L87 Difference]: Start difference. First operand 234 states and 591 transitions. Second operand has 44 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 43 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:33:35,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:33:35,140 INFO L93 Difference]: Finished difference Result 274 states and 679 transitions. [2021-11-25 18:33:35,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-11-25 18:33:35,140 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 43 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 23 [2021-11-25 18:33:35,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:33:35,142 INFO L225 Difference]: With dead ends: 274 [2021-11-25 18:33:35,142 INFO L226 Difference]: Without dead ends: 269 [2021-11-25 18:33:35,142 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 19 SyntacticMatches, 6 SemanticMatches, 66 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 974 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=461, Invalid=3708, Unknown=3, NotChecked=384, Total=4556 [2021-11-25 18:33:35,144 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 78 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 1731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 996 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-25 18:33:35,145 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 79 Invalid, 1731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 689 Invalid, 0 Unknown, 996 Unchecked, 0.4s Time] [2021-11-25 18:33:35,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2021-11-25 18:33:35,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 238. [2021-11-25 18:33:35,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 237 states have (on average 2.5443037974683542) internal successors, (603), 237 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:33:35,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 603 transitions. [2021-11-25 18:33:35,152 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 603 transitions. Word has length 23 [2021-11-25 18:33:35,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:33:35,153 INFO L470 AbstractCegarLoop]: Abstraction has 238 states and 603 transitions. [2021-11-25 18:33:35,153 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 43 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:33:35,153 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 603 transitions. [2021-11-25 18:33:35,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:33:35,154 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:33:35,154 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:33:35,182 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2021-11-25 18:33:35,373 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2021-11-25 18:33:35,373 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:33:35,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:33:35,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1369766035, now seen corresponding path program 39 times [2021-11-25 18:33:35,373 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:33:35,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134684756] [2021-11-25 18:33:35,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:33:35,374 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:33:35,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:33:35,974 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:33:35,974 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:33:35,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134684756] [2021-11-25 18:33:35,974 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134684756] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:33:35,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903072868] [2021-11-25 18:33:35,974 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 18:33:35,974 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:33:35,974 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:33:35,975 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:33:35,976 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2021-11-25 18:33:36,099 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 18:33:36,100 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:33:36,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 122 conjunts are in the unsatisfiable core [2021-11-25 18:33:36,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:33:36,254 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-25 18:33:36,328 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 18:33:36,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:33:36,488 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 14 treesize of output 16 [2021-11-25 18:33:36,750 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:33:36,750 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 15 treesize of output 16 [2021-11-25 18:33:36,830 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:33:36,831 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:33:36,965 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:33:37,430 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork0_~i~0#1_285| Int)) (or (and (forall ((v_ArrVal_1462 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1462) c_~A~0.base))) (< (+ (select .cse0 (+ c_~A~0.offset 4)) (select .cse0 c_~A~0.offset) (select .cse0 (+ c_~A~0.offset 8))) (+ c_~counter~0 (select .cse0 (+ (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) c_~A~0.offset)) (select .cse0 (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_285| 4) c_~A~0.offset)) 1)))) (forall ((v_ArrVal_1462 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1462) c_~A~0.base))) (<= (+ c_~counter~0 (select .cse1 (+ (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) c_~A~0.offset)) (select .cse1 (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_285| 4) c_~A~0.offset))) (+ (select .cse1 (+ c_~A~0.offset 4)) (select .cse1 c_~A~0.offset) (select .cse1 (+ c_~A~0.offset 8))))))) (< (+ |v_thread1Thread1of1ForFork0_~i~0#1_285| 1) c_~N~0) (<= c_~N~0 |v_thread1Thread1of1ForFork0_~i~0#1_285|))) is different from false [2021-11-25 18:33:37,490 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork0_~i~0#1_285| Int)) (or (< (+ |v_thread1Thread1of1ForFork0_~i~0#1_285| 1) c_~N~0) (<= c_~N~0 |v_thread1Thread1of1ForFork0_~i~0#1_285|) (and (forall ((v_ArrVal_1462 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1462) c_~A~0.base))) (<= (let ((.cse1 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse0 (+ .cse1 c_~A~0.offset 4)) (select .cse0 (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_285| 4) c_~A~0.offset)) (select (select |c_#memory_int| c_~A~0.base) (+ .cse1 c_~A~0.offset)))) (+ (select .cse0 (+ c_~A~0.offset 4)) (select .cse0 c_~A~0.offset) (select .cse0 (+ c_~A~0.offset 8)))))) (forall ((v_ArrVal_1462 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1462) c_~A~0.base))) (< (+ (select .cse2 (+ c_~A~0.offset 4)) (select .cse2 c_~A~0.offset) (select .cse2 (+ c_~A~0.offset 8))) (let ((.cse3 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse2 (+ .cse3 c_~A~0.offset 4)) (select .cse2 (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_285| 4) c_~A~0.offset)) 1 (select (select |c_#memory_int| c_~A~0.base) (+ .cse3 c_~A~0.offset)))))))))) is different from false [2021-11-25 18:33:37,534 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork0_~i~0#1_285| Int)) (or (< (+ |v_thread1Thread1of1ForFork0_~i~0#1_285| 1) c_~N~0) (<= c_~N~0 |v_thread1Thread1of1ForFork0_~i~0#1_285|) (and (forall ((v_ArrVal_1462 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1462) c_~A~0.base))) (< (+ (select .cse0 c_~A~0.offset) (select .cse0 (+ c_~A~0.offset 8))) (+ c_~counter~0 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) (select .cse0 (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_285| 4) c_~A~0.offset)) 1)))) (forall ((v_ArrVal_1462 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1462) c_~A~0.base))) (<= (+ c_~counter~0 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) (select .cse1 (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_285| 4) c_~A~0.offset))) (+ (select .cse1 c_~A~0.offset) (select .cse1 (+ c_~A~0.offset 8))))))))) is different from false [2021-11-25 18:33:37,727 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:33:37,727 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 200 treesize of output 117 [2021-11-25 18:33:37,793 INFO L354 Elim1Store]: treesize reduction 26, result has 67.1 percent of original size [2021-11-25 18:33:37,794 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 784 treesize of output 696 [2021-11-25 18:33:37,840 INFO L354 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2021-11-25 18:33:37,840 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 639 treesize of output 604 [2021-11-25 18:33:37,881 INFO L354 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2021-11-25 18:33:37,881 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 583 treesize of output 508 [2021-11-25 18:33:37,922 INFO L354 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2021-11-25 18:33:37,922 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 487 treesize of output 460 [2021-11-25 18:33:37,964 INFO L354 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2021-11-25 18:33:37,965 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 439 treesize of output 432 [2021-11-25 18:33:38,991 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2021-11-25 18:33:38,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [903072868] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:33:38,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [278156002] [2021-11-25 18:33:38,992 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:33:38,992 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:33:38,992 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 43 [2021-11-25 18:33:38,993 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404505522] [2021-11-25 18:33:38,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:33:38,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2021-11-25 18:33:38,993 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:33:38,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-11-25 18:33:38,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1549, Unknown=3, NotChecked=246, Total=1980 [2021-11-25 18:33:38,994 INFO L87 Difference]: Start difference. First operand 238 states and 603 transitions. Second operand has 45 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 44 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:33:41,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:33:41,061 INFO L93 Difference]: Finished difference Result 347 states and 850 transitions. [2021-11-25 18:33:41,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-11-25 18:33:41,061 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 44 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-25 18:33:41,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:33:41,063 INFO L225 Difference]: With dead ends: 347 [2021-11-25 18:33:41,063 INFO L226 Difference]: Without dead ends: 337 [2021-11-25 18:33:41,063 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 16 SyntacticMatches, 5 SemanticMatches, 66 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1180 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=502, Invalid=3667, Unknown=3, NotChecked=384, Total=4556 [2021-11-25 18:33:41,064 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 158 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 1030 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 1890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 793 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-25 18:33:41,064 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [158 Valid, 81 Invalid, 1890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1030 Invalid, 0 Unknown, 793 Unchecked, 0.6s Time] [2021-11-25 18:33:41,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2021-11-25 18:33:41,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 246. [2021-11-25 18:33:41,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 245 states have (on average 2.5510204081632653) internal successors, (625), 245 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:33:41,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 625 transitions. [2021-11-25 18:33:41,071 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 625 transitions. Word has length 23 [2021-11-25 18:33:41,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:33:41,071 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 625 transitions. [2021-11-25 18:33:41,072 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 44 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:33:41,072 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 625 transitions. [2021-11-25 18:33:41,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:33:41,073 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:33:41,073 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:33:41,102 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2021-11-25 18:33:41,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2021-11-25 18:33:41,291 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:33:41,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:33:41,291 INFO L85 PathProgramCache]: Analyzing trace with hash 779030501, now seen corresponding path program 40 times [2021-11-25 18:33:41,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:33:41,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121078928] [2021-11-25 18:33:41,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:33:41,292 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:33:41,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:33:41,982 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:33:41,982 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:33:41,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121078928] [2021-11-25 18:33:41,982 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121078928] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:33:41,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203345109] [2021-11-25 18:33:41,982 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 18:33:41,982 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:33:41,983 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:33:41,983 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:33:41,984 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2021-11-25 18:33:42,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:33:42,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 102 conjunts are in the unsatisfiable core [2021-11-25 18:33:42,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:33:42,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:33:42,241 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 19 treesize of output 21 [2021-11-25 18:33:42,470 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 18:33:42,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:33:42,729 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1501 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1501) c_~A~0.base))) (<= (let ((.cse1 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse0 (+ .cse1 c_~A~0.offset 4)) (select .cse0 (+ .cse1 c_~A~0.offset)))) (+ (select .cse0 (+ c_~A~0.offset 8)) (select .cse0 c_~A~0.offset) (select .cse0 (+ c_~A~0.offset 4)))))) (forall ((v_ArrVal_1501 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1501) c_~A~0.base))) (< (+ (select .cse2 (+ c_~A~0.offset 8)) (select .cse2 c_~A~0.offset) (select .cse2 (+ c_~A~0.offset 4))) (let ((.cse3 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse2 (+ .cse3 c_~A~0.offset 4)) (select .cse2 (+ .cse3 c_~A~0.offset)) 1)))))) is different from false [2021-11-25 18:33:42,813 INFO L354 Elim1Store]: treesize reduction 114, result has 46.0 percent of original size [2021-11-25 18:33:42,814 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 104 treesize of output 150 [2021-11-25 18:33:42,869 INFO L354 Elim1Store]: treesize reduction 70, result has 48.9 percent of original size [2021-11-25 18:33:42,869 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 38 treesize of output 81 [2021-11-25 18:33:43,454 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:33:43,480 INFO L354 Elim1Store]: treesize reduction 198, result has 6.2 percent of original size [2021-11-25 18:33:43,480 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 53 treesize of output 24 [2021-11-25 18:33:43,603 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 18:33:43,603 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203345109] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:33:43,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1463856228] [2021-11-25 18:33:43,604 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:33:43,604 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:33:43,605 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 34 [2021-11-25 18:33:43,605 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798293874] [2021-11-25 18:33:43,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:33:43,605 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-11-25 18:33:43,605 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:33:43,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-11-25 18:33:43,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1068, Unknown=1, NotChecked=66, Total=1260 [2021-11-25 18:33:43,606 INFO L87 Difference]: Start difference. First operand 246 states and 625 transitions. Second operand has 36 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 35 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:33:45,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:33:45,522 INFO L93 Difference]: Finished difference Result 413 states and 1001 transitions. [2021-11-25 18:33:45,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-11-25 18:33:45,522 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 35 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-25 18:33:45,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:33:45,524 INFO L225 Difference]: With dead ends: 413 [2021-11-25 18:33:45,524 INFO L226 Difference]: Without dead ends: 398 [2021-11-25 18:33:45,525 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 764 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=353, Invalid=2842, Unknown=1, NotChecked=110, Total=3306 [2021-11-25 18:33:45,525 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 159 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 1496 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 1615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 64 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-25 18:33:45,525 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [159 Valid, 41 Invalid, 1615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1496 Invalid, 0 Unknown, 64 Unchecked, 0.8s Time] [2021-11-25 18:33:45,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2021-11-25 18:33:45,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 258. [2021-11-25 18:33:45,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 257 states have (on average 2.595330739299611) internal successors, (667), 257 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:33:45,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 667 transitions. [2021-11-25 18:33:45,534 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 667 transitions. Word has length 23 [2021-11-25 18:33:45,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:33:45,534 INFO L470 AbstractCegarLoop]: Abstraction has 258 states and 667 transitions. [2021-11-25 18:33:45,534 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 35 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:33:45,534 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 667 transitions. [2021-11-25 18:33:45,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:33:45,536 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:33:45,536 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:33:45,563 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2021-11-25 18:33:45,753 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:33:45,753 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:33:45,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:33:45,753 INFO L85 PathProgramCache]: Analyzing trace with hash -629296933, now seen corresponding path program 41 times [2021-11-25 18:33:45,754 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:33:45,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009314898] [2021-11-25 18:33:45,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:33:45,754 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:33:45,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:33:46,279 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:33:46,279 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:33:46,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009314898] [2021-11-25 18:33:46,280 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009314898] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:33:46,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428054728] [2021-11-25 18:33:46,280 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:33:46,280 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:33:46,280 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:33:46,281 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:33:46,281 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2021-11-25 18:33:46,440 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-11-25 18:33:46,440 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:33:46,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 115 conjunts are in the unsatisfiable core [2021-11-25 18:33:46,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:33:46,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:33:46,634 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 14 treesize of output 16 [2021-11-25 18:33:46,867 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:33:46,867 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 17 treesize of output 18 [2021-11-25 18:33:47,006 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:33:47,007 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:33:47,460 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1540 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1540) c_~A~0.base))) (< (+ (select .cse0 (+ c_~A~0.offset 4)) (select .cse0 c_~A~0.offset)) (+ c_~counter~0 (select .cse0 (+ (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) c_~A~0.offset)) 1)))) (forall ((v_ArrVal_1540 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1540) c_~A~0.base))) (<= (+ c_~counter~0 (select .cse1 (+ (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) c_~A~0.offset))) (+ (select .cse1 (+ c_~A~0.offset 4)) (select .cse1 c_~A~0.offset)))))) is different from false [2021-11-25 18:33:47,494 INFO L354 Elim1Store]: treesize reduction 39, result has 52.4 percent of original size [2021-11-25 18:33:47,497 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 76 treesize of output 83 [2021-11-25 18:33:47,563 INFO L354 Elim1Store]: treesize reduction 16, result has 59.0 percent of original size [2021-11-25 18:33:47,564 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 26 treesize of output 36 [2021-11-25 18:33:47,701 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:33:47,714 INFO L354 Elim1Store]: treesize reduction 73, result has 11.0 percent of original size [2021-11-25 18:33:47,714 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 35 treesize of output 17 [2021-11-25 18:33:47,878 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:33:47,878 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428054728] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:33:47,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [986634203] [2021-11-25 18:33:47,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 18:33:47,879 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:33:47,879 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 13] total 40 [2021-11-25 18:33:47,879 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574853183] [2021-11-25 18:33:47,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:33:47,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2021-11-25 18:33:47,880 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:33:47,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-11-25 18:33:47,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=1438, Unknown=1, NotChecked=78, Total=1722 [2021-11-25 18:33:47,881 INFO L87 Difference]: Start difference. First operand 258 states and 667 transitions. Second operand has 42 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 41 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:33:50,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:33:50,334 INFO L93 Difference]: Finished difference Result 343 states and 862 transitions. [2021-11-25 18:33:50,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-11-25 18:33:50,335 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 41 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 23 [2021-11-25 18:33:50,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:33:50,337 INFO L225 Difference]: With dead ends: 343 [2021-11-25 18:33:50,337 INFO L226 Difference]: Without dead ends: 333 [2021-11-25 18:33:50,337 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 16 SyntacticMatches, 9 SemanticMatches, 70 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1320 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=710, Invalid=4263, Unknown=1, NotChecked=138, Total=5112 [2021-11-25 18:33:50,337 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 172 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 1086 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 1426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 241 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-25 18:33:50,338 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [172 Valid, 49 Invalid, 1426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1086 Invalid, 0 Unknown, 241 Unchecked, 0.6s Time] [2021-11-25 18:33:50,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2021-11-25 18:33:50,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 264. [2021-11-25 18:33:50,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 263 states have (on average 2.6311787072243344) internal successors, (692), 263 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:33:50,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 692 transitions. [2021-11-25 18:33:50,347 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 692 transitions. Word has length 23 [2021-11-25 18:33:50,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:33:50,347 INFO L470 AbstractCegarLoop]: Abstraction has 264 states and 692 transitions. [2021-11-25 18:33:50,347 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 41 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:33:50,347 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 692 transitions. [2021-11-25 18:33:50,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:33:50,348 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:33:50,348 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:33:50,383 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2021-11-25 18:33:50,575 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:33:50,575 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:33:50,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:33:50,576 INFO L85 PathProgramCache]: Analyzing trace with hash -587284517, now seen corresponding path program 42 times [2021-11-25 18:33:50,576 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:33:50,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097582117] [2021-11-25 18:33:50,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:33:50,576 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:33:50,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:33:51,250 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:33:51,250 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:33:51,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097582117] [2021-11-25 18:33:51,250 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097582117] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:33:51,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16996721] [2021-11-25 18:33:51,251 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 18:33:51,251 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:33:51,251 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:33:51,253 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:33:51,275 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2021-11-25 18:33:51,408 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 18:33:51,408 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:33:51,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 102 conjunts are in the unsatisfiable core [2021-11-25 18:33:51,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:33:51,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:33:51,541 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 14 treesize of output 16 [2021-11-25 18:33:51,781 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 18:33:51,781 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:33:52,043 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1579 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1579) c_~A~0.base))) (< (+ (select .cse0 (+ c_~A~0.offset 4)) (select .cse0 (+ c_~A~0.offset 8)) (select .cse0 c_~A~0.offset)) (let ((.cse1 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse0 (+ .cse1 c_~A~0.offset 4)) (select .cse0 (+ .cse1 c_~A~0.offset)) 1))))) (forall ((v_ArrVal_1579 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1579) c_~A~0.base))) (<= (let ((.cse3 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse2 (+ .cse3 c_~A~0.offset 4)) (select .cse2 (+ .cse3 c_~A~0.offset)))) (+ (select .cse2 (+ c_~A~0.offset 4)) (select .cse2 (+ c_~A~0.offset 8)) (select .cse2 c_~A~0.offset)))))) is different from false [2021-11-25 18:33:52,126 INFO L354 Elim1Store]: treesize reduction 114, result has 46.0 percent of original size [2021-11-25 18:33:52,126 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 106 treesize of output 152 [2021-11-25 18:33:52,178 INFO L354 Elim1Store]: treesize reduction 70, result has 48.9 percent of original size [2021-11-25 18:33:52,178 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 39 treesize of output 82 [2021-11-25 18:33:52,762 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:33:52,789 INFO L354 Elim1Store]: treesize reduction 198, result has 6.2 percent of original size [2021-11-25 18:33:52,789 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 52 treesize of output 23 [2021-11-25 18:33:52,918 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 18:33:52,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16996721] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:33:52,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1530362406] [2021-11-25 18:33:52,919 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:33:52,919 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:33:52,919 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 35 [2021-11-25 18:33:52,919 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309631735] [2021-11-25 18:33:52,920 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:33:52,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-11-25 18:33:52,920 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:33:52,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-11-25 18:33:52,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1134, Unknown=1, NotChecked=68, Total=1332 [2021-11-25 18:33:52,921 INFO L87 Difference]: Start difference. First operand 264 states and 692 transitions. Second operand has 37 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 36 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:33:54,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:33:54,695 INFO L93 Difference]: Finished difference Result 347 states and 884 transitions. [2021-11-25 18:33:54,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-11-25 18:33:54,696 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 36 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 23 [2021-11-25 18:33:54,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:33:54,697 INFO L225 Difference]: With dead ends: 347 [2021-11-25 18:33:54,697 INFO L226 Difference]: Without dead ends: 342 [2021-11-25 18:33:54,698 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 22 SyntacticMatches, 5 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 766 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=385, Invalid=2810, Unknown=1, NotChecked=110, Total=3306 [2021-11-25 18:33:54,698 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 149 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 1365 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 1514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-25 18:33:54,699 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 45 Invalid, 1514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1365 Invalid, 0 Unknown, 105 Unchecked, 0.8s Time] [2021-11-25 18:33:54,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2021-11-25 18:33:54,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 266. [2021-11-25 18:33:54,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 265 states have (on average 2.637735849056604) internal successors, (699), 265 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:33:54,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 699 transitions. [2021-11-25 18:33:54,707 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 699 transitions. Word has length 23 [2021-11-25 18:33:54,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:33:54,708 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 699 transitions. [2021-11-25 18:33:54,708 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 36 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:33:54,708 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 699 transitions. [2021-11-25 18:33:54,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:33:54,709 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:33:54,709 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:33:54,737 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Ended with exit code 0 [2021-11-25 18:33:54,925 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2021-11-25 18:33:54,925 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:33:54,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:33:54,925 INFO L85 PathProgramCache]: Analyzing trace with hash 2081415397, now seen corresponding path program 43 times [2021-11-25 18:33:54,926 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:33:54,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930866189] [2021-11-25 18:33:54,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:33:54,926 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:33:54,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:33:55,475 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:33:55,475 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:33:55,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930866189] [2021-11-25 18:33:55,476 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930866189] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:33:55,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62432348] [2021-11-25 18:33:55,476 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 18:33:55,476 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:33:55,476 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:33:55,477 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:33:55,477 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2021-11-25 18:33:55,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:33:55,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 102 conjunts are in the unsatisfiable core [2021-11-25 18:33:55,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:33:55,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:33:55,741 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 14 treesize of output 16 [2021-11-25 18:33:55,974 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 18:33:55,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:33:56,256 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1618 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1618) c_~A~0.base))) (<= (let ((.cse1 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse0 (+ .cse1 c_~A~0.offset)) (select .cse0 (+ .cse1 c_~A~0.offset 4)))) (+ (select .cse0 c_~A~0.offset) (select .cse0 (+ c_~A~0.offset 4)) (select .cse0 (+ c_~A~0.offset 8)))))) (forall ((v_ArrVal_1618 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1618) c_~A~0.base))) (< (+ (select .cse2 c_~A~0.offset) (select .cse2 (+ c_~A~0.offset 4)) (select .cse2 (+ c_~A~0.offset 8))) (let ((.cse3 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse2 (+ .cse3 c_~A~0.offset)) (select .cse2 (+ .cse3 c_~A~0.offset 4)) 1)))))) is different from false [2021-11-25 18:33:56,345 INFO L354 Elim1Store]: treesize reduction 114, result has 46.0 percent of original size [2021-11-25 18:33:56,345 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 104 treesize of output 150 [2021-11-25 18:33:56,404 INFO L354 Elim1Store]: treesize reduction 70, result has 48.9 percent of original size [2021-11-25 18:33:56,405 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 38 treesize of output 81 [2021-11-25 18:33:56,827 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:33:56,853 INFO L354 Elim1Store]: treesize reduction 198, result has 6.2 percent of original size [2021-11-25 18:33:56,853 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 53 treesize of output 24 [2021-11-25 18:33:56,981 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 18:33:56,981 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [62432348] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:33:56,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1065290155] [2021-11-25 18:33:56,982 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:33:56,983 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:33:56,983 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 34 [2021-11-25 18:33:56,983 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415836576] [2021-11-25 18:33:56,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:33:56,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-11-25 18:33:56,984 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:33:56,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-11-25 18:33:56,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1078, Unknown=1, NotChecked=66, Total=1260 [2021-11-25 18:33:56,984 INFO L87 Difference]: Start difference. First operand 266 states and 699 transitions. Second operand has 36 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 35 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:33:58,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:33:58,939 INFO L93 Difference]: Finished difference Result 422 states and 1057 transitions. [2021-11-25 18:33:58,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-11-25 18:33:58,939 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 35 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-25 18:33:58,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:33:58,942 INFO L225 Difference]: With dead ends: 422 [2021-11-25 18:33:58,942 INFO L226 Difference]: Without dead ends: 412 [2021-11-25 18:33:58,942 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 727 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=348, Invalid=2961, Unknown=1, NotChecked=112, Total=3422 [2021-11-25 18:33:58,942 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 155 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 1492 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 1643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 98 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-25 18:33:58,943 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 37 Invalid, 1643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1492 Invalid, 0 Unknown, 98 Unchecked, 0.8s Time] [2021-11-25 18:33:58,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2021-11-25 18:33:58,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 278. [2021-11-25 18:33:58,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 277 states have (on average 2.660649819494585) internal successors, (737), 277 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:33:58,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 737 transitions. [2021-11-25 18:33:58,951 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 737 transitions. Word has length 23 [2021-11-25 18:33:58,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:33:58,951 INFO L470 AbstractCegarLoop]: Abstraction has 278 states and 737 transitions. [2021-11-25 18:33:58,952 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 35 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:33:58,952 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 737 transitions. [2021-11-25 18:33:58,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:33:58,953 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:33:58,953 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:33:59,001 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Ended with exit code 0 [2021-11-25 18:33:59,173 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47,46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:33:59,173 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:33:59,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:33:59,173 INFO L85 PathProgramCache]: Analyzing trace with hash 673087963, now seen corresponding path program 44 times [2021-11-25 18:33:59,174 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:33:59,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240376414] [2021-11-25 18:33:59,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:33:59,174 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:33:59,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:33:59,760 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:33:59,760 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:33:59,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240376414] [2021-11-25 18:33:59,760 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240376414] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:33:59,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1511713732] [2021-11-25 18:33:59,760 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:33:59,761 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:33:59,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:33:59,765 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:33:59,781 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2021-11-25 18:33:59,943 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-11-25 18:33:59,943 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:33:59,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 117 conjunts are in the unsatisfiable core [2021-11-25 18:33:59,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:34:00,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:34:00,207 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 19 treesize of output 21 [2021-11-25 18:34:00,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:34:00,491 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:34:00,492 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 32 treesize of output 67 [2021-11-25 18:34:00,984 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:34:00,985 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:34:01,382 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:34:01,571 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:34:02,322 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork0_~i~0#1_326| Int) (|v_thread2Thread1of1ForFork1_~i~1#1_311| Int)) (or (<= c_~N~0 (+ |v_thread2Thread1of1ForFork1_~i~1#1_311| 1)) (and (forall ((v_ArrVal_1657 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1657) c_~A~0.base))) (< (let ((.cse1 (* |v_thread2Thread1of1ForFork1_~i~1#1_311| 4))) (+ (select .cse0 (+ .cse1 c_~A~0.offset 4)) (select .cse0 c_~A~0.offset) (select .cse0 (+ .cse1 c_~A~0.offset)))) (+ c_~counter~0 (select .cse0 (+ (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) c_~A~0.offset)) (select .cse0 (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_326| 4) c_~A~0.offset)) 1)))) (forall ((v_ArrVal_1657 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1657) c_~A~0.base))) (<= (+ c_~counter~0 (select .cse2 (+ (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) c_~A~0.offset)) (select .cse2 (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_326| 4) c_~A~0.offset))) (let ((.cse3 (* |v_thread2Thread1of1ForFork1_~i~1#1_311| 4))) (+ (select .cse2 (+ .cse3 c_~A~0.offset 4)) (select .cse2 c_~A~0.offset) (select .cse2 (+ .cse3 c_~A~0.offset)))))))) (< (+ |v_thread1Thread1of1ForFork0_~i~0#1_326| 1) c_~N~0) (<= c_~N~0 |v_thread1Thread1of1ForFork0_~i~0#1_326|) (< (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_311|) c_~N~0))) is different from false [2021-11-25 18:34:02,429 INFO L354 Elim1Store]: treesize reduction 132, result has 42.9 percent of original size [2021-11-25 18:34:02,430 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 227 treesize of output 218 [2021-11-25 18:34:02,527 INFO L354 Elim1Store]: treesize reduction 88, result has 42.5 percent of original size [2021-11-25 18:34:02,527 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 115 treesize of output 152 [2021-11-25 18:34:02,623 INFO L354 Elim1Store]: treesize reduction 90, result has 41.2 percent of original size [2021-11-25 18:34:02,623 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 85 treesize of output 120 [2021-11-25 18:34:05,614 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:34:05,614 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1511713732] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:34:05,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1600917664] [2021-11-25 18:34:05,614 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:34:05,614 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:34:05,615 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 16] total 44 [2021-11-25 18:34:05,615 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791180829] [2021-11-25 18:34:05,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:34:05,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2021-11-25 18:34:05,615 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:34:05,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-11-25 18:34:05,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=1739, Unknown=1, NotChecked=86, Total=2070 [2021-11-25 18:34:05,616 INFO L87 Difference]: Start difference. First operand 278 states and 737 transitions. Second operand has 46 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 45 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:34:07,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:34:07,920 INFO L93 Difference]: Finished difference Result 419 states and 1059 transitions. [2021-11-25 18:34:07,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-11-25 18:34:07,921 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 45 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-25 18:34:07,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:34:07,923 INFO L225 Difference]: With dead ends: 419 [2021-11-25 18:34:07,923 INFO L226 Difference]: Without dead ends: 414 [2021-11-25 18:34:07,924 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 17 SyntacticMatches, 7 SemanticMatches, 67 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1281 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=658, Invalid=3901, Unknown=1, NotChecked=132, Total=4692 [2021-11-25 18:34:07,924 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 167 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 982 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 1538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 489 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-25 18:34:07,924 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [167 Valid, 89 Invalid, 1538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 982 Invalid, 0 Unknown, 489 Unchecked, 0.6s Time] [2021-11-25 18:34:07,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2021-11-25 18:34:07,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 288. [2021-11-25 18:34:07,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 287 states have (on average 2.658536585365854) internal successors, (763), 287 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:34:07,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 763 transitions. [2021-11-25 18:34:07,933 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 763 transitions. Word has length 23 [2021-11-25 18:34:07,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:34:07,934 INFO L470 AbstractCegarLoop]: Abstraction has 288 states and 763 transitions. [2021-11-25 18:34:07,934 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 45 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:34:07,934 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 763 transitions. [2021-11-25 18:34:07,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:34:07,935 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:34:07,935 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:34:07,956 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 [2021-11-25 18:34:08,137 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2021-11-25 18:34:08,137 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:34:08,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:34:08,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1473082797, now seen corresponding path program 45 times [2021-11-25 18:34:08,138 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:34:08,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960864772] [2021-11-25 18:34:08,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:34:08,138 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:34:08,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:34:08,921 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:34:08,922 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:34:08,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960864772] [2021-11-25 18:34:08,922 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960864772] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:34:08,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076858123] [2021-11-25 18:34:08,922 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 18:34:08,922 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:34:08,922 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:34:08,923 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:34:08,924 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2021-11-25 18:34:09,057 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 18:34:09,057 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:34:09,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 104 conjunts are in the unsatisfiable core [2021-11-25 18:34:09,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:34:09,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:34:09,200 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 14 treesize of output 16 [2021-11-25 18:34:09,447 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 18:34:09,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:34:09,717 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1696 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1696) c_~A~0.base))) (< (+ (select .cse0 (+ c_~A~0.offset 8)) (select .cse0 (+ c_~A~0.offset 4)) (select .cse0 c_~A~0.offset)) (let ((.cse1 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse0 (+ .cse1 c_~A~0.offset 4)) (select .cse0 (+ .cse1 c_~A~0.offset)) 1))))) (forall ((v_ArrVal_1696 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1696) c_~A~0.base))) (<= (let ((.cse3 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse2 (+ .cse3 c_~A~0.offset 4)) (select .cse2 (+ .cse3 c_~A~0.offset)))) (+ (select .cse2 (+ c_~A~0.offset 8)) (select .cse2 (+ c_~A~0.offset 4)) (select .cse2 c_~A~0.offset)))))) is different from false [2021-11-25 18:34:09,800 INFO L354 Elim1Store]: treesize reduction 114, result has 46.0 percent of original size [2021-11-25 18:34:09,800 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 106 treesize of output 152 [2021-11-25 18:34:09,855 INFO L354 Elim1Store]: treesize reduction 70, result has 48.9 percent of original size [2021-11-25 18:34:09,855 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 39 treesize of output 82 [2021-11-25 18:34:10,858 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:34:10,887 INFO L354 Elim1Store]: treesize reduction 198, result has 6.2 percent of original size [2021-11-25 18:34:10,887 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 52 treesize of output 23 [2021-11-25 18:34:11,006 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 18:34:11,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2076858123] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:34:11,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1621743405] [2021-11-25 18:34:11,007 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:34:11,007 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:34:11,007 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 35 [2021-11-25 18:34:11,007 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731786586] [2021-11-25 18:34:11,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:34:11,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-11-25 18:34:11,008 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:34:11,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-11-25 18:34:11,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1131, Unknown=1, NotChecked=68, Total=1332 [2021-11-25 18:34:11,009 INFO L87 Difference]: Start difference. First operand 288 states and 763 transitions. Second operand has 37 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 36 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:34:12,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:34:12,791 INFO L93 Difference]: Finished difference Result 381 states and 982 transitions. [2021-11-25 18:34:12,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-11-25 18:34:12,791 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 36 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 23 [2021-11-25 18:34:12,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:34:12,793 INFO L225 Difference]: With dead ends: 381 [2021-11-25 18:34:12,793 INFO L226 Difference]: Without dead ends: 376 [2021-11-25 18:34:12,793 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 22 SyntacticMatches, 5 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 669 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=359, Invalid=2614, Unknown=1, NotChecked=106, Total=3080 [2021-11-25 18:34:12,794 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 148 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 1166 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 1302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 87 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-25 18:34:12,794 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 44 Invalid, 1302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1166 Invalid, 0 Unknown, 87 Unchecked, 0.7s Time] [2021-11-25 18:34:12,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2021-11-25 18:34:12,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 288. [2021-11-25 18:34:12,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 287 states have (on average 2.658536585365854) internal successors, (763), 287 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:34:12,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 763 transitions. [2021-11-25 18:34:12,803 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 763 transitions. Word has length 23 [2021-11-25 18:34:12,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:34:12,804 INFO L470 AbstractCegarLoop]: Abstraction has 288 states and 763 transitions. [2021-11-25 18:34:12,804 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 36 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:34:12,804 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 763 transitions. [2021-11-25 18:34:12,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:34:12,805 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:34:12,805 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:34:12,856 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2021-11-25 18:34:13,027 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2021-11-25 18:34:13,027 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:34:13,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:34:13,028 INFO L85 PathProgramCache]: Analyzing trace with hash 715100379, now seen corresponding path program 46 times [2021-11-25 18:34:13,028 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:34:13,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602176945] [2021-11-25 18:34:13,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:34:13,028 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:34:13,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:34:13,638 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:34:13,638 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:34:13,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602176945] [2021-11-25 18:34:13,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602176945] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:34:13,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025081094] [2021-11-25 18:34:13,638 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 18:34:13,639 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:34:13,639 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:34:13,639 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:34:13,640 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2021-11-25 18:34:13,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:34:13,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 108 conjunts are in the unsatisfiable core [2021-11-25 18:34:13,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:34:13,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:34:13,955 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 19 treesize of output 21 [2021-11-25 18:34:14,207 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:34:14,207 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:34:14,486 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1735 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1735) c_~A~0.base))) (<= (let ((.cse1 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse0 (+ .cse1 c_~A~0.offset 4)) (select .cse0 (+ .cse1 c_~A~0.offset)))) (+ (select .cse0 (+ c_~A~0.offset 4)) (select .cse0 c_~A~0.offset) (select .cse0 (+ c_~A~0.offset 8)))))) (forall ((v_ArrVal_1735 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1735) c_~A~0.base))) (< (+ (select .cse2 (+ c_~A~0.offset 4)) (select .cse2 c_~A~0.offset) (select .cse2 (+ c_~A~0.offset 8))) (let ((.cse3 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse2 (+ .cse3 c_~A~0.offset 4)) (select .cse2 (+ .cse3 c_~A~0.offset)) 1)))))) is different from false [2021-11-25 18:34:14,571 INFO L354 Elim1Store]: treesize reduction 114, result has 46.0 percent of original size [2021-11-25 18:34:14,572 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 104 treesize of output 150 [2021-11-25 18:34:14,626 INFO L354 Elim1Store]: treesize reduction 70, result has 48.9 percent of original size [2021-11-25 18:34:14,627 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 38 treesize of output 81 [2021-11-25 18:34:15,087 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:34:15,113 INFO L354 Elim1Store]: treesize reduction 198, result has 6.2 percent of original size [2021-11-25 18:34:15,113 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 53 treesize of output 24 [2021-11-25 18:34:15,249 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 18:34:15,249 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025081094] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:34:15,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1259942812] [2021-11-25 18:34:15,249 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:34:15,251 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:34:15,251 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 11] total 37 [2021-11-25 18:34:15,251 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745127169] [2021-11-25 18:34:15,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:34:15,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-11-25 18:34:15,252 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:34:15,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-11-25 18:34:15,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1273, Unknown=1, NotChecked=72, Total=1482 [2021-11-25 18:34:15,252 INFO L87 Difference]: Start difference. First operand 288 states and 763 transitions. Second operand has 39 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 38 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:34:17,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:34:17,068 INFO L93 Difference]: Finished difference Result 390 states and 998 transitions. [2021-11-25 18:34:17,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-11-25 18:34:17,069 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 38 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-25 18:34:17,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:34:17,071 INFO L225 Difference]: With dead ends: 390 [2021-11-25 18:34:17,071 INFO L226 Difference]: Without dead ends: 385 [2021-11-25 18:34:17,072 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 1 IntricatePredicates, 2 DeprecatedPredicates, 723 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=367, Invalid=3058, Unknown=1, NotChecked=114, Total=3540 [2021-11-25 18:34:17,072 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 151 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 1435 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 1594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 123 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-25 18:34:17,072 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 63 Invalid, 1594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1435 Invalid, 0 Unknown, 123 Unchecked, 0.8s Time] [2021-11-25 18:34:17,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2021-11-25 18:34:17,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 296. [2021-11-25 18:34:17,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 295 states have (on average 2.6576271186440676) internal successors, (784), 295 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:34:17,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 784 transitions. [2021-11-25 18:34:17,078 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 784 transitions. Word has length 23 [2021-11-25 18:34:17,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:34:17,078 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 784 transitions. [2021-11-25 18:34:17,079 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 38 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:34:17,079 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 784 transitions. [2021-11-25 18:34:17,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:34:17,080 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:34:17,080 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:34:17,115 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Ended with exit code 0 [2021-11-25 18:34:17,293 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,49 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:34:17,293 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:34:17,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:34:17,293 INFO L85 PathProgramCache]: Analyzing trace with hash -279386675, now seen corresponding path program 47 times [2021-11-25 18:34:17,294 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:34:17,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984812786] [2021-11-25 18:34:17,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:34:17,294 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:34:17,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:34:17,938 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:34:17,938 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:34:17,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984812786] [2021-11-25 18:34:17,939 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984812786] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:34:17,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131356794] [2021-11-25 18:34:17,939 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:34:17,939 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:34:17,939 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:34:17,941 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:34:17,957 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2021-11-25 18:34:18,108 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-11-25 18:34:18,108 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:34:18,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 118 conjunts are in the unsatisfiable core [2021-11-25 18:34:18,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:34:18,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:34:18,380 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 14 treesize of output 16 [2021-11-25 18:34:18,656 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:34:18,656 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 15 treesize of output 16 [2021-11-25 18:34:18,748 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:34:18,748 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:34:19,104 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:34:19,247 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork0_~i~0#1_351| Int)) (or (< (+ |v_thread1Thread1of1ForFork0_~i~0#1_351| 1) c_~N~0) (and (forall ((v_ArrVal_1774 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1774) c_~A~0.base))) (< (+ (select .cse0 (+ c_~A~0.offset 4)) (select .cse0 c_~A~0.offset) (select .cse0 (+ c_~A~0.offset 8))) (+ c_~counter~0 (select .cse0 (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_351| 4) c_~A~0.offset)) (select .cse0 (+ (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) c_~A~0.offset)) 1)))) (forall ((v_ArrVal_1774 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1774) c_~A~0.base))) (<= (+ c_~counter~0 (select .cse1 (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_351| 4) c_~A~0.offset)) (select .cse1 (+ (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) c_~A~0.offset))) (+ (select .cse1 (+ c_~A~0.offset 4)) (select .cse1 c_~A~0.offset) (select .cse1 (+ c_~A~0.offset 8))))))) (<= c_~N~0 |v_thread1Thread1of1ForFork0_~i~0#1_351|))) is different from false [2021-11-25 18:34:19,360 INFO L354 Elim1Store]: treesize reduction 87, result has 57.8 percent of original size [2021-11-25 18:34:19,360 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 207 treesize of output 228 [2021-11-25 18:34:19,436 INFO L354 Elim1Store]: treesize reduction 56, result has 57.9 percent of original size [2021-11-25 18:34:19,437 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 109 treesize of output 163 [2021-11-25 18:34:19,523 INFO L354 Elim1Store]: treesize reduction 56, result has 57.9 percent of original size [2021-11-25 18:34:19,524 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 86 treesize of output 140 [2021-11-25 18:34:25,902 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:34:25,902 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131356794] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:34:25,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1363428742] [2021-11-25 18:34:25,903 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:34:25,903 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:34:25,903 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 43 [2021-11-25 18:34:25,903 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198762835] [2021-11-25 18:34:25,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:34:25,904 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2021-11-25 18:34:25,904 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:34:25,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-11-25 18:34:25,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1701, Unknown=1, NotChecked=84, Total=1980 [2021-11-25 18:34:25,905 INFO L87 Difference]: Start difference. First operand 296 states and 784 transitions. Second operand has 45 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 44 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:34:29,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:34:29,507 INFO L93 Difference]: Finished difference Result 552 states and 1404 transitions. [2021-11-25 18:34:29,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2021-11-25 18:34:29,507 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 44 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-25 18:34:29,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:34:29,510 INFO L225 Difference]: With dead ends: 552 [2021-11-25 18:34:29,510 INFO L226 Difference]: Without dead ends: 542 [2021-11-25 18:34:29,511 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 15 SyntacticMatches, 4 SemanticMatches, 86 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 2091 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=913, Invalid=6572, Unknown=1, NotChecked=170, Total=7656 [2021-11-25 18:34:29,511 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 225 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 1313 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 2372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 957 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-25 18:34:29,512 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [225 Valid, 114 Invalid, 2372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1313 Invalid, 0 Unknown, 957 Unchecked, 0.8s Time] [2021-11-25 18:34:29,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2021-11-25 18:34:29,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 294. [2021-11-25 18:34:29,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 293 states have (on average 2.651877133105802) internal successors, (777), 293 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:34:29,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 777 transitions. [2021-11-25 18:34:29,520 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 777 transitions. Word has length 23 [2021-11-25 18:34:29,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:34:29,521 INFO L470 AbstractCegarLoop]: Abstraction has 294 states and 777 transitions. [2021-11-25 18:34:29,521 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 44 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:34:29,521 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 777 transitions. [2021-11-25 18:34:29,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:34:29,522 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:34:29,522 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:34:29,561 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2021-11-25 18:34:29,749 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,50 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:34:29,749 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:34:29,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:34:29,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1908796501, now seen corresponding path program 48 times [2021-11-25 18:34:29,749 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:34:29,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786546188] [2021-11-25 18:34:29,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:34:29,750 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:34:29,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:34:30,322 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:34:30,322 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:34:30,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786546188] [2021-11-25 18:34:30,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786546188] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:34:30,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681424893] [2021-11-25 18:34:30,322 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 18:34:30,322 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:34:30,322 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:34:30,325 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:34:30,326 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2021-11-25 18:34:30,459 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 18:34:30,459 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:34:30,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 102 conjunts are in the unsatisfiable core [2021-11-25 18:34:30,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:34:30,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:34:30,617 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 19 treesize of output 21 [2021-11-25 18:34:30,843 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 18:34:30,843 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:34:31,113 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1813 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1813) c_~A~0.base))) (< (+ (select .cse0 (+ c_~A~0.offset 4)) (select .cse0 c_~A~0.offset) (select .cse0 (+ c_~A~0.offset 8))) (let ((.cse1 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse0 (+ .cse1 c_~A~0.offset)) (select .cse0 (+ .cse1 c_~A~0.offset 4)) 1))))) (forall ((v_ArrVal_1813 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1813) c_~A~0.base))) (<= (let ((.cse3 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse2 (+ .cse3 c_~A~0.offset)) (select .cse2 (+ .cse3 c_~A~0.offset 4)))) (+ (select .cse2 (+ c_~A~0.offset 4)) (select .cse2 c_~A~0.offset) (select .cse2 (+ c_~A~0.offset 8))))))) is different from false [2021-11-25 18:34:31,208 INFO L354 Elim1Store]: treesize reduction 114, result has 46.0 percent of original size [2021-11-25 18:34:31,208 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 104 treesize of output 150 [2021-11-25 18:34:31,263 INFO L354 Elim1Store]: treesize reduction 70, result has 48.9 percent of original size [2021-11-25 18:34:31,263 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 38 treesize of output 81 [2021-11-25 18:34:31,883 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:34:31,909 INFO L354 Elim1Store]: treesize reduction 198, result has 6.2 percent of original size [2021-11-25 18:34:31,909 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 53 treesize of output 24 [2021-11-25 18:34:32,052 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 18:34:32,052 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681424893] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:34:32,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [653251175] [2021-11-25 18:34:32,053 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:34:32,053 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:34:32,053 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 35 [2021-11-25 18:34:32,053 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471458727] [2021-11-25 18:34:32,053 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:34:32,054 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-11-25 18:34:32,054 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:34:32,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-11-25 18:34:32,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1130, Unknown=1, NotChecked=68, Total=1332 [2021-11-25 18:34:32,054 INFO L87 Difference]: Start difference. First operand 294 states and 777 transitions. Second operand has 37 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 36 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:34:33,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:34:33,741 INFO L93 Difference]: Finished difference Result 414 states and 1060 transitions. [2021-11-25 18:34:33,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-11-25 18:34:33,741 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 36 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 23 [2021-11-25 18:34:33,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:34:33,743 INFO L225 Difference]: With dead ends: 414 [2021-11-25 18:34:33,743 INFO L226 Difference]: Without dead ends: 409 [2021-11-25 18:34:33,744 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 1 IntricatePredicates, 2 DeprecatedPredicates, 692 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=375, Invalid=3050, Unknown=1, NotChecked=114, Total=3540 [2021-11-25 18:34:33,744 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 142 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 1114 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 1282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 125 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-25 18:34:33,744 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 60 Invalid, 1282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1114 Invalid, 0 Unknown, 125 Unchecked, 0.6s Time] [2021-11-25 18:34:33,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2021-11-25 18:34:33,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 294. [2021-11-25 18:34:33,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 293 states have (on average 2.651877133105802) internal successors, (777), 293 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:34:33,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 777 transitions. [2021-11-25 18:34:33,752 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 777 transitions. Word has length 23 [2021-11-25 18:34:33,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:34:33,752 INFO L470 AbstractCegarLoop]: Abstraction has 294 states and 777 transitions. [2021-11-25 18:34:33,753 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 36 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:34:33,753 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 777 transitions. [2021-11-25 18:34:33,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:34:33,754 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:34:33,754 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:34:33,793 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2021-11-25 18:34:33,969 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,51 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:34:33,969 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:34:33,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:34:33,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1650714555, now seen corresponding path program 49 times [2021-11-25 18:34:33,969 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:34:33,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681358569] [2021-11-25 18:34:33,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:34:33,970 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:34:34,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:34:34,597 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:34:34,598 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:34:34,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681358569] [2021-11-25 18:34:34,598 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681358569] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:34:34,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292062733] [2021-11-25 18:34:34,598 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 18:34:34,598 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:34:34,599 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:34:34,599 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:34:34,600 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2021-11-25 18:34:34,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:34:34,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 102 conjunts are in the unsatisfiable core [2021-11-25 18:34:34,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:34:34,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:34:34,900 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 19 treesize of output 21 [2021-11-25 18:34:35,168 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 18:34:35,168 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:34:35,460 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1852 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1852) c_~A~0.base))) (< (+ (select .cse0 (+ c_~A~0.offset 4)) (select .cse0 (+ c_~A~0.offset 8)) (select .cse0 c_~A~0.offset)) (let ((.cse1 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse0 (+ .cse1 c_~A~0.offset)) (select .cse0 (+ .cse1 c_~A~0.offset 4)) 1))))) (forall ((v_ArrVal_1852 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1852) c_~A~0.base))) (<= (let ((.cse3 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse2 (+ .cse3 c_~A~0.offset)) (select .cse2 (+ .cse3 c_~A~0.offset 4)))) (+ (select .cse2 (+ c_~A~0.offset 4)) (select .cse2 (+ c_~A~0.offset 8)) (select .cse2 c_~A~0.offset)))))) is different from false [2021-11-25 18:34:35,542 INFO L354 Elim1Store]: treesize reduction 114, result has 46.0 percent of original size [2021-11-25 18:34:35,543 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 106 treesize of output 152 [2021-11-25 18:34:35,597 INFO L354 Elim1Store]: treesize reduction 70, result has 48.9 percent of original size [2021-11-25 18:34:35,597 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 39 treesize of output 82 [2021-11-25 18:34:36,228 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:34:36,254 INFO L354 Elim1Store]: treesize reduction 198, result has 6.2 percent of original size [2021-11-25 18:34:36,254 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 52 treesize of output 23 [2021-11-25 18:34:36,383 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 18:34:36,384 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292062733] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:34:36,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [939616052] [2021-11-25 18:34:36,384 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:34:36,384 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:34:36,384 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 35 [2021-11-25 18:34:36,385 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648686147] [2021-11-25 18:34:36,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:34:36,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-11-25 18:34:36,385 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:34:36,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-11-25 18:34:36,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1133, Unknown=1, NotChecked=68, Total=1332 [2021-11-25 18:34:36,386 INFO L87 Difference]: Start difference. First operand 294 states and 777 transitions. Second operand has 37 states, 36 states have (on average 1.5) internal successors, (54), 36 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:34:38,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:34:38,670 INFO L93 Difference]: Finished difference Result 468 states and 1158 transitions. [2021-11-25 18:34:38,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-11-25 18:34:38,671 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.5) internal successors, (54), 36 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-25 18:34:38,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:34:38,673 INFO L225 Difference]: With dead ends: 468 [2021-11-25 18:34:38,673 INFO L226 Difference]: Without dead ends: 458 [2021-11-25 18:34:38,674 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 22 SyntacticMatches, 5 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 894 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=433, Invalid=3230, Unknown=1, NotChecked=118, Total=3782 [2021-11-25 18:34:38,674 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 195 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 1423 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 1596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 116 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-25 18:34:38,674 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [195 Valid, 44 Invalid, 1596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1423 Invalid, 0 Unknown, 116 Unchecked, 0.9s Time] [2021-11-25 18:34:38,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2021-11-25 18:34:38,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 290. [2021-11-25 18:34:38,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 289 states have (on average 2.685121107266436) internal successors, (776), 289 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:34:38,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 776 transitions. [2021-11-25 18:34:38,680 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 776 transitions. Word has length 23 [2021-11-25 18:34:38,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:34:38,680 INFO L470 AbstractCegarLoop]: Abstraction has 290 states and 776 transitions. [2021-11-25 18:34:38,681 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.5) internal successors, (54), 36 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:34:38,681 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 776 transitions. [2021-11-25 18:34:38,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:34:38,682 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:34:38,682 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:34:38,732 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2021-11-25 18:34:38,897 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2021-11-25 18:34:38,897 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:34:38,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:34:38,898 INFO L85 PathProgramCache]: Analyzing trace with hash -96785731, now seen corresponding path program 50 times [2021-11-25 18:34:38,898 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:34:38,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732429976] [2021-11-25 18:34:38,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:34:38,898 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:34:38,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:34:39,386 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:34:39,386 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:34:39,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732429976] [2021-11-25 18:34:39,386 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732429976] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:34:39,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370622757] [2021-11-25 18:34:39,386 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:34:39,386 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:34:39,387 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:34:39,387 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:34:39,388 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2021-11-25 18:34:39,532 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-11-25 18:34:39,532 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:34:39,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 110 conjunts are in the unsatisfiable core [2021-11-25 18:34:39,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:34:40,015 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:34:40,018 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:34:40,018 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 17 treesize of output 9 [2021-11-25 18:34:40,055 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:34:40,055 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:34:40,615 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:34:40,891 INFO L354 Elim1Store]: treesize reduction 134, result has 46.6 percent of original size [2021-11-25 18:34:40,891 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 122 treesize of output 139 [2021-11-25 18:34:41,638 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:34:41,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370622757] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:34:41,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [746340268] [2021-11-25 18:34:41,638 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) WARNING: YOUR LOGFILE WAS TOO LONG, SOME LINES IN THE MIDDLE WERE REMOVED. [2021-11-25 18:36:05,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:36:05,479 INFO L93 Difference]: Finished difference Result 747 states and 2071 transitions. [2021-11-25 18:36:05,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-11-25 18:36:05,479 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 30 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-25 18:36:05,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:36:05,481 INFO L225 Difference]: With dead ends: 747 [2021-11-25 18:36:05,481 INFO L226 Difference]: Without dead ends: 732 [2021-11-25 18:36:05,481 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 565 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=246, Invalid=1916, Unknown=0, NotChecked=0, Total=2162 [2021-11-25 18:36:05,482 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 93 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 1107 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-25 18:36:05,482 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 26 Invalid, 1135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1107 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-25 18:36:05,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2021-11-25 18:36:05,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 614. [2021-11-25 18:36:05,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 613 states have (on average 2.8809135399673735) internal successors, (1766), 613 states have internal predecessors, (1766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:36:05,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 1766 transitions. [2021-11-25 18:36:05,497 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 1766 transitions. Word has length 23 [2021-11-25 18:36:05,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:36:05,497 INFO L470 AbstractCegarLoop]: Abstraction has 614 states and 1766 transitions. [2021-11-25 18:36:05,497 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 30 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:36:05,497 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 1766 transitions. [2021-11-25 18:36:05,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:36:05,498 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:36:05,498 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:36:05,519 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Ended with exit code 0 [2021-11-25 18:36:05,698 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,70 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:36:05,699 INFO L402 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:36:05,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:36:05,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1401306729, now seen corresponding path program 68 times [2021-11-25 18:36:05,699 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:36:05,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452864883] [2021-11-25 18:36:05,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:36:05,699 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:36:05,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:36:06,264 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:36:06,264 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:36:06,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452864883] [2021-11-25 18:36:06,264 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452864883] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:36:06,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250984201] [2021-11-25 18:36:06,264 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:36:06,264 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:36:06,265 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:36:06,266 INFO L229 MonitoredProcess]: Starting monitored process 71 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:36:06,281 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Waiting until timeout for monitored process [2021-11-25 18:36:06,566 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-11-25 18:36:06,566 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:36:06,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 110 conjunts are in the unsatisfiable core [2021-11-25 18:36:06,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:36:06,992 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:36:06,992 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 17 treesize of output 18 [2021-11-25 18:36:07,094 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:36:07,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:36:07,277 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:36:07,764 INFO L354 Elim1Store]: treesize reduction 134, result has 46.6 percent of original size [2021-11-25 18:36:07,765 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 122 treesize of output 139 [2021-11-25 18:36:09,138 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:36:09,138 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250984201] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:36:09,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1238565420] [2021-11-25 18:36:09,138 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:36:09,138 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:36:09,138 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 41 [2021-11-25 18:36:09,139 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460263123] [2021-11-25 18:36:09,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:36:09,139 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2021-11-25 18:36:09,139 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:36:09,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-11-25 18:36:09,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=1568, Unknown=0, NotChecked=0, Total=1806 [2021-11-25 18:36:09,139 INFO L87 Difference]: Start difference. First operand 614 states and 1766 transitions. Second operand has 43 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 42 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:36:13,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:36:13,176 INFO L93 Difference]: Finished difference Result 850 states and 2418 transitions. [2021-11-25 18:36:13,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2021-11-25 18:36:13,176 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 42 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-25 18:36:13,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:36:13,178 INFO L225 Difference]: With dead ends: 850 [2021-11-25 18:36:13,178 INFO L226 Difference]: Without dead ends: 840 [2021-11-25 18:36:13,179 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1936 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=922, Invalid=6388, Unknown=0, NotChecked=0, Total=7310 [2021-11-25 18:36:13,179 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 214 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 1042 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 2103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 1042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 955 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-25 18:36:13,179 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [214 Valid, 82 Invalid, 2103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 1042 Invalid, 0 Unknown, 955 Unchecked, 0.6s Time] [2021-11-25 18:36:13,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2021-11-25 18:36:13,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 683. [2021-11-25 18:36:13,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 682 states have (on average 2.9574780058651027) internal successors, (2017), 682 states have internal predecessors, (2017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:36:13,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 2017 transitions. [2021-11-25 18:36:13,193 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 2017 transitions. Word has length 23 [2021-11-25 18:36:13,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:36:13,193 INFO L470 AbstractCegarLoop]: Abstraction has 683 states and 2017 transitions. [2021-11-25 18:36:13,193 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 42 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:36:13,193 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 2017 transitions. [2021-11-25 18:36:13,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:36:13,194 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:36:13,194 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:36:13,215 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Ended with exit code 0 [2021-11-25 18:36:13,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72,71 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:36:13,395 INFO L402 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:36:13,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:36:13,395 INFO L85 PathProgramCache]: Analyzing trace with hash -275118367, now seen corresponding path program 69 times [2021-11-25 18:36:13,395 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:36:13,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622735012] [2021-11-25 18:36:13,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:36:13,396 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:36:13,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:36:13,857 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:36:13,857 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:36:13,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622735012] [2021-11-25 18:36:13,857 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622735012] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:36:13,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740668395] [2021-11-25 18:36:13,857 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 18:36:13,858 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:36:13,858 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:36:13,858 INFO L229 MonitoredProcess]: Starting monitored process 72 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:36:13,860 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Waiting until timeout for monitored process [2021-11-25 18:36:14,025 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 18:36:14,025 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:36:14,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 103 conjunts are in the unsatisfiable core [2021-11-25 18:36:14,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:36:14,459 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:36:14,460 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:36:14,461 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 43 treesize of output 14 [2021-11-25 18:36:14,495 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:36:14,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:36:14,769 INFO L354 Elim1Store]: treesize reduction 140, result has 46.4 percent of original size [2021-11-25 18:36:14,769 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 62 treesize of output 131 [2021-11-25 18:36:15,024 INFO L354 Elim1Store]: treesize reduction 248, result has 5.0 percent of original size [2021-11-25 18:36:15,024 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 63 treesize of output 24 [2021-11-25 18:36:15,106 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 18:36:15,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740668395] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:36:15,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [893087438] [2021-11-25 18:36:15,107 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:36:15,107 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:36:15,107 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 8] total 27 [2021-11-25 18:36:15,107 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573794504] [2021-11-25 18:36:15,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:36:15,108 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-11-25 18:36:15,108 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:36:15,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-11-25 18:36:15,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2021-11-25 18:36:15,108 INFO L87 Difference]: Start difference. First operand 683 states and 2017 transitions. Second operand has 29 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 28 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:36:15,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:36:15,852 INFO L93 Difference]: Finished difference Result 826 states and 2358 transitions. [2021-11-25 18:36:15,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-25 18:36:15,852 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 28 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-25 18:36:15,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:36:15,854 INFO L225 Difference]: With dead ends: 826 [2021-11-25 18:36:15,854 INFO L226 Difference]: Without dead ends: 812 [2021-11-25 18:36:15,854 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 26 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=214, Invalid=1346, Unknown=0, NotChecked=0, Total=1560 [2021-11-25 18:36:15,854 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 83 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 59 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-25 18:36:15,855 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 19 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 789 Invalid, 0 Unknown, 59 Unchecked, 0.5s Time] [2021-11-25 18:36:15,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2021-11-25 18:36:15,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 713. [2021-11-25 18:36:15,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 713 states, 712 states have (on average 2.980337078651685) internal successors, (2122), 712 states have internal predecessors, (2122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:36:15,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 2122 transitions. [2021-11-25 18:36:15,869 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 2122 transitions. Word has length 23 [2021-11-25 18:36:15,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:36:15,869 INFO L470 AbstractCegarLoop]: Abstraction has 713 states and 2122 transitions. [2021-11-25 18:36:15,869 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 28 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:36:15,869 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 2122 transitions. [2021-11-25 18:36:15,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:36:15,871 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:36:15,871 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:36:15,892 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Forceful destruction successful, exit code 0 [2021-11-25 18:36:16,071 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73,72 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:36:16,071 INFO L402 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:36:16,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:36:16,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1591275671, now seen corresponding path program 70 times [2021-11-25 18:36:16,072 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:36:16,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554710837] [2021-11-25 18:36:16,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:36:16,072 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:36:16,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:36:16,622 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:36:16,622 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:36:16,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554710837] [2021-11-25 18:36:16,622 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554710837] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:36:16,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296945162] [2021-11-25 18:36:16,623 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 18:36:16,623 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:36:16,623 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:36:16,623 INFO L229 MonitoredProcess]: Starting monitored process 73 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:36:16,625 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process [2021-11-25 18:36:16,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:36:16,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 103 conjunts are in the unsatisfiable core [2021-11-25 18:36:16,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:36:17,118 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:36:17,118 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:36:17,431 INFO L354 Elim1Store]: treesize reduction 140, result has 46.4 percent of original size [2021-11-25 18:36:17,431 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 62 treesize of output 131 [2021-11-25 18:36:17,701 INFO L354 Elim1Store]: treesize reduction 248, result has 5.0 percent of original size [2021-11-25 18:36:17,701 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 63 treesize of output 24 [2021-11-25 18:36:17,804 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 18:36:17,804 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296945162] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:36:17,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1730863514] [2021-11-25 18:36:17,805 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:36:17,805 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:36:17,805 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 8] total 33 [2021-11-25 18:36:17,805 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197635822] [2021-11-25 18:36:17,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:36:17,805 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-11-25 18:36:17,806 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:36:17,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-11-25 18:36:17,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1037, Unknown=0, NotChecked=0, Total=1190 [2021-11-25 18:36:17,806 INFO L87 Difference]: Start difference. First operand 713 states and 2122 transitions. Second operand has 35 states, 34 states have (on average 1.588235294117647) internal successors, (54), 34 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:36:19,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:36:19,576 INFO L93 Difference]: Finished difference Result 904 states and 2563 transitions. [2021-11-25 18:36:19,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-11-25 18:36:19,576 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.588235294117647) internal successors, (54), 34 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-25 18:36:19,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:36:19,578 INFO L225 Difference]: With dead ends: 904 [2021-11-25 18:36:19,578 INFO L226 Difference]: Without dead ends: 889 [2021-11-25 18:36:19,578 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 805 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=387, Invalid=2693, Unknown=0, NotChecked=0, Total=3080 [2021-11-25 18:36:19,579 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 145 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 1805 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 1839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-25 18:36:19,579 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 32 Invalid, 1839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1805 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-11-25 18:36:19,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2021-11-25 18:36:19,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 713. [2021-11-25 18:36:19,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 713 states, 712 states have (on average 2.980337078651685) internal successors, (2122), 712 states have internal predecessors, (2122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:36:19,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 2122 transitions. [2021-11-25 18:36:19,595 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 2122 transitions. Word has length 23 [2021-11-25 18:36:19,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:36:19,595 INFO L470 AbstractCegarLoop]: Abstraction has 713 states and 2122 transitions. [2021-11-25 18:36:19,595 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.588235294117647) internal successors, (54), 34 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:36:19,595 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 2122 transitions. [2021-11-25 18:36:19,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:36:19,597 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:36:19,597 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:36:19,618 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Ended with exit code 0 [2021-11-25 18:36:19,797 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74,73 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:36:19,797 INFO L402 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:36:19,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:36:19,798 INFO L85 PathProgramCache]: Analyzing trace with hash 557520865, now seen corresponding path program 71 times [2021-11-25 18:36:19,798 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:36:19,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063804466] [2021-11-25 18:36:19,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:36:19,798 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:36:19,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:36:20,205 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:36:20,209 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:36:20,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063804466] [2021-11-25 18:36:20,209 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063804466] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:36:20,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326414211] [2021-11-25 18:36:20,210 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:36:20,210 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:36:20,210 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:36:20,211 INFO L229 MonitoredProcess]: Starting monitored process 74 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:36:20,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Waiting until timeout for monitored process [2021-11-25 18:36:20,487 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-11-25 18:36:20,487 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:36:20,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 110 conjunts are in the unsatisfiable core [2021-11-25 18:36:20,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:36:20,882 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:36:20,882 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 35 treesize of output 23 [2021-11-25 18:36:21,040 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:36:21,040 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:36:21,187 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:36:21,421 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:36:21,907 INFO L354 Elim1Store]: treesize reduction 142, result has 43.4 percent of original size [2021-11-25 18:36:21,907 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 122 treesize of output 131 [2021-11-25 18:36:22,191 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:36:22,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326414211] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:36:22,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [69884227] [2021-11-25 18:36:22,191 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:36:22,192 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:36:22,193 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 11] total 36 [2021-11-25 18:36:22,193 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273519277] [2021-11-25 18:36:22,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:36:22,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-11-25 18:36:22,193 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:36:22,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-11-25 18:36:22,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1187, Unknown=0, NotChecked=0, Total=1406 [2021-11-25 18:36:22,194 INFO L87 Difference]: Start difference. First operand 713 states and 2122 transitions. Second operand has 38 states, 37 states have (on average 1.5405405405405406) internal successors, (57), 37 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:36:24,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:36:24,596 INFO L93 Difference]: Finished difference Result 838 states and 2432 transitions. [2021-11-25 18:36:24,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-11-25 18:36:24,596 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.5405405405405406) internal successors, (57), 37 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-25 18:36:24,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:36:24,598 INFO L225 Difference]: With dead ends: 838 [2021-11-25 18:36:24,598 INFO L226 Difference]: Without dead ends: 828 [2021-11-25 18:36:24,599 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 985 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=610, Invalid=3422, Unknown=0, NotChecked=0, Total=4032 [2021-11-25 18:36:24,599 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 120 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 1308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 565 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-25 18:36:24,599 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 35 Invalid, 1308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 683 Invalid, 0 Unknown, 565 Unchecked, 0.4s Time] [2021-11-25 18:36:24,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2021-11-25 18:36:24,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 721. [2021-11-25 18:36:24,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 721 states, 720 states have (on average 2.977777777777778) internal successors, (2144), 720 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:36:24,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 2144 transitions. [2021-11-25 18:36:24,615 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 2144 transitions. Word has length 23 [2021-11-25 18:36:24,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:36:24,616 INFO L470 AbstractCegarLoop]: Abstraction has 721 states and 2144 transitions. [2021-11-25 18:36:24,616 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.5405405405405406) internal successors, (57), 37 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:36:24,616 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 2144 transitions. [2021-11-25 18:36:24,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:36:24,617 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:36:24,617 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:36:24,639 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Ended with exit code 0 [2021-11-25 18:36:24,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 74 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable75 [2021-11-25 18:36:24,818 INFO L402 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:36:24,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:36:24,818 INFO L85 PathProgramCache]: Analyzing trace with hash 942370473, now seen corresponding path program 72 times [2021-11-25 18:36:24,818 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:36:24,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795910786] [2021-11-25 18:36:24,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:36:24,818 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:36:24,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:36:25,381 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:36:25,381 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:36:25,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795910786] [2021-11-25 18:36:25,385 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795910786] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:36:25,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233363476] [2021-11-25 18:36:25,385 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 18:36:25,385 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:36:25,386 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:36:25,386 INFO L229 MonitoredProcess]: Starting monitored process 75 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:36:25,387 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process [2021-11-25 18:36:25,558 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 18:36:25,558 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:36:25,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 122 conjunts are in the unsatisfiable core [2021-11-25 18:36:25,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:36:25,688 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-25 18:36:25,734 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 18:36:25,783 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 18:36:26,145 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:36:26,145 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 15 treesize of output 16 [2021-11-25 18:36:26,230 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:36:26,230 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:36:26,353 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:36:27,009 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork0_~i~0#1_561| Int)) (or (and (forall ((v_ArrVal_2746 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2746) c_~A~0.base))) (< (select .cse0 (+ c_~A~0.offset 8)) (+ c_~counter~0 (select .cse0 (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_561| 4) c_~A~0.offset)) 1)))) (forall ((v_ArrVal_2746 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2746) c_~A~0.base))) (<= (+ c_~counter~0 (select .cse1 (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_561| 4) c_~A~0.offset))) (select .cse1 (+ c_~A~0.offset 8)))))) (<= c_~N~0 |v_thread1Thread1of1ForFork0_~i~0#1_561|) (< (+ |v_thread1Thread1of1ForFork0_~i~0#1_561| 1) c_~N~0))) is different from false [2021-11-25 18:36:27,180 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:36:27,181 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 112 treesize of output 77 [2021-11-25 18:36:27,198 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:36:27,198 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 418 treesize of output 398 [2021-11-25 18:36:27,212 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:36:27,213 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 349 treesize of output 344 [2021-11-25 18:36:27,225 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:36:27,225 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 329 treesize of output 304 [2021-11-25 18:36:27,238 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:36:27,238 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 289 treesize of output 284 [2021-11-25 18:36:27,252 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:36:27,252 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 269 treesize of output 244 [2021-11-25 18:36:27,957 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:36:27,957 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233363476] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:36:27,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1248355351] [2021-11-25 18:36:27,958 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:36:27,958 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:36:27,958 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 43 [2021-11-25 18:36:27,958 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643477932] [2021-11-25 18:36:27,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:36:27,958 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2021-11-25 18:36:27,959 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:36:27,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-11-25 18:36:27,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=1689, Unknown=1, NotChecked=84, Total=1980 [2021-11-25 18:36:27,959 INFO L87 Difference]: Start difference. First operand 721 states and 2144 transitions. Second operand has 45 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 44 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:36:31,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:36:31,354 INFO L93 Difference]: Finished difference Result 791 states and 2305 transitions. [2021-11-25 18:36:31,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-11-25 18:36:31,354 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 44 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-25 18:36:31,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:36:31,356 INFO L225 Difference]: With dead ends: 791 [2021-11-25 18:36:31,356 INFO L226 Difference]: Without dead ends: 781 [2021-11-25 18:36:31,356 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 14 SyntacticMatches, 4 SemanticMatches, 72 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1473 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=733, Invalid=4526, Unknown=1, NotChecked=142, Total=5402 [2021-11-25 18:36:31,356 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 198 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 972 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 1806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 761 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-25 18:36:31,357 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [198 Valid, 70 Invalid, 1806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 972 Invalid, 0 Unknown, 761 Unchecked, 0.6s Time] [2021-11-25 18:36:31,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2021-11-25 18:36:31,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 723. [2021-11-25 18:36:31,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 723 states, 722 states have (on average 2.9764542936288088) internal successors, (2149), 722 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:36:31,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 2149 transitions. [2021-11-25 18:36:31,368 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 2149 transitions. Word has length 23 [2021-11-25 18:36:31,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:36:31,368 INFO L470 AbstractCegarLoop]: Abstraction has 723 states and 2149 transitions. [2021-11-25 18:36:31,368 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 44 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:36:31,368 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 2149 transitions. [2021-11-25 18:36:31,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:36:31,369 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:36:31,369 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:36:31,391 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Ended with exit code 0 [2021-11-25 18:36:31,570 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 75 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable76 [2021-11-25 18:36:31,570 INFO L402 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:36:31,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:36:31,570 INFO L85 PathProgramCache]: Analyzing trace with hash 233892979, now seen corresponding path program 73 times [2021-11-25 18:36:31,570 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:36:31,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567562870] [2021-11-25 18:36:31,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:36:31,571 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:36:31,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:36:32,031 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:36:32,032 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:36:32,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567562870] [2021-11-25 18:36:32,032 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567562870] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:36:32,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023989993] [2021-11-25 18:36:32,032 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 18:36:32,032 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:36:32,032 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:36:32,033 INFO L229 MonitoredProcess]: Starting monitored process 76 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:36:32,034 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Waiting until timeout for monitored process [2021-11-25 18:36:32,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:36:32,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 97 conjunts are in the unsatisfiable core [2021-11-25 18:36:32,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:36:32,490 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 18:36:32,490 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:36:32,763 INFO L354 Elim1Store]: treesize reduction 140, result has 46.4 percent of original size [2021-11-25 18:36:32,763 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 62 treesize of output 131 [2021-11-25 18:36:32,979 INFO L354 Elim1Store]: treesize reduction 248, result has 5.0 percent of original size [2021-11-25 18:36:32,979 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 63 treesize of output 24 [2021-11-25 18:36:33,061 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 18:36:33,061 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1023989993] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:36:33,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1259641196] [2021-11-25 18:36:33,062 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:36:33,062 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:36:33,062 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 8] total 31 [2021-11-25 18:36:33,062 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716596587] [2021-11-25 18:36:33,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:36:33,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-11-25 18:36:33,063 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:36:33,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-11-25 18:36:33,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=909, Unknown=0, NotChecked=0, Total=1056 [2021-11-25 18:36:33,063 INFO L87 Difference]: Start difference. First operand 723 states and 2149 transitions. Second operand has 33 states, 32 states have (on average 1.65625) internal successors, (53), 32 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:36:34,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:36:34,416 INFO L93 Difference]: Finished difference Result 949 states and 2660 transitions. [2021-11-25 18:36:34,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-11-25 18:36:34,416 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.65625) internal successors, (53), 32 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-25 18:36:34,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:36:34,419 INFO L225 Difference]: With dead ends: 949 [2021-11-25 18:36:34,419 INFO L226 Difference]: Without dead ends: 929 [2021-11-25 18:36:34,420 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 661 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=329, Invalid=2221, Unknown=0, NotChecked=0, Total=2550 [2021-11-25 18:36:34,420 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 146 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 1420 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 1449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-25 18:36:34,420 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 23 Invalid, 1449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1420 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-25 18:36:34,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2021-11-25 18:36:34,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 729. [2021-11-25 18:36:34,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 728 states have (on average 2.989010989010989) internal successors, (2176), 728 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:36:34,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 2176 transitions. [2021-11-25 18:36:34,441 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 2176 transitions. Word has length 23 [2021-11-25 18:36:34,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:36:34,441 INFO L470 AbstractCegarLoop]: Abstraction has 729 states and 2176 transitions. [2021-11-25 18:36:34,442 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.65625) internal successors, (53), 32 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:36:34,442 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 2176 transitions. [2021-11-25 18:36:34,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:36:34,444 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:36:34,444 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:36:34,478 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Forceful destruction successful, exit code 0 [2021-11-25 18:36:34,657 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77,76 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:36:34,657 INFO L402 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:36:34,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:36:34,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1174434455, now seen corresponding path program 74 times [2021-11-25 18:36:34,658 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:36:34,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054977976] [2021-11-25 18:36:34,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:36:34,658 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:36:34,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:36:35,046 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:36:35,046 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:36:35,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054977976] [2021-11-25 18:36:35,046 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054977976] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:36:35,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422742851] [2021-11-25 18:36:35,046 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:36:35,046 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:36:35,047 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:36:35,047 INFO L229 MonitoredProcess]: Starting monitored process 77 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:36:35,048 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process [2021-11-25 18:36:35,242 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-11-25 18:36:35,242 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:36:35,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 121 conjunts are in the unsatisfiable core [2021-11-25 18:36:35,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:36:35,344 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 15 treesize of output 11 [2021-11-25 18:36:35,384 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 18:36:35,415 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 18:36:35,625 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:36:35,625 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 17 treesize of output 18 [2021-11-25 18:36:35,762 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:36:35,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:36:36,294 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:36:36,295 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422742851] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:36:36,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [276777829] [2021-11-25 18:36:36,295 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:36:36,295 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:36:36,295 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 10] total 36 [2021-11-25 18:36:36,295 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478436617] [2021-11-25 18:36:36,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:36:36,296 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-11-25 18:36:36,296 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:36:36,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-11-25 18:36:36,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=1189, Unknown=0, NotChecked=0, Total=1406 [2021-11-25 18:36:36,296 INFO L87 Difference]: Start difference. First operand 729 states and 2176 transitions. Second operand has 38 states, 37 states have (on average 1.5675675675675675) internal successors, (58), 37 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:36:38,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:36:38,203 INFO L93 Difference]: Finished difference Result 849 states and 2470 transitions. [2021-11-25 18:36:38,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-11-25 18:36:38,203 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.5675675675675675) internal successors, (58), 37 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 23 [2021-11-25 18:36:38,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:36:38,205 INFO L225 Difference]: With dead ends: 849 [2021-11-25 18:36:38,206 INFO L226 Difference]: Without dead ends: 839 [2021-11-25 18:36:38,206 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1004 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=621, Invalid=3285, Unknown=0, NotChecked=0, Total=3906 [2021-11-25 18:36:38,206 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 156 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 1033 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 1434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 331 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-25 18:36:38,206 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 46 Invalid, 1434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1033 Invalid, 0 Unknown, 331 Unchecked, 0.6s Time] [2021-11-25 18:36:38,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2021-11-25 18:36:38,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 730. [2021-11-25 18:36:38,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 730 states, 729 states have (on average 2.9876543209876543) internal successors, (2178), 729 states have internal predecessors, (2178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:36:38,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 2178 transitions. [2021-11-25 18:36:38,219 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 2178 transitions. Word has length 23 [2021-11-25 18:36:38,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:36:38,219 INFO L470 AbstractCegarLoop]: Abstraction has 730 states and 2178 transitions. [2021-11-25 18:36:38,219 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.5675675675675675) internal successors, (58), 37 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:36:38,219 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 2178 transitions. [2021-11-25 18:36:38,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:36:38,225 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:36:38,225 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:36:38,251 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Forceful destruction successful, exit code 0 [2021-11-25 18:36:38,437 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78,77 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:36:38,437 INFO L402 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:36:38,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:36:38,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1536277875, now seen corresponding path program 75 times [2021-11-25 18:36:38,438 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:36:38,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145009982] [2021-11-25 18:36:38,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:36:38,438 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:36:38,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:36:38,980 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:36:38,980 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:36:38,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145009982] [2021-11-25 18:36:38,981 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145009982] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:36:38,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595191039] [2021-11-25 18:36:38,981 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 18:36:38,981 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:36:38,981 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:36:38,982 INFO L229 MonitoredProcess]: Starting monitored process 78 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:36:38,982 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2021-11-25 18:36:39,164 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 18:36:39,165 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:36:39,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 107 conjunts are in the unsatisfiable core [2021-11-25 18:36:39,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:36:39,603 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:36:39,603 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 15 treesize of output 16 [2021-11-25 18:36:39,688 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:36:39,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:36:40,167 INFO L354 Elim1Store]: treesize reduction 109, result has 57.4 percent of original size [2021-11-25 18:36:40,167 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 124 treesize of output 169 [2021-11-25 18:36:43,292 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:36:43,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595191039] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:36:43,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1452531816] [2021-11-25 18:36:43,292 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:36:43,292 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:36:43,293 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 13] total 40 [2021-11-25 18:36:43,293 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079009718] [2021-11-25 18:36:43,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:36:43,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2021-11-25 18:36:43,293 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:36:43,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-11-25 18:36:43,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=1465, Unknown=0, NotChecked=0, Total=1722 [2021-11-25 18:36:43,294 INFO L87 Difference]: Start difference. First operand 730 states and 2178 transitions. Second operand has 42 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 41 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:36:45,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:36:45,332 INFO L93 Difference]: Finished difference Result 856 states and 2492 transitions. [2021-11-25 18:36:45,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-11-25 18:36:45,333 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 41 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-25 18:36:45,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:36:45,335 INFO L225 Difference]: With dead ends: 856 [2021-11-25 18:36:45,336 INFO L226 Difference]: Without dead ends: 846 [2021-11-25 18:36:45,336 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1174 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=686, Invalid=3736, Unknown=0, NotChecked=0, Total=4422 [2021-11-25 18:36:45,337 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 177 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 1006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 57 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-25 18:36:45,337 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 33 Invalid, 1006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 862 Invalid, 0 Unknown, 57 Unchecked, 0.6s Time] [2021-11-25 18:36:45,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2021-11-25 18:36:45,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 734. [2021-11-25 18:36:45,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 733 states have (on average 2.9849931787175987) internal successors, (2188), 733 states have internal predecessors, (2188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:36:45,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 2188 transitions. [2021-11-25 18:36:45,356 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 2188 transitions. Word has length 23 [2021-11-25 18:36:45,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:36:45,356 INFO L470 AbstractCegarLoop]: Abstraction has 734 states and 2188 transitions. [2021-11-25 18:36:45,357 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 41 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:36:45,357 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 2188 transitions. [2021-11-25 18:36:45,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:36:45,359 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:36:45,359 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:36:45,400 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Forceful destruction successful, exit code 0 [2021-11-25 18:36:45,581 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 78 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable79 [2021-11-25 18:36:45,581 INFO L402 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:36:45,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:36:45,581 INFO L85 PathProgramCache]: Analyzing trace with hash 127950441, now seen corresponding path program 76 times [2021-11-25 18:36:45,582 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:36:45,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316371575] [2021-11-25 18:36:45,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:36:45,582 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:36:45,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:36:46,134 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:36:46,134 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:36:46,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316371575] [2021-11-25 18:36:46,134 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316371575] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:36:46,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843071580] [2021-11-25 18:36:46,134 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 18:36:46,134 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:36:46,134 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:36:46,135 INFO L229 MonitoredProcess]: Starting monitored process 79 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:36:46,136 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Waiting until timeout for monitored process [2021-11-25 18:36:46,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:36:46,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 97 conjunts are in the unsatisfiable core [2021-11-25 18:36:46,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:36:46,631 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 18:36:46,631 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:36:46,932 INFO L354 Elim1Store]: treesize reduction 140, result has 46.4 percent of original size [2021-11-25 18:36:46,932 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 62 treesize of output 131 [2021-11-25 18:36:47,125 INFO L354 Elim1Store]: treesize reduction 248, result has 5.0 percent of original size [2021-11-25 18:36:47,125 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 63 treesize of output 24 [2021-11-25 18:36:47,211 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 18:36:47,212 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843071580] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:36:47,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [496624868] [2021-11-25 18:36:47,212 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:36:47,212 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:36:47,212 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 8] total 31 [2021-11-25 18:36:47,212 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048679228] [2021-11-25 18:36:47,212 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:36:47,213 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-11-25 18:36:47,213 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:36:47,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-11-25 18:36:47,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=922, Unknown=0, NotChecked=0, Total=1056 [2021-11-25 18:36:47,213 INFO L87 Difference]: Start difference. First operand 734 states and 2188 transitions. Second operand has 33 states, 32 states have (on average 1.625) internal successors, (52), 32 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:36:48,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:36:48,881 INFO L93 Difference]: Finished difference Result 962 states and 2722 transitions. [2021-11-25 18:36:48,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-11-25 18:36:48,881 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.625) internal successors, (52), 32 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 23 [2021-11-25 18:36:48,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:36:48,883 INFO L225 Difference]: With dead ends: 962 [2021-11-25 18:36:48,883 INFO L226 Difference]: Without dead ends: 947 [2021-11-25 18:36:48,883 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 695 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=389, Invalid=2581, Unknown=0, NotChecked=0, Total=2970 [2021-11-25 18:36:48,884 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 151 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 1324 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 1359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-25 18:36:48,884 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 25 Invalid, 1359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1324 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-25 18:36:48,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2021-11-25 18:36:48,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 744. [2021-11-25 18:36:48,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 744 states, 743 states have (on average 2.9919246298788695) internal successors, (2223), 743 states have internal predecessors, (2223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:36:48,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 2223 transitions. [2021-11-25 18:36:48,897 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 2223 transitions. Word has length 23 [2021-11-25 18:36:48,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:36:48,897 INFO L470 AbstractCegarLoop]: Abstraction has 744 states and 2223 transitions. [2021-11-25 18:36:48,897 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.625) internal successors, (52), 32 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:36:48,897 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 2223 transitions. [2021-11-25 18:36:48,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:36:48,898 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:36:48,898 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:36:48,919 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Forceful destruction successful, exit code 0 [2021-11-25 18:36:49,105 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80,79 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:36:49,105 INFO L402 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:36:49,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:36:49,105 INFO L85 PathProgramCache]: Analyzing trace with hash -2018220319, now seen corresponding path program 77 times [2021-11-25 18:36:49,106 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:36:49,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671733752] [2021-11-25 18:36:49,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:36:49,106 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:36:49,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:36:49,784 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:36:49,784 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:36:49,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671733752] [2021-11-25 18:36:49,784 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671733752] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:36:49,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776997861] [2021-11-25 18:36:49,785 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:36:49,785 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:36:49,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:36:49,786 INFO L229 MonitoredProcess]: Starting monitored process 80 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:36:49,801 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Waiting until timeout for monitored process [2021-11-25 18:36:50,045 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-11-25 18:36:50,045 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:36:50,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 111 conjunts are in the unsatisfiable core [2021-11-25 18:36:50,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:36:50,484 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:36:50,485 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 15 treesize of output 16 [2021-11-25 18:36:50,577 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:36:50,577 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:36:50,865 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:36:51,074 INFO L354 Elim1Store]: treesize reduction 109, result has 57.4 percent of original size [2021-11-25 18:36:51,074 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 124 treesize of output 169 [2021-11-25 18:36:53,426 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:36:53,426 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776997861] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:36:53,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [873861602] [2021-11-25 18:36:53,426 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:36:53,429 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:36:53,429 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 41 [2021-11-25 18:36:53,429 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498817342] [2021-11-25 18:36:53,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:36:53,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2021-11-25 18:36:53,430 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:36:53,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-11-25 18:36:53,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=1579, Unknown=0, NotChecked=0, Total=1806 [2021-11-25 18:36:53,430 INFO L87 Difference]: Start difference. First operand 744 states and 2223 transitions. Second operand has 43 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 42 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:36:55,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:36:55,915 INFO L93 Difference]: Finished difference Result 863 states and 2525 transitions. [2021-11-25 18:36:55,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-11-25 18:36:55,915 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 42 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-25 18:36:55,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:36:55,930 INFO L225 Difference]: With dead ends: 863 [2021-11-25 18:36:55,930 INFO L226 Difference]: Without dead ends: 853 [2021-11-25 18:36:55,931 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1438 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=774, Invalid=4482, Unknown=0, NotChecked=0, Total=5256 [2021-11-25 18:36:55,931 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 208 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 1115 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 1603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 403 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-25 18:36:55,931 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 73 Invalid, 1603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1115 Invalid, 0 Unknown, 403 Unchecked, 0.7s Time] [2021-11-25 18:36:55,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2021-11-25 18:36:55,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 742. [2021-11-25 18:36:55,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 741 states have (on average 2.99055330634278) internal successors, (2216), 741 states have internal predecessors, (2216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:36:55,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 2216 transitions. [2021-11-25 18:36:55,951 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 2216 transitions. Word has length 23 [2021-11-25 18:36:55,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:36:55,951 INFO L470 AbstractCegarLoop]: Abstraction has 742 states and 2216 transitions. [2021-11-25 18:36:55,951 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 42 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:36:55,951 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 2216 transitions. [2021-11-25 18:36:55,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:36:55,953 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:36:55,954 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:36:55,958 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Forceful destruction successful, exit code 0 [2021-11-25 18:36:56,158 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81,80 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:36:56,159 INFO L402 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:36:56,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:36:56,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1226357553, now seen corresponding path program 78 times [2021-11-25 18:36:56,159 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:36:56,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163474178] [2021-11-25 18:36:56,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:36:56,159 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:36:56,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:36:56,627 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:36:56,628 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:36:56,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163474178] [2021-11-25 18:36:56,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163474178] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:36:56,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148388109] [2021-11-25 18:36:56,628 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 18:36:56,628 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:36:56,628 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:36:56,629 INFO L229 MonitoredProcess]: Starting monitored process 81 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:36:56,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Waiting until timeout for monitored process [2021-11-25 18:36:56,822 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 18:36:56,822 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:36:56,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 111 conjunts are in the unsatisfiable core [2021-11-25 18:36:56,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:36:57,185 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:36:57,185 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 15 treesize of output 16 [2021-11-25 18:36:57,260 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:36:57,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:36:57,360 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:36:57,777 INFO L354 Elim1Store]: treesize reduction 109, result has 57.4 percent of original size [2021-11-25 18:36:57,777 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 124 treesize of output 169 [2021-11-25 18:37:00,644 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:37:00,645 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148388109] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:37:00,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [619252236] [2021-11-25 18:37:00,645 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:37:00,645 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:37:00,645 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 37 [2021-11-25 18:37:00,645 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230011146] [2021-11-25 18:37:00,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:37:00,646 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-11-25 18:37:00,646 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:37:00,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-11-25 18:37:00,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1299, Unknown=0, NotChecked=0, Total=1482 [2021-11-25 18:37:00,647 INFO L87 Difference]: Start difference. First operand 742 states and 2216 transitions. Second operand has 39 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 38 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 18:37:02,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:37:02,754 INFO L93 Difference]: Finished difference Result 838 states and 2423 transitions. [2021-11-25 18:37:02,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-11-25 18:37:02,754 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 38 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 23 [2021-11-25 18:37:02,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:37:02,757 INFO L225 Difference]: With dead ends: 838 [2021-11-25 18:37:02,757 INFO L226 Difference]: Without dead ends: 828 [2021-11-25 18:37:02,758 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 972 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=561, Invalid=3221, Unknown=0, NotChecked=0, Total=3782 [2021-11-25 18:37:02,758 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 145 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 1191 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 1676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 416 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-25 18:37:02,758 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 65 Invalid, 1676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1191 Invalid, 0 Unknown, 416 Unchecked, 0.7s Time] [2021-11-25 18:37:02,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2021-11-25 18:37:02,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 740. [2021-11-25 18:37:02,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 739 states have (on average 2.989174560216509) internal successors, (2209), 739 states have internal predecessors, (2209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:37:02,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 2209 transitions. [2021-11-25 18:37:02,777 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 2209 transitions. Word has length 23 [2021-11-25 18:37:02,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:37:02,777 INFO L470 AbstractCegarLoop]: Abstraction has 740 states and 2209 transitions. [2021-11-25 18:37:02,777 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 38 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 18:37:02,778 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 2209 transitions. [2021-11-25 18:37:02,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:37:02,780 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:37:02,780 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:37:02,815 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Forceful destruction successful, exit code 0 [2021-11-25 18:37:02,997 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82,81 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:37:02,998 INFO L402 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:37:02,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:37:02,998 INFO L85 PathProgramCache]: Analyzing trace with hash 169962857, now seen corresponding path program 79 times [2021-11-25 18:37:02,998 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:37:02,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710009336] [2021-11-25 18:37:02,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:37:02,998 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:37:03,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:37:03,426 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:37:03,426 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:37:03,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710009336] [2021-11-25 18:37:03,427 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710009336] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:37:03,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377916747] [2021-11-25 18:37:03,427 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 18:37:03,427 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:37:03,427 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:37:03,428 INFO L229 MonitoredProcess]: Starting monitored process 82 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:37:03,428 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Waiting until timeout for monitored process [2021-11-25 18:37:03,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:37:03,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 103 conjunts are in the unsatisfiable core [2021-11-25 18:37:03,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:37:03,963 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:37:03,963 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:37:04,242 INFO L354 Elim1Store]: treesize reduction 140, result has 46.4 percent of original size [2021-11-25 18:37:04,243 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 62 treesize of output 131 [2021-11-25 18:37:04,527 INFO L354 Elim1Store]: treesize reduction 248, result has 5.0 percent of original size [2021-11-25 18:37:04,527 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 63 treesize of output 24 [2021-11-25 18:37:04,615 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 18:37:04,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [377916747] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:37:04,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [168983798] [2021-11-25 18:37:04,615 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:37:04,616 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:37:04,616 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 8] total 32 [2021-11-25 18:37:04,616 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704739088] [2021-11-25 18:37:04,616 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:37:04,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-11-25 18:37:04,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:37:04,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-11-25 18:37:04,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=992, Unknown=0, NotChecked=0, Total=1122 [2021-11-25 18:37:04,617 INFO L87 Difference]: Start difference. First operand 740 states and 2209 transitions. Second operand has 34 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 33 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:37:05,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:37:05,598 INFO L93 Difference]: Finished difference Result 864 states and 2514 transitions. [2021-11-25 18:37:05,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-11-25 18:37:05,599 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 33 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-25 18:37:05,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:37:05,600 INFO L225 Difference]: With dead ends: 864 [2021-11-25 18:37:05,600 INFO L226 Difference]: Without dead ends: 854 [2021-11-25 18:37:05,600 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=277, Invalid=2075, Unknown=0, NotChecked=0, Total=2352 [2021-11-25 18:37:05,601 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 162 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 957 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-25 18:37:05,601 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 34 Invalid, 993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 957 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-25 18:37:05,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2021-11-25 18:37:05,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 740. [2021-11-25 18:37:05,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 739 states have (on average 2.989174560216509) internal successors, (2209), 739 states have internal predecessors, (2209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:37:05,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 2209 transitions. [2021-11-25 18:37:05,614 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 2209 transitions. Word has length 23 [2021-11-25 18:37:05,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:37:05,614 INFO L470 AbstractCegarLoop]: Abstraction has 740 states and 2209 transitions. [2021-11-25 18:37:05,614 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 33 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:37:05,614 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 2209 transitions. [2021-11-25 18:37:05,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:37:05,615 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:37:05,616 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:37:05,650 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Ended with exit code 0 [2021-11-25 18:37:05,832 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83,82 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:37:05,832 INFO L402 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:37:05,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:37:05,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1083017901, now seen corresponding path program 80 times [2021-11-25 18:37:05,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:37:05,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6693152] [2021-11-25 18:37:05,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:37:05,833 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:37:05,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:37:06,336 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:37:06,336 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:37:06,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6693152] [2021-11-25 18:37:06,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6693152] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:37:06,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640203228] [2021-11-25 18:37:06,337 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:37:06,337 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:37:06,337 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:37:06,338 INFO L229 MonitoredProcess]: Starting monitored process 83 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:37:06,338 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Waiting until timeout for monitored process [2021-11-25 18:37:06,546 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-11-25 18:37:06,546 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:37:06,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 110 conjunts are in the unsatisfiable core [2021-11-25 18:37:06,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:37:06,962 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:37:06,962 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 17 treesize of output 18 [2021-11-25 18:37:07,057 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:37:07,057 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:37:07,186 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:37:07,623 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:37:08,136 INFO L354 Elim1Store]: treesize reduction 123, result has 43.1 percent of original size [2021-11-25 18:37:08,136 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 108 treesize of output 115 [2021-11-25 18:37:08,404 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:37:08,405 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640203228] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:37:08,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [785997087] [2021-11-25 18:37:08,405 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:37:08,405 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:37:08,405 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 11] total 38 [2021-11-25 18:37:08,405 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533824469] [2021-11-25 18:37:08,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:37:08,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-11-25 18:37:08,406 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:37:08,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-11-25 18:37:08,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1403, Unknown=0, NotChecked=0, Total=1560 [2021-11-25 18:37:08,406 INFO L87 Difference]: Start difference. First operand 740 states and 2209 transitions. Second operand has 40 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 39 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:37:09,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:37:09,464 INFO L93 Difference]: Finished difference Result 788 states and 2305 transitions. [2021-11-25 18:37:09,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-11-25 18:37:09,465 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 39 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 23 [2021-11-25 18:37:09,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:37:09,466 INFO L225 Difference]: With dead ends: 788 [2021-11-25 18:37:09,466 INFO L226 Difference]: Without dead ends: 783 [2021-11-25 18:37:09,466 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 761 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=360, Invalid=2946, Unknown=0, NotChecked=0, Total=3306 [2021-11-25 18:37:09,467 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 67 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 320 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-25 18:37:09,467 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 53 Invalid, 883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 528 Invalid, 0 Unknown, 320 Unchecked, 0.3s Time] [2021-11-25 18:37:09,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2021-11-25 18:37:09,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 748. [2021-11-25 18:37:09,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 747 states have (on average 2.9879518072289155) internal successors, (2232), 747 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:37:09,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 2232 transitions. [2021-11-25 18:37:09,480 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 2232 transitions. Word has length 23 [2021-11-25 18:37:09,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:37:09,480 INFO L470 AbstractCegarLoop]: Abstraction has 748 states and 2232 transitions. [2021-11-25 18:37:09,481 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 39 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:37:09,481 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 2232 transitions. [2021-11-25 18:37:09,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:37:09,482 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:37:09,483 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:37:09,504 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Forceful destruction successful, exit code 0 [2021-11-25 18:37:09,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84,83 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:37:09,683 INFO L402 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:37:09,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:37:09,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1223220807, now seen corresponding path program 81 times [2021-11-25 18:37:09,684 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:37:09,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67550269] [2021-11-25 18:37:09,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:37:09,684 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:37:09,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:37:10,281 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:37:10,281 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:37:10,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67550269] [2021-11-25 18:37:10,281 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67550269] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:37:10,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910405771] [2021-11-25 18:37:10,281 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 18:37:10,282 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:37:10,282 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:37:10,283 INFO L229 MonitoredProcess]: Starting monitored process 84 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:37:10,304 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Waiting until timeout for monitored process [2021-11-25 18:37:10,485 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 18:37:10,485 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:37:10,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 122 conjunts are in the unsatisfiable core [2021-11-25 18:37:10,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:37:10,602 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-25 18:37:10,652 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 18:37:10,697 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 18:37:11,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:37:11,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:37:11,042 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:37:11,043 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 30 treesize of output 41 [2021-11-25 18:37:11,131 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:37:11,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:37:11,315 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:37:11,932 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork0_~i~0#1_637| Int)) (or (<= c_~N~0 (+ |v_thread1Thread1of1ForFork0_~i~0#1_637| 1)) (< (+ |v_thread1Thread1of1ForFork0_~i~0#1_637| 2) c_~N~0) (and (forall ((v_ArrVal_3096 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3096) c_~A~0.base))) (< (+ (select .cse0 (+ c_~A~0.offset 8)) (select .cse0 (+ c_~A~0.offset 4))) (let ((.cse1 (* |v_thread1Thread1of1ForFork0_~i~0#1_637| 4))) (+ c_~counter~0 (select .cse0 (+ .cse1 c_~A~0.offset)) (select .cse0 (+ .cse1 c_~A~0.offset 4)) 1))))) (forall ((v_ArrVal_3096 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3096) c_~A~0.base))) (<= (let ((.cse3 (* |v_thread1Thread1of1ForFork0_~i~0#1_637| 4))) (+ c_~counter~0 (select .cse2 (+ .cse3 c_~A~0.offset)) (select .cse2 (+ .cse3 c_~A~0.offset 4)))) (+ (select .cse2 (+ c_~A~0.offset 8)) (select .cse2 (+ c_~A~0.offset 4))))))))) is different from false [2021-11-25 18:37:12,110 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:37:12,111 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 220 treesize of output 137 [2021-11-25 18:37:12,185 INFO L354 Elim1Store]: treesize reduction 62, result has 58.4 percent of original size [2021-11-25 18:37:12,186 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 494 treesize of output 485 [2021-11-25 18:37:12,234 INFO L354 Elim1Store]: treesize reduction 47, result has 46.6 percent of original size [2021-11-25 18:37:12,235 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 394 treesize of output 393 [2021-11-25 18:37:12,307 INFO L354 Elim1Store]: treesize reduction 47, result has 46.6 percent of original size [2021-11-25 18:37:12,308 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 352 treesize of output 309 [2021-11-25 18:37:12,363 INFO L354 Elim1Store]: treesize reduction 47, result has 46.6 percent of original size [2021-11-25 18:37:12,363 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 268 treesize of output 267 [2021-11-25 18:37:12,418 INFO L354 Elim1Store]: treesize reduction 47, result has 46.6 percent of original size [2021-11-25 18:37:12,419 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 226 treesize of output 246 [2021-11-25 18:37:14,483 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:37:14,483 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910405771] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:37:14,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [531318927] [2021-11-25 18:37:14,483 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:37:14,484 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:37:14,484 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 43 [2021-11-25 18:37:14,484 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32522676] [2021-11-25 18:37:14,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:37:14,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2021-11-25 18:37:14,485 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:37:14,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-11-25 18:37:14,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1716, Unknown=1, NotChecked=84, Total=1980 [2021-11-25 18:37:14,486 INFO L87 Difference]: Start difference. First operand 748 states and 2232 transitions. Second operand has 45 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 44 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 18:37:16,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:37:16,842 INFO L93 Difference]: Finished difference Result 906 states and 2571 transitions. [2021-11-25 18:37:16,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-11-25 18:37:16,843 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 44 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 18:37:16,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:37:16,844 INFO L225 Difference]: With dead ends: 906 [2021-11-25 18:37:16,844 INFO L226 Difference]: Without dead ends: 897 [2021-11-25 18:37:16,844 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1187 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=534, Invalid=4025, Unknown=1, NotChecked=132, Total=4692 [2021-11-25 18:37:16,845 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 202 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 1149 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 1780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 551 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-25 18:37:16,845 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [202 Valid, 97 Invalid, 1780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1149 Invalid, 0 Unknown, 551 Unchecked, 0.7s Time] [2021-11-25 18:37:16,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2021-11-25 18:37:16,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 744. [2021-11-25 18:37:16,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 744 states, 743 states have (on average 2.9892328398384924) internal successors, (2221), 743 states have internal predecessors, (2221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:37:16,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 2221 transitions. [2021-11-25 18:37:16,858 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 2221 transitions. Word has length 23 [2021-11-25 18:37:16,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:37:16,858 INFO L470 AbstractCegarLoop]: Abstraction has 744 states and 2221 transitions. [2021-11-25 18:37:16,858 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 44 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 18:37:16,859 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 2221 transitions. [2021-11-25 18:37:16,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:37:16,860 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:37:16,860 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:37:16,881 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Ended with exit code 0 [2021-11-25 18:37:17,060 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85,84 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:37:17,061 INFO L402 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:37:17,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:37:17,061 INFO L85 PathProgramCache]: Analyzing trace with hash 595052067, now seen corresponding path program 82 times [2021-11-25 18:37:17,061 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:37:17,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702919166] [2021-11-25 18:37:17,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:37:17,061 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:37:17,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:37:17,611 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:37:17,611 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:37:17,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702919166] [2021-11-25 18:37:17,612 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702919166] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:37:17,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058660848] [2021-11-25 18:37:17,612 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 18:37:17,612 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:37:17,612 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:37:17,614 INFO L229 MonitoredProcess]: Starting monitored process 85 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:37:17,615 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Waiting until timeout for monitored process [2021-11-25 18:37:17,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:37:17,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 97 conjunts are in the unsatisfiable core [2021-11-25 18:37:17,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:37:18,134 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 18:37:18,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:37:18,449 INFO L354 Elim1Store]: treesize reduction 114, result has 46.0 percent of original size [2021-11-25 18:37:18,449 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 52 treesize of output 107 [2021-11-25 18:37:18,766 INFO L354 Elim1Store]: treesize reduction 198, result has 6.2 percent of original size [2021-11-25 18:37:18,766 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 53 treesize of output 24 [2021-11-25 18:37:18,821 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 18:37:18,821 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058660848] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:37:18,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1343751399] [2021-11-25 18:37:18,822 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:37:18,822 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:37:18,822 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 8] total 31 [2021-11-25 18:37:18,822 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750560947] [2021-11-25 18:37:18,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:37:18,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-11-25 18:37:18,823 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:37:18,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-11-25 18:37:18,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=944, Unknown=0, NotChecked=0, Total=1056 [2021-11-25 18:37:18,824 INFO L87 Difference]: Start difference. First operand 744 states and 2221 transitions. Second operand has 33 states, 32 states have (on average 1.65625) internal successors, (53), 32 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:37:19,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:37:19,923 INFO L93 Difference]: Finished difference Result 845 states and 2472 transitions. [2021-11-25 18:37:19,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-25 18:37:19,923 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.65625) internal successors, (53), 32 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-25 18:37:19,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:37:19,925 INFO L225 Difference]: With dead ends: 845 [2021-11-25 18:37:19,925 INFO L226 Difference]: Without dead ends: 835 [2021-11-25 18:37:19,925 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=248, Invalid=1914, Unknown=0, NotChecked=0, Total=2162 [2021-11-25 18:37:19,925 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 105 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 934 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-25 18:37:19,925 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 31 Invalid, 968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 934 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-25 18:37:19,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2021-11-25 18:37:19,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 746. [2021-11-25 18:37:19,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 746 states, 745 states have (on average 2.9879194630872483) internal successors, (2226), 745 states have internal predecessors, (2226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:37:19,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 2226 transitions. [2021-11-25 18:37:19,938 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 2226 transitions. Word has length 23 [2021-11-25 18:37:19,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:37:19,938 INFO L470 AbstractCegarLoop]: Abstraction has 746 states and 2226 transitions. [2021-11-25 18:37:19,938 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.65625) internal successors, (53), 32 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:37:19,938 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 2226 transitions. [2021-11-25 18:37:19,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:37:19,939 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:37:19,940 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:37:19,962 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Forceful destruction successful, exit code 0 [2021-11-25 18:37:20,140 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 85 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable86 [2021-11-25 18:37:20,141 INFO L402 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:37:20,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:37:20,141 INFO L85 PathProgramCache]: Analyzing trace with hash -113425427, now seen corresponding path program 83 times [2021-11-25 18:37:20,141 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:37:20,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228761023] [2021-11-25 18:37:20,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:37:20,141 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:37:20,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:37:20,635 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:37:20,635 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:37:20,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228761023] [2021-11-25 18:37:20,636 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228761023] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:37:20,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210032873] [2021-11-25 18:37:20,636 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:37:20,636 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:37:20,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:37:20,637 INFO L229 MonitoredProcess]: Starting monitored process 86 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:37:20,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Waiting until timeout for monitored process [2021-11-25 18:37:20,882 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-11-25 18:37:20,882 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:37:20,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 123 conjunts are in the unsatisfiable core [2021-11-25 18:37:20,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:37:21,002 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-25 18:37:21,042 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 18:37:21,089 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 18:37:21,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:37:21,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:37:21,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:37:21,486 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:37:21,486 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 32 treesize of output 43 [2021-11-25 18:37:21,592 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:37:21,592 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:37:22,027 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:37:22,217 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:37:23,483 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread2Thread1of1ForFork1_~i~1#1_631| Int) (|v_thread1Thread1of1ForFork0_~i~0#1_654| Int)) (or (<= c_~N~0 (+ |v_thread1Thread1of1ForFork0_~i~0#1_654| 1)) (< (+ |v_thread1Thread1of1ForFork0_~i~0#1_654| 2) c_~N~0) (<= c_~N~0 |v_thread2Thread1of1ForFork1_~i~1#1_631|) (< (+ |v_thread2Thread1of1ForFork1_~i~1#1_631| 1) c_~N~0) (and (forall ((v_ArrVal_3176 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3176) c_~A~0.base))) (< (+ (select .cse0 (+ (* |v_thread2Thread1of1ForFork1_~i~1#1_631| 4) c_~A~0.offset)) (select .cse0 (+ c_~A~0.offset 4))) (let ((.cse1 (* |v_thread1Thread1of1ForFork0_~i~0#1_654| 4))) (+ c_~counter~0 (select .cse0 (+ .cse1 c_~A~0.offset)) (select .cse0 (+ .cse1 c_~A~0.offset 4)) 1))))) (forall ((v_ArrVal_3176 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3176) c_~A~0.base))) (<= (let ((.cse3 (* |v_thread1Thread1of1ForFork0_~i~0#1_654| 4))) (+ c_~counter~0 (select .cse2 (+ .cse3 c_~A~0.offset)) (select .cse2 (+ .cse3 c_~A~0.offset 4)))) (+ (select .cse2 (+ (* |v_thread2Thread1of1ForFork1_~i~1#1_631| 4) c_~A~0.offset)) (select .cse2 (+ c_~A~0.offset 4))))))))) is different from false [2021-11-25 18:37:24,009 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:37:24,009 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 224 treesize of output 141 [2021-11-25 18:37:24,075 INFO L354 Elim1Store]: treesize reduction 98, result has 37.6 percent of original size [2021-11-25 18:37:24,076 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 690 treesize of output 616 [2021-11-25 18:37:24,116 INFO L354 Elim1Store]: treesize reduction 69, result has 26.6 percent of original size [2021-11-25 18:37:24,116 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 541 treesize of output 520 [2021-11-25 18:37:24,155 INFO L354 Elim1Store]: treesize reduction 69, result has 26.6 percent of original size [2021-11-25 18:37:24,156 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 489 treesize of output 422 [2021-11-25 18:37:24,197 INFO L354 Elim1Store]: treesize reduction 69, result has 26.6 percent of original size [2021-11-25 18:37:24,197 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 385 treesize of output 364 [2021-11-25 18:37:24,239 INFO L354 Elim1Store]: treesize reduction 69, result has 26.6 percent of original size [2021-11-25 18:37:24,240 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 333 treesize of output 266 [2021-11-25 18:37:25,069 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:37:25,069 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210032873] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:37:25,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [184771752] [2021-11-25 18:37:25,073 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:37:25,074 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:37:25,075 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 16] total 44 [2021-11-25 18:37:25,075 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179440845] [2021-11-25 18:37:25,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:37:25,075 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2021-11-25 18:37:25,076 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:37:25,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-11-25 18:37:25,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1764, Unknown=1, NotChecked=86, Total=2070 [2021-11-25 18:37:25,076 INFO L87 Difference]: Start difference. First operand 746 states and 2226 transitions. Second operand has 46 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 45 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:37:27,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:37:27,394 INFO L93 Difference]: Finished difference Result 884 states and 2521 transitions. [2021-11-25 18:37:27,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-11-25 18:37:27,394 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 45 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-25 18:37:27,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:37:27,395 INFO L225 Difference]: With dead ends: 884 [2021-11-25 18:37:27,395 INFO L226 Difference]: Without dead ends: 878 [2021-11-25 18:37:27,396 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 18 SyntacticMatches, 7 SemanticMatches, 68 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1286 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=605, Invalid=4090, Unknown=1, NotChecked=134, Total=4830 [2021-11-25 18:37:27,396 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 151 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 844 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 1790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 875 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-25 18:37:27,396 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 76 Invalid, 1790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 844 Invalid, 0 Unknown, 875 Unchecked, 0.5s Time] [2021-11-25 18:37:27,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2021-11-25 18:37:27,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 750. [2021-11-25 18:37:27,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 750 states, 749 states have (on average 2.9853137516688917) internal successors, (2236), 749 states have internal predecessors, (2236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:37:27,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 2236 transitions. [2021-11-25 18:37:27,408 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 2236 transitions. Word has length 23 [2021-11-25 18:37:27,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:37:27,409 INFO L470 AbstractCegarLoop]: Abstraction has 750 states and 2236 transitions. [2021-11-25 18:37:27,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 45 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:37:27,409 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 2236 transitions. [2021-11-25 18:37:27,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:37:27,411 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:37:27,411 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:37:27,443 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Ended with exit code 0 [2021-11-25 18:37:27,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 86 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable87 [2021-11-25 18:37:27,637 INFO L402 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:37:27,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:37:27,637 INFO L85 PathProgramCache]: Analyzing trace with hash -205595557, now seen corresponding path program 84 times [2021-11-25 18:37:27,638 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:37:27,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895865868] [2021-11-25 18:37:27,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:37:27,638 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:37:27,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:37:28,010 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:37:28,010 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:37:28,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895865868] [2021-11-25 18:37:28,011 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895865868] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:37:28,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133807966] [2021-11-25 18:37:28,011 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 18:37:28,011 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:37:28,011 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:37:28,012 INFO L229 MonitoredProcess]: Starting monitored process 87 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:37:28,012 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Waiting until timeout for monitored process [2021-11-25 18:37:28,202 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 18:37:28,202 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:37:28,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 103 conjunts are in the unsatisfiable core [2021-11-25 18:37:28,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:37:28,532 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:37:28,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:37:28,812 INFO L354 Elim1Store]: treesize reduction 114, result has 46.0 percent of original size [2021-11-25 18:37:28,812 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 52 treesize of output 107 [2021-11-25 18:37:29,050 INFO L354 Elim1Store]: treesize reduction 198, result has 6.2 percent of original size [2021-11-25 18:37:29,051 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 53 treesize of output 24 [2021-11-25 18:37:29,116 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 18:37:29,116 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133807966] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:37:29,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [340816562] [2021-11-25 18:37:29,117 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:37:29,117 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:37:29,117 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 8] total 26 [2021-11-25 18:37:29,117 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605872597] [2021-11-25 18:37:29,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:37:29,117 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-11-25 18:37:29,118 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:37:29,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-11-25 18:37:29,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=656, Unknown=0, NotChecked=0, Total=756 [2021-11-25 18:37:29,118 INFO L87 Difference]: Start difference. First operand 750 states and 2236 transitions. Second operand has 28 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:37:29,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:37:29,844 INFO L93 Difference]: Finished difference Result 935 states and 2694 transitions. [2021-11-25 18:37:29,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-25 18:37:29,845 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-25 18:37:29,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:37:29,846 INFO L225 Difference]: With dead ends: 935 [2021-11-25 18:37:29,846 INFO L226 Difference]: Without dead ends: 920 [2021-11-25 18:37:29,847 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 26 SyntacticMatches, 6 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=183, Invalid=1149, Unknown=0, NotChecked=0, Total=1332 [2021-11-25 18:37:29,847 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 80 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-25 18:37:29,847 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 26 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 869 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-25 18:37:29,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2021-11-25 18:37:29,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 782. [2021-11-25 18:37:29,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 782 states, 781 states have (on average 3.0076824583866837) internal successors, (2349), 781 states have internal predecessors, (2349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:37:29,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 2349 transitions. [2021-11-25 18:37:29,862 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 2349 transitions. Word has length 23 [2021-11-25 18:37:29,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:37:29,863 INFO L470 AbstractCegarLoop]: Abstraction has 782 states and 2349 transitions. [2021-11-25 18:37:29,863 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:37:29,863 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 2349 transitions. [2021-11-25 18:37:29,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:37:29,864 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:37:29,864 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:37:29,889 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Forceful destruction successful, exit code 0 [2021-11-25 18:37:30,064 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88,87 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:37:30,065 INFO L402 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:37:30,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:37:30,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1521752861, now seen corresponding path program 85 times [2021-11-25 18:37:30,065 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:37:30,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969221741] [2021-11-25 18:37:30,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:37:30,065 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:37:30,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:37:30,581 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:37:30,581 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:37:30,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969221741] [2021-11-25 18:37:30,582 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969221741] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:37:30,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685697909] [2021-11-25 18:37:30,582 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 18:37:30,582 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:37:30,582 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:37:30,583 INFO L229 MonitoredProcess]: Starting monitored process 88 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:37:30,583 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Waiting until timeout for monitored process [2021-11-25 18:37:30,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:37:30,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 97 conjunts are in the unsatisfiable core [2021-11-25 18:37:30,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:37:31,091 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 18:37:31,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:37:31,399 INFO L354 Elim1Store]: treesize reduction 114, result has 46.0 percent of original size [2021-11-25 18:37:31,399 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 52 treesize of output 107 [2021-11-25 18:37:31,583 INFO L354 Elim1Store]: treesize reduction 198, result has 6.2 percent of original size [2021-11-25 18:37:31,584 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 53 treesize of output 24 [2021-11-25 18:37:31,637 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 18:37:31,637 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685697909] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:37:31,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [656699820] [2021-11-25 18:37:31,638 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:37:31,638 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:37:31,638 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 8] total 31 [2021-11-25 18:37:31,638 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593735789] [2021-11-25 18:37:31,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:37:31,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-11-25 18:37:31,639 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:37:31,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-11-25 18:37:31,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=940, Unknown=0, NotChecked=0, Total=1056 [2021-11-25 18:37:31,639 INFO L87 Difference]: Start difference. First operand 782 states and 2349 transitions. Second operand has 33 states, 32 states have (on average 1.625) internal successors, (52), 32 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:37:33,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:37:33,393 INFO L93 Difference]: Finished difference Result 1007 states and 2881 transitions. [2021-11-25 18:37:33,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-11-25 18:37:33,393 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.625) internal successors, (52), 32 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 23 [2021-11-25 18:37:33,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:37:33,394 INFO L225 Difference]: With dead ends: 1007 [2021-11-25 18:37:33,395 INFO L226 Difference]: Without dead ends: 987 [2021-11-25 18:37:33,395 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 714 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=328, Invalid=2534, Unknown=0, NotChecked=0, Total=2862 [2021-11-25 18:37:33,395 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 171 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 1591 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 1646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-25 18:37:33,397 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 33 Invalid, 1646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1591 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-25 18:37:33,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2021-11-25 18:37:33,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 794. [2021-11-25 18:37:33,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 793 states have (on average 3.0226986128625475) internal successors, (2397), 793 states have internal predecessors, (2397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:37:33,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 2397 transitions. [2021-11-25 18:37:33,413 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 2397 transitions. Word has length 23 [2021-11-25 18:37:33,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:37:33,413 INFO L470 AbstractCegarLoop]: Abstraction has 794 states and 2397 transitions. [2021-11-25 18:37:33,413 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.625) internal successors, (52), 32 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:37:33,414 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 2397 transitions. [2021-11-25 18:37:33,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:37:33,415 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:37:33,415 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:37:33,436 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Forceful destruction successful, exit code 0 [2021-11-25 18:37:33,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89,88 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:37:33,616 INFO L402 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:37:33,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:37:33,616 INFO L85 PathProgramCache]: Analyzing trace with hash -290746213, now seen corresponding path program 86 times [2021-11-25 18:37:33,616 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:37:33,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195797459] [2021-11-25 18:37:33,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:37:33,616 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:37:33,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:37:34,023 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:37:34,023 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:37:34,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195797459] [2021-11-25 18:37:34,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195797459] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:37:34,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215729522] [2021-11-25 18:37:34,024 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:37:34,024 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:37:34,024 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:37:34,024 INFO L229 MonitoredProcess]: Starting monitored process 89 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:37:34,025 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Waiting until timeout for monitored process [2021-11-25 18:37:34,238 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-11-25 18:37:34,238 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:37:34,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 121 conjunts are in the unsatisfiable core [2021-11-25 18:37:34,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:37:34,327 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 15 treesize of output 11 [2021-11-25 18:37:34,370 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 18:37:34,400 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 18:37:34,722 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:37:34,722 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 17 treesize of output 18 [2021-11-25 18:37:34,834 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:37:34,835 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:37:34,994 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:37:35,389 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:37:36,444 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:37:36,444 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215729522] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:37:36,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1773308821] [2021-11-25 18:37:36,444 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:37:36,444 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:37:36,444 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 11] total 38 [2021-11-25 18:37:36,445 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341444435] [2021-11-25 18:37:36,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:37:36,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-11-25 18:37:36,445 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:37:36,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-11-25 18:37:36,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1392, Unknown=0, NotChecked=0, Total=1560 [2021-11-25 18:37:36,446 INFO L87 Difference]: Start difference. First operand 794 states and 2397 transitions. Second operand has 40 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 39 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:37:37,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:37:37,670 INFO L93 Difference]: Finished difference Result 821 states and 2441 transitions. [2021-11-25 18:37:37,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-11-25 18:37:37,671 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 39 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 23 [2021-11-25 18:37:37,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:37:37,672 INFO L225 Difference]: With dead ends: 821 [2021-11-25 18:37:37,672 INFO L226 Difference]: Without dead ends: 816 [2021-11-25 18:37:37,672 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 916 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=403, Invalid=3257, Unknown=0, NotChecked=0, Total=3660 [2021-11-25 18:37:37,673 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 71 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 483 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-25 18:37:37,673 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 45 Invalid, 953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 433 Invalid, 0 Unknown, 483 Unchecked, 0.3s Time] [2021-11-25 18:37:37,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2021-11-25 18:37:37,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 795. [2021-11-25 18:37:37,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 795 states, 794 states have (on average 3.0214105793450883) internal successors, (2399), 794 states have internal predecessors, (2399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:37:37,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 2399 transitions. [2021-11-25 18:37:37,686 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 2399 transitions. Word has length 23 [2021-11-25 18:37:37,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:37:37,686 INFO L470 AbstractCegarLoop]: Abstraction has 795 states and 2399 transitions. [2021-11-25 18:37:37,686 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 39 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:37:37,686 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 2399 transitions. [2021-11-25 18:37:37,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:37:37,688 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:37:37,688 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:37:37,709 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Ended with exit code 0 [2021-11-25 18:37:37,888 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90,89 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:37:37,888 INFO L402 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:37:37,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:37:37,889 INFO L85 PathProgramCache]: Analyzing trace with hash -150543307, now seen corresponding path program 87 times [2021-11-25 18:37:37,889 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:37:37,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342026995] [2021-11-25 18:37:37,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:37:37,889 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:37:37,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:37:38,494 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:37:38,494 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:37:38,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342026995] [2021-11-25 18:37:38,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342026995] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:37:38,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680419277] [2021-11-25 18:37:38,494 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 18:37:38,494 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:37:38,495 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:37:38,495 INFO L229 MonitoredProcess]: Starting monitored process 90 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:37:38,497 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Waiting until timeout for monitored process [2021-11-25 18:37:38,691 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 18:37:38,692 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:37:38,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 122 conjunts are in the unsatisfiable core [2021-11-25 18:37:38,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:37:38,811 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-25 18:37:38,860 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 18:37:38,905 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 18:37:39,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:37:39,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:37:39,360 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:37:39,361 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 30 treesize of output 41 [2021-11-25 18:37:39,449 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:37:39,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:37:39,831 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:37:40,281 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork0_~i~0#1_688| Int)) (or (< (+ |v_thread1Thread1of1ForFork0_~i~0#1_688| 2) c_~N~0) (<= c_~N~0 (+ |v_thread1Thread1of1ForFork0_~i~0#1_688| 1)) (and (forall ((v_ArrVal_3336 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3336) c_~A~0.base))) (<= (let ((.cse1 (* |v_thread1Thread1of1ForFork0_~i~0#1_688| 4))) (+ c_~counter~0 (select .cse0 (+ .cse1 c_~A~0.offset)) (select .cse0 (+ .cse1 c_~A~0.offset 4)))) (+ (select .cse0 (+ c_~A~0.offset 4)) (select .cse0 (+ c_~A~0.offset 8)))))) (forall ((v_ArrVal_3336 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3336) c_~A~0.base))) (< (+ (select .cse2 (+ c_~A~0.offset 4)) (select .cse2 (+ c_~A~0.offset 8))) (let ((.cse3 (* |v_thread1Thread1of1ForFork0_~i~0#1_688| 4))) (+ c_~counter~0 (select .cse2 (+ .cse3 c_~A~0.offset)) (select .cse2 (+ .cse3 c_~A~0.offset 4)) 1)))))))) is different from false [2021-11-25 18:37:40,533 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:37:40,533 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 220 treesize of output 137 [2021-11-25 18:37:40,608 INFO L354 Elim1Store]: treesize reduction 62, result has 58.4 percent of original size [2021-11-25 18:37:40,608 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 326 treesize of output 346 [2021-11-25 18:37:40,658 INFO L354 Elim1Store]: treesize reduction 47, result has 46.6 percent of original size [2021-11-25 18:37:40,658 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 255 treesize of output 254 [2021-11-25 18:37:40,709 INFO L354 Elim1Store]: treesize reduction 47, result has 46.6 percent of original size [2021-11-25 18:37:40,710 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 213 treesize of output 233 [2021-11-25 18:37:40,759 INFO L354 Elim1Store]: treesize reduction 47, result has 46.6 percent of original size [2021-11-25 18:37:40,759 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 192 treesize of output 191 [2021-11-25 18:37:40,813 INFO L354 Elim1Store]: treesize reduction 47, result has 46.6 percent of original size [2021-11-25 18:37:40,813 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 150 treesize of output 170 [2021-11-25 18:37:43,269 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:37:43,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1680419277] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:37:43,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [945105793] [2021-11-25 18:37:43,269 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:37:43,269 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:37:43,270 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 43 [2021-11-25 18:37:43,270 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422411411] [2021-11-25 18:37:43,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:37:43,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2021-11-25 18:37:43,270 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:37:43,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-11-25 18:37:43,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1707, Unknown=1, NotChecked=84, Total=1980 [2021-11-25 18:37:43,271 INFO L87 Difference]: Start difference. First operand 795 states and 2399 transitions. Second operand has 45 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 44 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 18:37:45,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:37:45,614 INFO L93 Difference]: Finished difference Result 924 states and 2668 transitions. [2021-11-25 18:37:45,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-11-25 18:37:45,614 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 44 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 18:37:45,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:37:45,616 INFO L225 Difference]: With dead ends: 924 [2021-11-25 18:37:45,616 INFO L226 Difference]: Without dead ends: 915 [2021-11-25 18:37:45,616 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 15 SyntacticMatches, 6 SemanticMatches, 71 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1424 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=570, Invalid=4545, Unknown=1, NotChecked=140, Total=5256 [2021-11-25 18:37:45,616 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 191 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 1069 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 1797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 629 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-25 18:37:45,617 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 105 Invalid, 1797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1069 Invalid, 0 Unknown, 629 Unchecked, 0.7s Time] [2021-11-25 18:37:45,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2021-11-25 18:37:45,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 800. [2021-11-25 18:37:45,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 799 states have (on average 3.021276595744681) internal successors, (2414), 799 states have internal predecessors, (2414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:37:45,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 2414 transitions. [2021-11-25 18:37:45,637 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 2414 transitions. Word has length 23 [2021-11-25 18:37:45,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:37:45,637 INFO L470 AbstractCegarLoop]: Abstraction has 800 states and 2414 transitions. [2021-11-25 18:37:45,637 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 44 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 18:37:45,638 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 2414 transitions. [2021-11-25 18:37:45,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:37:45,640 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:37:45,640 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:37:45,675 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Ended with exit code 0 [2021-11-25 18:37:45,853 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91,90 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:37:45,853 INFO L402 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:37:45,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:37:45,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1188959469, now seen corresponding path program 88 times [2021-11-25 18:37:45,853 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:37:45,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967368246] [2021-11-25 18:37:45,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:37:45,854 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:37:45,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:37:46,385 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:37:46,385 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:37:46,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967368246] [2021-11-25 18:37:46,385 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967368246] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:37:46,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023165433] [2021-11-25 18:37:46,385 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 18:37:46,385 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:37:46,386 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:37:46,386 INFO L229 MonitoredProcess]: Starting monitored process 91 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:37:46,387 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Waiting until timeout for monitored process [2021-11-25 18:37:46,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:37:46,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 103 conjunts are in the unsatisfiable core [2021-11-25 18:37:46,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:37:46,915 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:37:46,915 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:37:47,248 INFO L354 Elim1Store]: treesize reduction 114, result has 46.0 percent of original size [2021-11-25 18:37:47,249 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 52 treesize of output 107 [2021-11-25 18:37:47,477 INFO L354 Elim1Store]: treesize reduction 198, result has 6.2 percent of original size [2021-11-25 18:37:47,478 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 53 treesize of output 24 [2021-11-25 18:37:47,533 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 18:37:47,534 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1023165433] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:37:47,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [281204740] [2021-11-25 18:37:47,534 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:37:47,534 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:37:47,534 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 8] total 33 [2021-11-25 18:37:47,534 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651521729] [2021-11-25 18:37:47,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:37:47,535 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-11-25 18:37:47,535 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:37:47,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-11-25 18:37:47,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1070, Unknown=0, NotChecked=0, Total=1190 [2021-11-25 18:37:47,535 INFO L87 Difference]: Start difference. First operand 800 states and 2414 transitions. Second operand has 35 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 34 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:37:49,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:37:49,709 INFO L93 Difference]: Finished difference Result 1030 states and 2959 transitions. [2021-11-25 18:37:49,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-11-25 18:37:49,709 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 34 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-25 18:37:49,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:37:49,711 INFO L225 Difference]: With dead ends: 1030 [2021-11-25 18:37:49,711 INFO L226 Difference]: Without dead ends: 1015 [2021-11-25 18:37:49,711 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 839 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=361, Invalid=2831, Unknown=0, NotChecked=0, Total=3192 [2021-11-25 18:37:49,712 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 153 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 1816 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 1871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-25 18:37:49,712 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 38 Invalid, 1871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1816 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-11-25 18:37:49,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2021-11-25 18:37:49,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 808. [2021-11-25 18:37:49,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 807 states have (on average 3.030978934324659) internal successors, (2446), 807 states have internal predecessors, (2446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:37:49,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 2446 transitions. [2021-11-25 18:37:49,727 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 2446 transitions. Word has length 23 [2021-11-25 18:37:49,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:37:49,727 INFO L470 AbstractCegarLoop]: Abstraction has 808 states and 2446 transitions. [2021-11-25 18:37:49,727 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 34 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:37:49,727 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 2446 transitions. [2021-11-25 18:37:49,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:37:49,729 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:37:49,729 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:37:49,750 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Ended with exit code 0 [2021-11-25 18:37:49,933 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92,91 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:37:49,933 INFO L402 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:37:49,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:37:49,933 INFO L85 PathProgramCache]: Analyzing trace with hash -219367965, now seen corresponding path program 89 times [2021-11-25 18:37:49,934 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:37:49,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385678260] [2021-11-25 18:37:49,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:37:49,934 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:37:49,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:37:50,413 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:37:50,413 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:37:50,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385678260] [2021-11-25 18:37:50,413 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385678260] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:37:50,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658456741] [2021-11-25 18:37:50,413 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:37:50,413 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:37:50,413 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:37:50,414 INFO L229 MonitoredProcess]: Starting monitored process 92 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:37:50,415 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Waiting until timeout for monitored process [2021-11-25 18:37:50,616 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-11-25 18:37:50,616 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:37:50,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 110 conjunts are in the unsatisfiable core [2021-11-25 18:37:50,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:37:50,923 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:37:50,923 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 17 treesize of output 18 [2021-11-25 18:37:51,071 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:37:51,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:37:51,600 INFO L354 Elim1Store]: treesize reduction 39, result has 52.4 percent of original size [2021-11-25 18:37:51,600 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 36 treesize of output 52 [2021-11-25 18:37:51,663 INFO L354 Elim1Store]: treesize reduction 73, result has 11.0 percent of original size [2021-11-25 18:37:51,663 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 35 treesize of output 17 [2021-11-25 18:37:51,745 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:37:51,746 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658456741] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:37:51,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [816813390] [2021-11-25 18:37:51,746 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:37:51,747 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:37:51,747 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 10] total 35 [2021-11-25 18:37:51,747 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2501157] [2021-11-25 18:37:51,747 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:37:51,748 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-11-25 18:37:51,748 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:37:51,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-11-25 18:37:51,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1133, Unknown=0, NotChecked=0, Total=1332 [2021-11-25 18:37:51,748 INFO L87 Difference]: Start difference. First operand 808 states and 2446 transitions. Second operand has 37 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 36 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:37:53,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:37:53,646 INFO L93 Difference]: Finished difference Result 910 states and 2677 transitions. [2021-11-25 18:37:53,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-11-25 18:37:53,646 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 36 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 23 [2021-11-25 18:37:53,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:37:53,647 INFO L225 Difference]: With dead ends: 910 [2021-11-25 18:37:53,648 INFO L226 Difference]: Without dead ends: 900 [2021-11-25 18:37:53,648 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 21 SyntacticMatches, 6 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1196 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=626, Invalid=3534, Unknown=0, NotChecked=0, Total=4160 [2021-11-25 18:37:53,648 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 126 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 943 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 1202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 196 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-25 18:37:53,648 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 43 Invalid, 1202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 943 Invalid, 0 Unknown, 196 Unchecked, 0.5s Time] [2021-11-25 18:37:53,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2021-11-25 18:37:53,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 810. [2021-11-25 18:37:53,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 810 states, 809 states have (on average 3.029666254635352) internal successors, (2451), 809 states have internal predecessors, (2451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:37:53,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 2451 transitions. [2021-11-25 18:37:53,663 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 2451 transitions. Word has length 23 [2021-11-25 18:37:53,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:37:53,663 INFO L470 AbstractCegarLoop]: Abstraction has 810 states and 2451 transitions. [2021-11-25 18:37:53,663 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 36 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:37:53,663 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 2451 transitions. [2021-11-25 18:37:53,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:37:53,665 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:37:53,665 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:37:53,686 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Ended with exit code 0 [2021-11-25 18:37:53,865 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93,92 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:37:53,866 INFO L402 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:37:53,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:37:53,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1929428571, now seen corresponding path program 90 times [2021-11-25 18:37:53,866 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:37:53,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015141613] [2021-11-25 18:37:53,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:37:53,866 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:37:53,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:37:54,341 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:37:54,341 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:37:54,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015141613] [2021-11-25 18:37:54,341 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015141613] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:37:54,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54043956] [2021-11-25 18:37:54,341 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 18:37:54,341 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:37:54,341 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:37:54,342 INFO L229 MonitoredProcess]: Starting monitored process 93 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:37:54,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Waiting until timeout for monitored process [2021-11-25 18:37:54,540 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 18:37:54,540 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:37:54,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 103 conjunts are in the unsatisfiable core [2021-11-25 18:37:54,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:37:54,852 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:37:54,852 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:37:55,148 INFO L354 Elim1Store]: treesize reduction 114, result has 46.0 percent of original size [2021-11-25 18:37:55,148 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 52 treesize of output 107 [2021-11-25 18:37:55,422 INFO L354 Elim1Store]: treesize reduction 198, result has 6.2 percent of original size [2021-11-25 18:37:55,423 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 53 treesize of output 24 [2021-11-25 18:37:55,478 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 18:37:55,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [54043956] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:37:55,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [900260558] [2021-11-25 18:37:55,479 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:37:55,480 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:37:55,480 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 8] total 32 [2021-11-25 18:37:55,481 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570750726] [2021-11-25 18:37:55,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:37:55,481 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-11-25 18:37:55,481 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:37:55,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-11-25 18:37:55,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=986, Unknown=0, NotChecked=0, Total=1122 [2021-11-25 18:37:55,482 INFO L87 Difference]: Start difference. First operand 810 states and 2451 transitions. Second operand has 34 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 33 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:37:57,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:37:57,000 INFO L93 Difference]: Finished difference Result 902 states and 2665 transitions. [2021-11-25 18:37:57,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-11-25 18:37:57,000 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 33 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-25 18:37:57,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:37:57,002 INFO L225 Difference]: With dead ends: 902 [2021-11-25 18:37:57,002 INFO L226 Difference]: Without dead ends: 892 [2021-11-25 18:37:57,002 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=317, Invalid=2439, Unknown=0, NotChecked=0, Total=2756 [2021-11-25 18:37:57,003 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 98 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 1681 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 1714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-25 18:37:57,003 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 47 Invalid, 1714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1681 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-25 18:37:57,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2021-11-25 18:37:57,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 810. [2021-11-25 18:37:57,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 810 states, 809 states have (on average 3.029666254635352) internal successors, (2451), 809 states have internal predecessors, (2451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:37:57,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 2451 transitions. [2021-11-25 18:37:57,026 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 2451 transitions. Word has length 23 [2021-11-25 18:37:57,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:37:57,026 INFO L470 AbstractCegarLoop]: Abstraction has 810 states and 2451 transitions. [2021-11-25 18:37:57,026 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 33 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:37:57,026 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 2451 transitions. [2021-11-25 18:37:57,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:37:57,029 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:37:57,029 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:37:57,067 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Ended with exit code 0 [2021-11-25 18:37:57,245 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94,93 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:37:57,245 INFO L402 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:37:57,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:37:57,245 INFO L85 PathProgramCache]: Analyzing trace with hash -258200333, now seen corresponding path program 91 times [2021-11-25 18:37:57,245 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:37:57,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011942977] [2021-11-25 18:37:57,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:37:57,246 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:37:57,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:37:57,856 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:37:57,856 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:37:57,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011942977] [2021-11-25 18:37:57,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011942977] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:37:57,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256957529] [2021-11-25 18:37:57,856 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 18:37:57,856 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:37:57,856 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:37:57,857 INFO L229 MonitoredProcess]: Starting monitored process 94 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:37:57,858 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Waiting until timeout for monitored process [2021-11-25 18:37:58,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:37:58,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 103 conjunts are in the unsatisfiable core [2021-11-25 18:37:58,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:37:58,404 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:37:58,404 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:37:58,710 INFO L354 Elim1Store]: treesize reduction 114, result has 46.0 percent of original size [2021-11-25 18:37:58,711 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 52 treesize of output 107 [2021-11-25 18:37:59,005 INFO L354 Elim1Store]: treesize reduction 198, result has 6.2 percent of original size [2021-11-25 18:37:59,005 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 53 treesize of output 24 [2021-11-25 18:37:59,062 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 18:37:59,062 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256957529] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:37:59,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1542760465] [2021-11-25 18:37:59,062 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:37:59,063 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:37:59,063 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 8] total 31 [2021-11-25 18:37:59,063 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385172347] [2021-11-25 18:37:59,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:37:59,064 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-11-25 18:37:59,064 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:37:59,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-11-25 18:37:59,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=944, Unknown=0, NotChecked=0, Total=1056 [2021-11-25 18:37:59,064 INFO L87 Difference]: Start difference. First operand 810 states and 2451 transitions. Second operand has 33 states, 32 states have (on average 1.6875) internal successors, (54), 32 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:37:59,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:37:59,883 INFO L93 Difference]: Finished difference Result 859 states and 2572 transitions. [2021-11-25 18:37:59,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-25 18:37:59,883 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.6875) internal successors, (54), 32 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-25 18:37:59,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:37:59,885 INFO L225 Difference]: With dead ends: 859 [2021-11-25 18:37:59,885 INFO L226 Difference]: Without dead ends: 854 [2021-11-25 18:37:59,885 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=217, Invalid=1675, Unknown=0, NotChecked=0, Total=1892 [2021-11-25 18:37:59,885 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 83 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-25 18:37:59,885 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 45 Invalid, 950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 921 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-25 18:37:59,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2021-11-25 18:37:59,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 812. [2021-11-25 18:37:59,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 811 states have (on average 3.032059186189889) internal successors, (2459), 811 states have internal predecessors, (2459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:37:59,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 2459 transitions. [2021-11-25 18:37:59,898 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 2459 transitions. Word has length 23 [2021-11-25 18:37:59,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:37:59,899 INFO L470 AbstractCegarLoop]: Abstraction has 812 states and 2459 transitions. [2021-11-25 18:37:59,899 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.6875) internal successors, (54), 32 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:37:59,899 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 2459 transitions. [2021-11-25 18:37:59,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:37:59,901 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:37:59,901 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:37:59,922 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Ended with exit code 0 [2021-11-25 18:38:00,101 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95,94 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:38:00,101 INFO L402 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:38:00,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:38:00,102 INFO L85 PathProgramCache]: Analyzing trace with hash -746166167, now seen corresponding path program 92 times [2021-11-25 18:38:00,102 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:38:00,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274836148] [2021-11-25 18:38:00,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:38:00,102 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:38:00,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:38:00,614 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:38:00,614 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:38:00,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274836148] [2021-11-25 18:38:00,614 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274836148] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:38:00,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86494352] [2021-11-25 18:38:00,614 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:38:00,615 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:38:00,615 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:38:00,615 INFO L229 MonitoredProcess]: Starting monitored process 95 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:38:00,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (95)] Waiting until timeout for monitored process [2021-11-25 18:38:00,825 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-11-25 18:38:00,825 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:38:00,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 123 conjunts are in the unsatisfiable core [2021-11-25 18:38:00,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:38:00,941 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-25 18:38:00,987 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 18:38:01,029 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 18:38:01,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:38:01,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:38:01,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:38:01,427 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:38:01,427 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 32 treesize of output 43 [2021-11-25 18:38:01,532 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:38:01,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:38:01,983 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:38:02,371 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:38:03,375 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread2Thread1of1ForFork1_~i~1#1_705| Int) (|v_thread1Thread1of1ForFork0_~i~0#1_729| Int)) (or (< (+ |v_thread1Thread1of1ForFork0_~i~0#1_729| 2) c_~N~0) (<= c_~N~0 |v_thread2Thread1of1ForFork1_~i~1#1_705|) (< (+ |v_thread2Thread1of1ForFork1_~i~1#1_705| 1) c_~N~0) (and (forall ((v_ArrVal_3530 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3530) c_~A~0.base))) (< (+ (select .cse0 (+ (* |v_thread2Thread1of1ForFork1_~i~1#1_705| 4) c_~A~0.offset)) (select .cse0 (+ c_~A~0.offset 4))) (let ((.cse1 (* |v_thread1Thread1of1ForFork0_~i~0#1_729| 4))) (+ (select .cse0 (+ .cse1 c_~A~0.offset 4)) c_~counter~0 (select .cse0 (+ .cse1 c_~A~0.offset)) 1))))) (forall ((v_ArrVal_3530 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3530) c_~A~0.base))) (<= (let ((.cse3 (* |v_thread1Thread1of1ForFork0_~i~0#1_729| 4))) (+ (select .cse2 (+ .cse3 c_~A~0.offset 4)) c_~counter~0 (select .cse2 (+ .cse3 c_~A~0.offset)))) (+ (select .cse2 (+ (* |v_thread2Thread1of1ForFork1_~i~1#1_705| 4) c_~A~0.offset)) (select .cse2 (+ c_~A~0.offset 4))))))) (<= c_~N~0 (+ |v_thread1Thread1of1ForFork0_~i~0#1_729| 1)))) is different from false [2021-11-25 18:38:03,891 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:38:03,892 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 224 treesize of output 141 [2021-11-25 18:38:03,960 INFO L354 Elim1Store]: treesize reduction 98, result has 37.6 percent of original size [2021-11-25 18:38:03,961 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 518 treesize of output 475 [2021-11-25 18:38:04,003 INFO L354 Elim1Store]: treesize reduction 69, result has 26.6 percent of original size [2021-11-25 18:38:04,003 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 403 treesize of output 382 [2021-11-25 18:38:04,046 INFO L354 Elim1Store]: treesize reduction 69, result has 26.6 percent of original size [2021-11-25 18:38:04,046 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 351 treesize of output 284 [2021-11-25 18:38:04,088 INFO L354 Elim1Store]: treesize reduction 69, result has 26.6 percent of original size [2021-11-25 18:38:04,088 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 247 treesize of output 226 [2021-11-25 18:38:04,131 INFO L354 Elim1Store]: treesize reduction 69, result has 26.6 percent of original size [2021-11-25 18:38:04,131 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 195 treesize of output 197 [2021-11-25 18:38:06,978 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:38:06,978 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86494352] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:38:06,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [311564146] [2021-11-25 18:38:06,979 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:38:06,979 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:38:06,979 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 16] total 45 [2021-11-25 18:38:06,979 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579259778] [2021-11-25 18:38:06,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:38:06,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2021-11-25 18:38:06,980 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:38:06,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-11-25 18:38:06,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1886, Unknown=1, NotChecked=88, Total=2162 [2021-11-25 18:38:06,980 INFO L87 Difference]: Start difference. First operand 812 states and 2459 transitions. Second operand has 47 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 46 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:38:09,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:38:09,934 INFO L93 Difference]: Finished difference Result 916 states and 2661 transitions. [2021-11-25 18:38:09,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-11-25 18:38:09,935 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 46 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-25 18:38:09,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:38:09,936 INFO L225 Difference]: With dead ends: 916 [2021-11-25 18:38:09,937 INFO L226 Difference]: Without dead ends: 906 [2021-11-25 18:38:09,937 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 17 SyntacticMatches, 4 SemanticMatches, 78 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1707 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=613, Invalid=5552, Unknown=1, NotChecked=154, Total=6320 [2021-11-25 18:38:09,937 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 212 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 966 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 1953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 907 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-25 18:38:09,937 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [212 Valid, 133 Invalid, 1953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 966 Invalid, 0 Unknown, 907 Unchecked, 0.6s Time] [2021-11-25 18:38:09,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2021-11-25 18:38:09,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 812. [2021-11-25 18:38:09,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 811 states have (on average 3.032059186189889) internal successors, (2459), 811 states have internal predecessors, (2459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:38:09,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 2459 transitions. [2021-11-25 18:38:09,951 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 2459 transitions. Word has length 23 [2021-11-25 18:38:09,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:38:09,952 INFO L470 AbstractCegarLoop]: Abstraction has 812 states and 2459 transitions. [2021-11-25 18:38:09,952 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 46 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:38:09,952 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 2459 transitions. [2021-11-25 18:38:09,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:38:09,953 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:38:09,953 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:38:09,975 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (95)] Forceful destruction successful, exit code 0 [2021-11-25 18:38:10,154 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96,95 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:38:10,154 INFO L402 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:38:10,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:38:10,154 INFO L85 PathProgramCache]: Analyzing trace with hash 691527099, now seen corresponding path program 93 times [2021-11-25 18:38:10,154 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:38:10,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001312445] [2021-11-25 18:38:10,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:38:10,155 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:38:10,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:38:10,768 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:38:10,768 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:38:10,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001312445] [2021-11-25 18:38:10,768 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001312445] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:38:10,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77014096] [2021-11-25 18:38:10,769 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 18:38:10,769 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:38:10,769 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:38:10,770 INFO L229 MonitoredProcess]: Starting monitored process 96 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:38:10,785 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Waiting until timeout for monitored process [2021-11-25 18:38:11,005 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 18:38:11,005 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:38:11,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 122 conjunts are in the unsatisfiable core [2021-11-25 18:38:11,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:38:11,156 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-25 18:38:11,200 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 18:38:11,240 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 18:38:11,578 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:38:11,579 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 15 treesize of output 16 [2021-11-25 18:38:11,661 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:38:11,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:38:11,795 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:38:12,404 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork0_~i~0#1_737| Int)) (or (and (forall ((v_ArrVal_3572 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3572) c_~A~0.base))) (<= (+ c_~counter~0 (select .cse0 (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_737| 4) c_~A~0.offset))) (select .cse0 (+ c_~A~0.offset 8))))) (forall ((v_ArrVal_3572 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3572) c_~A~0.base))) (< (select .cse1 (+ c_~A~0.offset 8)) (+ c_~counter~0 (select .cse1 (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_737| 4) c_~A~0.offset)) 1))))) (< (+ |v_thread1Thread1of1ForFork0_~i~0#1_737| 1) c_~N~0) (<= c_~N~0 |v_thread1Thread1of1ForFork0_~i~0#1_737|))) is different from false [2021-11-25 18:38:12,554 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:38:12,554 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 112 treesize of output 77 [2021-11-25 18:38:12,571 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:38:12,571 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 314 treesize of output 308 [2021-11-25 18:38:12,585 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:38:12,585 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 259 treesize of output 254 [2021-11-25 18:38:12,597 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:38:12,597 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 239 treesize of output 214 [2021-11-25 18:38:12,610 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:38:12,610 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 199 treesize of output 194 [2021-11-25 18:38:12,623 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:38:12,623 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 179 treesize of output 184 [2021-11-25 18:38:13,181 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:38:13,181 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77014096] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:38:13,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1837275098] [2021-11-25 18:38:13,182 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:38:13,182 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:38:13,182 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 43 [2021-11-25 18:38:13,182 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386450761] [2021-11-25 18:38:13,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:38:13,183 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2021-11-25 18:38:13,183 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:38:13,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-11-25 18:38:13,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1705, Unknown=1, NotChecked=84, Total=1980 [2021-11-25 18:38:13,183 INFO L87 Difference]: Start difference. First operand 812 states and 2459 transitions. Second operand has 45 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 44 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:38:15,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:38:15,668 INFO L93 Difference]: Finished difference Result 898 states and 2653 transitions. [2021-11-25 18:38:15,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-11-25 18:38:15,669 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 44 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-25 18:38:15,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:38:15,670 INFO L225 Difference]: With dead ends: 898 [2021-11-25 18:38:15,670 INFO L226 Difference]: Without dead ends: 888 [2021-11-25 18:38:15,670 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 70 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1298 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=578, Invalid=4395, Unknown=1, NotChecked=138, Total=5112 [2021-11-25 18:38:15,671 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 189 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 1000 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 1705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 614 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-25 18:38:15,671 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [189 Valid, 87 Invalid, 1705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1000 Invalid, 0 Unknown, 614 Unchecked, 0.7s Time] [2021-11-25 18:38:15,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2021-11-25 18:38:15,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 814. [2021-11-25 18:38:15,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 813 states have (on average 3.030750307503075) internal successors, (2464), 813 states have internal predecessors, (2464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:38:15,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 2464 transitions. [2021-11-25 18:38:15,685 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 2464 transitions. Word has length 23 [2021-11-25 18:38:15,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:38:15,685 INFO L470 AbstractCegarLoop]: Abstraction has 814 states and 2464 transitions. [2021-11-25 18:38:15,685 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 44 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:38:15,685 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 2464 transitions. [2021-11-25 18:38:15,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:38:15,686 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:38:15,686 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:38:15,708 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Ended with exit code 0 [2021-11-25 18:38:15,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 96 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable97 [2021-11-25 18:38:15,887 INFO L402 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:38:15,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:38:15,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1454643661, now seen corresponding path program 94 times [2021-11-25 18:38:15,887 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:38:15,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336899035] [2021-11-25 18:38:15,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:38:15,888 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:38:15,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:38:16,314 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:38:16,315 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:38:16,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336899035] [2021-11-25 18:38:16,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336899035] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:38:16,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537520757] [2021-11-25 18:38:16,315 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 18:38:16,315 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:38:16,315 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:38:16,316 INFO L229 MonitoredProcess]: Starting monitored process 97 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:38:16,317 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Waiting until timeout for monitored process [2021-11-25 18:38:16,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:38:16,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 103 conjunts are in the unsatisfiable core [2021-11-25 18:38:16,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:38:16,842 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:38:16,843 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:38:17,165 INFO L354 Elim1Store]: treesize reduction 114, result has 46.0 percent of original size [2021-11-25 18:38:17,165 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 52 treesize of output 107 [2021-11-25 18:38:17,439 INFO L354 Elim1Store]: treesize reduction 198, result has 6.2 percent of original size [2021-11-25 18:38:17,439 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 53 treesize of output 24 [2021-11-25 18:38:17,497 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 18:38:17,497 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1537520757] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:38:17,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [597770178] [2021-11-25 18:38:17,497 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:38:17,498 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:38:17,498 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 8] total 32 [2021-11-25 18:38:17,498 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657360969] [2021-11-25 18:38:17,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:38:17,498 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-11-25 18:38:17,499 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:38:17,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-11-25 18:38:17,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=998, Unknown=0, NotChecked=0, Total=1122 [2021-11-25 18:38:17,499 INFO L87 Difference]: Start difference. First operand 814 states and 2464 transitions. Second operand has 34 states, 33 states have (on average 1.6666666666666667) internal successors, (55), 33 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:38:18,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:38:18,672 INFO L93 Difference]: Finished difference Result 1001 states and 2918 transitions. [2021-11-25 18:38:18,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-25 18:38:18,673 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.6666666666666667) internal successors, (55), 33 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-25 18:38:18,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:38:18,674 INFO L225 Difference]: With dead ends: 1001 [2021-11-25 18:38:18,674 INFO L226 Difference]: Without dead ends: 986 [2021-11-25 18:38:18,675 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=262, Invalid=1994, Unknown=0, NotChecked=0, Total=2256 [2021-11-25 18:38:18,675 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 126 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 1223 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 1267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-25 18:38:18,675 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 44 Invalid, 1267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1223 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-25 18:38:18,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2021-11-25 18:38:18,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 818. [2021-11-25 18:38:18,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 817 states have (on average 3.033047735618115) internal successors, (2478), 817 states have internal predecessors, (2478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:38:18,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 2478 transitions. [2021-11-25 18:38:18,689 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 2478 transitions. Word has length 23 [2021-11-25 18:38:18,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:38:18,689 INFO L470 AbstractCegarLoop]: Abstraction has 818 states and 2478 transitions. [2021-11-25 18:38:18,689 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.6666666666666667) internal successors, (55), 33 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:38:18,689 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 2478 transitions. [2021-11-25 18:38:18,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:38:18,691 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:38:18,691 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:38:18,712 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Forceful destruction successful, exit code 0 [2021-11-25 18:38:18,891 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 97 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable98 [2021-11-25 18:38:18,891 INFO L402 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:38:18,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:38:18,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1431996201, now seen corresponding path program 95 times [2021-11-25 18:38:18,892 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:38:18,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403895621] [2021-11-25 18:38:18,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:38:18,892 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:38:18,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:38:19,361 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:38:19,361 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:38:19,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403895621] [2021-11-25 18:38:19,362 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403895621] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:38:19,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860756869] [2021-11-25 18:38:19,362 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:38:19,362 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:38:19,362 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:38:19,363 INFO L229 MonitoredProcess]: Starting monitored process 98 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:38:19,363 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Waiting until timeout for monitored process [2021-11-25 18:38:19,661 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-11-25 18:38:19,662 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:38:19,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 110 conjunts are in the unsatisfiable core [2021-11-25 18:38:19,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:38:19,962 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:38:19,962 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 17 treesize of output 18 [2021-11-25 18:38:20,104 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:38:20,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:38:20,579 INFO L354 Elim1Store]: treesize reduction 39, result has 52.4 percent of original size [2021-11-25 18:38:20,579 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 36 treesize of output 52 [2021-11-25 18:38:20,647 INFO L354 Elim1Store]: treesize reduction 73, result has 11.0 percent of original size [2021-11-25 18:38:20,648 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 35 treesize of output 17 [2021-11-25 18:38:20,736 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:38:20,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860756869] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:38:20,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1552832082] [2021-11-25 18:38:20,736 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:38:20,737 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:38:20,737 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 10] total 36 [2021-11-25 18:38:20,737 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421159254] [2021-11-25 18:38:20,737 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:38:20,737 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-11-25 18:38:20,737 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:38:20,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-11-25 18:38:20,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1227, Unknown=0, NotChecked=0, Total=1406 [2021-11-25 18:38:20,738 INFO L87 Difference]: Start difference. First operand 818 states and 2478 transitions. Second operand has 38 states, 37 states have (on average 1.5675675675675675) internal successors, (58), 37 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:38:23,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:38:23,127 INFO L93 Difference]: Finished difference Result 988 states and 2863 transitions. [2021-11-25 18:38:23,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-11-25 18:38:23,127 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.5675675675675675) internal successors, (58), 37 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 23 [2021-11-25 18:38:23,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:38:23,129 INFO L225 Difference]: With dead ends: 988 [2021-11-25 18:38:23,129 INFO L226 Difference]: Without dead ends: 975 [2021-11-25 18:38:23,129 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1253 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=676, Invalid=4436, Unknown=0, NotChecked=0, Total=5112 [2021-11-25 18:38:23,129 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 152 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 1199 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 1406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 118 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-25 18:38:23,130 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 72 Invalid, 1406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1199 Invalid, 0 Unknown, 118 Unchecked, 0.7s Time] [2021-11-25 18:38:23,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2021-11-25 18:38:23,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 821. [2021-11-25 18:38:23,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 821 states, 820 states have (on average 3.0353658536585364) internal successors, (2489), 820 states have internal predecessors, (2489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:38:23,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 2489 transitions. [2021-11-25 18:38:23,156 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 2489 transitions. Word has length 23 [2021-11-25 18:38:23,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:38:23,157 INFO L470 AbstractCegarLoop]: Abstraction has 821 states and 2489 transitions. [2021-11-25 18:38:23,157 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.5675675675675675) internal successors, (58), 37 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:38:23,157 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 2489 transitions. [2021-11-25 18:38:23,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:38:23,159 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:38:23,159 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:38:23,180 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Ended with exit code 0 [2021-11-25 18:38:23,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99,98 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:38:23,360 INFO L402 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:38:23,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:38:23,360 INFO L85 PathProgramCache]: Analyzing trace with hash -868760381, now seen corresponding path program 96 times [2021-11-25 18:38:23,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:38:23,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92343184] [2021-11-25 18:38:23,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:38:23,360 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:38:23,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:38:23,864 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:38:23,865 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:38:23,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92343184] [2021-11-25 18:38:23,865 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92343184] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:38:23,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487886713] [2021-11-25 18:38:23,865 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 18:38:23,865 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:38:23,865 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:38:23,869 INFO L229 MonitoredProcess]: Starting monitored process 99 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:38:23,887 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Waiting until timeout for monitored process [2021-11-25 18:38:24,089 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 18:38:24,089 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:38:24,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 103 conjunts are in the unsatisfiable core [2021-11-25 18:38:24,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:38:24,433 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:38:24,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:38:24,743 INFO L354 Elim1Store]: treesize reduction 114, result has 46.0 percent of original size [2021-11-25 18:38:24,743 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 52 treesize of output 107 [2021-11-25 18:38:24,993 INFO L354 Elim1Store]: treesize reduction 198, result has 6.2 percent of original size [2021-11-25 18:38:24,993 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 53 treesize of output 24 [2021-11-25 18:38:25,050 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 18:38:25,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487886713] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:38:25,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [412484486] [2021-11-25 18:38:25,051 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:38:25,051 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:38:25,051 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 8] total 32 [2021-11-25 18:38:25,052 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093382926] [2021-11-25 18:38:25,052 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:38:25,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-11-25 18:38:25,052 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:38:25,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-11-25 18:38:25,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=995, Unknown=0, NotChecked=0, Total=1122 [2021-11-25 18:38:25,053 INFO L87 Difference]: Start difference. First operand 821 states and 2489 transitions. Second operand has 34 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 33 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:38:27,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:38:27,112 INFO L93 Difference]: Finished difference Result 1058 states and 3062 transitions. [2021-11-25 18:38:27,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-11-25 18:38:27,112 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 33 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-25 18:38:27,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:38:27,114 INFO L225 Difference]: With dead ends: 1058 [2021-11-25 18:38:27,114 INFO L226 Difference]: Without dead ends: 1049 [2021-11-25 18:38:27,114 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 919 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=424, Invalid=3358, Unknown=0, NotChecked=0, Total=3782 [2021-11-25 18:38:27,114 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 97 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 1821 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 1876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-25 18:38:27,115 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 85 Invalid, 1876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1821 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-11-25 18:38:27,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2021-11-25 18:38:27,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 822. [2021-11-25 18:38:27,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 822 states, 821 states have (on average 3.035322777101096) internal successors, (2492), 821 states have internal predecessors, (2492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:38:27,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 2492 transitions. [2021-11-25 18:38:27,127 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 2492 transitions. Word has length 23 [2021-11-25 18:38:27,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:38:27,127 INFO L470 AbstractCegarLoop]: Abstraction has 822 states and 2492 transitions. [2021-11-25 18:38:27,128 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 33 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:38:27,128 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 2492 transitions. [2021-11-25 18:38:27,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:38:27,129 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:38:27,129 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:38:27,149 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Forceful destruction successful, exit code 0 [2021-11-25 18:38:27,333 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 99 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable100 [2021-11-25 18:38:27,333 INFO L402 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:38:27,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:38:27,333 INFO L85 PathProgramCache]: Analyzing trace with hash 2075083625, now seen corresponding path program 97 times [2021-11-25 18:38:27,333 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:38:27,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028609675] [2021-11-25 18:38:27,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:38:27,334 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:38:27,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:38:27,725 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:38:27,726 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:38:27,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028609675] [2021-11-25 18:38:27,726 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028609675] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:38:27,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423438494] [2021-11-25 18:38:27,726 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 18:38:27,726 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:38:27,726 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:38:27,728 INFO L229 MonitoredProcess]: Starting monitored process 100 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:38:27,729 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Waiting until timeout for monitored process [2021-11-25 18:38:27,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:38:27,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 97 conjunts are in the unsatisfiable core [2021-11-25 18:38:27,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:38:28,212 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 18:38:28,212 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:38:28,505 INFO L354 Elim1Store]: treesize reduction 114, result has 46.0 percent of original size [2021-11-25 18:38:28,505 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 52 treesize of output 107 [2021-11-25 18:38:28,783 INFO L354 Elim1Store]: treesize reduction 198, result has 6.2 percent of original size [2021-11-25 18:38:28,784 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 53 treesize of output 24 [2021-11-25 18:38:28,854 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 18:38:28,854 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [423438494] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:38:28,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [427369793] [2021-11-25 18:38:28,855 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:38:28,856 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:38:28,856 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 8] total 27 [2021-11-25 18:38:28,856 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588489576] [2021-11-25 18:38:28,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:38:28,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-11-25 18:38:28,857 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:38:28,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-11-25 18:38:28,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=726, Unknown=0, NotChecked=0, Total=812 [2021-11-25 18:38:28,858 INFO L87 Difference]: Start difference. First operand 822 states and 2492 transitions. Second operand has 29 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 28 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:38:29,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:38:29,782 INFO L93 Difference]: Finished difference Result 853 states and 2564 transitions. [2021-11-25 18:38:29,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-25 18:38:29,782 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 28 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-25 18:38:29,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:38:29,784 INFO L225 Difference]: With dead ends: 853 [2021-11-25 18:38:29,784 INFO L226 Difference]: Without dead ends: 848 [2021-11-25 18:38:29,784 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 26 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=184, Invalid=1456, Unknown=0, NotChecked=0, Total=1640 [2021-11-25 18:38:29,784 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 73 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-25 18:38:29,784 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 65 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 913 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-25 18:38:29,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2021-11-25 18:38:29,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 826. [2021-11-25 18:38:29,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 826 states, 825 states have (on average 3.0327272727272727) internal successors, (2502), 825 states have internal predecessors, (2502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:38:29,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 2502 transitions. [2021-11-25 18:38:29,797 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 2502 transitions. Word has length 23 [2021-11-25 18:38:29,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:38:29,797 INFO L470 AbstractCegarLoop]: Abstraction has 826 states and 2502 transitions. [2021-11-25 18:38:29,797 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 28 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:38:29,797 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 2502 transitions. [2021-11-25 18:38:29,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-25 18:38:29,798 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:38:29,798 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:38:29,819 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Forceful destruction successful, exit code 0 [2021-11-25 18:38:29,998 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 100 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable101 [2021-11-25 18:38:29,999 INFO L402 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:38:29,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:38:29,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1689198398, now seen corresponding path program 98 times [2021-11-25 18:38:29,999 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:38:29,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980454454] [2021-11-25 18:38:29,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:38:29,999 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:38:30,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:38:30,089 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 18:38:30,090 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:38:30,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980454454] [2021-11-25 18:38:30,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980454454] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:38:30,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78513196] [2021-11-25 18:38:30,090 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:38:30,090 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:38:30,090 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:38:30,093 INFO L229 MonitoredProcess]: Starting monitored process 101 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:38:30,112 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (101)] Waiting until timeout for monitored process [2021-11-25 18:38:30,322 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-11-25 18:38:30,322 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:38:30,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-25 18:38:30,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:38:30,447 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 18:38:30,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:38:30,538 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 18:38:30,538 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [78513196] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:38:30,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1957375577] [2021-11-25 18:38:30,539 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:38:30,539 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:38:30,539 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 23 [2021-11-25 18:38:30,539 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569283330] [2021-11-25 18:38:30,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:38:30,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-11-25 18:38:30,540 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:38:30,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-25 18:38:30,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=403, Unknown=0, NotChecked=0, Total=552 [2021-11-25 18:38:30,540 INFO L87 Difference]: Start difference. First operand 826 states and 2502 transitions. Second operand has 24 states, 24 states have (on average 1.625) internal successors, (39), 23 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:38:30,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:38:30,735 INFO L93 Difference]: Finished difference Result 1041 states and 2919 transitions. [2021-11-25 18:38:30,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-25 18:38:30,735 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.625) internal successors, (39), 23 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 24 [2021-11-25 18:38:30,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:38:30,737 INFO L225 Difference]: With dead ends: 1041 [2021-11-25 18:38:30,737 INFO L226 Difference]: Without dead ends: 1015 [2021-11-25 18:38:30,737 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=222, Invalid=590, Unknown=0, NotChecked=0, Total=812 [2021-11-25 18:38:30,737 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 129 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:38:30,738 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 48 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:38:30,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2021-11-25 18:38:30,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 681. [2021-11-25 18:38:30,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 680 states have (on average 2.8308823529411766) internal successors, (1925), 680 states have internal predecessors, (1925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:38:30,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 1925 transitions. [2021-11-25 18:38:30,748 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 1925 transitions. Word has length 24 [2021-11-25 18:38:30,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:38:30,749 INFO L470 AbstractCegarLoop]: Abstraction has 681 states and 1925 transitions. [2021-11-25 18:38:30,749 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.625) internal successors, (39), 23 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:38:30,749 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 1925 transitions. [2021-11-25 18:38:30,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-25 18:38:30,750 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:38:30,750 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:38:30,771 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (101)] Forceful destruction successful, exit code 0 [2021-11-25 18:38:30,950 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 101 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable102 [2021-11-25 18:38:30,950 INFO L402 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:38:30,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:38:30,951 INFO L85 PathProgramCache]: Analyzing trace with hash 285010290, now seen corresponding path program 99 times [2021-11-25 18:38:30,951 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:38:30,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81908024] [2021-11-25 18:38:30,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:38:30,951 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:38:30,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:38:31,025 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 18:38:31,025 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:38:31,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81908024] [2021-11-25 18:38:31,026 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81908024] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:38:31,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86003623] [2021-11-25 18:38:31,026 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 18:38:31,026 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:38:31,026 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:38:31,027 INFO L229 MonitoredProcess]: Starting monitored process 102 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:38:31,027 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (102)] Waiting until timeout for monitored process [2021-11-25 18:38:31,235 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 18:38:31,235 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:38:31,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-25 18:38:31,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:38:31,368 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 18:38:31,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:38:31,469 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 18:38:31,469 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86003623] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:38:31,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1969870512] [2021-11-25 18:38:31,469 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:38:31,470 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:38:31,470 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 23 [2021-11-25 18:38:31,470 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606736462] [2021-11-25 18:38:31,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:38:31,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-11-25 18:38:31,470 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:38:31,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-25 18:38:31,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=406, Unknown=0, NotChecked=0, Total=552 [2021-11-25 18:38:31,471 INFO L87 Difference]: Start difference. First operand 681 states and 1925 transitions. Second operand has 24 states, 24 states have (on average 1.625) internal successors, (39), 23 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:38:31,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:38:31,649 INFO L93 Difference]: Finished difference Result 653 states and 1802 transitions. [2021-11-25 18:38:31,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-25 18:38:31,649 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.625) internal successors, (39), 23 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 24 [2021-11-25 18:38:31,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:38:31,650 INFO L225 Difference]: With dead ends: 653 [2021-11-25 18:38:31,650 INFO L226 Difference]: Without dead ends: 513 [2021-11-25 18:38:31,651 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=219, Invalid=593, Unknown=0, NotChecked=0, Total=812 [2021-11-25 18:38:31,651 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 106 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:38:31,651 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 46 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:38:31,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2021-11-25 18:38:31,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 513. [2021-11-25 18:38:31,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 512 states have (on average 2.95703125) internal successors, (1514), 512 states have internal predecessors, (1514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:38:31,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 1514 transitions. [2021-11-25 18:38:31,677 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 1514 transitions. Word has length 24 [2021-11-25 18:38:31,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:38:31,677 INFO L470 AbstractCegarLoop]: Abstraction has 513 states and 1514 transitions. [2021-11-25 18:38:31,677 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.625) internal successors, (39), 23 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:38:31,677 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 1514 transitions. [2021-11-25 18:38:31,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-25 18:38:31,678 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:38:31,678 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:38:31,699 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (102)] Ended with exit code 0 [2021-11-25 18:38:31,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 102 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable103 [2021-11-25 18:38:31,878 INFO L402 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:38:31,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:38:31,879 INFO L85 PathProgramCache]: Analyzing trace with hash 917816354, now seen corresponding path program 100 times [2021-11-25 18:38:31,879 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:38:31,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138572222] [2021-11-25 18:38:31,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:38:31,879 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:38:31,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:38:31,951 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:38:31,951 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:38:31,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138572222] [2021-11-25 18:38:31,951 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138572222] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:38:31,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184557656] [2021-11-25 18:38:31,952 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 18:38:31,952 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:38:31,952 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:38:31,952 INFO L229 MonitoredProcess]: Starting monitored process 103 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:38:31,953 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Waiting until timeout for monitored process [2021-11-25 18:38:32,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:38:32,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-25 18:38:32,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:38:32,323 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:38:32,324 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:38:32,449 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:38:32,449 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184557656] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:38:32,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1460822976] [2021-11-25 18:38:32,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 18:38:32,450 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:38:32,450 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 23 [2021-11-25 18:38:32,450 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476071882] [2021-11-25 18:38:32,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:38:32,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-11-25 18:38:32,450 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:38:32,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-25 18:38:32,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=406, Unknown=0, NotChecked=0, Total=552 [2021-11-25 18:38:32,451 INFO L87 Difference]: Start difference. First operand 513 states and 1514 transitions. Second operand has 24 states, 24 states have (on average 1.625) internal successors, (39), 23 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:38:32,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:38:32,577 INFO L93 Difference]: Finished difference Result 555 states and 1499 transitions. [2021-11-25 18:38:32,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-25 18:38:32,577 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.625) internal successors, (39), 23 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 24 [2021-11-25 18:38:32,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:38:32,578 INFO L225 Difference]: With dead ends: 555 [2021-11-25 18:38:32,578 INFO L226 Difference]: Without dead ends: 555 [2021-11-25 18:38:32,578 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=247, Invalid=565, Unknown=0, NotChecked=0, Total=812 [2021-11-25 18:38:32,579 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 169 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:38:32,579 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 12 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:38:32,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2021-11-25 18:38:32,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 423. [2021-11-25 18:38:32,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 422 states have (on average 2.793838862559242) internal successors, (1179), 422 states have internal predecessors, (1179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:38:32,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 1179 transitions. [2021-11-25 18:38:32,585 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 1179 transitions. Word has length 24 [2021-11-25 18:38:32,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:38:32,585 INFO L470 AbstractCegarLoop]: Abstraction has 423 states and 1179 transitions. [2021-11-25 18:38:32,585 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.625) internal successors, (39), 23 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:38:32,585 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 1179 transitions. [2021-11-25 18:38:32,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-25 18:38:32,586 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:38:32,586 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:38:32,607 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Forceful destruction successful, exit code 0 [2021-11-25 18:38:32,786 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104,103 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:38:32,787 INFO L402 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:38:32,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:38:32,787 INFO L85 PathProgramCache]: Analyzing trace with hash -341486757, now seen corresponding path program 101 times [2021-11-25 18:38:32,787 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:38:32,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225992589] [2021-11-25 18:38:32,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:38:32,787 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:38:32,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:38:32,894 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-25 18:38:32,894 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:38:32,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225992589] [2021-11-25 18:38:32,894 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225992589] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:38:32,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141632309] [2021-11-25 18:38:32,895 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:38:32,895 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:38:32,895 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:38:32,895 INFO L229 MonitoredProcess]: Starting monitored process 104 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:38:32,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (104)] Waiting until timeout for monitored process [2021-11-25 18:38:33,121 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-11-25 18:38:33,121 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:38:33,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-25 18:38:33,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:38:33,245 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-25 18:38:33,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:38:33,323 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-25 18:38:33,323 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141632309] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:38:33,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [610693567] [2021-11-25 18:38:33,323 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:38:33,324 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:38:33,324 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 25 [2021-11-25 18:38:33,324 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064365942] [2021-11-25 18:38:33,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:38:33,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-25 18:38:33,324 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:38:33,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-25 18:38:33,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=506, Unknown=0, NotChecked=0, Total=600 [2021-11-25 18:38:33,325 INFO L87 Difference]: Start difference. First operand 423 states and 1179 transitions. Second operand has 25 states, 25 states have (on average 1.72) internal successors, (43), 25 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:38:33,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:38:33,630 INFO L93 Difference]: Finished difference Result 445 states and 1158 transitions. [2021-11-25 18:38:33,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-25 18:38:33,631 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.72) internal successors, (43), 25 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-25 18:38:33,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:38:33,632 INFO L225 Difference]: With dead ends: 445 [2021-11-25 18:38:33,632 INFO L226 Difference]: Without dead ends: 445 [2021-11-25 18:38:33,632 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=259, Invalid=931, Unknown=0, NotChecked=0, Total=1190 [2021-11-25 18:38:33,632 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 127 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:38:33,632 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 25 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:38:33,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2021-11-25 18:38:33,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 439. [2021-11-25 18:38:33,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 438 states have (on average 2.6232876712328768) internal successors, (1149), 438 states have internal predecessors, (1149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:38:33,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 1149 transitions. [2021-11-25 18:38:33,638 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 1149 transitions. Word has length 25 [2021-11-25 18:38:33,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:38:33,638 INFO L470 AbstractCegarLoop]: Abstraction has 439 states and 1149 transitions. [2021-11-25 18:38:33,638 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.72) internal successors, (43), 25 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:38:33,639 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 1149 transitions. [2021-11-25 18:38:33,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-25 18:38:33,639 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:38:33,639 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:38:33,660 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (104)] Forceful destruction successful, exit code 0 [2021-11-25 18:38:33,839 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 104 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable105 [2021-11-25 18:38:33,840 INFO L402 AbstractCegarLoop]: === Iteration 107 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:38:33,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:38:33,840 INFO L85 PathProgramCache]: Analyzing trace with hash 319231056, now seen corresponding path program 102 times [2021-11-25 18:38:33,840 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:38:33,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829350572] [2021-11-25 18:38:33,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:38:33,841 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:38:33,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:38:34,578 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:38:34,579 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:38:34,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829350572] [2021-11-25 18:38:34,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829350572] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:38:34,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304498761] [2021-11-25 18:38:34,579 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 18:38:34,579 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:38:34,579 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:38:34,580 INFO L229 MonitoredProcess]: Starting monitored process 105 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:38:34,581 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (105)] Waiting until timeout for monitored process [2021-11-25 18:38:34,799 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 18:38:34,800 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:38:34,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 130 conjunts are in the unsatisfiable core [2021-11-25 18:38:34,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:38:35,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:38:35,093 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 36 treesize of output 32 [2021-11-25 18:38:35,319 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-25 18:38:35,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:38:35,564 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3927 (Array Int Int))) (<= c_~counter~0 (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3927) c_~A~0.base))) (+ (select .cse0 c_~A~0.offset) (select .cse0 (+ c_~A~0.offset 8)) (select .cse0 (+ c_~A~0.offset 4)) (select .cse0 (+ c_~A~0.offset 12)))))) (forall ((v_ArrVal_3927 (Array Int Int))) (< (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3927) c_~A~0.base))) (+ (select .cse1 c_~A~0.offset) (select .cse1 (+ c_~A~0.offset 8)) (select .cse1 (+ c_~A~0.offset 4)) (select .cse1 (+ c_~A~0.offset 12)))) (+ c_~counter~0 1)))) is different from false [2021-11-25 18:38:35,581 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3927 (Array Int Int))) (<= (+ c_~counter~0 (select (select |c_#memory_int| c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) c_~A~0.offset))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3927) c_~A~0.base))) (+ (select .cse0 c_~A~0.offset) (select .cse0 (+ c_~A~0.offset 8)) (select .cse0 (+ c_~A~0.offset 4)) (select .cse0 (+ c_~A~0.offset 12)))))) (forall ((v_ArrVal_3927 (Array Int Int))) (< (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3927) c_~A~0.base))) (+ (select .cse1 c_~A~0.offset) (select .cse1 (+ c_~A~0.offset 8)) (select .cse1 (+ c_~A~0.offset 4)) (select .cse1 (+ c_~A~0.offset 12)))) (+ c_~counter~0 1 (select (select |c_#memory_int| c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) c_~A~0.offset)))))) is different from false [2021-11-25 18:38:35,595 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3927 (Array Int Int))) (< (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3927) c_~A~0.base))) (+ (select .cse0 c_~A~0.offset) (select .cse0 (+ c_~A~0.offset 8)) (select .cse0 (+ c_~A~0.offset 4)) (select .cse0 (+ c_~A~0.offset 12)))) (let ((.cse1 (select |c_#memory_int| c_~A~0.base)) (.cse2 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse1 (+ .cse2 c_~A~0.offset 4)) 1 (select .cse1 (+ .cse2 c_~A~0.offset)))))) (forall ((v_ArrVal_3927 (Array Int Int))) (<= (let ((.cse3 (select |c_#memory_int| c_~A~0.base)) (.cse4 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse3 (+ .cse4 c_~A~0.offset 4)) (select .cse3 (+ .cse4 c_~A~0.offset)))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3927) c_~A~0.base))) (+ (select .cse5 c_~A~0.offset) (select .cse5 (+ c_~A~0.offset 8)) (select .cse5 (+ c_~A~0.offset 4)) (select .cse5 (+ c_~A~0.offset 12))))))) is different from false [2021-11-25 18:38:35,607 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3927 (Array Int Int))) (<= (let ((.cse0 (select |c_#memory_int| c_~A~0.base)) (.cse1 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse0 (+ .cse1 c_~A~0.offset 8)) (select .cse0 (+ .cse1 c_~A~0.offset 4)) (select .cse0 (+ .cse1 c_~A~0.offset)))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3927) c_~A~0.base))) (+ (select .cse2 c_~A~0.offset) (select .cse2 (+ c_~A~0.offset 8)) (select .cse2 (+ c_~A~0.offset 4)) (select .cse2 (+ c_~A~0.offset 12)))))) (forall ((v_ArrVal_3927 (Array Int Int))) (< (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3927) c_~A~0.base))) (+ (select .cse3 c_~A~0.offset) (select .cse3 (+ c_~A~0.offset 8)) (select .cse3 (+ c_~A~0.offset 4)) (select .cse3 (+ c_~A~0.offset 12)))) (let ((.cse4 (select |c_#memory_int| c_~A~0.base)) (.cse5 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse4 (+ .cse5 c_~A~0.offset 8)) (select .cse4 (+ .cse5 c_~A~0.offset 4)) 1 (select .cse4 (+ .cse5 c_~A~0.offset))))))) is different from false [2021-11-25 18:38:35,780 INFO L354 Elim1Store]: treesize reduction 227, result has 43.3 percent of original size [2021-11-25 18:38:35,780 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 140 treesize of output 220 [2021-11-25 18:38:35,790 INFO L354 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2021-11-25 18:38:35,791 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 30 treesize of output 16 [2021-11-25 18:38:36,560 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:38:36,609 INFO L354 Elim1Store]: treesize reduction 383, result has 4.3 percent of original size [2021-11-25 18:38:36,609 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 70 treesize of output 30 [2021-11-25 18:38:36,752 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 10 not checked. [2021-11-25 18:38:36,753 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304498761] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:38:36,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [280681923] [2021-11-25 18:38:36,753 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:38:36,754 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:38:36,755 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13, 13] total 40 [2021-11-25 18:38:36,755 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478937427] [2021-11-25 18:38:36,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:38:36,755 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2021-11-25 18:38:36,755 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:38:36,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-11-25 18:38:36,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1291, Unknown=4, NotChecked=300, Total=1722 [2021-11-25 18:38:36,756 INFO L87 Difference]: Start difference. First operand 439 states and 1149 transitions. Second operand has 42 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 41 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:38:38,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:38:38,522 INFO L93 Difference]: Finished difference Result 537 states and 1377 transitions. [2021-11-25 18:38:38,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-25 18:38:38,522 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 41 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 26 [2021-11-25 18:38:38,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:38:38,523 INFO L225 Difference]: With dead ends: 537 [2021-11-25 18:38:38,523 INFO L226 Difference]: Without dead ends: 532 [2021-11-25 18:38:38,523 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 24 SyntacticMatches, 7 SemanticMatches, 55 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 696 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=267, Invalid=2501, Unknown=4, NotChecked=420, Total=3192 [2021-11-25 18:38:38,523 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 131 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 1502 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 1909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 363 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-25 18:38:38,524 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 89 Invalid, 1909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1502 Invalid, 0 Unknown, 363 Unchecked, 0.8s Time] [2021-11-25 18:38:38,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2021-11-25 18:38:38,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 463. [2021-11-25 18:38:38,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 462 states have (on average 2.606060606060606) internal successors, (1204), 462 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:38:38,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 1204 transitions. [2021-11-25 18:38:38,533 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 1204 transitions. Word has length 26 [2021-11-25 18:38:38,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:38:38,534 INFO L470 AbstractCegarLoop]: Abstraction has 463 states and 1204 transitions. [2021-11-25 18:38:38,534 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 41 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:38:38,534 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 1204 transitions. [2021-11-25 18:38:38,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-25 18:38:38,535 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:38:38,535 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:38:38,561 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (105)] Forceful destruction successful, exit code 0 [2021-11-25 18:38:38,749 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 105 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable106 [2021-11-25 18:38:38,749 INFO L402 AbstractCegarLoop]: === Iteration 108 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:38:38,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:38:38,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1320759056, now seen corresponding path program 103 times [2021-11-25 18:38:38,749 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:38:38,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203081132] [2021-11-25 18:38:38,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:38:38,750 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:38:38,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:38:39,413 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:38:39,413 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:38:39,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203081132] [2021-11-25 18:38:39,414 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203081132] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:38:39,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91024766] [2021-11-25 18:38:39,414 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 18:38:39,414 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:38:39,414 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:38:39,415 INFO L229 MonitoredProcess]: Starting monitored process 106 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:38:39,415 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (106)] Waiting until timeout for monitored process [2021-11-25 18:38:39,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:38:39,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 138 conjunts are in the unsatisfiable core [2021-11-25 18:38:39,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:38:39,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:38:39,960 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 29 treesize of output 27 [2021-11-25 18:38:40,282 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:38:40,282 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:38:40,605 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3970 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3970) c_~A~0.base))) (<= (+ c_~counter~0 (select .cse0 (+ (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) c_~A~0.offset))) (+ (select .cse0 (+ c_~A~0.offset 8)) (select .cse0 (+ c_~A~0.offset 12)) (select .cse0 (+ c_~A~0.offset 4)) (select .cse0 c_~A~0.offset))))) (forall ((v_ArrVal_3970 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3970) c_~A~0.base))) (< (+ (select .cse1 (+ c_~A~0.offset 8)) (select .cse1 (+ c_~A~0.offset 12)) (select .cse1 (+ c_~A~0.offset 4)) (select .cse1 c_~A~0.offset)) (+ c_~counter~0 (select .cse1 (+ (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) c_~A~0.offset)) 1))))) is different from false [2021-11-25 18:38:40,616 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3970 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3970) c_~A~0.base))) (<= (let ((.cse1 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse0 (+ .cse1 c_~A~0.offset 4)) (select (select |c_#memory_int| c_~A~0.base) (+ .cse1 c_~A~0.offset)))) (+ (select .cse0 (+ c_~A~0.offset 8)) (select .cse0 (+ c_~A~0.offset 12)) (select .cse0 (+ c_~A~0.offset 4)) (select .cse0 c_~A~0.offset))))) (forall ((v_ArrVal_3970 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3970) c_~A~0.base))) (< (+ (select .cse2 (+ c_~A~0.offset 8)) (select .cse2 (+ c_~A~0.offset 12)) (select .cse2 (+ c_~A~0.offset 4)) (select .cse2 c_~A~0.offset)) (let ((.cse3 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse2 (+ .cse3 c_~A~0.offset 4)) 1 (select (select |c_#memory_int| c_~A~0.base) (+ .cse3 c_~A~0.offset)))))))) is different from false [2021-11-25 18:38:40,628 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3970 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3970) c_~A~0.base))) (<= (let ((.cse2 (select |c_#memory_int| c_~A~0.base)) (.cse1 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse0 (+ .cse1 c_~A~0.offset 8)) (select .cse2 (+ .cse1 c_~A~0.offset 4)) (select .cse2 (+ .cse1 c_~A~0.offset)))) (+ (select .cse0 (+ c_~A~0.offset 8)) (select .cse0 (+ c_~A~0.offset 12)) (select .cse0 (+ c_~A~0.offset 4)) (select .cse0 c_~A~0.offset))))) (forall ((v_ArrVal_3970 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3970) c_~A~0.base))) (< (+ (select .cse3 (+ c_~A~0.offset 8)) (select .cse3 (+ c_~A~0.offset 12)) (select .cse3 (+ c_~A~0.offset 4)) (select .cse3 c_~A~0.offset)) (let ((.cse5 (select |c_#memory_int| c_~A~0.base)) (.cse4 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse3 (+ .cse4 c_~A~0.offset 8)) (select .cse5 (+ .cse4 c_~A~0.offset 4)) 1 (select .cse5 (+ .cse4 c_~A~0.offset)))))))) is different from false [2021-11-25 18:38:40,811 INFO L354 Elim1Store]: treesize reduction 227, result has 43.3 percent of original size [2021-11-25 18:38:40,812 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 138 treesize of output 227 [2021-11-25 18:38:40,859 INFO L354 Elim1Store]: treesize reduction 78, result has 37.6 percent of original size [2021-11-25 18:38:40,859 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 37 treesize of output 63 [2021-11-25 18:38:41,716 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:38:41,788 INFO L354 Elim1Store]: treesize reduction 383, result has 4.3 percent of original size [2021-11-25 18:38:41,788 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 70 treesize of output 30 [2021-11-25 18:38:41,944 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 7 not checked. [2021-11-25 18:38:41,944 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [91024766] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:38:41,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [532101296] [2021-11-25 18:38:41,944 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:38:41,944 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:38:41,945 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 13] total 45 [2021-11-25 18:38:41,945 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640401362] [2021-11-25 18:38:41,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:38:41,945 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2021-11-25 18:38:41,945 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:38:41,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-11-25 18:38:41,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1751, Unknown=3, NotChecked=258, Total=2162 [2021-11-25 18:38:41,946 INFO L87 Difference]: Start difference. First operand 463 states and 1204 transitions. Second operand has 47 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 46 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:38:45,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:38:45,714 INFO L93 Difference]: Finished difference Result 648 states and 1637 transitions. [2021-11-25 18:38:45,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-11-25 18:38:45,714 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 46 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 26 [2021-11-25 18:38:45,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:38:45,715 INFO L225 Difference]: With dead ends: 648 [2021-11-25 18:38:45,715 INFO L226 Difference]: Without dead ends: 643 [2021-11-25 18:38:45,715 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 21 SyntacticMatches, 11 SemanticMatches, 85 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1932 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=596, Invalid=6385, Unknown=3, NotChecked=498, Total=7482 [2021-11-25 18:38:45,716 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 182 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 1998 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 2432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 335 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-25 18:38:45,716 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [182 Valid, 93 Invalid, 2432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1998 Invalid, 0 Unknown, 335 Unchecked, 1.2s Time] [2021-11-25 18:38:45,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2021-11-25 18:38:45,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 475. [2021-11-25 18:38:45,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 474 states have (on average 2.611814345991561) internal successors, (1238), 474 states have internal predecessors, (1238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:38:45,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 1238 transitions. [2021-11-25 18:38:45,722 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 1238 transitions. Word has length 26 [2021-11-25 18:38:45,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:38:45,722 INFO L470 AbstractCegarLoop]: Abstraction has 475 states and 1238 transitions. [2021-11-25 18:38:45,723 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 46 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:38:45,723 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 1238 transitions. [2021-11-25 18:38:45,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-25 18:38:45,723 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:38:45,723 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:38:45,746 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (106)] Forceful destruction successful, exit code 0 [2021-11-25 18:38:45,924 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107,106 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:38:45,924 INFO L402 AbstractCegarLoop]: === Iteration 109 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:38:45,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:38:45,924 INFO L85 PathProgramCache]: Analyzing trace with hash -87568378, now seen corresponding path program 104 times [2021-11-25 18:38:45,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:38:45,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391459452] [2021-11-25 18:38:45,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:38:45,925 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:38:45,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:38:46,785 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:38:46,785 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:38:46,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391459452] [2021-11-25 18:38:46,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391459452] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:38:46,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592717717] [2021-11-25 18:38:46,785 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:38:46,785 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:38:46,786 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:38:46,786 INFO L229 MonitoredProcess]: Starting monitored process 107 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:38:46,787 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (107)] Waiting until timeout for monitored process [2021-11-25 18:38:47,052 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-11-25 18:38:47,052 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:38:47,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 153 conjunts are in the unsatisfiable core [2021-11-25 18:38:47,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:38:47,239 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-25 18:38:47,287 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 18:38:47,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:38:47,538 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 29 treesize of output 27 [2021-11-25 18:38:47,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:38:47,881 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:38:47,882 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 32 treesize of output 67 [2021-11-25 18:38:48,195 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:38:48,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:38:48,643 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:38:49,640 WARN L838 $PredicateComparison]: unable to prove that (forall ((|thread1Thread1of1ForFork0_~i~0#1| Int) (|v_thread2Thread1of1ForFork1_~i~1#1_809| Int)) (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0) (<= c_~N~0 |thread1Thread1of1ForFork0_~i~0#1|) (< (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_809|) c_~N~0) (<= c_~N~0 (+ |v_thread2Thread1of1ForFork1_~i~1#1_809| 1)) (and (forall ((v_ArrVal_4016 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4016) c_~A~0.base))) (<= (+ c_~counter~0 (select .cse0 (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) c_~A~0.offset))) (let ((.cse1 (* |v_thread2Thread1of1ForFork1_~i~1#1_809| 4))) (+ (select .cse0 (+ .cse1 c_~A~0.offset 4)) (select .cse0 (+ c_~A~0.offset 4)) (select .cse0 (+ .cse1 c_~A~0.offset)) (select .cse0 c_~A~0.offset)))))) (forall ((v_ArrVal_4016 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4016) c_~A~0.base))) (< (let ((.cse3 (* |v_thread2Thread1of1ForFork1_~i~1#1_809| 4))) (+ (select .cse2 (+ .cse3 c_~A~0.offset 4)) (select .cse2 (+ c_~A~0.offset 4)) (select .cse2 (+ .cse3 c_~A~0.offset)) (select .cse2 c_~A~0.offset))) (+ c_~counter~0 (select .cse2 (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) c_~A~0.offset)) 1))))))) is different from false [2021-11-25 18:38:49,642 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:38:49,804 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread2Thread1of1ForFork1_~i~1#1_809| Int) (|v_thread1Thread1of1ForFork0_~i~0#1_826| Int)) (or (<= c_~N~0 |v_thread1Thread1of1ForFork0_~i~0#1_826|) (< (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_809|) c_~N~0) (< (+ |v_thread1Thread1of1ForFork0_~i~0#1_826| 1) c_~N~0) (and (forall ((v_ArrVal_4016 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4016) c_~A~0.base))) (<= (+ c_~counter~0 (select .cse0 (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_826| 4) c_~A~0.offset)) (select (select |c_#memory_int| c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) c_~A~0.offset))) (let ((.cse1 (* |v_thread2Thread1of1ForFork1_~i~1#1_809| 4))) (+ (select .cse0 (+ .cse1 c_~A~0.offset 4)) (select .cse0 (+ c_~A~0.offset 4)) (select .cse0 (+ .cse1 c_~A~0.offset)) (select .cse0 c_~A~0.offset)))))) (forall ((v_ArrVal_4016 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4016) c_~A~0.base))) (< (let ((.cse3 (* |v_thread2Thread1of1ForFork1_~i~1#1_809| 4))) (+ (select .cse2 (+ .cse3 c_~A~0.offset 4)) (select .cse2 (+ c_~A~0.offset 4)) (select .cse2 (+ .cse3 c_~A~0.offset)) (select .cse2 c_~A~0.offset))) (+ c_~counter~0 (select .cse2 (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_826| 4) c_~A~0.offset)) 1 (select (select |c_#memory_int| c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) c_~A~0.offset))))))) (<= c_~N~0 (+ |v_thread2Thread1of1ForFork1_~i~1#1_809| 1)))) is different from false [2021-11-25 18:38:49,953 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread2Thread1of1ForFork1_~i~1#1_809| Int) (|v_thread1Thread1of1ForFork0_~i~0#1_826| Int)) (or (<= c_~N~0 |v_thread1Thread1of1ForFork0_~i~0#1_826|) (< (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_809|) c_~N~0) (< (+ |v_thread1Thread1of1ForFork0_~i~0#1_826| 1) c_~N~0) (<= c_~N~0 (+ |v_thread2Thread1of1ForFork1_~i~1#1_809| 1)) (and (forall ((v_ArrVal_4016 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4016) c_~A~0.base))) (< (let ((.cse1 (* |v_thread2Thread1of1ForFork1_~i~1#1_809| 4))) (+ (select .cse0 (+ .cse1 c_~A~0.offset 4)) (select .cse0 (+ c_~A~0.offset 4)) (select .cse0 (+ .cse1 c_~A~0.offset)) (select .cse0 c_~A~0.offset))) (let ((.cse2 (select |c_#memory_int| c_~A~0.base)) (.cse3 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse0 (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_826| 4) c_~A~0.offset)) (select .cse2 (+ .cse3 c_~A~0.offset 4)) 1 (select .cse2 (+ .cse3 c_~A~0.offset))))))) (forall ((v_ArrVal_4016 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4016) c_~A~0.base))) (<= (let ((.cse5 (select |c_#memory_int| c_~A~0.base)) (.cse6 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse4 (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_826| 4) c_~A~0.offset)) (select .cse5 (+ .cse6 c_~A~0.offset 4)) (select .cse5 (+ .cse6 c_~A~0.offset)))) (let ((.cse7 (* |v_thread2Thread1of1ForFork1_~i~1#1_809| 4))) (+ (select .cse4 (+ .cse7 c_~A~0.offset 4)) (select .cse4 (+ c_~A~0.offset 4)) (select .cse4 (+ .cse7 c_~A~0.offset)) (select .cse4 c_~A~0.offset))))))))) is different from false [2021-11-25 18:38:50,115 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread2Thread1of1ForFork1_~i~1#1_809| Int) (|v_thread1Thread1of1ForFork0_~i~0#1_826| Int)) (or (<= c_~N~0 |v_thread1Thread1of1ForFork0_~i~0#1_826|) (< (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_809|) c_~N~0) (< (+ |v_thread1Thread1of1ForFork0_~i~0#1_826| 1) c_~N~0) (and (forall ((v_ArrVal_4016 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4016) c_~A~0.base))) (< (let ((.cse1 (* |v_thread2Thread1of1ForFork1_~i~1#1_809| 4))) (+ (select .cse0 (+ .cse1 c_~A~0.offset 4)) (select .cse0 (+ c_~A~0.offset 4)) (select .cse0 (+ .cse1 c_~A~0.offset)) (select .cse0 c_~A~0.offset))) (let ((.cse2 (select |c_#memory_int| c_~A~0.base)) (.cse3 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse0 (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_826| 4) c_~A~0.offset)) (select .cse2 (+ .cse3 c_~A~0.offset 8)) (select .cse2 (+ .cse3 c_~A~0.offset 4)) 1 (select .cse2 (+ .cse3 c_~A~0.offset))))))) (forall ((v_ArrVal_4016 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4016) c_~A~0.base))) (<= (let ((.cse5 (select |c_#memory_int| c_~A~0.base)) (.cse6 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse4 (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_826| 4) c_~A~0.offset)) (select .cse5 (+ .cse6 c_~A~0.offset 8)) (select .cse5 (+ .cse6 c_~A~0.offset 4)) (select .cse5 (+ .cse6 c_~A~0.offset)))) (let ((.cse7 (* |v_thread2Thread1of1ForFork1_~i~1#1_809| 4))) (+ (select .cse4 (+ .cse7 c_~A~0.offset 4)) (select .cse4 (+ c_~A~0.offset 4)) (select .cse4 (+ .cse7 c_~A~0.offset)) (select .cse4 c_~A~0.offset))))))) (<= c_~N~0 (+ |v_thread2Thread1of1ForFork1_~i~1#1_809| 1)))) is different from false [2021-11-25 18:38:50,264 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread2Thread1of1ForFork1_~i~1#1_809| Int) (|v_thread1Thread1of1ForFork0_~i~0#1_826| Int)) (or (<= c_~N~0 |v_thread1Thread1of1ForFork0_~i~0#1_826|) (< (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_809|) c_~N~0) (< (+ |v_thread1Thread1of1ForFork0_~i~0#1_826| 1) c_~N~0) (and (forall ((v_ArrVal_4016 (Array Int Int))) (let ((.cse2 (+ c_~A~0.offset 4)) (.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4016) c_~A~0.base))) (<= (let ((.cse1 (select |c_#memory_int| c_~A~0.base))) (+ c_~counter~0 (select .cse0 (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_826| 4) c_~A~0.offset)) (select .cse1 c_~A~0.offset) (select .cse1 (+ c_~A~0.offset 8)) (select .cse1 .cse2))) (let ((.cse3 (* |v_thread2Thread1of1ForFork1_~i~1#1_809| 4))) (+ (select .cse0 (+ .cse3 c_~A~0.offset 4)) (select .cse0 .cse2) (select .cse0 (+ .cse3 c_~A~0.offset)) (select .cse0 c_~A~0.offset)))))) (forall ((v_ArrVal_4016 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4016) c_~A~0.base)) (.cse6 (+ c_~A~0.offset 4))) (< (let ((.cse5 (* |v_thread2Thread1of1ForFork1_~i~1#1_809| 4))) (+ (select .cse4 (+ .cse5 c_~A~0.offset 4)) (select .cse4 .cse6) (select .cse4 (+ .cse5 c_~A~0.offset)) (select .cse4 c_~A~0.offset))) (let ((.cse7 (select |c_#memory_int| c_~A~0.base))) (+ c_~counter~0 (select .cse4 (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_826| 4) c_~A~0.offset)) (select .cse7 c_~A~0.offset) (select .cse7 (+ c_~A~0.offset 8)) (select .cse7 .cse6) 1)))))) (<= c_~N~0 (+ |v_thread2Thread1of1ForFork1_~i~1#1_809| 1)))) is different from false [2021-11-25 18:38:50,828 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:38:50,828 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 398 treesize of output 219 [2021-11-25 18:38:50,985 INFO L354 Elim1Store]: treesize reduction 174, result has 41.0 percent of original size [2021-11-25 18:38:50,985 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 1850 treesize of output 1506 [2021-11-25 18:38:51,073 INFO L354 Elim1Store]: treesize reduction 96, result has 31.9 percent of original size [2021-11-25 18:38:51,073 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1361 treesize of output 1206 [2021-11-25 18:38:51,208 INFO L354 Elim1Store]: treesize reduction 141, result has 31.6 percent of original size [2021-11-25 18:38:51,208 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 1145 treesize of output 1054 [2021-11-25 18:38:51,336 INFO L354 Elim1Store]: treesize reduction 141, result has 31.6 percent of original size [2021-11-25 18:38:51,336 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 979 treesize of output 888 [2021-11-25 18:38:51,452 INFO L354 Elim1Store]: treesize reduction 94, result has 33.3 percent of original size [2021-11-25 18:38:51,453 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 813 treesize of output 660 [2021-11-25 18:38:57,824 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2021-11-25 18:38:57,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592717717] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:38:57,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [207126292] [2021-11-25 18:38:57,825 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:38:57,825 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:38:57,825 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 19] total 54 [2021-11-25 18:38:57,825 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083779429] [2021-11-25 18:38:57,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:38:57,826 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2021-11-25 18:38:57,826 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:38:57,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2021-11-25 18:38:57,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=2329, Unknown=5, NotChecked=510, Total=3080 [2021-11-25 18:38:57,826 INFO L87 Difference]: Start difference. First operand 475 states and 1238 transitions. Second operand has 56 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 55 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:39:03,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:39:03,636 INFO L93 Difference]: Finished difference Result 976 states and 2437 transitions. [2021-11-25 18:39:03,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2021-11-25 18:39:03,636 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 55 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-25 18:39:03,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:39:03,638 INFO L225 Difference]: With dead ends: 976 [2021-11-25 18:39:03,638 INFO L226 Difference]: Without dead ends: 966 [2021-11-25 18:39:03,638 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 26 SyntacticMatches, 7 SemanticMatches, 107 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2864 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=1235, Invalid=9492, Unknown=5, NotChecked=1040, Total=11772 [2021-11-25 18:39:03,639 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 334 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 1656 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 3017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 1656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1196 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:39:03,639 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [334 Valid, 170 Invalid, 3017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 1656 Invalid, 0 Unknown, 1196 Unchecked, 1.1s Time] [2021-11-25 18:39:03,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2021-11-25 18:39:03,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 477. [2021-11-25 18:39:03,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 476 states have (on average 2.615546218487395) internal successors, (1245), 476 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:39:03,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 1245 transitions. [2021-11-25 18:39:03,647 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 1245 transitions. Word has length 26 [2021-11-25 18:39:03,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:39:03,647 INFO L470 AbstractCegarLoop]: Abstraction has 477 states and 1245 transitions. [2021-11-25 18:39:03,647 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 55 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:39:03,647 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 1245 transitions. [2021-11-25 18:39:03,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-25 18:39:03,648 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:39:03,648 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:39:03,669 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (107)] Forceful destruction successful, exit code 0 [2021-11-25 18:39:03,848 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108,107 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:39:03,848 INFO L402 AbstractCegarLoop]: === Iteration 110 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:39:03,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:39:03,849 INFO L85 PathProgramCache]: Analyzing trace with hash 2061228158, now seen corresponding path program 105 times [2021-11-25 18:39:03,849 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:39:03,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917731288] [2021-11-25 18:39:03,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:39:03,849 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:39:03,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:39:04,566 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:39:04,566 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:39:04,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917731288] [2021-11-25 18:39:04,567 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917731288] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:39:04,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065714730] [2021-11-25 18:39:04,567 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 18:39:04,567 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:39:04,567 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:39:04,568 INFO L229 MonitoredProcess]: Starting monitored process 108 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:39:04,568 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (108)] Waiting until timeout for monitored process [2021-11-25 18:39:04,793 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 18:39:04,793 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:39:04,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 138 conjunts are in the unsatisfiable core [2021-11-25 18:39:04,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:39:05,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:39:05,187 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 29 treesize of output 27 [2021-11-25 18:39:05,528 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:39:05,528 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:39:05,873 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4059 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4059) c_~A~0.base))) (< (+ (select .cse0 (+ c_~A~0.offset 4)) (select .cse0 (+ c_~A~0.offset 12)) (select .cse0 (+ c_~A~0.offset 8)) (select .cse0 c_~A~0.offset)) (+ c_~counter~0 (select .cse0 (+ (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) c_~A~0.offset)) 1)))) (forall ((v_ArrVal_4059 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4059) c_~A~0.base))) (<= (+ c_~counter~0 (select .cse1 (+ (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) c_~A~0.offset))) (+ (select .cse1 (+ c_~A~0.offset 4)) (select .cse1 (+ c_~A~0.offset 12)) (select .cse1 (+ c_~A~0.offset 8)) (select .cse1 c_~A~0.offset)))))) is different from false [2021-11-25 18:39:05,884 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4059 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4059) c_~A~0.base))) (<= (let ((.cse1 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse0 (+ .cse1 c_~A~0.offset 4)) (select (select |c_#memory_int| c_~A~0.base) (+ .cse1 c_~A~0.offset)))) (+ (select .cse0 (+ c_~A~0.offset 4)) (select .cse0 (+ c_~A~0.offset 12)) (select .cse0 (+ c_~A~0.offset 8)) (select .cse0 c_~A~0.offset))))) (forall ((v_ArrVal_4059 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4059) c_~A~0.base))) (< (+ (select .cse2 (+ c_~A~0.offset 4)) (select .cse2 (+ c_~A~0.offset 12)) (select .cse2 (+ c_~A~0.offset 8)) (select .cse2 c_~A~0.offset)) (let ((.cse3 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse2 (+ .cse3 c_~A~0.offset 4)) 1 (select (select |c_#memory_int| c_~A~0.base) (+ .cse3 c_~A~0.offset)))))))) is different from false [2021-11-25 18:39:05,896 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4059 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4059) c_~A~0.base))) (<= (let ((.cse2 (select |c_#memory_int| c_~A~0.base)) (.cse1 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse0 (+ .cse1 c_~A~0.offset 8)) (select .cse2 (+ .cse1 c_~A~0.offset 4)) (select .cse2 (+ .cse1 c_~A~0.offset)))) (+ (select .cse0 (+ c_~A~0.offset 4)) (select .cse0 (+ c_~A~0.offset 12)) (select .cse0 (+ c_~A~0.offset 8)) (select .cse0 c_~A~0.offset))))) (forall ((v_ArrVal_4059 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4059) c_~A~0.base))) (< (+ (select .cse3 (+ c_~A~0.offset 4)) (select .cse3 (+ c_~A~0.offset 12)) (select .cse3 (+ c_~A~0.offset 8)) (select .cse3 c_~A~0.offset)) (let ((.cse5 (select |c_#memory_int| c_~A~0.base)) (.cse4 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse3 (+ .cse4 c_~A~0.offset 8)) (select .cse5 (+ .cse4 c_~A~0.offset 4)) 1 (select .cse5 (+ .cse4 c_~A~0.offset)))))))) is different from false [2021-11-25 18:39:06,081 INFO L354 Elim1Store]: treesize reduction 227, result has 43.3 percent of original size [2021-11-25 18:39:06,082 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 140 treesize of output 229 [2021-11-25 18:39:06,134 INFO L354 Elim1Store]: treesize reduction 78, result has 37.6 percent of original size [2021-11-25 18:39:06,135 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 38 treesize of output 64 [2021-11-25 18:39:07,097 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:39:07,147 INFO L354 Elim1Store]: treesize reduction 383, result has 4.3 percent of original size [2021-11-25 18:39:07,148 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 69 treesize of output 29 [2021-11-25 18:39:07,309 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 7 not checked. [2021-11-25 18:39:07,310 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1065714730] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:39:07,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [268445710] [2021-11-25 18:39:07,310 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:39:07,310 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:39:07,310 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 13] total 45 [2021-11-25 18:39:07,310 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787482311] [2021-11-25 18:39:07,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:39:07,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2021-11-25 18:39:07,311 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:39:07,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-11-25 18:39:07,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1743, Unknown=3, NotChecked=258, Total=2162 [2021-11-25 18:39:07,311 INFO L87 Difference]: Start difference. First operand 477 states and 1245 transitions. Second operand has 47 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 46 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:39:11,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:39:11,318 INFO L93 Difference]: Finished difference Result 666 states and 1692 transitions. [2021-11-25 18:39:11,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-11-25 18:39:11,318 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 46 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 26 [2021-11-25 18:39:11,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:39:11,319 INFO L225 Difference]: With dead ends: 666 [2021-11-25 18:39:11,319 INFO L226 Difference]: Without dead ends: 661 [2021-11-25 18:39:11,319 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 79 ConstructedPredicates, 3 IntricatePredicates, 3 DeprecatedPredicates, 1414 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=535, Invalid=5480, Unknown=3, NotChecked=462, Total=6480 [2021-11-25 18:39:11,320 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 161 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 2188 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 2765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 2188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 531 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-25 18:39:11,320 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 119 Invalid, 2765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 2188 Invalid, 0 Unknown, 531 Unchecked, 1.3s Time] [2021-11-25 18:39:11,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2021-11-25 18:39:11,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 500. [2021-11-25 18:39:11,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 499 states have (on average 2.62124248496994) internal successors, (1308), 499 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:39:11,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 1308 transitions. [2021-11-25 18:39:11,326 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 1308 transitions. Word has length 26 [2021-11-25 18:39:11,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:39:11,327 INFO L470 AbstractCegarLoop]: Abstraction has 500 states and 1308 transitions. [2021-11-25 18:39:11,327 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 46 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:39:11,327 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 1308 transitions. [2021-11-25 18:39:11,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-25 18:39:11,327 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:39:11,327 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:39:11,348 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (108)] Forceful destruction successful, exit code 0 [2021-11-25 18:39:11,528 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 108 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable109 [2021-11-25 18:39:11,528 INFO L402 AbstractCegarLoop]: === Iteration 111 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:39:11,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:39:11,528 INFO L85 PathProgramCache]: Analyzing trace with hash -45555962, now seen corresponding path program 106 times [2021-11-25 18:39:11,528 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:39:11,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5223495] [2021-11-25 18:39:11,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:39:11,529 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:39:11,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:39:12,228 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:39:12,228 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:39:12,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5223495] [2021-11-25 18:39:12,228 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5223495] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:39:12,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730642115] [2021-11-25 18:39:12,228 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 18:39:12,228 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:39:12,229 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:39:12,229 INFO L229 MonitoredProcess]: Starting monitored process 109 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:39:12,230 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (109)] Waiting until timeout for monitored process [2021-11-25 18:39:12,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:39:12,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 130 conjunts are in the unsatisfiable core [2021-11-25 18:39:12,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:39:12,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:39:12,696 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 32 treesize of output 30 [2021-11-25 18:39:12,980 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-25 18:39:12,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:39:13,303 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4102 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4102) c_~A~0.base))) (< (+ (select .cse0 c_~A~0.offset) (select .cse0 (+ c_~A~0.offset 12)) (select .cse0 (+ c_~A~0.offset 4)) (select .cse0 (+ c_~A~0.offset 8))) (+ c_~counter~0 (select .cse0 (+ (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) c_~A~0.offset)) 1)))) (forall ((v_ArrVal_4102 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4102) c_~A~0.base))) (<= (+ c_~counter~0 (select .cse1 (+ (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) c_~A~0.offset))) (+ (select .cse1 c_~A~0.offset) (select .cse1 (+ c_~A~0.offset 12)) (select .cse1 (+ c_~A~0.offset 4)) (select .cse1 (+ c_~A~0.offset 8))))))) is different from false [2021-11-25 18:39:13,328 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4102 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4102) c_~A~0.base))) (<= (let ((.cse1 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse0 (+ .cse1 c_~A~0.offset 4)) (select (select |c_#memory_int| c_~A~0.base) (+ .cse1 c_~A~0.offset)))) (+ (select .cse0 c_~A~0.offset) (select .cse0 (+ c_~A~0.offset 12)) (select .cse0 (+ c_~A~0.offset 4)) (select .cse0 (+ c_~A~0.offset 8)))))) (forall ((v_ArrVal_4102 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4102) c_~A~0.base))) (< (+ (select .cse2 c_~A~0.offset) (select .cse2 (+ c_~A~0.offset 12)) (select .cse2 (+ c_~A~0.offset 4)) (select .cse2 (+ c_~A~0.offset 8))) (let ((.cse3 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse2 (+ .cse3 c_~A~0.offset 4)) 1 (select (select |c_#memory_int| c_~A~0.base) (+ .cse3 c_~A~0.offset)))))))) is different from false [2021-11-25 18:39:13,340 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4102 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4102) c_~A~0.base))) (<= (let ((.cse0 (select |c_#memory_int| c_~A~0.base)) (.cse1 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse0 (+ .cse1 c_~A~0.offset 4)) (select .cse2 (+ .cse1 c_~A~0.offset 8)) (select .cse0 (+ .cse1 c_~A~0.offset)))) (+ (select .cse2 c_~A~0.offset) (select .cse2 (+ c_~A~0.offset 12)) (select .cse2 (+ c_~A~0.offset 4)) (select .cse2 (+ c_~A~0.offset 8)))))) (forall ((v_ArrVal_4102 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4102) c_~A~0.base))) (< (+ (select .cse3 c_~A~0.offset) (select .cse3 (+ c_~A~0.offset 12)) (select .cse3 (+ c_~A~0.offset 4)) (select .cse3 (+ c_~A~0.offset 8))) (let ((.cse4 (select |c_#memory_int| c_~A~0.base)) (.cse5 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse4 (+ .cse5 c_~A~0.offset 4)) (select .cse3 (+ .cse5 c_~A~0.offset 8)) 1 (select .cse4 (+ .cse5 c_~A~0.offset)))))))) is different from false [2021-11-25 18:39:13,516 INFO L354 Elim1Store]: treesize reduction 227, result has 43.3 percent of original size [2021-11-25 18:39:13,517 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 140 treesize of output 229 [2021-11-25 18:39:13,565 INFO L354 Elim1Store]: treesize reduction 78, result has 37.6 percent of original size [2021-11-25 18:39:13,565 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 38 treesize of output 64 [2021-11-25 18:39:14,410 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:39:14,461 INFO L354 Elim1Store]: treesize reduction 383, result has 4.3 percent of original size [2021-11-25 18:39:14,462 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 69 treesize of output 29 [2021-11-25 18:39:14,617 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 7 not checked. [2021-11-25 18:39:14,617 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1730642115] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:39:14,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1963167983] [2021-11-25 18:39:14,618 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:39:14,618 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:39:14,618 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13, 13] total 42 [2021-11-25 18:39:14,618 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172861229] [2021-11-25 18:39:14,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:39:14,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2021-11-25 18:39:14,619 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:39:14,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-11-25 18:39:14,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1499, Unknown=3, NotChecked=240, Total=1892 [2021-11-25 18:39:14,619 INFO L87 Difference]: Start difference. First operand 500 states and 1308 transitions. Second operand has 44 states, 43 states have (on average 1.372093023255814) internal successors, (59), 43 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:39:18,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:39:18,343 INFO L93 Difference]: Finished difference Result 677 states and 1730 transitions. [2021-11-25 18:39:18,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-11-25 18:39:18,344 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 1.372093023255814) internal successors, (59), 43 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-25 18:39:18,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:39:18,345 INFO L225 Difference]: With dead ends: 677 [2021-11-25 18:39:18,345 INFO L226 Difference]: Without dead ends: 672 [2021-11-25 18:39:18,345 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 25 SyntacticMatches, 8 SemanticMatches, 78 ConstructedPredicates, 3 IntricatePredicates, 2 DeprecatedPredicates, 1396 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=553, Invalid=5308, Unknown=3, NotChecked=456, Total=6320 [2021-11-25 18:39:18,346 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 172 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 1742 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 2154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 362 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:39:18,346 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [172 Valid, 77 Invalid, 2154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1742 Invalid, 0 Unknown, 362 Unchecked, 1.1s Time] [2021-11-25 18:39:18,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2021-11-25 18:39:18,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 515. [2021-11-25 18:39:18,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 514 states have (on average 2.6186770428015564) internal successors, (1346), 514 states have internal predecessors, (1346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:39:18,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 1346 transitions. [2021-11-25 18:39:18,354 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 1346 transitions. Word has length 26 [2021-11-25 18:39:18,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:39:18,354 INFO L470 AbstractCegarLoop]: Abstraction has 515 states and 1346 transitions. [2021-11-25 18:39:18,354 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 1.372093023255814) internal successors, (59), 43 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:39:18,354 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 1346 transitions. [2021-11-25 18:39:18,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-25 18:39:18,355 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:39:18,355 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:39:18,378 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (109)] Forceful destruction successful, exit code 0 [2021-11-25 18:39:18,555 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110,109 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:39:18,555 INFO L402 AbstractCegarLoop]: === Iteration 112 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:39:18,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:39:18,556 INFO L85 PathProgramCache]: Analyzing trace with hash -931354242, now seen corresponding path program 107 times [2021-11-25 18:39:18,556 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:39:18,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32994545] [2021-11-25 18:39:18,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:39:18,556 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:39:18,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:39:19,354 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:39:19,354 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:39:19,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32994545] [2021-11-25 18:39:19,354 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32994545] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:39:19,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508022132] [2021-11-25 18:39:19,355 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:39:19,355 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:39:19,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:39:19,355 INFO L229 MonitoredProcess]: Starting monitored process 110 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:39:19,356 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (110)] Waiting until timeout for monitored process [2021-11-25 18:39:19,614 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-11-25 18:39:19,614 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:39:19,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 147 conjunts are in the unsatisfiable core [2021-11-25 18:39:19,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:39:19,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:39:19,972 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 29 treesize of output 27 [2021-11-25 18:39:20,315 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:39:20,315 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 17 treesize of output 18 [2021-11-25 18:39:20,490 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:39:20,491 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:39:20,686 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:39:21,775 WARN L838 $PredicateComparison]: unable to prove that (forall ((|thread1Thread1of1ForFork0_~i~0#1| Int) (|v_thread2Thread1of1ForFork1_~i~1#1_839| Int)) (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0) (and (forall ((v_ArrVal_4145 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4145) c_~A~0.base))) (< (+ (select .cse0 (+ c_~A~0.offset 8)) (select .cse0 (+ c_~A~0.offset 4)) (select .cse0 (+ (* |v_thread2Thread1of1ForFork1_~i~1#1_839| 4) c_~A~0.offset)) (select .cse0 c_~A~0.offset)) (+ c_~counter~0 (select .cse0 (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) c_~A~0.offset)) 1)))) (forall ((v_ArrVal_4145 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4145) c_~A~0.base))) (<= (+ c_~counter~0 (select .cse1 (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) c_~A~0.offset))) (+ (select .cse1 (+ c_~A~0.offset 8)) (select .cse1 (+ c_~A~0.offset 4)) (select .cse1 (+ (* |v_thread2Thread1of1ForFork1_~i~1#1_839| 4) c_~A~0.offset)) (select .cse1 c_~A~0.offset)))))) (<= c_~N~0 |v_thread2Thread1of1ForFork1_~i~1#1_839|) (<= c_~N~0 |thread1Thread1of1ForFork0_~i~0#1|) (< (+ |v_thread2Thread1of1ForFork1_~i~1#1_839| 1) c_~N~0))) is different from false [2021-11-25 18:39:21,777 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:39:21,932 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork0_~i~0#1_857| Int) (|v_thread2Thread1of1ForFork1_~i~1#1_839| Int)) (or (<= c_~N~0 |v_thread2Thread1of1ForFork1_~i~1#1_839|) (<= c_~N~0 |v_thread1Thread1of1ForFork0_~i~0#1_857|) (< (+ |v_thread2Thread1of1ForFork1_~i~1#1_839| 1) c_~N~0) (and (forall ((v_ArrVal_4145 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4145) c_~A~0.base))) (<= (+ (select .cse0 (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_857| 4) c_~A~0.offset)) c_~counter~0 (select (select |c_#memory_int| c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) c_~A~0.offset))) (+ (select .cse0 (+ c_~A~0.offset 8)) (select .cse0 (+ c_~A~0.offset 4)) (select .cse0 (+ (* |v_thread2Thread1of1ForFork1_~i~1#1_839| 4) c_~A~0.offset)) (select .cse0 c_~A~0.offset))))) (forall ((v_ArrVal_4145 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4145) c_~A~0.base))) (< (+ (select .cse1 (+ c_~A~0.offset 8)) (select .cse1 (+ c_~A~0.offset 4)) (select .cse1 (+ (* |v_thread2Thread1of1ForFork1_~i~1#1_839| 4) c_~A~0.offset)) (select .cse1 c_~A~0.offset)) (+ (select .cse1 (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_857| 4) c_~A~0.offset)) c_~counter~0 1 (select (select |c_#memory_int| c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) c_~A~0.offset))))))) (< (+ |v_thread1Thread1of1ForFork0_~i~0#1_857| 1) c_~N~0))) is different from false [2021-11-25 18:39:22,098 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork0_~i~0#1_857| Int) (|v_thread2Thread1of1ForFork1_~i~1#1_839| Int)) (or (<= c_~N~0 |v_thread2Thread1of1ForFork1_~i~1#1_839|) (<= c_~N~0 |v_thread1Thread1of1ForFork0_~i~0#1_857|) (< (+ |v_thread2Thread1of1ForFork1_~i~1#1_839| 1) c_~N~0) (and (forall ((v_ArrVal_4145 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4145) c_~A~0.base))) (< (+ (select .cse0 (+ c_~A~0.offset 8)) (select .cse0 (+ c_~A~0.offset 4)) (select .cse0 (+ (* |v_thread2Thread1of1ForFork1_~i~1#1_839| 4) c_~A~0.offset)) (select .cse0 c_~A~0.offset)) (let ((.cse1 (select |c_#memory_int| c_~A~0.base)) (.cse2 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ (select .cse0 (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_857| 4) c_~A~0.offset)) c_~counter~0 (select .cse1 (+ .cse2 c_~A~0.offset 4)) 1 (select .cse1 (+ .cse2 c_~A~0.offset))))))) (forall ((v_ArrVal_4145 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4145) c_~A~0.base))) (<= (let ((.cse4 (select |c_#memory_int| c_~A~0.base)) (.cse5 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ (select .cse3 (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_857| 4) c_~A~0.offset)) c_~counter~0 (select .cse4 (+ .cse5 c_~A~0.offset 4)) (select .cse4 (+ .cse5 c_~A~0.offset)))) (+ (select .cse3 (+ c_~A~0.offset 8)) (select .cse3 (+ c_~A~0.offset 4)) (select .cse3 (+ (* |v_thread2Thread1of1ForFork1_~i~1#1_839| 4) c_~A~0.offset)) (select .cse3 c_~A~0.offset)))))) (< (+ |v_thread1Thread1of1ForFork0_~i~0#1_857| 1) c_~N~0))) is different from false [2021-11-25 18:39:22,311 INFO L354 Elim1Store]: treesize reduction 236, result has 42.0 percent of original size [2021-11-25 18:39:22,311 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 283 treesize of output 286 [2021-11-25 18:39:22,365 INFO L354 Elim1Store]: treesize reduction 94, result has 27.1 percent of original size [2021-11-25 18:39:22,366 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 111 treesize of output 124 [2021-11-25 18:39:22,421 INFO L354 Elim1Store]: treesize reduction 94, result has 27.1 percent of original size [2021-11-25 18:39:22,421 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 87 treesize of output 100 [2021-11-25 18:39:28,973 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 6 trivial. 7 not checked. [2021-11-25 18:39:28,973 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508022132] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:39:28,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1609942441] [2021-11-25 18:39:28,974 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:39:28,974 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:39:28,974 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 16] total 50 [2021-11-25 18:39:28,974 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818394954] [2021-11-25 18:39:28,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:39:28,974 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2021-11-25 18:39:28,975 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:39:28,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2021-11-25 18:39:28,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=2150, Unknown=3, NotChecked=288, Total=2652 [2021-11-25 18:39:28,975 INFO L87 Difference]: Start difference. First operand 515 states and 1346 transitions. Second operand has 52 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 51 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:39:33,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:39:33,777 INFO L93 Difference]: Finished difference Result 656 states and 1697 transitions. [2021-11-25 18:39:33,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-11-25 18:39:33,777 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 51 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-25 18:39:33,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:39:33,778 INFO L225 Difference]: With dead ends: 656 [2021-11-25 18:39:33,778 INFO L226 Difference]: Without dead ends: 651 [2021-11-25 18:39:33,778 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 19 SyntacticMatches, 5 SemanticMatches, 88 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1732 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=779, Invalid=6712, Unknown=3, NotChecked=516, Total=8010 [2021-11-25 18:39:33,779 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 195 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 1897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 935 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-25 18:39:33,779 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [195 Valid, 128 Invalid, 1897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 906 Invalid, 0 Unknown, 935 Unchecked, 0.6s Time] [2021-11-25 18:39:33,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2021-11-25 18:39:33,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 525. [2021-11-25 18:39:33,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 524 states have (on average 2.631679389312977) internal successors, (1379), 524 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:39:33,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 1379 transitions. [2021-11-25 18:39:33,786 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 1379 transitions. Word has length 26 [2021-11-25 18:39:33,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:39:33,786 INFO L470 AbstractCegarLoop]: Abstraction has 525 states and 1379 transitions. [2021-11-25 18:39:33,787 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 51 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:39:33,787 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 1379 transitions. [2021-11-25 18:39:33,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-25 18:39:33,787 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:39:33,787 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:39:33,812 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (110)] Forceful destruction successful, exit code 0 [2021-11-25 18:39:33,988 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 110 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable111 [2021-11-25 18:39:33,988 INFO L402 AbstractCegarLoop]: === Iteration 113 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:39:33,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:39:33,988 INFO L85 PathProgramCache]: Analyzing trace with hash 785800172, now seen corresponding path program 108 times [2021-11-25 18:39:33,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:39:33,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698642165] [2021-11-25 18:39:33,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:39:33,989 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:39:34,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:39:34,795 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:39:34,795 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:39:34,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698642165] [2021-11-25 18:39:34,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698642165] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:39:34,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286885725] [2021-11-25 18:39:34,796 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 18:39:34,796 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:39:34,796 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:39:34,797 INFO L229 MonitoredProcess]: Starting monitored process 111 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:39:34,797 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (111)] Waiting until timeout for monitored process [2021-11-25 18:39:35,030 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 18:39:35,030 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:39:35,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 138 conjunts are in the unsatisfiable core [2021-11-25 18:39:35,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:39:35,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:39:35,362 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 35 treesize of output 33 [2021-11-25 18:39:35,654 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:39:35,654 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:39:35,966 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4188 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4188) c_~A~0.base))) (<= (+ c_~counter~0 (select .cse0 (+ (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) c_~A~0.offset))) (+ (select .cse0 (+ c_~A~0.offset 8)) (select .cse0 (+ c_~A~0.offset 12)) (select .cse0 c_~A~0.offset) (select .cse0 (+ c_~A~0.offset 4)))))) (forall ((v_ArrVal_4188 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4188) c_~A~0.base))) (< (+ (select .cse1 (+ c_~A~0.offset 8)) (select .cse1 (+ c_~A~0.offset 12)) (select .cse1 c_~A~0.offset) (select .cse1 (+ c_~A~0.offset 4))) (+ c_~counter~0 (select .cse1 (+ (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) c_~A~0.offset)) 1))))) is different from false [2021-11-25 18:39:35,978 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4188 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4188) c_~A~0.base))) (< (+ (select .cse0 (+ c_~A~0.offset 8)) (select .cse0 (+ c_~A~0.offset 12)) (select .cse0 c_~A~0.offset) (select .cse0 (+ c_~A~0.offset 4))) (let ((.cse1 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse0 (+ .cse1 c_~A~0.offset 4)) 1 (select (select |c_#memory_int| c_~A~0.base) (+ .cse1 c_~A~0.offset))))))) (forall ((v_ArrVal_4188 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4188) c_~A~0.base))) (<= (let ((.cse3 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse2 (+ .cse3 c_~A~0.offset 4)) (select (select |c_#memory_int| c_~A~0.base) (+ .cse3 c_~A~0.offset)))) (+ (select .cse2 (+ c_~A~0.offset 8)) (select .cse2 (+ c_~A~0.offset 12)) (select .cse2 c_~A~0.offset) (select .cse2 (+ c_~A~0.offset 4))))))) is different from false [2021-11-25 18:39:35,990 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4188 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4188) c_~A~0.base))) (<= (let ((.cse0 (select |c_#memory_int| c_~A~0.base)) (.cse1 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse0 (+ .cse1 c_~A~0.offset 4)) (select .cse2 (+ .cse1 c_~A~0.offset 8)) (select .cse0 (+ .cse1 c_~A~0.offset)))) (+ (select .cse2 (+ c_~A~0.offset 8)) (select .cse2 (+ c_~A~0.offset 12)) (select .cse2 c_~A~0.offset) (select .cse2 (+ c_~A~0.offset 4)))))) (forall ((v_ArrVal_4188 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4188) c_~A~0.base))) (< (+ (select .cse3 (+ c_~A~0.offset 8)) (select .cse3 (+ c_~A~0.offset 12)) (select .cse3 c_~A~0.offset) (select .cse3 (+ c_~A~0.offset 4))) (let ((.cse4 (select |c_#memory_int| c_~A~0.base)) (.cse5 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse4 (+ .cse5 c_~A~0.offset 4)) (select .cse3 (+ .cse5 c_~A~0.offset 8)) 1 (select .cse4 (+ .cse5 c_~A~0.offset)))))))) is different from false [2021-11-25 18:39:36,178 INFO L354 Elim1Store]: treesize reduction 227, result has 43.3 percent of original size [2021-11-25 18:39:36,178 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 140 treesize of output 229 [2021-11-25 18:39:36,227 INFO L354 Elim1Store]: treesize reduction 78, result has 37.6 percent of original size [2021-11-25 18:39:36,227 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 38 treesize of output 64 [2021-11-25 18:39:37,746 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:39:37,798 INFO L354 Elim1Store]: treesize reduction 383, result has 4.3 percent of original size [2021-11-25 18:39:37,798 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 69 treesize of output 29 [2021-11-25 18:39:37,957 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 7 not checked. [2021-11-25 18:39:37,957 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286885725] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:39:37,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [529498511] [2021-11-25 18:39:37,958 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:39:37,959 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:39:37,959 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 13] total 45 [2021-11-25 18:39:37,959 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781958813] [2021-11-25 18:39:37,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:39:37,959 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2021-11-25 18:39:37,960 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:39:37,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-11-25 18:39:37,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1730, Unknown=3, NotChecked=258, Total=2162 [2021-11-25 18:39:37,960 INFO L87 Difference]: Start difference. First operand 525 states and 1379 transitions. Second operand has 47 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 46 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:39:41,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:39:41,415 INFO L93 Difference]: Finished difference Result 658 states and 1687 transitions. [2021-11-25 18:39:41,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-11-25 18:39:41,416 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 46 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 26 [2021-11-25 18:39:41,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:39:41,417 INFO L225 Difference]: With dead ends: 658 [2021-11-25 18:39:41,417 INFO L226 Difference]: Without dead ends: 653 [2021-11-25 18:39:41,417 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 21 SyntacticMatches, 6 SemanticMatches, 73 ConstructedPredicates, 3 IntricatePredicates, 2 DeprecatedPredicates, 1388 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=558, Invalid=4563, Unknown=3, NotChecked=426, Total=5550 [2021-11-25 18:39:41,417 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 185 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 2181 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 2707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 2181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 444 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-25 18:39:41,417 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [185 Valid, 91 Invalid, 2707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 2181 Invalid, 0 Unknown, 444 Unchecked, 1.3s Time] [2021-11-25 18:39:41,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2021-11-25 18:39:41,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 517. [2021-11-25 18:39:41,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 516 states have (on average 2.618217054263566) internal successors, (1351), 516 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:39:41,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 1351 transitions. [2021-11-25 18:39:41,424 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 1351 transitions. Word has length 26 [2021-11-25 18:39:41,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:39:41,425 INFO L470 AbstractCegarLoop]: Abstraction has 517 states and 1351 transitions. [2021-11-25 18:39:41,425 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 46 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:39:41,425 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 1351 transitions. [2021-11-25 18:39:41,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-25 18:39:41,425 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:39:41,425 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:39:41,447 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (111)] Ended with exit code 0 [2021-11-25 18:39:41,626 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 111 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable112 [2021-11-25 18:39:41,626 INFO L402 AbstractCegarLoop]: === Iteration 114 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:39:41,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:39:41,626 INFO L85 PathProgramCache]: Analyzing trace with hash 2063761110, now seen corresponding path program 109 times [2021-11-25 18:39:41,626 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:39:41,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414709275] [2021-11-25 18:39:41,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:39:41,627 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:39:41,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:39:42,341 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:39:42,341 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:39:42,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414709275] [2021-11-25 18:39:42,341 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414709275] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:39:42,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355150005] [2021-11-25 18:39:42,341 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 18:39:42,342 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:39:42,342 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:39:42,342 INFO L229 MonitoredProcess]: Starting monitored process 112 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:39:42,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (112)] Waiting until timeout for monitored process [2021-11-25 18:39:42,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:39:42,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 138 conjunts are in the unsatisfiable core [2021-11-25 18:39:42,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:39:42,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:39:42,860 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 22 treesize of output 22 [2021-11-25 18:39:43,194 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:39:43,194 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:39:43,593 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4231 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4231) c_~A~0.base))) (< (+ (select .cse0 c_~A~0.offset) (select .cse0 (+ c_~A~0.offset 8)) (select .cse0 (+ c_~A~0.offset 4)) (select .cse0 (+ c_~A~0.offset 12))) (let ((.cse1 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse0 (+ .cse1 c_~A~0.offset)) (select .cse0 (+ .cse1 c_~A~0.offset 4)) 1))))) (forall ((v_ArrVal_4231 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4231) c_~A~0.base))) (<= (let ((.cse3 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse2 (+ .cse3 c_~A~0.offset)) (select .cse2 (+ .cse3 c_~A~0.offset 4)))) (+ (select .cse2 c_~A~0.offset) (select .cse2 (+ c_~A~0.offset 8)) (select .cse2 (+ c_~A~0.offset 4)) (select .cse2 (+ c_~A~0.offset 12))))))) is different from false [2021-11-25 18:39:43,605 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4231 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4231) c_~A~0.base))) (<= (let ((.cse1 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse0 (+ .cse1 c_~A~0.offset 4)) (select .cse0 (+ .cse1 c_~A~0.offset 8)) (select (select |c_#memory_int| c_~A~0.base) (+ .cse1 c_~A~0.offset)))) (+ (select .cse0 c_~A~0.offset) (select .cse0 (+ c_~A~0.offset 8)) (select .cse0 (+ c_~A~0.offset 4)) (select .cse0 (+ c_~A~0.offset 12)))))) (forall ((v_ArrVal_4231 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4231) c_~A~0.base))) (< (+ (select .cse2 c_~A~0.offset) (select .cse2 (+ c_~A~0.offset 8)) (select .cse2 (+ c_~A~0.offset 4)) (select .cse2 (+ c_~A~0.offset 12))) (let ((.cse3 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse2 (+ .cse3 c_~A~0.offset 4)) (select .cse2 (+ .cse3 c_~A~0.offset 8)) 1 (select (select |c_#memory_int| c_~A~0.base) (+ .cse3 c_~A~0.offset)))))))) is different from false [2021-11-25 18:39:43,795 INFO L354 Elim1Store]: treesize reduction 227, result has 43.3 percent of original size [2021-11-25 18:39:43,795 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 136 treesize of output 234 [2021-11-25 18:39:43,877 INFO L354 Elim1Store]: treesize reduction 110, result has 45.3 percent of original size [2021-11-25 18:39:43,878 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 44 treesize of output 107 [2021-11-25 18:39:45,348 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:39:45,399 INFO L354 Elim1Store]: treesize reduction 383, result has 4.3 percent of original size [2021-11-25 18:39:45,399 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 70 treesize of output 30 [2021-11-25 18:39:45,559 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 4 not checked. [2021-11-25 18:39:45,560 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355150005] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:39:45,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [599639521] [2021-11-25 18:39:45,560 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:39:45,561 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:39:45,561 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 13] total 45 [2021-11-25 18:39:45,561 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022613701] [2021-11-25 18:39:45,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:39:45,561 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2021-11-25 18:39:45,561 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:39:45,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-11-25 18:39:45,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1838, Unknown=2, NotChecked=174, Total=2162 [2021-11-25 18:39:45,562 INFO L87 Difference]: Start difference. First operand 517 states and 1351 transitions. Second operand has 47 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 46 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:39:48,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:39:48,794 INFO L93 Difference]: Finished difference Result 651 states and 1674 transitions. [2021-11-25 18:39:48,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-11-25 18:39:48,795 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 46 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 26 [2021-11-25 18:39:48,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:39:48,796 INFO L225 Difference]: With dead ends: 651 [2021-11-25 18:39:48,796 INFO L226 Difference]: Without dead ends: 646 [2021-11-25 18:39:48,796 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 21 SyntacticMatches, 8 SemanticMatches, 74 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1450 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=443, Invalid=4965, Unknown=2, NotChecked=290, Total=5700 [2021-11-25 18:39:48,796 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 120 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 2292 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 2530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 183 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-25 18:39:48,797 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 96 Invalid, 2530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2292 Invalid, 0 Unknown, 183 Unchecked, 1.3s Time] [2021-11-25 18:39:48,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2021-11-25 18:39:48,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 527. [2021-11-25 18:39:48,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 526 states have (on average 2.6197718631178706) internal successors, (1378), 526 states have internal predecessors, (1378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:39:48,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 1378 transitions. [2021-11-25 18:39:48,804 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 1378 transitions. Word has length 26 [2021-11-25 18:39:48,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:39:48,804 INFO L470 AbstractCegarLoop]: Abstraction has 527 states and 1378 transitions. [2021-11-25 18:39:48,804 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 46 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:39:48,804 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 1378 transitions. [2021-11-25 18:39:48,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-25 18:39:48,805 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:39:48,805 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:39:48,826 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (112)] Forceful destruction successful, exit code 0 [2021-11-25 18:39:49,005 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 112 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable113 [2021-11-25 18:39:49,005 INFO L402 AbstractCegarLoop]: === Iteration 115 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:39:49,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:39:49,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1355283616, now seen corresponding path program 110 times [2021-11-25 18:39:49,006 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:39:49,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493150171] [2021-11-25 18:39:49,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:39:49,006 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:39:49,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:39:49,751 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:39:49,751 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:39:49,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493150171] [2021-11-25 18:39:49,751 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493150171] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:39:49,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2067305600] [2021-11-25 18:39:49,752 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:39:49,752 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:39:49,752 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:39:49,752 INFO L229 MonitoredProcess]: Starting monitored process 113 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:39:49,753 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (113)] Waiting until timeout for monitored process [2021-11-25 18:39:50,034 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-11-25 18:39:50,034 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:39:50,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 151 conjunts are in the unsatisfiable core [2021-11-25 18:39:50,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:39:50,172 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 15 treesize of output 11 [2021-11-25 18:39:50,221 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 18:39:50,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:39:50,371 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 25 treesize of output 25 [2021-11-25 18:39:50,742 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:39:50,742 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 17 treesize of output 18 [2021-11-25 18:39:50,828 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:39:50,828 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:39:51,477 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4277 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4277) c_~A~0.base))) (< (+ (select .cse0 (+ c_~A~0.offset 4)) (select .cse0 (+ c_~A~0.offset 8)) (select .cse0 c_~A~0.offset)) (+ c_~counter~0 (select .cse0 (+ (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) c_~A~0.offset)) 1)))) (forall ((v_ArrVal_4277 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4277) c_~A~0.base))) (<= (+ c_~counter~0 (select .cse1 (+ (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) c_~A~0.offset))) (+ (select .cse1 (+ c_~A~0.offset 4)) (select .cse1 (+ c_~A~0.offset 8)) (select .cse1 c_~A~0.offset)))))) is different from false [2021-11-25 18:39:51,488 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4277 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4277) c_~A~0.base))) (< (+ (select .cse0 (+ c_~A~0.offset 4)) (select .cse0 (+ c_~A~0.offset 8)) (select .cse0 c_~A~0.offset)) (let ((.cse1 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse0 (+ .cse1 c_~A~0.offset 4)) 1 (select (select |c_#memory_int| c_~A~0.base) (+ .cse1 c_~A~0.offset))))))) (forall ((v_ArrVal_4277 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4277) c_~A~0.base))) (<= (let ((.cse3 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse2 (+ .cse3 c_~A~0.offset 4)) (select (select |c_#memory_int| c_~A~0.base) (+ .cse3 c_~A~0.offset)))) (+ (select .cse2 (+ c_~A~0.offset 4)) (select .cse2 (+ c_~A~0.offset 8)) (select .cse2 c_~A~0.offset)))))) is different from false [2021-11-25 18:39:51,500 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4277 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4277) c_~A~0.base))) (<= (let ((.cse2 (select |c_#memory_int| c_~A~0.base)) (.cse1 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse0 (+ .cse1 c_~A~0.offset 8)) (select .cse2 (+ .cse1 c_~A~0.offset 4)) (select .cse2 (+ .cse1 c_~A~0.offset)))) (+ (select .cse0 (+ c_~A~0.offset 4)) (select .cse0 (+ c_~A~0.offset 8)) (select .cse0 c_~A~0.offset))))) (forall ((v_ArrVal_4277 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4277) c_~A~0.base))) (< (+ (select .cse3 (+ c_~A~0.offset 4)) (select .cse3 (+ c_~A~0.offset 8)) (select .cse3 c_~A~0.offset)) (let ((.cse5 (select |c_#memory_int| c_~A~0.base)) (.cse4 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse3 (+ .cse4 c_~A~0.offset 8)) (select .cse5 (+ .cse4 c_~A~0.offset 4)) 1 (select .cse5 (+ .cse4 c_~A~0.offset)))))))) is different from false [2021-11-25 18:39:51,509 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4277 (Array Int Int))) (let ((.cse1 (+ c_~A~0.offset 4))) (< (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4277) c_~A~0.base))) (+ (select .cse0 .cse1) (select .cse0 c_~A~0.offset))) (let ((.cse2 (select |c_#memory_int| c_~A~0.base))) (+ c_~counter~0 (select .cse2 c_~A~0.offset) (select .cse2 .cse1) 1))))) (forall ((v_ArrVal_4277 (Array Int Int))) (let ((.cse4 (+ c_~A~0.offset 4))) (<= (let ((.cse3 (select |c_#memory_int| c_~A~0.base))) (+ c_~counter~0 (select .cse3 c_~A~0.offset) (select .cse3 .cse4))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4277) c_~A~0.base))) (+ (select .cse5 .cse4) (select .cse5 c_~A~0.offset))))))) is different from false [2021-11-25 18:39:51,622 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:39:51,623 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 190 treesize of output 119 [2021-11-25 18:39:51,644 INFO L354 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2021-11-25 18:39:51,644 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 294 treesize of output 266 [2021-11-25 18:39:51,679 INFO L354 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2021-11-25 18:39:51,679 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 432 treesize of output 404 [2021-11-25 18:39:51,698 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-25 18:39:51,699 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 355 treesize of output 331 [2021-11-25 18:39:51,712 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-25 18:39:51,713 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 331 treesize of output 307 [2021-11-25 18:39:51,726 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-25 18:39:51,726 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 307 treesize of output 283 [2021-11-25 18:39:51,740 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-25 18:39:51,740 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 283 treesize of output 259 [2021-11-25 18:39:52,028 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 6 trivial. 7 not checked. [2021-11-25 18:39:52,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2067305600] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:39:52,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [170591205] [2021-11-25 18:39:52,029 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:39:52,030 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:39:52,030 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 15] total 49 [2021-11-25 18:39:52,030 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028708420] [2021-11-25 18:39:52,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:39:52,031 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2021-11-25 18:39:52,031 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:39:52,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2021-11-25 18:39:52,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1990, Unknown=4, NotChecked=372, Total=2550 [2021-11-25 18:39:52,032 INFO L87 Difference]: Start difference. First operand 527 states and 1378 transitions. Second operand has 51 states, 50 states have (on average 1.32) internal successors, (66), 50 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:39:55,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:39:55,665 INFO L93 Difference]: Finished difference Result 734 states and 1845 transitions. [2021-11-25 18:39:55,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2021-11-25 18:39:55,666 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 1.32) internal successors, (66), 50 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-25 18:39:55,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:39:55,667 INFO L225 Difference]: With dead ends: 734 [2021-11-25 18:39:55,667 INFO L226 Difference]: Without dead ends: 724 [2021-11-25 18:39:55,668 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 20 SyntacticMatches, 11 SemanticMatches, 88 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 2056 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=737, Invalid=6585, Unknown=4, NotChecked=684, Total=8010 [2021-11-25 18:39:55,668 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 207 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 1393 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 2491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 1393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 973 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-25 18:39:55,668 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 74 Invalid, 2491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 1393 Invalid, 0 Unknown, 973 Unchecked, 0.9s Time] [2021-11-25 18:39:55,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2021-11-25 18:39:55,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 535. [2021-11-25 18:39:55,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 534 states have (on average 2.6385767790262173) internal successors, (1409), 534 states have internal predecessors, (1409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:39:55,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 1409 transitions. [2021-11-25 18:39:55,676 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 1409 transitions. Word has length 26 [2021-11-25 18:39:55,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:39:55,676 INFO L470 AbstractCegarLoop]: Abstraction has 535 states and 1409 transitions. [2021-11-25 18:39:55,676 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 1.32) internal successors, (66), 50 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:39:55,677 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 1409 transitions. [2021-11-25 18:39:55,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-25 18:39:55,677 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:39:55,677 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:39:55,699 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (113)] Ended with exit code 0 [2021-11-25 18:39:55,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 113 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable114 [2021-11-25 18:39:55,878 INFO L402 AbstractCegarLoop]: === Iteration 116 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:39:55,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:39:55,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1263113486, now seen corresponding path program 111 times [2021-11-25 18:39:55,878 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:39:55,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276335768] [2021-11-25 18:39:55,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:39:55,879 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:39:55,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:39:56,717 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:39:56,717 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:39:56,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276335768] [2021-11-25 18:39:56,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276335768] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:39:56,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508954242] [2021-11-25 18:39:56,717 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 18:39:56,718 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:39:56,718 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:39:56,718 INFO L229 MonitoredProcess]: Starting monitored process 114 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:39:56,719 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (114)] Waiting until timeout for monitored process [2021-11-25 18:39:56,967 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 18:39:56,967 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:39:56,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 140 conjunts are in the unsatisfiable core [2021-11-25 18:39:56,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:39:57,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:39:57,254 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 22 treesize of output 22 [2021-11-25 18:39:57,587 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:39:57,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:39:57,984 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4320 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4320) c_~A~0.base))) (<= (let ((.cse1 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse0 (+ .cse1 c_~A~0.offset)) (select .cse0 (+ .cse1 c_~A~0.offset 4)))) (+ (select .cse0 (+ c_~A~0.offset 12)) (select .cse0 c_~A~0.offset) (select .cse0 (+ c_~A~0.offset 8)) (select .cse0 (+ c_~A~0.offset 4)))))) (forall ((v_ArrVal_4320 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4320) c_~A~0.base))) (< (+ (select .cse2 (+ c_~A~0.offset 12)) (select .cse2 c_~A~0.offset) (select .cse2 (+ c_~A~0.offset 8)) (select .cse2 (+ c_~A~0.offset 4))) (let ((.cse3 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse2 (+ .cse3 c_~A~0.offset)) (select .cse2 (+ .cse3 c_~A~0.offset 4)) 1)))))) is different from false [2021-11-25 18:39:57,996 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4320 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4320) c_~A~0.base))) (< (+ (select .cse0 (+ c_~A~0.offset 12)) (select .cse0 c_~A~0.offset) (select .cse0 (+ c_~A~0.offset 8)) (select .cse0 (+ c_~A~0.offset 4))) (let ((.cse1 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse0 (+ .cse1 c_~A~0.offset 8)) (select .cse0 (+ .cse1 c_~A~0.offset 4)) 1 (select (select |c_#memory_int| c_~A~0.base) (+ .cse1 c_~A~0.offset))))))) (forall ((v_ArrVal_4320 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4320) c_~A~0.base))) (<= (let ((.cse3 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse2 (+ .cse3 c_~A~0.offset 8)) (select .cse2 (+ .cse3 c_~A~0.offset 4)) (select (select |c_#memory_int| c_~A~0.base) (+ .cse3 c_~A~0.offset)))) (+ (select .cse2 (+ c_~A~0.offset 12)) (select .cse2 c_~A~0.offset) (select .cse2 (+ c_~A~0.offset 8)) (select .cse2 (+ c_~A~0.offset 4))))))) is different from false [2021-11-25 18:39:58,188 INFO L354 Elim1Store]: treesize reduction 227, result has 43.3 percent of original size [2021-11-25 18:39:58,188 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 136 treesize of output 234 [2021-11-25 18:39:58,288 INFO L354 Elim1Store]: treesize reduction 110, result has 45.3 percent of original size [2021-11-25 18:39:58,289 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 44 treesize of output 107 [2021-11-25 18:39:59,711 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:39:59,782 INFO L354 Elim1Store]: treesize reduction 383, result has 4.3 percent of original size [2021-11-25 18:39:59,782 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 70 treesize of output 30 [2021-11-25 18:39:59,961 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 4 not checked. [2021-11-25 18:39:59,961 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1508954242] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:39:59,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1515804095] [2021-11-25 18:39:59,962 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:39:59,962 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:39:59,962 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 13] total 45 [2021-11-25 18:39:59,962 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641816321] [2021-11-25 18:39:59,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:39:59,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2021-11-25 18:39:59,963 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:39:59,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-11-25 18:39:59,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1809, Unknown=2, NotChecked=174, Total=2162 [2021-11-25 18:39:59,963 INFO L87 Difference]: Start difference. First operand 535 states and 1409 transitions. Second operand has 47 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 46 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:40:03,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:40:03,874 INFO L93 Difference]: Finished difference Result 893 states and 2230 transitions. [2021-11-25 18:40:03,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2021-11-25 18:40:03,875 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 46 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 26 [2021-11-25 18:40:03,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:40:03,876 INFO L225 Difference]: With dead ends: 893 [2021-11-25 18:40:03,876 INFO L226 Difference]: Without dead ends: 874 [2021-11-25 18:40:03,876 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 84 ConstructedPredicates, 2 IntricatePredicates, 3 DeprecatedPredicates, 1758 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=647, Invalid=6331, Unknown=2, NotChecked=330, Total=7310 [2021-11-25 18:40:03,877 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 190 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 2491 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 2807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 260 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-11-25 18:40:03,877 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [190 Valid, 92 Invalid, 2807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 2491 Invalid, 0 Unknown, 260 Unchecked, 1.5s Time] [2021-11-25 18:40:03,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2021-11-25 18:40:03,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 567. [2021-11-25 18:40:03,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 566 states have (on average 2.6696113074204946) internal successors, (1511), 566 states have internal predecessors, (1511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:40:03,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 1511 transitions. [2021-11-25 18:40:03,895 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 1511 transitions. Word has length 26 [2021-11-25 18:40:03,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:40:03,895 INFO L470 AbstractCegarLoop]: Abstraction has 567 states and 1511 transitions. [2021-11-25 18:40:03,895 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 46 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:40:03,895 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 1511 transitions. [2021-11-25 18:40:03,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-25 18:40:03,896 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:40:03,896 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:40:03,918 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (114)] Ended with exit code 0 [2021-11-25 18:40:04,097 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115,114 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:40:04,097 INFO L402 AbstractCegarLoop]: === Iteration 117 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:40:04,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:40:04,097 INFO L85 PathProgramCache]: Analyzing trace with hash -53043818, now seen corresponding path program 112 times [2021-11-25 18:40:04,097 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:40:04,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789071152] [2021-11-25 18:40:04,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:40:04,098 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:40:04,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:40:04,791 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:40:04,791 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:40:04,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789071152] [2021-11-25 18:40:04,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789071152] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:40:04,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214831061] [2021-11-25 18:40:04,791 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 18:40:04,791 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:40:04,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:40:04,792 INFO L229 MonitoredProcess]: Starting monitored process 115 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:40:04,793 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (115)] Waiting until timeout for monitored process [2021-11-25 18:40:05,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:40:05,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 140 conjunts are in the unsatisfiable core [2021-11-25 18:40:05,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:40:05,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:40:05,303 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 25 treesize of output 25 [2021-11-25 18:40:05,613 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:40:05,613 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:40:05,990 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4363 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4363) c_~A~0.base))) (<= (let ((.cse1 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse0 (+ .cse1 c_~A~0.offset 4)) (select .cse0 (+ .cse1 c_~A~0.offset)))) (+ (select .cse0 c_~A~0.offset) (select .cse0 (+ c_~A~0.offset 8)) (select .cse0 (+ c_~A~0.offset 12)) (select .cse0 (+ c_~A~0.offset 4)))))) (forall ((v_ArrVal_4363 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4363) c_~A~0.base))) (< (+ (select .cse2 c_~A~0.offset) (select .cse2 (+ c_~A~0.offset 8)) (select .cse2 (+ c_~A~0.offset 12)) (select .cse2 (+ c_~A~0.offset 4))) (let ((.cse3 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse2 (+ .cse3 c_~A~0.offset 4)) (select .cse2 (+ .cse3 c_~A~0.offset)) 1)))))) is different from false [2021-11-25 18:40:06,002 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4363 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4363) c_~A~0.base))) (< (+ (select .cse0 c_~A~0.offset) (select .cse0 (+ c_~A~0.offset 8)) (select .cse0 (+ c_~A~0.offset 12)) (select .cse0 (+ c_~A~0.offset 4))) (let ((.cse1 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse0 (+ .cse1 c_~A~0.offset 4)) (select .cse0 (+ .cse1 c_~A~0.offset 8)) 1 (select (select |c_#memory_int| c_~A~0.base) (+ .cse1 c_~A~0.offset))))))) (forall ((v_ArrVal_4363 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4363) c_~A~0.base))) (<= (let ((.cse3 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse2 (+ .cse3 c_~A~0.offset 4)) (select .cse2 (+ .cse3 c_~A~0.offset 8)) (select (select |c_#memory_int| c_~A~0.base) (+ .cse3 c_~A~0.offset)))) (+ (select .cse2 c_~A~0.offset) (select .cse2 (+ c_~A~0.offset 8)) (select .cse2 (+ c_~A~0.offset 12)) (select .cse2 (+ c_~A~0.offset 4))))))) is different from false [2021-11-25 18:40:06,191 INFO L354 Elim1Store]: treesize reduction 227, result has 43.3 percent of original size [2021-11-25 18:40:06,191 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 136 treesize of output 234 [2021-11-25 18:40:06,284 INFO L354 Elim1Store]: treesize reduction 110, result has 45.3 percent of original size [2021-11-25 18:40:06,284 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 44 treesize of output 107 [2021-11-25 18:40:07,459 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:40:07,512 INFO L354 Elim1Store]: treesize reduction 383, result has 4.3 percent of original size [2021-11-25 18:40:07,512 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 70 treesize of output 30 [2021-11-25 18:40:07,679 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 4 not checked. [2021-11-25 18:40:07,679 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214831061] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:40:07,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [90942039] [2021-11-25 18:40:07,680 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:40:07,681 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:40:07,681 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 13] total 45 [2021-11-25 18:40:07,682 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935011068] [2021-11-25 18:40:07,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:40:07,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2021-11-25 18:40:07,682 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:40:07,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-11-25 18:40:07,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1800, Unknown=2, NotChecked=174, Total=2162 [2021-11-25 18:40:07,683 INFO L87 Difference]: Start difference. First operand 567 states and 1511 transitions. Second operand has 47 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 46 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:40:11,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:40:11,596 INFO L93 Difference]: Finished difference Result 846 states and 2136 transitions. [2021-11-25 18:40:11,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-11-25 18:40:11,597 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 46 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 26 [2021-11-25 18:40:11,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:40:11,598 INFO L225 Difference]: With dead ends: 846 [2021-11-25 18:40:11,598 INFO L226 Difference]: Without dead ends: 826 [2021-11-25 18:40:11,599 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 83 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1850 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=654, Invalid=6158, Unknown=2, NotChecked=326, Total=7140 [2021-11-25 18:40:11,599 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 198 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 2583 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 2941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 2583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 286 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-11-25 18:40:11,599 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [198 Valid, 74 Invalid, 2941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 2583 Invalid, 0 Unknown, 286 Unchecked, 1.6s Time] [2021-11-25 18:40:11,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2021-11-25 18:40:11,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 577. [2021-11-25 18:40:11,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 576 states have (on average 2.6979166666666665) internal successors, (1554), 576 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:40:11,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 1554 transitions. [2021-11-25 18:40:11,608 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 1554 transitions. Word has length 26 [2021-11-25 18:40:11,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:40:11,609 INFO L470 AbstractCegarLoop]: Abstraction has 577 states and 1554 transitions. [2021-11-25 18:40:11,609 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 46 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:40:11,609 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 1554 transitions. [2021-11-25 18:40:11,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-25 18:40:11,609 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:40:11,610 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:40:11,631 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (115)] Ended with exit code 0 [2021-11-25 18:40:11,810 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 115 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable116 [2021-11-25 18:40:11,810 INFO L402 AbstractCegarLoop]: === Iteration 118 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:40:11,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:40:11,810 INFO L85 PathProgramCache]: Analyzing trace with hash 2135139358, now seen corresponding path program 113 times [2021-11-25 18:40:11,811 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:40:11,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022697255] [2021-11-25 18:40:11,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:40:11,811 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:40:11,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:40:12,606 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:40:12,607 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:40:12,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022697255] [2021-11-25 18:40:12,607 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022697255] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:40:12,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616456593] [2021-11-25 18:40:12,607 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:40:12,607 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:40:12,607 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:40:12,608 INFO L229 MonitoredProcess]: Starting monitored process 116 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:40:12,609 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (116)] Waiting until timeout for monitored process [2021-11-25 18:40:12,899 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-11-25 18:40:12,899 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:40:12,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 153 conjunts are in the unsatisfiable core [2021-11-25 18:40:12,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:40:13,062 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-25 18:40:13,118 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 18:40:13,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:40:13,300 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 22 treesize of output 22 [2021-11-25 18:40:13,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:40:13,687 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:40:13,688 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 32 treesize of output 67 [2021-11-25 18:40:14,107 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:40:14,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:40:14,551 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:40:14,755 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:40:15,844 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread2Thread1of1ForFork1_~i~1#1_901| Int) (|v_thread1Thread1of1ForFork0_~i~0#1_918| Int)) (or (<= c_~N~0 |v_thread1Thread1of1ForFork0_~i~0#1_918|) (< (+ |v_thread1Thread1of1ForFork0_~i~0#1_918| 1) c_~N~0) (and (forall ((v_ArrVal_4409 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4409) c_~A~0.base))) (<= (+ c_~counter~0 (select .cse0 (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_918| 4) c_~A~0.offset)) (select .cse0 (+ (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) c_~A~0.offset))) (let ((.cse1 (* |v_thread2Thread1of1ForFork1_~i~1#1_901| 4))) (+ (select .cse0 c_~A~0.offset) (select .cse0 (+ .cse1 c_~A~0.offset)) (select .cse0 (+ c_~A~0.offset 4)) (select .cse0 (+ .cse1 c_~A~0.offset 4))))))) (forall ((v_ArrVal_4409 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4409) c_~A~0.base))) (< (let ((.cse3 (* |v_thread2Thread1of1ForFork1_~i~1#1_901| 4))) (+ (select .cse2 c_~A~0.offset) (select .cse2 (+ .cse3 c_~A~0.offset)) (select .cse2 (+ c_~A~0.offset 4)) (select .cse2 (+ .cse3 c_~A~0.offset 4)))) (+ c_~counter~0 (select .cse2 (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_918| 4) c_~A~0.offset)) (select .cse2 (+ (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) c_~A~0.offset)) 1))))) (<= c_~N~0 (+ |v_thread2Thread1of1ForFork1_~i~1#1_901| 1)) (< (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_901|) c_~N~0))) is different from false [2021-11-25 18:40:16,018 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread2Thread1of1ForFork1_~i~1#1_901| Int) (|v_thread1Thread1of1ForFork0_~i~0#1_918| Int)) (or (<= c_~N~0 |v_thread1Thread1of1ForFork0_~i~0#1_918|) (< (+ |v_thread1Thread1of1ForFork0_~i~0#1_918| 1) c_~N~0) (and (forall ((v_ArrVal_4409 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4409) c_~A~0.base))) (< (let ((.cse1 (* |v_thread2Thread1of1ForFork1_~i~1#1_901| 4))) (+ (select .cse0 c_~A~0.offset) (select .cse0 (+ .cse1 c_~A~0.offset)) (select .cse0 (+ c_~A~0.offset 4)) (select .cse0 (+ .cse1 c_~A~0.offset 4)))) (let ((.cse2 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse0 (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_918| 4) c_~A~0.offset)) (select .cse0 (+ .cse2 c_~A~0.offset 4)) 1 (select (select |c_#memory_int| c_~A~0.base) (+ .cse2 c_~A~0.offset))))))) (forall ((v_ArrVal_4409 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4409) c_~A~0.base))) (<= (let ((.cse4 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse3 (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_918| 4) c_~A~0.offset)) (select .cse3 (+ .cse4 c_~A~0.offset 4)) (select (select |c_#memory_int| c_~A~0.base) (+ .cse4 c_~A~0.offset)))) (let ((.cse5 (* |v_thread2Thread1of1ForFork1_~i~1#1_901| 4))) (+ (select .cse3 c_~A~0.offset) (select .cse3 (+ .cse5 c_~A~0.offset)) (select .cse3 (+ c_~A~0.offset 4)) (select .cse3 (+ .cse5 c_~A~0.offset 4)))))))) (<= c_~N~0 (+ |v_thread2Thread1of1ForFork1_~i~1#1_901| 1)) (< (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_901|) c_~N~0))) is different from false [2021-11-25 18:40:16,181 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread2Thread1of1ForFork1_~i~1#1_901| Int) (|v_thread1Thread1of1ForFork0_~i~0#1_918| Int)) (or (<= c_~N~0 |v_thread1Thread1of1ForFork0_~i~0#1_918|) (and (forall ((v_ArrVal_4409 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4409) c_~A~0.base))) (< (let ((.cse1 (* |v_thread2Thread1of1ForFork1_~i~1#1_901| 4))) (+ (select .cse0 c_~A~0.offset) (select .cse0 (+ .cse1 c_~A~0.offset)) (select .cse0 (+ c_~A~0.offset 4)) (select .cse0 (+ .cse1 c_~A~0.offset 4)))) (let ((.cse2 (select |c_#memory_int| c_~A~0.base)) (.cse3 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse0 (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_918| 4) c_~A~0.offset)) (select .cse2 (+ .cse3 c_~A~0.offset 4)) (select .cse0 (+ .cse3 c_~A~0.offset 8)) 1 (select .cse2 (+ .cse3 c_~A~0.offset))))))) (forall ((v_ArrVal_4409 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4409) c_~A~0.base))) (<= (let ((.cse5 (select |c_#memory_int| c_~A~0.base)) (.cse6 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse4 (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_918| 4) c_~A~0.offset)) (select .cse5 (+ .cse6 c_~A~0.offset 4)) (select .cse4 (+ .cse6 c_~A~0.offset 8)) (select .cse5 (+ .cse6 c_~A~0.offset)))) (let ((.cse7 (* |v_thread2Thread1of1ForFork1_~i~1#1_901| 4))) (+ (select .cse4 c_~A~0.offset) (select .cse4 (+ .cse7 c_~A~0.offset)) (select .cse4 (+ c_~A~0.offset 4)) (select .cse4 (+ .cse7 c_~A~0.offset 4)))))))) (< (+ |v_thread1Thread1of1ForFork0_~i~0#1_918| 1) c_~N~0) (<= c_~N~0 (+ |v_thread2Thread1of1ForFork1_~i~1#1_901| 1)) (< (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_901|) c_~N~0))) is different from false [2021-11-25 18:40:16,341 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread2Thread1of1ForFork1_~i~1#1_901| Int) (|v_thread1Thread1of1ForFork0_~i~0#1_918| Int)) (or (and (forall ((v_ArrVal_4409 (Array Int Int))) (let ((.cse2 (+ c_~A~0.offset 4)) (.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4409) c_~A~0.base))) (<= (let ((.cse0 (select |c_#memory_int| c_~A~0.base))) (+ c_~counter~0 (select .cse0 c_~A~0.offset) (select .cse1 (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_918| 4) c_~A~0.offset)) (select .cse1 (+ c_~A~0.offset 8)) (select .cse0 .cse2))) (let ((.cse3 (* |v_thread2Thread1of1ForFork1_~i~1#1_901| 4))) (+ (select .cse1 c_~A~0.offset) (select .cse1 (+ .cse3 c_~A~0.offset)) (select .cse1 .cse2) (select .cse1 (+ .cse3 c_~A~0.offset 4))))))) (forall ((v_ArrVal_4409 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4409) c_~A~0.base)) (.cse6 (+ c_~A~0.offset 4))) (< (let ((.cse5 (* |v_thread2Thread1of1ForFork1_~i~1#1_901| 4))) (+ (select .cse4 c_~A~0.offset) (select .cse4 (+ .cse5 c_~A~0.offset)) (select .cse4 .cse6) (select .cse4 (+ .cse5 c_~A~0.offset 4)))) (let ((.cse7 (select |c_#memory_int| c_~A~0.base))) (+ c_~counter~0 (select .cse7 c_~A~0.offset) (select .cse4 (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_918| 4) c_~A~0.offset)) (select .cse4 (+ c_~A~0.offset 8)) (select .cse7 .cse6) 1)))))) (<= c_~N~0 |v_thread1Thread1of1ForFork0_~i~0#1_918|) (< (+ |v_thread1Thread1of1ForFork0_~i~0#1_918| 1) c_~N~0) (<= c_~N~0 (+ |v_thread2Thread1of1ForFork1_~i~1#1_901| 1)) (< (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_901|) c_~N~0))) is different from false [2021-11-25 18:40:16,907 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:40:16,908 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 404 treesize of output 225 [2021-11-25 18:40:17,075 INFO L354 Elim1Store]: treesize reduction 174, result has 41.0 percent of original size [2021-11-25 18:40:17,075 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 1834 treesize of output 1538 [2021-11-25 18:40:17,205 INFO L354 Elim1Store]: treesize reduction 139, result has 32.5 percent of original size [2021-11-25 18:40:17,205 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 1393 treesize of output 1228 [2021-11-25 18:40:17,344 INFO L354 Elim1Store]: treesize reduction 139, result has 32.5 percent of original size [2021-11-25 18:40:17,344 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 1145 treesize of output 1072 [2021-11-25 18:40:17,466 INFO L354 Elim1Store]: treesize reduction 139, result has 32.5 percent of original size [2021-11-25 18:40:17,467 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 995 treesize of output 830 [2021-11-25 18:40:17,625 INFO L354 Elim1Store]: treesize reduction 139, result has 32.5 percent of original size [2021-11-25 18:40:17,625 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 747 treesize of output 674 [2021-11-25 18:41:58,249 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2021-11-25 18:41:58,249 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616456593] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:41:58,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1989157497] [2021-11-25 18:41:58,250 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:41:58,251 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:41:58,251 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 19] total 53 [2021-11-25 18:41:58,251 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858496991] [2021-11-25 18:41:58,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:41:58,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2021-11-25 18:41:58,251 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:41:58,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2021-11-25 18:41:58,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=2286, Unknown=4, NotChecked=404, Total=2970 [2021-11-25 18:41:58,252 INFO L87 Difference]: Start difference. First operand 577 states and 1554 transitions. Second operand has 55 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 54 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:42:02,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:42:02,586 INFO L93 Difference]: Finished difference Result 1046 states and 2667 transitions. [2021-11-25 18:42:02,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2021-11-25 18:42:02,586 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 54 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-25 18:42:02,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:42:02,588 INFO L225 Difference]: With dead ends: 1046 [2021-11-25 18:42:02,589 INFO L226 Difference]: Without dead ends: 1036 [2021-11-25 18:42:02,589 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 31 SyntacticMatches, 9 SemanticMatches, 96 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 2431 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1090, Invalid=7664, Unknown=4, NotChecked=748, Total=9506 [2021-11-25 18:42:02,589 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 234 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 1288 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 2880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 1288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1469 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-25 18:42:02,589 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [234 Valid, 127 Invalid, 2880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1288 Invalid, 0 Unknown, 1469 Unchecked, 0.8s Time] [2021-11-25 18:42:02,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2021-11-25 18:42:02,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 583. [2021-11-25 18:42:02,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 582 states have (on average 2.695876288659794) internal successors, (1569), 582 states have internal predecessors, (1569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:42:02,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 1569 transitions. [2021-11-25 18:42:02,601 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 1569 transitions. Word has length 26 [2021-11-25 18:42:02,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:42:02,601 INFO L470 AbstractCegarLoop]: Abstraction has 583 states and 1569 transitions. [2021-11-25 18:42:02,601 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 54 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:42:02,601 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 1569 transitions. [2021-11-25 18:42:02,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-25 18:42:02,602 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:42:02,602 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:42:02,623 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (116)] Ended with exit code 0 [2021-11-25 18:42:02,802 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 116 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable117 [2021-11-25 18:42:02,803 INFO L402 AbstractCegarLoop]: === Iteration 119 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:42:02,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:42:02,803 INFO L85 PathProgramCache]: Analyzing trace with hash -11031402, now seen corresponding path program 114 times [2021-11-25 18:42:02,803 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:42:02,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778542107] [2021-11-25 18:42:02,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:42:02,803 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:42:02,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:42:03,570 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:42:03,570 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:42:03,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778542107] [2021-11-25 18:42:03,570 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778542107] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:42:03,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452709077] [2021-11-25 18:42:03,571 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 18:42:03,571 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:42:03,571 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:42:03,571 INFO L229 MonitoredProcess]: Starting monitored process 117 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:42:03,572 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (117)] Waiting until timeout for monitored process [2021-11-25 18:42:03,814 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 18:42:03,814 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:42:03,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 138 conjunts are in the unsatisfiable core [2021-11-25 18:42:03,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:42:04,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:42:04,114 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 30 treesize of output 30 [2021-11-25 18:42:04,481 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:42:04,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:42:04,873 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4452 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4452) c_~A~0.base))) (<= (let ((.cse1 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse0 (+ .cse1 c_~A~0.offset 4)) (select .cse0 (+ .cse1 c_~A~0.offset)))) (+ (select .cse0 c_~A~0.offset) (select .cse0 (+ c_~A~0.offset 8)) (select .cse0 (+ c_~A~0.offset 12)) (select .cse0 (+ c_~A~0.offset 4)))))) (forall ((v_ArrVal_4452 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4452) c_~A~0.base))) (< (+ (select .cse2 c_~A~0.offset) (select .cse2 (+ c_~A~0.offset 8)) (select .cse2 (+ c_~A~0.offset 12)) (select .cse2 (+ c_~A~0.offset 4))) (let ((.cse3 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse2 (+ .cse3 c_~A~0.offset 4)) 1 (select .cse2 (+ .cse3 c_~A~0.offset)))))))) is different from false [2021-11-25 18:42:04,885 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4452 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4452) c_~A~0.base))) (< (+ (select .cse0 c_~A~0.offset) (select .cse0 (+ c_~A~0.offset 8)) (select .cse0 (+ c_~A~0.offset 12)) (select .cse0 (+ c_~A~0.offset 4))) (let ((.cse1 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse0 (+ .cse1 c_~A~0.offset 4)) (select .cse0 (+ .cse1 c_~A~0.offset 8)) 1 (select (select |c_#memory_int| c_~A~0.base) (+ .cse1 c_~A~0.offset))))))) (forall ((v_ArrVal_4452 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4452) c_~A~0.base))) (<= (let ((.cse3 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse2 (+ .cse3 c_~A~0.offset 4)) (select .cse2 (+ .cse3 c_~A~0.offset 8)) (select (select |c_#memory_int| c_~A~0.base) (+ .cse3 c_~A~0.offset)))) (+ (select .cse2 c_~A~0.offset) (select .cse2 (+ c_~A~0.offset 8)) (select .cse2 (+ c_~A~0.offset 12)) (select .cse2 (+ c_~A~0.offset 4))))))) is different from false [2021-11-25 18:42:05,070 INFO L354 Elim1Store]: treesize reduction 227, result has 43.3 percent of original size [2021-11-25 18:42:05,070 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 138 treesize of output 236 [2021-11-25 18:42:05,163 INFO L354 Elim1Store]: treesize reduction 110, result has 45.3 percent of original size [2021-11-25 18:42:05,163 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 45 treesize of output 108 [2021-11-25 18:42:06,750 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:42:06,801 INFO L354 Elim1Store]: treesize reduction 383, result has 4.3 percent of original size [2021-11-25 18:42:06,801 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 69 treesize of output 29 [2021-11-25 18:42:06,969 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 4 not checked. [2021-11-25 18:42:06,970 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452709077] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:42:06,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1061330849] [2021-11-25 18:42:06,970 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:42:06,970 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:42:06,970 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 13] total 45 [2021-11-25 18:42:06,970 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989935290] [2021-11-25 18:42:06,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:42:06,971 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2021-11-25 18:42:06,971 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:42:06,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-11-25 18:42:06,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1819, Unknown=2, NotChecked=174, Total=2162 [2021-11-25 18:42:06,971 INFO L87 Difference]: Start difference. First operand 583 states and 1569 transitions. Second operand has 47 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 46 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:42:12,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:42:12,341 INFO L93 Difference]: Finished difference Result 946 states and 2437 transitions. [2021-11-25 18:42:12,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2021-11-25 18:42:12,342 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 46 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 26 [2021-11-25 18:42:12,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:42:12,343 INFO L225 Difference]: With dead ends: 946 [2021-11-25 18:42:12,343 INFO L226 Difference]: Without dead ends: 936 [2021-11-25 18:42:12,343 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 22 SyntacticMatches, 9 SemanticMatches, 94 ConstructedPredicates, 2 IntricatePredicates, 2 DeprecatedPredicates, 2457 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=799, Invalid=7949, Unknown=2, NotChecked=370, Total=9120 [2021-11-25 18:42:12,344 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 224 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 2167 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 2546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 2167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 281 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-11-25 18:42:12,344 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [224 Valid, 110 Invalid, 2546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 2167 Invalid, 0 Unknown, 281 Unchecked, 1.5s Time] [2021-11-25 18:42:12,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2021-11-25 18:42:12,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 601. [2021-11-25 18:42:12,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 600 states have (on average 2.725) internal successors, (1635), 600 states have internal predecessors, (1635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:42:12,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 1635 transitions. [2021-11-25 18:42:12,353 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 1635 transitions. Word has length 26 [2021-11-25 18:42:12,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:42:12,353 INFO L470 AbstractCegarLoop]: Abstraction has 601 states and 1635 transitions. [2021-11-25 18:42:12,353 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 46 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:42:12,353 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 1635 transitions. [2021-11-25 18:42:12,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-25 18:42:12,354 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:42:12,354 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:42:12,375 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (117)] Forceful destruction successful, exit code 0 [2021-11-25 18:42:12,554 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118,117 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:42:12,554 INFO L402 AbstractCegarLoop]: === Iteration 120 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:42:12,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:42:12,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1249341078, now seen corresponding path program 115 times [2021-11-25 18:42:12,555 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:42:12,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52580916] [2021-11-25 18:42:12,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:42:12,555 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:42:12,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:42:13,205 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:42:13,205 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:42:13,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52580916] [2021-11-25 18:42:13,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52580916] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:42:13,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209491206] [2021-11-25 18:42:13,205 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 18:42:13,205 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:42:13,206 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:42:13,206 INFO L229 MonitoredProcess]: Starting monitored process 118 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:42:13,207 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (118)] Waiting until timeout for monitored process [2021-11-25 18:42:13,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:42:13,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 138 conjunts are in the unsatisfiable core [2021-11-25 18:42:13,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:42:13,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:42:13,726 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 25 treesize of output 25 [2021-11-25 18:42:14,063 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:42:14,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:42:14,443 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4495 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4495) c_~A~0.base))) (< (+ (select .cse0 (+ c_~A~0.offset 12)) (select .cse0 (+ c_~A~0.offset 8)) (select .cse0 c_~A~0.offset) (select .cse0 (+ c_~A~0.offset 4))) (let ((.cse1 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ (select .cse0 (+ .cse1 c_~A~0.offset 4)) c_~counter~0 (select .cse0 (+ .cse1 c_~A~0.offset)) 1))))) (forall ((v_ArrVal_4495 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4495) c_~A~0.base))) (<= (let ((.cse3 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ (select .cse2 (+ .cse3 c_~A~0.offset 4)) c_~counter~0 (select .cse2 (+ .cse3 c_~A~0.offset)))) (+ (select .cse2 (+ c_~A~0.offset 12)) (select .cse2 (+ c_~A~0.offset 8)) (select .cse2 c_~A~0.offset) (select .cse2 (+ c_~A~0.offset 4))))))) is different from false [2021-11-25 18:42:14,456 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4495 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4495) c_~A~0.base))) (<= (let ((.cse1 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ (select .cse0 (+ .cse1 c_~A~0.offset 4)) c_~counter~0 (select .cse0 (+ .cse1 c_~A~0.offset 8)) (select (select |c_#memory_int| c_~A~0.base) (+ .cse1 c_~A~0.offset)))) (+ (select .cse0 (+ c_~A~0.offset 12)) (select .cse0 (+ c_~A~0.offset 8)) (select .cse0 c_~A~0.offset) (select .cse0 (+ c_~A~0.offset 4)))))) (forall ((v_ArrVal_4495 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4495) c_~A~0.base))) (< (+ (select .cse2 (+ c_~A~0.offset 12)) (select .cse2 (+ c_~A~0.offset 8)) (select .cse2 c_~A~0.offset) (select .cse2 (+ c_~A~0.offset 4))) (let ((.cse3 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ (select .cse2 (+ .cse3 c_~A~0.offset 4)) c_~counter~0 (select .cse2 (+ .cse3 c_~A~0.offset 8)) 1 (select (select |c_#memory_int| c_~A~0.base) (+ .cse3 c_~A~0.offset)))))))) is different from false [2021-11-25 18:42:14,638 INFO L354 Elim1Store]: treesize reduction 227, result has 43.3 percent of original size [2021-11-25 18:42:14,638 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 138 treesize of output 236 [2021-11-25 18:42:14,726 INFO L354 Elim1Store]: treesize reduction 110, result has 45.3 percent of original size [2021-11-25 18:42:14,727 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 45 treesize of output 108 [2021-11-25 18:42:16,835 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:42:16,887 INFO L354 Elim1Store]: treesize reduction 383, result has 4.3 percent of original size [2021-11-25 18:42:16,887 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 69 treesize of output 29 [2021-11-25 18:42:17,047 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 4 not checked. [2021-11-25 18:42:17,047 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209491206] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:42:17,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1281172028] [2021-11-25 18:42:17,047 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:42:17,048 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:42:17,048 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 13] total 45 [2021-11-25 18:42:17,048 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078373656] [2021-11-25 18:42:17,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:42:17,048 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2021-11-25 18:42:17,048 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:42:17,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-11-25 18:42:17,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1814, Unknown=2, NotChecked=174, Total=2162 [2021-11-25 18:42:17,049 INFO L87 Difference]: Start difference. First operand 601 states and 1635 transitions. Second operand has 47 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 46 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:42:20,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:42:20,799 INFO L93 Difference]: Finished difference Result 833 states and 2175 transitions. [2021-11-25 18:42:20,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-11-25 18:42:20,800 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 46 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 26 [2021-11-25 18:42:20,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:42:20,801 INFO L225 Difference]: With dead ends: 833 [2021-11-25 18:42:20,801 INFO L226 Difference]: Without dead ends: 823 [2021-11-25 18:42:20,801 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 79 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1591 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=623, Invalid=5545, Unknown=2, NotChecked=310, Total=6480 [2021-11-25 18:42:20,802 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 220 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 2170 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 2476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 2170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 223 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-25 18:42:20,802 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [220 Valid, 76 Invalid, 2476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 2170 Invalid, 0 Unknown, 223 Unchecked, 1.3s Time] [2021-11-25 18:42:20,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2021-11-25 18:42:20,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 618. [2021-11-25 18:42:20,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 617 states have (on average 2.755267423014587) internal successors, (1700), 617 states have internal predecessors, (1700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:42:20,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 1700 transitions. [2021-11-25 18:42:20,811 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 1700 transitions. Word has length 26 [2021-11-25 18:42:20,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:42:20,811 INFO L470 AbstractCegarLoop]: Abstraction has 618 states and 1700 transitions. [2021-11-25 18:42:20,811 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 46 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:42:20,811 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 1700 transitions. [2021-11-25 18:42:20,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-25 18:42:20,812 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:42:20,812 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:42:20,833 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (118)] Ended with exit code 0 [2021-11-25 18:42:21,012 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119,118 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:42:21,013 INFO L402 AbstractCegarLoop]: === Iteration 121 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:42:21,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:42:21,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1291353494, now seen corresponding path program 116 times [2021-11-25 18:42:21,013 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:42:21,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054834951] [2021-11-25 18:42:21,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:42:21,013 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:42:21,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:42:21,566 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:42:21,567 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:42:21,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054834951] [2021-11-25 18:42:21,567 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054834951] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:42:21,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826677360] [2021-11-25 18:42:21,567 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:42:21,567 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:42:21,567 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:42:21,568 INFO L229 MonitoredProcess]: Starting monitored process 119 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:42:21,569 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (119)] Waiting until timeout for monitored process [2021-11-25 18:42:21,823 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-11-25 18:42:21,823 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:42:21,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 147 conjunts are in the unsatisfiable core [2021-11-25 18:42:21,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:42:22,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:42:22,126 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 22 treesize of output 22 [2021-11-25 18:42:22,530 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:42:22,531 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 35 treesize of output 23 [2021-11-25 18:42:22,715 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:42:22,715 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:42:22,885 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:42:23,273 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:42:24,329 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread2Thread1of1ForFork1_~i~1#1_931| Int) (|v_thread1Thread1of1ForFork0_~i~0#1_949| Int)) (or (<= c_~N~0 |v_thread2Thread1of1ForFork1_~i~1#1_931|) (and (forall ((v_ArrVal_4538 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4538) c_~A~0.base))) (<= (+ c_~counter~0 (select .cse0 (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_949| 4) c_~A~0.offset)) (select .cse0 (+ (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) c_~A~0.offset))) (+ (select .cse0 (+ c_~A~0.offset 8)) (select .cse0 (+ (* |v_thread2Thread1of1ForFork1_~i~1#1_931| 4) c_~A~0.offset)) (select .cse0 c_~A~0.offset) (select .cse0 (+ c_~A~0.offset 4)))))) (forall ((v_ArrVal_4538 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4538) c_~A~0.base))) (< (+ (select .cse1 (+ c_~A~0.offset 8)) (select .cse1 (+ (* |v_thread2Thread1of1ForFork1_~i~1#1_931| 4) c_~A~0.offset)) (select .cse1 c_~A~0.offset) (select .cse1 (+ c_~A~0.offset 4))) (+ c_~counter~0 (select .cse1 (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_949| 4) c_~A~0.offset)) (select .cse1 (+ (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) c_~A~0.offset)) 1))))) (< (+ |v_thread2Thread1of1ForFork1_~i~1#1_931| 1) c_~N~0) (< (+ |v_thread1Thread1of1ForFork0_~i~0#1_949| 1) c_~N~0) (<= c_~N~0 |v_thread1Thread1of1ForFork0_~i~0#1_949|))) is different from false [2021-11-25 18:42:24,517 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread2Thread1of1ForFork1_~i~1#1_931| Int) (|v_thread1Thread1of1ForFork0_~i~0#1_949| Int)) (or (<= c_~N~0 |v_thread2Thread1of1ForFork1_~i~1#1_931|) (and (forall ((v_ArrVal_4538 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4538) c_~A~0.base))) (< (+ (select .cse0 (+ c_~A~0.offset 8)) (select .cse0 (+ (* |v_thread2Thread1of1ForFork1_~i~1#1_931| 4) c_~A~0.offset)) (select .cse0 c_~A~0.offset) (select .cse0 (+ c_~A~0.offset 4))) (let ((.cse1 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse0 (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_949| 4) c_~A~0.offset)) (select .cse0 (+ .cse1 c_~A~0.offset 4)) 1 (select (select |c_#memory_int| c_~A~0.base) (+ .cse1 c_~A~0.offset))))))) (forall ((v_ArrVal_4538 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4538) c_~A~0.base))) (<= (let ((.cse3 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse2 (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_949| 4) c_~A~0.offset)) (select .cse2 (+ .cse3 c_~A~0.offset 4)) (select (select |c_#memory_int| c_~A~0.base) (+ .cse3 c_~A~0.offset)))) (+ (select .cse2 (+ c_~A~0.offset 8)) (select .cse2 (+ (* |v_thread2Thread1of1ForFork1_~i~1#1_931| 4) c_~A~0.offset)) (select .cse2 c_~A~0.offset) (select .cse2 (+ c_~A~0.offset 4))))))) (< (+ |v_thread2Thread1of1ForFork1_~i~1#1_931| 1) c_~N~0) (< (+ |v_thread1Thread1of1ForFork0_~i~0#1_949| 1) c_~N~0) (<= c_~N~0 |v_thread1Thread1of1ForFork0_~i~0#1_949|))) is different from false [2021-11-25 18:42:24,736 INFO L354 Elim1Store]: treesize reduction 236, result has 42.0 percent of original size [2021-11-25 18:42:24,736 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 279 treesize of output 300 [2021-11-25 18:42:24,844 INFO L354 Elim1Store]: treesize reduction 123, result has 40.3 percent of original size [2021-11-25 18:42:24,845 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 125 treesize of output 179 [2021-11-25 18:42:24,967 INFO L354 Elim1Store]: treesize reduction 123, result has 40.3 percent of original size [2021-11-25 18:42:24,967 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 94 treesize of output 148 [2021-11-25 18:42:43,754 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 6 trivial. 4 not checked. [2021-11-25 18:42:43,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826677360] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:42:43,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1745886470] [2021-11-25 18:42:43,755 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:42:43,755 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:42:43,755 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 16] total 46 [2021-11-25 18:42:43,755 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367761661] [2021-11-25 18:42:43,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:42:43,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2021-11-25 18:42:43,756 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:42:43,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-11-25 18:42:43,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=1867, Unknown=2, NotChecked=178, Total=2256 [2021-11-25 18:42:43,757 INFO L87 Difference]: Start difference. First operand 618 states and 1700 transitions. Second operand has 48 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 47 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:42:45,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:42:45,570 INFO L93 Difference]: Finished difference Result 750 states and 1982 transitions. [2021-11-25 18:42:45,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-11-25 18:42:45,570 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 47 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 26 [2021-11-25 18:42:45,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:42:45,572 INFO L225 Difference]: With dead ends: 750 [2021-11-25 18:42:45,572 INFO L226 Difference]: Without dead ends: 740 [2021-11-25 18:42:45,572 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 16 SyntacticMatches, 8 SemanticMatches, 61 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 908 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=366, Invalid=3300, Unknown=2, NotChecked=238, Total=3906 [2021-11-25 18:42:45,572 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 151 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 1903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1145 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-25 18:42:45,572 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 58 Invalid, 1903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 721 Invalid, 0 Unknown, 1145 Unchecked, 0.4s Time] [2021-11-25 18:42:45,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2021-11-25 18:42:45,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 647. [2021-11-25 18:42:45,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 646 states have (on average 2.760061919504644) internal successors, (1783), 646 states have internal predecessors, (1783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:42:45,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 1783 transitions. [2021-11-25 18:42:45,582 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 1783 transitions. Word has length 26 [2021-11-25 18:42:45,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:42:45,582 INFO L470 AbstractCegarLoop]: Abstraction has 647 states and 1783 transitions. [2021-11-25 18:42:45,582 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 47 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:42:45,582 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 1783 transitions. [2021-11-25 18:42:45,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-25 18:42:45,583 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:42:45,583 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:42:45,605 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (119)] Ended with exit code 0 [2021-11-25 18:42:45,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120,119 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:42:45,784 INFO L402 AbstractCegarLoop]: === Iteration 122 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:42:45,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:42:45,784 INFO L85 PathProgramCache]: Analyzing trace with hash -375850656, now seen corresponding path program 117 times [2021-11-25 18:42:45,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:42:45,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353966222] [2021-11-25 18:42:45,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:42:45,784 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:42:45,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:42:46,499 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:42:46,500 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:42:46,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353966222] [2021-11-25 18:42:46,500 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353966222] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:42:46,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100145269] [2021-11-25 18:42:46,500 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 18:42:46,500 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:42:46,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:42:46,501 INFO L229 MonitoredProcess]: Starting monitored process 120 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:42:46,502 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (120)] Waiting until timeout for monitored process [2021-11-25 18:42:46,748 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 18:42:46,748 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:42:46,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 138 conjunts are in the unsatisfiable core [2021-11-25 18:42:46,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:42:47,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:42:47,040 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 22 treesize of output 22 [2021-11-25 18:42:47,350 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:42:47,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:42:47,704 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4581 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4581) c_~A~0.base))) (< (+ (select .cse0 (+ c_~A~0.offset 4)) (select .cse0 (+ c_~A~0.offset 12)) (select .cse0 (+ c_~A~0.offset 8)) (select .cse0 c_~A~0.offset)) (let ((.cse1 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse0 (+ .cse1 c_~A~0.offset 4)) (select .cse0 (+ .cse1 c_~A~0.offset)) 1))))) (forall ((v_ArrVal_4581 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4581) c_~A~0.base))) (<= (let ((.cse3 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse2 (+ .cse3 c_~A~0.offset 4)) (select .cse2 (+ .cse3 c_~A~0.offset)))) (+ (select .cse2 (+ c_~A~0.offset 4)) (select .cse2 (+ c_~A~0.offset 12)) (select .cse2 (+ c_~A~0.offset 8)) (select .cse2 c_~A~0.offset)))))) is different from false [2021-11-25 18:42:47,726 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4581 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4581) c_~A~0.base))) (<= (let ((.cse1 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse0 (+ .cse1 c_~A~0.offset 8)) (select .cse0 (+ .cse1 c_~A~0.offset 4)) (select (select |c_#memory_int| c_~A~0.base) (+ .cse1 c_~A~0.offset)))) (+ (select .cse0 (+ c_~A~0.offset 4)) (select .cse0 (+ c_~A~0.offset 12)) (select .cse0 (+ c_~A~0.offset 8)) (select .cse0 c_~A~0.offset))))) (forall ((v_ArrVal_4581 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4581) c_~A~0.base))) (< (+ (select .cse2 (+ c_~A~0.offset 4)) (select .cse2 (+ c_~A~0.offset 12)) (select .cse2 (+ c_~A~0.offset 8)) (select .cse2 c_~A~0.offset)) (let ((.cse3 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse2 (+ .cse3 c_~A~0.offset 8)) (select .cse2 (+ .cse3 c_~A~0.offset 4)) 1 (select (select |c_#memory_int| c_~A~0.base) (+ .cse3 c_~A~0.offset)))))))) is different from false [2021-11-25 18:42:47,972 INFO L354 Elim1Store]: treesize reduction 227, result has 43.3 percent of original size [2021-11-25 18:42:47,973 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 136 treesize of output 234 [2021-11-25 18:42:48,064 INFO L354 Elim1Store]: treesize reduction 110, result has 45.3 percent of original size [2021-11-25 18:42:48,065 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 44 treesize of output 107 [2021-11-25 18:42:49,450 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:42:49,503 INFO L354 Elim1Store]: treesize reduction 383, result has 4.3 percent of original size [2021-11-25 18:42:49,504 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 70 treesize of output 30 [2021-11-25 18:42:49,657 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 4 not checked. [2021-11-25 18:42:49,657 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100145269] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:42:49,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [483594918] [2021-11-25 18:42:49,657 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:42:49,658 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:42:49,658 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 13] total 45 [2021-11-25 18:42:49,658 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783524832] [2021-11-25 18:42:49,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:42:49,658 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2021-11-25 18:42:49,658 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:42:49,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-11-25 18:42:49,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1808, Unknown=2, NotChecked=174, Total=2162 [2021-11-25 18:42:49,659 INFO L87 Difference]: Start difference. First operand 647 states and 1783 transitions. Second operand has 47 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 46 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:42:52,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:42:52,054 INFO L93 Difference]: Finished difference Result 852 states and 2291 transitions. [2021-11-25 18:42:52,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-11-25 18:42:52,054 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 46 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 26 [2021-11-25 18:42:52,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:42:52,056 INFO L225 Difference]: With dead ends: 852 [2021-11-25 18:42:52,056 INFO L226 Difference]: Without dead ends: 847 [2021-11-25 18:42:52,056 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 21 SyntacticMatches, 6 SemanticMatches, 68 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1237 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=492, Invalid=4070, Unknown=2, NotChecked=266, Total=4830 [2021-11-25 18:42:52,056 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 173 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 1621 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 1888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 186 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-25 18:42:52,057 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 57 Invalid, 1888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1621 Invalid, 0 Unknown, 186 Unchecked, 1.0s Time] [2021-11-25 18:42:52,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2021-11-25 18:42:52,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 635. [2021-11-25 18:42:52,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 634 states have (on average 2.774447949526814) internal successors, (1759), 634 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:42:52,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 1759 transitions. [2021-11-25 18:42:52,066 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 1759 transitions. Word has length 26 [2021-11-25 18:42:52,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:42:52,066 INFO L470 AbstractCegarLoop]: Abstraction has 635 states and 1759 transitions. [2021-11-25 18:42:52,066 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 46 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:42:52,066 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 1759 transitions. [2021-11-25 18:42:52,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-25 18:42:52,067 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:42:52,067 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:42:52,088 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (120)] Ended with exit code 0 [2021-11-25 18:42:52,267 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121,120 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:42:52,267 INFO L402 AbstractCegarLoop]: === Iteration 123 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:42:52,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:42:52,268 INFO L85 PathProgramCache]: Analyzing trace with hash 967725608, now seen corresponding path program 118 times [2021-11-25 18:42:52,268 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:42:52,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063724005] [2021-11-25 18:42:52,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:42:52,268 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:42:52,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:42:52,986 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:42:52,986 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:42:52,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063724005] [2021-11-25 18:42:52,986 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063724005] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:42:52,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99904193] [2021-11-25 18:42:52,986 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 18:42:52,986 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:42:52,987 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:42:52,987 INFO L229 MonitoredProcess]: Starting monitored process 121 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:42:52,988 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (121)] Waiting until timeout for monitored process [2021-11-25 18:42:53,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:42:53,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 138 conjunts are in the unsatisfiable core [2021-11-25 18:42:53,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:42:53,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:42:53,530 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 22 treesize of output 22 [2021-11-25 18:42:53,892 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:42:53,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:42:54,297 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4624 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4624) c_~A~0.base))) (<= (let ((.cse1 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse0 (+ .cse1 c_~A~0.offset)) (select .cse0 (+ .cse1 c_~A~0.offset 4)))) (+ (select .cse0 (+ c_~A~0.offset 12)) (select .cse0 (+ c_~A~0.offset 8)) (select .cse0 c_~A~0.offset) (select .cse0 (+ c_~A~0.offset 4)))))) (forall ((v_ArrVal_4624 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4624) c_~A~0.base))) (< (+ (select .cse2 (+ c_~A~0.offset 12)) (select .cse2 (+ c_~A~0.offset 8)) (select .cse2 c_~A~0.offset) (select .cse2 (+ c_~A~0.offset 4))) (let ((.cse3 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse2 (+ .cse3 c_~A~0.offset)) (select .cse2 (+ .cse3 c_~A~0.offset 4)) 1)))))) is different from false [2021-11-25 18:42:54,309 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4624 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4624) c_~A~0.base))) (<= (let ((.cse1 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse0 (+ .cse1 c_~A~0.offset 8)) (select .cse0 (+ .cse1 c_~A~0.offset 4)) (select (select |c_#memory_int| c_~A~0.base) (+ .cse1 c_~A~0.offset)))) (+ (select .cse0 (+ c_~A~0.offset 12)) (select .cse0 (+ c_~A~0.offset 8)) (select .cse0 c_~A~0.offset) (select .cse0 (+ c_~A~0.offset 4)))))) (forall ((v_ArrVal_4624 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4624) c_~A~0.base))) (< (+ (select .cse2 (+ c_~A~0.offset 12)) (select .cse2 (+ c_~A~0.offset 8)) (select .cse2 c_~A~0.offset) (select .cse2 (+ c_~A~0.offset 4))) (let ((.cse3 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ c_~counter~0 (select .cse2 (+ .cse3 c_~A~0.offset 8)) (select .cse2 (+ .cse3 c_~A~0.offset 4)) 1 (select (select |c_#memory_int| c_~A~0.base) (+ .cse3 c_~A~0.offset)))))))) is different from false [2021-11-25 18:42:54,495 INFO L354 Elim1Store]: treesize reduction 227, result has 43.3 percent of original size [2021-11-25 18:42:54,495 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 136 treesize of output 234 [2021-11-25 18:42:54,590 INFO L354 Elim1Store]: treesize reduction 110, result has 45.3 percent of original size [2021-11-25 18:42:54,590 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 44 treesize of output 107 [2021-11-25 18:42:55,951 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:42:56,002 INFO L354 Elim1Store]: treesize reduction 383, result has 4.3 percent of original size [2021-11-25 18:42:56,002 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 70 treesize of output 30 [2021-11-25 18:42:56,170 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 4 not checked. [2021-11-25 18:42:56,170 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99904193] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:42:56,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [503670891] [2021-11-25 18:42:56,170 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 18:42:56,171 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:42:56,171 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 13] total 45 [2021-11-25 18:42:56,171 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144859389] [2021-11-25 18:42:56,171 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:42:56,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2021-11-25 18:42:56,171 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:42:56,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-11-25 18:42:56,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1836, Unknown=2, NotChecked=174, Total=2162 [2021-11-25 18:42:56,173 INFO L87 Difference]: Start difference. First operand 635 states and 1759 transitions. Second operand has 47 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 46 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:42:59,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:42:59,990 INFO L93 Difference]: Finished difference Result 848 states and 2255 transitions. [2021-11-25 18:42:59,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-11-25 18:42:59,991 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 46 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 26 [2021-11-25 18:42:59,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:42:59,992 INFO L225 Difference]: With dead ends: 848 [2021-11-25 18:42:59,992 INFO L226 Difference]: Without dead ends: 843 [2021-11-25 18:42:59,992 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 81 ConstructedPredicates, 2 IntricatePredicates, 3 DeprecatedPredicates, 1520 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=532, Invalid=5954, Unknown=2, NotChecked=318, Total=6806 [2021-11-25 18:42:59,993 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 229 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 2291 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 2720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 2291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 341 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-11-25 18:42:59,993 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [229 Valid, 80 Invalid, 2720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 2291 Invalid, 0 Unknown, 341 Unchecked, 1.4s Time] [2021-11-25 18:42:59,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2021-11-25 18:43:00,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 651. [2021-11-25 18:43:00,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 650 states have (on average 2.7830769230769232) internal successors, (1809), 650 states have internal predecessors, (1809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:43:00,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1809 transitions. [2021-11-25 18:43:00,003 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1809 transitions. Word has length 26 [2021-11-25 18:43:00,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:43:00,003 INFO L470 AbstractCegarLoop]: Abstraction has 651 states and 1809 transitions. [2021-11-25 18:43:00,003 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 46 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:43:00,003 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1809 transitions. [2021-11-25 18:43:00,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-25 18:43:00,004 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:43:00,004 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:43:00,025 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (121)] Ended with exit code 0 [2021-11-25 18:43:00,204 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 121 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable122 [2021-11-25 18:43:00,204 INFO L402 AbstractCegarLoop]: === Iteration 124 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 18:43:00,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:43:00,205 INFO L85 PathProgramCache]: Analyzing trace with hash -440601826, now seen corresponding path program 119 times [2021-11-25 18:43:00,205 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:43:00,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690912699] [2021-11-25 18:43:00,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:43:00,205 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:43:00,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:43:00,939 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:43:00,939 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:43:00,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690912699] [2021-11-25 18:43:00,940 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690912699] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:43:00,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224305990] [2021-11-25 18:43:00,940 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:43:00,940 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:43:00,940 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:43:00,941 INFO L229 MonitoredProcess]: Starting monitored process 122 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:43:00,941 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_180815bd-2339-43bd-b931-d65548a7688a/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (122)] Waiting until timeout for monitored process [2021-11-25 18:43:01,202 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-11-25 18:43:01,202 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:43:01,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 149 conjunts are in the unsatisfiable core [2021-11-25 18:43:01,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:43:01,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:43:01,603 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 22 treesize of output 22 [2021-11-25 18:43:01,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:43:01,979 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:43:01,979 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 32 treesize of output 67 [2021-11-25 18:43:02,283 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:43:02,283 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:43:02,716 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:03,153 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:04,076 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread2Thread1of1ForFork1_~i~1#1_963| Int) (|v_thread1Thread1of1ForFork0_~i~0#1_980| Int)) (or (<= c_~N~0 (+ |v_thread2Thread1of1ForFork1_~i~1#1_963| 1)) (< (+ |v_thread1Thread1of1ForFork0_~i~0#1_980| 1) c_~N~0) (<= c_~N~0 |v_thread1Thread1of1ForFork0_~i~0#1_980|) (and (forall ((v_ArrVal_4667 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4667) c_~A~0.base))) (<= (+ c_~counter~0 (select .cse0 (+ (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) c_~A~0.offset)) (select .cse0 (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_980| 4) c_~A~0.offset))) (let ((.cse1 (* |v_thread2Thread1of1ForFork1_~i~1#1_963| 4))) (+ (select .cse0 (+ .cse1 c_~A~0.offset)) (select .cse0 c_~A~0.offset) (select .cse0 (+ c_~A~0.offset 4)) (select .cse0 (+ .cse1 c_~A~0.offset 4))))))) (forall ((v_ArrVal_4667 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4667) c_~A~0.base))) (< (let ((.cse3 (* |v_thread2Thread1of1ForFork1_~i~1#1_963| 4))) (+ (select .cse2 (+ .cse3 c_~A~0.offset)) (select .cse2 c_~A~0.offset) (select .cse2 (+ c_~A~0.offset 4)) (select .cse2 (+ .cse3 c_~A~0.offset 4)))) (+ c_~counter~0 (select .cse2 (+ (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) c_~A~0.offset)) (select .cse2 (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_980| 4) c_~A~0.offset)) 1))))) (< (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_963|) c_~N~0))) is different from false [2021-11-25 18:43:04,296 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread2Thread1of1ForFork1_~i~1#1_963| Int) (|v_thread1Thread1of1ForFork0_~i~0#1_980| Int)) (or (<= c_~N~0 (+ |v_thread2Thread1of1ForFork1_~i~1#1_963| 1)) (and (forall ((v_ArrVal_4667 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4667) c_~A~0.base))) (< (let ((.cse1 (* |v_thread2Thread1of1ForFork1_~i~1#1_963| 4))) (+ (select .cse0 (+ .cse1 c_~A~0.offset)) (select .cse0 c_~A~0.offset) (select .cse0 (+ c_~A~0.offset 4)) (select .cse0 (+ .cse1 c_~A~0.offset 4)))) (let ((.cse2 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ (select .cse0 (+ .cse2 c_~A~0.offset 4)) c_~counter~0 (select .cse0 (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_980| 4) c_~A~0.offset)) 1 (select (select |c_#memory_int| c_~A~0.base) (+ .cse2 c_~A~0.offset))))))) (forall ((v_ArrVal_4667 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4667) c_~A~0.base))) (<= (let ((.cse4 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ (select .cse3 (+ .cse4 c_~A~0.offset 4)) c_~counter~0 (select .cse3 (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_980| 4) c_~A~0.offset)) (select (select |c_#memory_int| c_~A~0.base) (+ .cse4 c_~A~0.offset)))) (let ((.cse5 (* |v_thread2Thread1of1ForFork1_~i~1#1_963| 4))) (+ (select .cse3 (+ .cse5 c_~A~0.offset)) (select .cse3 c_~A~0.offset) (select .cse3 (+ c_~A~0.offset 4)) (select .cse3 (+ .cse5 c_~A~0.offset 4)))))))) (< (+ |v_thread1Thread1of1ForFork0_~i~0#1_980| 1) c_~N~0) (<= c_~N~0 |v_thread1Thread1of1ForFork0_~i~0#1_980|) (< (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_963|) c_~N~0))) is different from false [2021-11-25 18:43:04,590 INFO L354 Elim1Store]: treesize reduction 237, result has 44.6 percent of original size [2021-11-25 18:43:04,591 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 291 treesize of output 326 [2021-11-25 18:43:04,752 INFO L354 Elim1Store]: treesize reduction 122, result has 44.8 percent of original size [2021-11-25 18:43:04,752 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 131 treesize of output 198 [2021-11-25 18:43:04,927 INFO L354 Elim1Store]: treesize reduction 124, result has 43.9 percent of original size [2021-11-25 18:43:04,927 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 97 treesize of output 162