./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 53f42b1a Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P --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 6727abf6d3311127e7c3f388ca276994a5a41bcb1f2faca3217c66ebe13b8b8f --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-20 23:13:15,582 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-20 23:13:15,584 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-20 23:13:15,617 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-20 23:13:15,618 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-20 23:13:15,619 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-20 23:13:15,621 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-20 23:13:15,623 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-20 23:13:15,626 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-20 23:13:15,627 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-20 23:13:15,629 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-20 23:13:15,630 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-20 23:13:15,631 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-20 23:13:15,632 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-20 23:13:15,634 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-20 23:13:15,635 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-20 23:13:15,636 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-20 23:13:15,638 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-20 23:13:15,640 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-20 23:13:15,642 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-20 23:13:15,644 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-20 23:13:15,646 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-20 23:13:15,648 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-20 23:13:15,649 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-20 23:13:15,653 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-20 23:13:15,653 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-20 23:13:15,653 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-20 23:13:15,655 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-20 23:13:15,655 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-20 23:13:15,657 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-20 23:13:15,657 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-20 23:13:15,658 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-20 23:13:15,659 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-20 23:13:15,660 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-20 23:13:15,662 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-20 23:13:15,662 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-20 23:13:15,663 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-20 23:13:15,663 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-20 23:13:15,663 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-20 23:13:15,664 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-20 23:13:15,665 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-20 23:13:15,666 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-20 23:13:15,690 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-20 23:13:15,691 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-20 23:13:15,691 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-20 23:13:15,691 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-20 23:13:15,692 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-20 23:13:15,692 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-20 23:13:15,692 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-20 23:13:15,693 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-20 23:13:15,693 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-20 23:13:15,693 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-20 23:13:15,693 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-20 23:13:15,694 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-20 23:13:15,694 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-20 23:13:15,694 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-20 23:13:15,694 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-20 23:13:15,694 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-20 23:13:15,695 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-20 23:13:15,695 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-20 23:13:15,696 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-20 23:13:15,696 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-20 23:13:15,696 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-20 23:13:15,696 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-20 23:13:15,697 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-20 23:13:15,697 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-20 23:13:15,697 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-20 23:13:15,697 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-20 23:13:15,697 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-20 23:13:15,698 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-20 23:13:15,698 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-20 23:13:15,698 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-20 23:13:15,698 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-20 23:13:15,699 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-20 23:13:15,699 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 23:13:15,699 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-20 23:13:15,699 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-20 23:13:15,700 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-20 23:13:15,700 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-20 23:13:15,700 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-20 23:13:15,700 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-20 23:13:15,700 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-20 23:13:15,701 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-20 23:13:15,701 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_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/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_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P 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 -> 6727abf6d3311127e7c3f388ca276994a5a41bcb1f2faca3217c66ebe13b8b8f [2021-11-20 23:13:15,954 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-20 23:13:15,973 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-20 23:13:15,976 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-20 23:13:15,977 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-20 23:13:15,978 INFO L275 PluginConnector]: CDTParser initialized [2021-11-20 23:13:15,979 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/../../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c [2021-11-20 23:13:16,061 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/data/433db6a42/307b4843322643d7b6f2628b073be46a/FLAG3f1230c63 [2021-11-20 23:13:16,486 INFO L306 CDTParser]: Found 1 translation units. [2021-11-20 23:13:16,487 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c [2021-11-20 23:13:16,495 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/data/433db6a42/307b4843322643d7b6f2628b073be46a/FLAG3f1230c63 [2021-11-20 23:13:16,880 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/data/433db6a42/307b4843322643d7b6f2628b073be46a [2021-11-20 23:13:16,883 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-20 23:13:16,885 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-20 23:13:16,887 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-20 23:13:16,887 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-20 23:13:16,891 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-20 23:13:16,892 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:13:16" (1/1) ... [2021-11-20 23:13:16,893 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53e0188a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:13:16, skipping insertion in model container [2021-11-20 23:13:16,894 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:13:16" (1/1) ... [2021-11-20 23:13:16,901 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-20 23:13:16,928 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-20 23:13:17,146 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_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c[2412,2425] [2021-11-20 23:13:17,156 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 23:13:17,164 INFO L203 MainTranslator]: Completed pre-run [2021-11-20 23:13:17,185 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_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c[2412,2425] [2021-11-20 23:13:17,190 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 23:13:17,204 INFO L208 MainTranslator]: Completed translation [2021-11-20 23:13:17,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:13:17 WrapperNode [2021-11-20 23:13:17,205 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-20 23:13:17,206 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-20 23:13:17,206 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-20 23:13:17,206 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-20 23:13:17,212 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:13:17" (1/1) ... [2021-11-20 23:13:17,220 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:13:17" (1/1) ... [2021-11-20 23:13:17,261 INFO L137 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 15, calls inlined = 27, statements flattened = 271 [2021-11-20 23:13:17,262 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-20 23:13:17,262 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-20 23:13:17,263 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-20 23:13:17,263 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-20 23:13:17,272 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:13:17" (1/1) ... [2021-11-20 23:13:17,272 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:13:17" (1/1) ... [2021-11-20 23:13:17,277 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:13:17" (1/1) ... [2021-11-20 23:13:17,278 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:13:17" (1/1) ... [2021-11-20 23:13:17,291 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:13:17" (1/1) ... [2021-11-20 23:13:17,297 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:13:17" (1/1) ... [2021-11-20 23:13:17,300 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:13:17" (1/1) ... [2021-11-20 23:13:17,305 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-20 23:13:17,308 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-20 23:13:17,309 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-20 23:13:17,309 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-20 23:13:17,310 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:13:17" (1/1) ... [2021-11-20 23:13:17,321 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 23:13:17,344 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:13:17,371 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-20 23:13:17,392 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-20 23:13:17,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-20 23:13:17,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-20 23:13:17,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-20 23:13:17,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-20 23:13:17,421 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-11-20 23:13:17,422 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-11-20 23:13:17,422 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-11-20 23:13:17,422 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-11-20 23:13:17,422 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-11-20 23:13:17,422 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-11-20 23:13:17,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-20 23:13:17,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-20 23:13:17,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-20 23:13:17,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-20 23:13:17,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-20 23:13:17,425 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-11-20 23:13:17,578 INFO L236 CfgBuilder]: Building ICFG [2021-11-20 23:13:17,579 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-20 23:13:18,002 INFO L277 CfgBuilder]: Performing block encoding [2021-11-20 23:13:18,018 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-20 23:13:18,018 INFO L301 CfgBuilder]: Removed 6 assume(true) statements. [2021-11-20 23:13:18,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:13:18 BoogieIcfgContainer [2021-11-20 23:13:18,021 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-20 23:13:18,023 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-20 23:13:18,023 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-20 23:13:18,027 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-20 23:13:18,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:13:16" (1/3) ... [2021-11-20 23:13:18,028 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@430121cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:13:18, skipping insertion in model container [2021-11-20 23:13:18,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:13:17" (2/3) ... [2021-11-20 23:13:18,029 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@430121cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:13:18, skipping insertion in model container [2021-11-20 23:13:18,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:13:18" (3/3) ... [2021-11-20 23:13:18,030 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-bad-three-array-sum-alt.wvr.c [2021-11-20 23:13:18,035 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-20 23:13:18,036 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-20 23:13:18,036 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-20 23:13:18,036 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-20 23:13:18,122 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,123 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,123 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,123 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,124 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,124 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,124 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,127 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,128 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,128 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,128 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,128 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,129 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,129 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,129 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,129 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,130 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,130 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,130 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,130 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,131 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,131 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,131 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,131 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,131 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,132 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,132 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,132 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,140 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,140 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,141 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,141 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,141 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,141 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,142 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,142 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,142 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,142 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,143 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,143 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,143 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,143 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,144 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,144 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,144 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,144 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,144 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,145 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,145 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,145 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,146 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,146 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,146 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,146 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,147 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,148 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,149 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,149 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,149 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,150 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,150 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,150 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,150 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,151 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,151 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,152 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,152 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,156 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,156 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,157 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,157 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,157 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,157 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,158 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,158 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,158 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,158 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,158 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,159 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,159 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,159 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,159 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,159 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,160 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,160 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,160 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,160 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,160 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,161 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,161 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,161 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,161 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,161 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,161 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,162 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,163 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,163 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,163 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,163 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,164 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,164 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,164 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,164 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,164 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,165 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,165 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,165 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,165 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,165 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,166 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,166 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,166 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,166 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,166 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,166 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,167 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,167 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,167 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,167 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,167 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,168 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,168 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,168 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,168 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,168 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,168 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,169 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,169 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,169 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,169 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,169 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,170 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,170 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,170 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,170 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,170 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,171 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,171 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,171 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,171 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,171 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,172 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,172 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,172 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,185 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,185 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,186 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,186 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,186 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,186 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,186 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,187 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,189 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,189 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,189 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,189 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,190 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,190 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,190 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,190 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,190 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,190 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,191 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,191 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,191 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,191 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,191 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,191 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,192 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,192 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,192 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,192 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,192 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,193 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,193 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,193 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,193 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,193 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,193 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,194 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,194 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,194 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,194 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,194 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,195 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,195 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,195 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,195 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,197 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,197 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,197 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,197 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,197 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,198 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,198 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,198 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,198 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,198 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,199 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,199 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,199 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,199 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,199 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,200 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,200 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,200 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,200 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,200 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,200 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,201 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,201 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,201 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,201 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,201 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,201 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,202 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,202 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,202 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,202 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,202 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,202 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,203 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,203 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,203 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,203 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,203 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,203 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,204 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,204 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,204 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,204 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,209 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,209 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,209 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,209 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,210 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,210 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,210 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,211 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,211 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,211 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,211 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,212 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,224 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,225 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,225 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,225 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,226 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,226 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,226 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,226 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,226 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,227 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,227 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,227 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,228 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,230 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,230 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,230 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,230 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,230 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,231 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,231 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,231 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,231 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,231 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,231 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,231 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,232 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,232 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,232 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,232 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,232 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,232 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,233 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,233 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,233 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,233 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,233 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,234 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,234 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,234 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,234 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,234 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,234 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,235 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,235 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,235 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,235 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,235 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,235 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,235 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,236 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,236 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,236 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,236 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,236 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,236 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,237 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,237 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,237 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,237 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,237 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,237 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,237 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,238 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,238 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,238 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,238 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,238 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,238 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,239 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,239 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,239 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,239 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,239 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,239 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,240 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,240 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,241 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,241 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,241 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,241 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,241 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,241 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,242 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,242 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,242 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,242 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,242 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,242 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,243 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,243 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,243 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,243 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,243 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,243 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,244 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,244 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,244 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,248 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,249 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,249 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,249 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,250 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,250 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,250 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,250 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,251 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,251 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,251 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,251 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,251 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,251 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,252 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,252 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,252 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,252 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,252 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,252 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,253 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,254 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,254 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,254 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,254 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,254 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,262 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,262 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,262 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,263 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,263 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,263 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,263 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,263 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,264 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,264 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,264 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,264 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,264 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,271 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,271 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,271 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,272 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,272 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,272 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,272 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,272 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,272 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,273 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,273 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,273 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,273 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,273 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,273 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,274 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,278 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,278 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,278 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,279 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,279 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,279 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,279 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,279 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,279 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,280 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,280 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,280 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,280 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:13:18,338 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2021-11-20 23:13:18,417 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-20 23:13:18,430 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-20 23:13:18,431 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-11-20 23:13:18,465 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-11-20 23:13:18,485 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 349 places, 368 transitions, 760 flow [2021-11-20 23:13:18,493 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 349 places, 368 transitions, 760 flow [2021-11-20 23:13:18,495 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 349 places, 368 transitions, 760 flow [2021-11-20 23:13:18,709 INFO L129 PetriNetUnfolder]: 29/365 cut-off events. [2021-11-20 23:13:18,709 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-11-20 23:13:18,717 INFO L84 FinitePrefix]: Finished finitePrefix Result has 378 conditions, 365 events. 29/365 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 516 event pairs, 0 based on Foata normal form. 0/335 useless extension candidates. Maximal degree in co-relation 239. Up to 2 conditions per place. [2021-11-20 23:13:18,733 INFO L116 LiptonReduction]: Number of co-enabled transitions 17502 [2021-11-20 23:13:29,767 INFO L131 LiptonReduction]: Checked pairs total: 16087 [2021-11-20 23:13:29,767 INFO L133 LiptonReduction]: Total number of compositions: 436 [2021-11-20 23:13:29,780 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 32 transitions, 88 flow [2021-11-20 23:13:29,817 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 109 states, 108 states have (on average 3.064814814814815) internal successors, (331), 108 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:13:29,819 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 108 states have (on average 3.064814814814815) internal successors, (331), 108 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:13:29,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-20 23:13:29,832 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:13:29,832 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:13:29,834 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:13:29,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:13:29,839 INFO L85 PathProgramCache]: Analyzing trace with hash 626566297, now seen corresponding path program 1 times [2021-11-20 23:13:29,848 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:13:29,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514487190] [2021-11-20 23:13:29,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:13:29,851 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:13:30,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:13:30,290 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-20 23:13:30,290 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:13:30,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514487190] [2021-11-20 23:13:30,291 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514487190] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:13:30,292 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:13:30,292 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-11-20 23:13:30,294 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682862159] [2021-11-20 23:13:30,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:13:30,301 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-20 23:13:30,301 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:13:30,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-20 23:13:30,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 23:13:30,332 INFO L87 Difference]: Start difference. First operand has 109 states, 108 states have (on average 3.064814814814815) internal successors, (331), 108 states have internal predecessors, (331), 0 states have call successors, (0), 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 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:13:30,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:13:30,429 INFO L93 Difference]: Finished difference Result 206 states and 636 transitions. [2021-11-20 23:13:30,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 23:13:30,431 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-11-20 23:13:30,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:13:30,450 INFO L225 Difference]: With dead ends: 206 [2021-11-20 23:13:30,450 INFO L226 Difference]: Without dead ends: 199 [2021-11-20 23:13:30,451 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-20 23:13:30,462 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 3 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 23:13:30,464 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 6 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 23:13:30,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-11-20 23:13:30,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2021-11-20 23:13:30,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 198 states have (on average 3.121212121212121) internal successors, (618), 198 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:13:30,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 618 transitions. [2021-11-20 23:13:30,532 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 618 transitions. Word has length 22 [2021-11-20 23:13:30,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:13:30,533 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 618 transitions. [2021-11-20 23:13:30,533 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:13:30,533 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 618 transitions. [2021-11-20 23:13:30,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-20 23:13:30,536 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:13:30,537 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:13:30,537 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-20 23:13:30,537 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:13:30,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:13:30,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1328589130, now seen corresponding path program 1 times [2021-11-20 23:13:30,538 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:13:30,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555481823] [2021-11-20 23:13:30,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:13:30,539 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:13:30,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:13:30,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:13:30,686 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:13:30,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555481823] [2021-11-20 23:13:30,689 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555481823] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:13:30,689 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:13:30,689 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-20 23:13:30,689 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823863818] [2021-11-20 23:13:30,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:13:30,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 23:13:30,692 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:13:30,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 23:13:30,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-20 23:13:30,693 INFO L87 Difference]: Start difference. First operand 199 states and 618 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:13:30,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:13:30,933 INFO L93 Difference]: Finished difference Result 568 states and 1682 transitions. [2021-11-20 23:13:30,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 23:13:30,933 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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-20 23:13:30,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:13:30,940 INFO L225 Difference]: With dead ends: 568 [2021-11-20 23:13:30,940 INFO L226 Difference]: Without dead ends: 560 [2021-11-20 23:13:30,941 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-20 23:13:30,942 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 66 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 23:13:30,943 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 15 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-20 23:13:30,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2021-11-20 23:13:30,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 293. [2021-11-20 23:13:30,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 292 states have (on average 3.154109589041096) internal successors, (921), 292 states have internal predecessors, (921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:13:30,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 921 transitions. [2021-11-20 23:13:30,977 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 921 transitions. Word has length 23 [2021-11-20 23:13:30,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:13:30,978 INFO L470 AbstractCegarLoop]: Abstraction has 293 states and 921 transitions. [2021-11-20 23:13:30,978 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:13:30,978 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 921 transitions. [2021-11-20 23:13:30,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-20 23:13:30,982 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:13:30,983 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:13:30,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-20 23:13:30,983 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:13:30,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:13:30,984 INFO L85 PathProgramCache]: Analyzing trace with hash -2043553384, now seen corresponding path program 1 times [2021-11-20 23:13:30,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:13:30,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357945832] [2021-11-20 23:13:30,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:13:30,985 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:13:31,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:13:31,106 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-20 23:13:31,106 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:13:31,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357945832] [2021-11-20 23:13:31,107 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357945832] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:13:31,107 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:13:31,107 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-20 23:13:31,107 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377402980] [2021-11-20 23:13:31,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:13:31,107 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 23:13:31,107 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:13:31,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 23:13:31,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-20 23:13:31,108 INFO L87 Difference]: Start difference. First operand 293 states and 921 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:13:31,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:13:31,283 INFO L93 Difference]: Finished difference Result 528 states and 1470 transitions. [2021-11-20 23:13:31,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 23:13:31,284 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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-20 23:13:31,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:13:31,289 INFO L225 Difference]: With dead ends: 528 [2021-11-20 23:13:31,290 INFO L226 Difference]: Without dead ends: 476 [2021-11-20 23:13:31,290 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-20 23:13:31,291 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 53 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 23:13:31,292 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 15 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 23:13:31,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2021-11-20 23:13:31,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 319. [2021-11-20 23:13:31,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 318 states have (on average 2.990566037735849) internal successors, (951), 318 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:13:31,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 951 transitions. [2021-11-20 23:13:31,320 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 951 transitions. Word has length 23 [2021-11-20 23:13:31,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:13:31,320 INFO L470 AbstractCegarLoop]: Abstraction has 319 states and 951 transitions. [2021-11-20 23:13:31,320 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:13:31,320 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 951 transitions. [2021-11-20 23:13:31,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-20 23:13:31,324 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:13:31,325 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:13:31,325 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-20 23:13:31,325 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:13:31,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:13:31,326 INFO L85 PathProgramCache]: Analyzing trace with hash -437087721, now seen corresponding path program 1 times [2021-11-20 23:13:31,326 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:13:31,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834627316] [2021-11-20 23:13:31,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:13:31,327 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:13:31,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:13:31,410 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-20 23:13:31,410 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:13:31,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834627316] [2021-11-20 23:13:31,411 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834627316] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:13:31,411 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:13:31,411 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-20 23:13:31,411 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026372701] [2021-11-20 23:13:31,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:13:31,412 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 23:13:31,412 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:13:31,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 23:13:31,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-20 23:13:31,413 INFO L87 Difference]: Start difference. First operand 319 states and 951 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:13:31,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:13:31,545 INFO L93 Difference]: Finished difference Result 340 states and 926 transitions. [2021-11-20 23:13:31,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 23:13:31,545 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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-20 23:13:31,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:13:31,548 INFO L225 Difference]: With dead ends: 340 [2021-11-20 23:13:31,548 INFO L226 Difference]: Without dead ends: 202 [2021-11-20 23:13:31,548 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-20 23:13:31,549 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 49 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 23:13:31,550 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 15 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 23:13:31,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-11-20 23:13:31,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2021-11-20 23:13:31,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 201 states have (on average 3.08955223880597) internal successors, (621), 201 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:13:31,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 621 transitions. [2021-11-20 23:13:31,563 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 621 transitions. Word has length 23 [2021-11-20 23:13:31,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:13:31,564 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 621 transitions. [2021-11-20 23:13:31,564 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:13:31,564 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 621 transitions. [2021-11-20 23:13:31,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-20 23:13:31,565 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:13:31,566 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:13:31,566 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-20 23:13:31,566 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:13:31,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:13:31,567 INFO L85 PathProgramCache]: Analyzing trace with hash -196278366, now seen corresponding path program 1 times [2021-11-20 23:13:31,567 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:13:31,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190850767] [2021-11-20 23:13:31,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:13:31,567 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:13:31,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:13:31,669 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:13:31,669 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:13:31,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190850767] [2021-11-20 23:13:31,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190850767] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:13:31,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317043646] [2021-11-20 23:13:31,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:13:31,670 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:13:31,671 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:13:31,672 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:13:31,692 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-20 23:13:31,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:13:31,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-20 23:13:31,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:13:32,001 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:13:32,001 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:13:32,154 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:13:32,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317043646] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-20 23:13:32,155 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-20 23:13:32,155 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2021-11-20 23:13:32,155 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104330796] [2021-11-20 23:13:32,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:13:32,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 23:13:32,156 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:13:32,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 23:13:32,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-11-20 23:13:32,158 INFO L87 Difference]: Start difference. First operand 202 states and 621 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:13:32,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:13:32,241 INFO L93 Difference]: Finished difference Result 198 states and 613 transitions. [2021-11-20 23:13:32,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-20 23:13:32,242 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-20 23:13:32,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:13:32,244 INFO L225 Difference]: With dead ends: 198 [2021-11-20 23:13:32,244 INFO L226 Difference]: Without dead ends: 198 [2021-11-20 23:13:32,245 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 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-20 23:13:32,247 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 52 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 23:13:32,248 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 7 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 23:13:32,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-11-20 23:13:32,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 142. [2021-11-20 23:13:32,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 3.0709219858156027) internal successors, (433), 141 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:13:32,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 433 transitions. [2021-11-20 23:13:32,263 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 433 transitions. Word has length 26 [2021-11-20 23:13:32,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:13:32,264 INFO L470 AbstractCegarLoop]: Abstraction has 142 states and 433 transitions. [2021-11-20 23:13:32,264 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:13:32,264 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 433 transitions. [2021-11-20 23:13:32,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-20 23:13:32,265 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:13:32,265 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:13:32,305 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-20 23:13:32,490 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:13:32,490 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:13:32,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:13:32,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1961955217, now seen corresponding path program 1 times [2021-11-20 23:13:32,491 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:13:32,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426657488] [2021-11-20 23:13:32,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:13:32,491 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:13:32,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:13:32,592 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:13:32,592 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:13:32,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426657488] [2021-11-20 23:13:32,592 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426657488] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:13:32,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810664913] [2021-11-20 23:13:32,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:13:32,595 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:13:32,595 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:13:32,596 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:13:32,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-20 23:13:32,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:13:32,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-20 23:13:32,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:13:32,827 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:13:32,827 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:13:32,908 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:13:32,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810664913] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-20 23:13:32,908 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-20 23:13:32,908 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2021-11-20 23:13:32,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157148774] [2021-11-20 23:13:32,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:13:32,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 23:13:32,909 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:13:32,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 23:13:32,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-11-20 23:13:32,910 INFO L87 Difference]: Start difference. First operand 142 states and 433 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:13:32,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:13:32,987 INFO L93 Difference]: Finished difference Result 176 states and 545 transitions. [2021-11-20 23:13:32,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-20 23:13:32,987 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-20 23:13:32,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:13:32,989 INFO L225 Difference]: With dead ends: 176 [2021-11-20 23:13:32,989 INFO L226 Difference]: Without dead ends: 176 [2021-11-20 23:13:32,990 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-20 23:13:32,990 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 49 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 23:13:32,991 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 7 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 23:13:32,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2021-11-20 23:13:32,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2021-11-20 23:13:32,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 175 states have (on average 3.1142857142857143) internal successors, (545), 175 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:13:32,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 545 transitions. [2021-11-20 23:13:32,999 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 545 transitions. Word has length 26 [2021-11-20 23:13:33,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:13:33,000 INFO L470 AbstractCegarLoop]: Abstraction has 176 states and 545 transitions. [2021-11-20 23:13:33,000 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:13:33,000 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 545 transitions. [2021-11-20 23:13:33,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-20 23:13:33,001 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:13:33,001 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:13:33,037 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-20 23:13:33,217 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:13:33,217 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:13:33,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:13:33,218 INFO L85 PathProgramCache]: Analyzing trace with hash -683341694, now seen corresponding path program 1 times [2021-11-20 23:13:33,218 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:13:33,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952930025] [2021-11-20 23:13:33,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:13:33,218 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:13:33,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:13:33,342 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-20 23:13:33,343 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:13:33,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952930025] [2021-11-20 23:13:33,343 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952930025] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:13:33,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408618125] [2021-11-20 23:13:33,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:13:33,343 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:13:33,344 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:13:33,344 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:13:33,365 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-20 23:13:33,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:13:33,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-20 23:13:33,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:13:33,544 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-20 23:13:33,545 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:13:33,631 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-20 23:13:33,631 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408618125] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-20 23:13:33,631 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-20 23:13:33,632 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2021-11-20 23:13:33,632 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13518726] [2021-11-20 23:13:33,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:13:33,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 23:13:33,632 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:13:33,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 23:13:33,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-11-20 23:13:33,633 INFO L87 Difference]: Start difference. First operand 176 states and 545 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 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-20 23:13:33,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:13:33,709 INFO L93 Difference]: Finished difference Result 218 states and 685 transitions. [2021-11-20 23:13:33,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-20 23:13:33,709 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 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 27 [2021-11-20 23:13:33,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:13:33,712 INFO L225 Difference]: With dead ends: 218 [2021-11-20 23:13:33,712 INFO L226 Difference]: Without dead ends: 218 [2021-11-20 23:13:33,712 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 47 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-20 23:13:33,713 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 37 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 23:13:33,713 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 7 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 23:13:33,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2021-11-20 23:13:33,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2021-11-20 23:13:33,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 217 states have (on average 3.1566820276497696) internal successors, (685), 217 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:13:33,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 685 transitions. [2021-11-20 23:13:33,723 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 685 transitions. Word has length 27 [2021-11-20 23:13:33,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:13:33,724 INFO L470 AbstractCegarLoop]: Abstraction has 218 states and 685 transitions. [2021-11-20 23:13:33,724 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 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-20 23:13:33,724 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 685 transitions. [2021-11-20 23:13:33,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:13:33,725 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:13:33,725 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:13:33,764 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-20 23:13:33,952 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:13:33,953 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:13:33,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:13:33,953 INFO L85 PathProgramCache]: Analyzing trace with hash 965870873, now seen corresponding path program 1 times [2021-11-20 23:13:33,954 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:13:33,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664965467] [2021-11-20 23:13:33,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:13:33,954 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:13:34,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:13:34,631 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:13:34,631 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:13:34,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664965467] [2021-11-20 23:13:34,632 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664965467] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:13:34,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335614026] [2021-11-20 23:13:34,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:13:34,632 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:13:34,632 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:13:34,634 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:13:34,655 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-20 23:13:34,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:13:34,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 72 conjunts are in the unsatisfiable core [2021-11-20 23:13:34,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:13:35,439 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-11-20 23:13:35,440 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 41 treesize of output 29 [2021-11-20 23:13:35,464 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:13:35,464 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:13:35,799 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:13:35,799 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 20 treesize of output 21 [2021-11-20 23:13:35,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:13:35,831 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:13:35,831 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 20 treesize of output 13 [2021-11-20 23:13:35,957 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:13:35,957 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335614026] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:13:35,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1069509727] [2021-11-20 23:13:35,967 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-20 23:13:35,973 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:13:35,973 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 6] total 14 [2021-11-20 23:13:35,974 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582541456] [2021-11-20 23:13:35,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:13:35,974 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-20 23:13:35,975 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:13:35,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-20 23:13:35,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2021-11-20 23:13:35,976 INFO L87 Difference]: Start difference. First operand 218 states and 685 transitions. Second operand has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 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-20 23:13:36,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:13:36,348 INFO L93 Difference]: Finished difference Result 297 states and 940 transitions. [2021-11-20 23:13:36,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-20 23:13:36,348 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 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 28 [2021-11-20 23:13:36,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:13:36,351 INFO L225 Difference]: With dead ends: 297 [2021-11-20 23:13:36,351 INFO L226 Difference]: Without dead ends: 290 [2021-11-20 23:13:36,352 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 44 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2021-11-20 23:13:36,353 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 52 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 106 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 23:13:36,353 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 33 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 346 Invalid, 0 Unknown, 106 Unchecked, 0.3s Time] [2021-11-20 23:13:36,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2021-11-20 23:13:36,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 256. [2021-11-20 23:13:36,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 255 states have (on average 3.243137254901961) internal successors, (827), 255 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:13:36,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 827 transitions. [2021-11-20 23:13:36,365 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 827 transitions. Word has length 28 [2021-11-20 23:13:36,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:13:36,366 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 827 transitions. [2021-11-20 23:13:36,366 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 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-20 23:13:36,366 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 827 transitions. [2021-11-20 23:13:36,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:13:36,368 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:13:36,368 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:13:36,405 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-20 23:13:36,580 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:13:36,581 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:13:36,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:13:36,581 INFO L85 PathProgramCache]: Analyzing trace with hash 294568447, now seen corresponding path program 2 times [2021-11-20 23:13:36,581 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:13:36,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484376493] [2021-11-20 23:13:36,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:13:36,582 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:13:36,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:13:37,214 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:13:37,214 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:13:37,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484376493] [2021-11-20 23:13:37,216 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484376493] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:13:37,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002466935] [2021-11-20 23:13:37,217 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 23:13:37,217 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:13:37,217 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:13:37,218 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:13:37,232 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-20 23:13:37,366 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-11-20 23:13:37,367 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:13:37,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 82 conjunts are in the unsatisfiable core [2021-11-20 23:13:37,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:13:37,430 INFO L354 Elim1Store]: treesize reduction 93, result has 14.7 percent of original size [2021-11-20 23:13:37,430 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 21 [2021-11-20 23:13:37,501 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 23:13:37,502 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 14 [2021-11-20 23:13:37,614 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 23:13:37,614 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 11 treesize of output 11 [2021-11-20 23:13:37,965 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:13:37,991 INFO L354 Elim1Store]: treesize reduction 52, result has 30.7 percent of original size [2021-11-20 23:13:37,991 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 49 [2021-11-20 23:13:38,239 INFO L354 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2021-11-20 23:13:38,240 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 72 treesize of output 56 [2021-11-20 23:13:38,342 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:13:38,343 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:13:46,738 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((~C~0.offset Int)) (let ((.cse2 (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse2))) (.cse1 (select (select |c_#memory_int| c_~B~0.base) (+ c_~B~0.offset .cse2)))) (<= (+ c_~csum~0 .cse0 .cse1) (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) (+ ~C~0.offset .cse2) (+ .cse0 .cse1))) c_~A~0.base) c_~A~0.offset)))))) (forall ((~C~0.offset Int)) (let ((.cse3 (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) (let ((.cse4 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse3))) (.cse5 (select (select |c_#memory_int| c_~B~0.base) (+ c_~B~0.offset .cse3)))) (<= (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) (+ ~C~0.offset .cse3) (+ .cse4 .cse5))) c_~A~0.base) c_~A~0.offset)) (+ c_~csum~0 .cse4 .cse5)))))) is different from false [2021-11-20 23:13:47,669 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((~C~0.offset Int)) (let ((.cse0 (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset)) (.cse1 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (<= (+ (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) ~C~0.offset (+ .cse0 .cse1))) c_~A~0.base) c_~A~0.offset) c_~asum~0 c_~bsum~0) (+ c_~csum~0 .cse0 .cse1)))) (forall ((~C~0.offset Int)) (let ((.cse2 (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset)) (.cse3 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (<= (+ c_~csum~0 .cse2 .cse3) (+ (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) ~C~0.offset (+ .cse2 .cse3))) c_~A~0.base) c_~A~0.offset) c_~asum~0 c_~bsum~0))))) is different from false [2021-11-20 23:13:47,697 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:13:47,697 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 52 treesize of output 44 [2021-11-20 23:13:47,749 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:13:47,756 INFO L354 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2021-11-20 23:13:47,757 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 20 treesize of output 13 [2021-11-20 23:13:48,097 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2021-11-20 23:13:48,097 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002466935] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:13:48,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1606327264] [2021-11-20 23:13:48,098 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-20 23:13:48,100 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:13:48,100 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2021-11-20 23:13:48,100 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629357020] [2021-11-20 23:13:48,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:13:48,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-11-20 23:13:48,102 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:13:48,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-20 23:13:48,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=358, Unknown=2, NotChecked=78, Total=506 [2021-11-20 23:13:48,103 INFO L87 Difference]: Start difference. First operand 256 states and 827 transitions. Second operand has 23 states, 22 states have (on average 2.409090909090909) internal successors, (53), 22 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-20 23:13:48,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:13:48,536 INFO L93 Difference]: Finished difference Result 314 states and 1017 transitions. [2021-11-20 23:13:48,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-20 23:13:48,536 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.409090909090909) internal successors, (53), 22 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 28 [2021-11-20 23:13:48,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:13:48,540 INFO L225 Difference]: With dead ends: 314 [2021-11-20 23:13:48,540 INFO L226 Difference]: Without dead ends: 307 [2021-11-20 23:13:48,540 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 39 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=117, Invalid=489, Unknown=2, NotChecked=94, Total=702 [2021-11-20 23:13:48,541 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 84 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 334 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 23:13:48,541 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 45 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 246 Invalid, 0 Unknown, 334 Unchecked, 0.2s Time] [2021-11-20 23:13:48,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2021-11-20 23:13:48,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 263. [2021-11-20 23:13:48,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 262 states have (on average 3.2595419847328246) internal successors, (854), 262 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:13:48,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 854 transitions. [2021-11-20 23:13:48,554 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 854 transitions. Word has length 28 [2021-11-20 23:13:48,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:13:48,554 INFO L470 AbstractCegarLoop]: Abstraction has 263 states and 854 transitions. [2021-11-20 23:13:48,554 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.409090909090909) internal successors, (53), 22 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-20 23:13:48,555 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 854 transitions. [2021-11-20 23:13:48,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:13:48,556 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:13:48,556 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:13:48,593 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-20 23:13:48,780 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-11-20 23:13:48,781 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:13:48,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:13:48,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1913800743, now seen corresponding path program 3 times [2021-11-20 23:13:48,781 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:13:48,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029642715] [2021-11-20 23:13:48,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:13:48,782 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:13:48,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:13:49,367 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:13:49,367 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:13:49,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029642715] [2021-11-20 23:13:49,367 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029642715] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:13:49,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063001837] [2021-11-20 23:13:49,368 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 23:13:49,368 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:13:49,368 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:13:49,369 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:13:49,372 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-20 23:13:49,477 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 23:13:49,477 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:13:49,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 84 conjunts are in the unsatisfiable core [2021-11-20 23:13:49,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:13:49,529 INFO L354 Elim1Store]: treesize reduction 93, result has 14.7 percent of original size [2021-11-20 23:13:49,530 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 21 [2021-11-20 23:13:49,589 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 23:13:49,589 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 14 [2021-11-20 23:13:49,681 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-20 23:13:49,681 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 16 treesize of output 18 [2021-11-20 23:13:50,213 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:13:50,229 INFO L354 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2021-11-20 23:13:50,229 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 42 [2021-11-20 23:13:50,466 INFO L354 Elim1Store]: treesize reduction 29, result has 21.6 percent of original size [2021-11-20 23:13:50,466 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 49 treesize of output 37 [2021-11-20 23:13:50,511 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:13:50,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:14:02,068 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((~C~0.offset Int)) (let ((.cse2 (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse2))) (.cse1 (select (select |c_#memory_int| c_~B~0.base) (+ c_~B~0.offset .cse2)))) (<= (+ c_~csum~0 .cse0 .cse1) (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) (+ ~C~0.offset .cse2) (+ .cse0 .cse1))) c_~A~0.base) c_~A~0.offset)))))) (forall ((~C~0.offset Int)) (let ((.cse3 (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) (let ((.cse4 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse3))) (.cse5 (select (select |c_#memory_int| c_~B~0.base) (+ c_~B~0.offset .cse3)))) (<= (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) (+ ~C~0.offset .cse3) (+ .cse4 .cse5))) c_~A~0.base) c_~A~0.offset)) (+ c_~csum~0 .cse4 .cse5)))))) is different from false [2021-11-20 23:14:03,071 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((~C~0.offset Int)) (let ((.cse0 (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset)) (.cse1 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (<= (+ (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) ~C~0.offset (+ .cse0 .cse1))) c_~A~0.base) c_~A~0.offset) c_~asum~0 c_~bsum~0) (+ c_~csum~0 .cse0 .cse1)))) (forall ((~C~0.offset Int)) (let ((.cse2 (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset)) (.cse3 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (<= (+ c_~csum~0 .cse2 .cse3) (+ (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) ~C~0.offset (+ .cse2 .cse3))) c_~A~0.base) c_~A~0.offset) c_~asum~0 c_~bsum~0))))) is different from false [2021-11-20 23:14:03,095 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:14:03,095 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 52 treesize of output 44 [2021-11-20 23:14:03,147 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:14:03,155 INFO L354 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2021-11-20 23:14:03,155 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 20 treesize of output 13 [2021-11-20 23:14:03,506 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2021-11-20 23:14:03,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063001837] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:14:03,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1266603127] [2021-11-20 23:14:03,508 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-20 23:14:03,509 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:14:03,509 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2021-11-20 23:14:03,510 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524558808] [2021-11-20 23:14:03,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:14:03,510 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-11-20 23:14:03,511 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:14:03,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-11-20 23:14:03,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=599, Unknown=7, NotChecked=102, Total=812 [2021-11-20 23:14:03,512 INFO L87 Difference]: Start difference. First operand 263 states and 854 transitions. Second operand has 29 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 28 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-20 23:14:04,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:14:04,131 INFO L93 Difference]: Finished difference Result 341 states and 1098 transitions. [2021-11-20 23:14:04,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-20 23:14:04,132 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 28 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 28 [2021-11-20 23:14:04,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:14:04,136 INFO L225 Difference]: With dead ends: 341 [2021-11-20 23:14:04,136 INFO L226 Difference]: Without dead ends: 334 [2021-11-20 23:14:04,136 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 35 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=173, Invalid=820, Unknown=7, NotChecked=122, Total=1122 [2021-11-20 23:14:04,137 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 79 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 335 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 23:14:04,137 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 50 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 427 Invalid, 0 Unknown, 335 Unchecked, 0.3s Time] [2021-11-20 23:14:04,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2021-11-20 23:14:04,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 264. [2021-11-20 23:14:04,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 263 states have (on average 3.2509505703422055) internal successors, (855), 263 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:14:04,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 855 transitions. [2021-11-20 23:14:04,150 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 855 transitions. Word has length 28 [2021-11-20 23:14:04,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:14:04,151 INFO L470 AbstractCegarLoop]: Abstraction has 264 states and 855 transitions. [2021-11-20 23:14:04,151 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 28 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-20 23:14:04,151 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 855 transitions. [2021-11-20 23:14:04,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:14:04,153 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:14:04,153 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:14:04,188 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-20 23:14:04,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-11-20 23:14:04,367 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:14:04,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:14:04,368 INFO L85 PathProgramCache]: Analyzing trace with hash 2107976321, now seen corresponding path program 4 times [2021-11-20 23:14:04,368 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:14:04,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024890091] [2021-11-20 23:14:04,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:14:04,368 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:14:04,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:14:04,875 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:14:04,876 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:14:04,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024890091] [2021-11-20 23:14:04,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024890091] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:14:04,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7043663] [2021-11-20 23:14:04,876 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-20 23:14:04,876 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:14:04,876 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:14:04,877 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:14:04,878 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-20 23:14:04,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:14:04,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 84 conjunts are in the unsatisfiable core [2021-11-20 23:14:04,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:14:05,012 INFO L354 Elim1Store]: treesize reduction 93, result has 14.7 percent of original size [2021-11-20 23:14:05,012 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 21 [2021-11-20 23:14:05,082 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-20 23:14:05,083 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-20 23:14:05,186 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-20 23:14:05,186 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 20 treesize of output 22 [2021-11-20 23:14:05,535 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:14:05,563 INFO L354 Elim1Store]: treesize reduction 52, result has 30.7 percent of original size [2021-11-20 23:14:05,563 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 49 [2021-11-20 23:14:08,148 INFO L354 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2021-11-20 23:14:08,148 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 72 treesize of output 56 [2021-11-20 23:14:08,237 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:14:08,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:14:16,139 WARN L227 SmtUtils]: Spent 5.11s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-20 23:14:17,164 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((~C~0.offset Int)) (let ((.cse0 (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset)) (.cse1 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (<= (+ (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) ~C~0.offset (+ .cse0 .cse1))) c_~A~0.base) c_~A~0.offset) c_~asum~0 c_~bsum~0) (+ c_~csum~0 .cse0 .cse1)))) (forall ((~C~0.offset Int)) (let ((.cse2 (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset)) (.cse3 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (<= (+ c_~csum~0 .cse2 .cse3) (+ (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) ~C~0.offset (+ .cse2 .cse3))) c_~A~0.base) c_~A~0.offset) c_~asum~0 c_~bsum~0))))) is different from false [2021-11-20 23:14:17,189 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:14:17,189 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 52 treesize of output 44 [2021-11-20 23:14:17,244 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:14:17,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:14:17,250 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:14:17,251 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 20 treesize of output 13 [2021-11-20 23:14:17,673 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2021-11-20 23:14:17,673 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [7043663] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:14:17,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1302962613] [2021-11-20 23:14:17,675 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-20 23:14:17,676 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:14:17,677 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2021-11-20 23:14:17,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082445969] [2021-11-20 23:14:17,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:14:17,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-11-20 23:14:17,678 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:14:17,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-20 23:14:17,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=4, NotChecked=42, Total=552 [2021-11-20 23:14:17,679 INFO L87 Difference]: Start difference. First operand 264 states and 855 transitions. Second operand has 24 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 23 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-20 23:14:18,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:14:18,267 INFO L93 Difference]: Finished difference Result 339 states and 1102 transitions. [2021-11-20 23:14:18,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-20 23:14:18,267 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 23 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 28 [2021-11-20 23:14:18,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:14:18,271 INFO L225 Difference]: With dead ends: 339 [2021-11-20 23:14:18,271 INFO L226 Difference]: Without dead ends: 332 [2021-11-20 23:14:18,272 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 39 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=134, Invalid=622, Unknown=4, NotChecked=52, Total=812 [2021-11-20 23:14:18,273 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 85 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 222 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 23:14:18,274 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 69 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 352 Invalid, 0 Unknown, 222 Unchecked, 0.3s Time] [2021-11-20 23:14:18,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2021-11-20 23:14:18,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 279. [2021-11-20 23:14:18,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 278 states have (on average 3.273381294964029) internal successors, (910), 278 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:14:18,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 910 transitions. [2021-11-20 23:14:18,289 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 910 transitions. Word has length 28 [2021-11-20 23:14:18,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:14:18,289 INFO L470 AbstractCegarLoop]: Abstraction has 279 states and 910 transitions. [2021-11-20 23:14:18,290 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 23 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-20 23:14:18,290 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 910 transitions. [2021-11-20 23:14:18,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:14:18,291 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:14:18,291 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:14:18,329 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-20 23:14:18,508 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-11-20 23:14:18,508 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:14:18,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:14:18,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1785675749, now seen corresponding path program 5 times [2021-11-20 23:14:18,509 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:14:18,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577820644] [2021-11-20 23:14:18,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:14:18,509 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:14:18,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:14:19,062 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:14:19,063 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:14:19,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577820644] [2021-11-20 23:14:19,063 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577820644] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:14:19,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493308336] [2021-11-20 23:14:19,063 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 23:14:19,063 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:14:19,063 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:14:19,065 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:14:19,080 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-20 23:14:19,169 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-20 23:14:19,170 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:14:19,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 82 conjunts are in the unsatisfiable core [2021-11-20 23:14:19,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:14:19,224 INFO L354 Elim1Store]: treesize reduction 93, result has 14.7 percent of original size [2021-11-20 23:14:19,225 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 21 [2021-11-20 23:14:19,291 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 23:14:19,291 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 14 [2021-11-20 23:14:19,391 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 23:14:19,391 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 11 treesize of output 11 [2021-11-20 23:14:19,708 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:14:19,729 INFO L354 Elim1Store]: treesize reduction 52, result has 30.7 percent of original size [2021-11-20 23:14:19,729 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 49 [2021-11-20 23:14:20,203 INFO L354 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2021-11-20 23:14:20,204 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 72 treesize of output 56 [2021-11-20 23:14:20,269 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:14:20,269 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:14:27,320 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:14:27,320 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 44 [2021-11-20 23:14:27,371 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:14:27,377 INFO L354 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2021-11-20 23:14:27,377 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 20 treesize of output 13 [2021-11-20 23:14:27,722 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:14:27,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493308336] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:14:27,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [502147919] [2021-11-20 23:14:27,724 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-20 23:14:27,725 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:14:27,726 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2021-11-20 23:14:27,726 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69142724] [2021-11-20 23:14:27,726 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:14:27,726 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-11-20 23:14:27,727 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:14:27,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-20 23:14:27,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=473, Unknown=1, NotChecked=0, Total=552 [2021-11-20 23:14:27,728 INFO L87 Difference]: Start difference. First operand 279 states and 910 transitions. Second operand has 24 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 23 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-20 23:14:28,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:14:28,097 INFO L93 Difference]: Finished difference Result 355 states and 1150 transitions. [2021-11-20 23:14:28,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-20 23:14:28,098 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 23 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 28 [2021-11-20 23:14:28,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:14:28,102 INFO L225 Difference]: With dead ends: 355 [2021-11-20 23:14:28,102 INFO L226 Difference]: Without dead ends: 348 [2021-11-20 23:14:28,102 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=119, Invalid=636, Unknown=1, NotChecked=0, Total=756 [2021-11-20 23:14:28,103 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 53 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 202 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 23:14:28,103 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 81 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 255 Invalid, 0 Unknown, 202 Unchecked, 0.2s Time] [2021-11-20 23:14:28,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2021-11-20 23:14:28,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 284. [2021-11-20 23:14:28,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 283 states have (on average 3.2897526501766783) internal successors, (931), 283 states have internal predecessors, (931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:14:28,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 931 transitions. [2021-11-20 23:14:28,116 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 931 transitions. Word has length 28 [2021-11-20 23:14:28,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:14:28,117 INFO L470 AbstractCegarLoop]: Abstraction has 284 states and 931 transitions. [2021-11-20 23:14:28,117 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 23 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-20 23:14:28,117 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 931 transitions. [2021-11-20 23:14:28,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:14:28,119 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:14:28,119 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:14:28,156 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-20 23:14:28,344 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:14:28,345 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:14:28,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:14:28,345 INFO L85 PathProgramCache]: Analyzing trace with hash -96099303, now seen corresponding path program 6 times [2021-11-20 23:14:28,345 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:14:28,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322860409] [2021-11-20 23:14:28,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:14:28,346 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:14:28,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:14:28,768 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:14:28,768 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:14:28,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322860409] [2021-11-20 23:14:28,769 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322860409] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:14:28,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026862307] [2021-11-20 23:14:28,769 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 23:14:28,769 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:14:28,769 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:14:28,773 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:14:28,780 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-20 23:14:28,885 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 23:14:28,885 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:14:28,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 72 conjunts are in the unsatisfiable core [2021-11-20 23:14:28,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:14:29,437 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-11-20 23:14:29,438 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 41 treesize of output 29 [2021-11-20 23:14:29,456 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:14:29,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:14:29,652 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:14:29,652 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 20 treesize of output 21 [2021-11-20 23:14:29,670 INFO L354 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2021-11-20 23:14:29,671 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 20 treesize of output 13 [2021-11-20 23:14:29,777 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:14:29,777 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026862307] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:14:29,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [453365759] [2021-11-20 23:14:29,778 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-20 23:14:29,778 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:14:29,779 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 6] total 14 [2021-11-20 23:14:29,779 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183474565] [2021-11-20 23:14:29,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:14:29,779 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-20 23:14:29,780 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:14:29,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-20 23:14:29,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2021-11-20 23:14:29,780 INFO L87 Difference]: Start difference. First operand 284 states and 931 transitions. Second operand has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 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-20 23:14:30,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:14:30,344 INFO L93 Difference]: Finished difference Result 393 states and 1276 transitions. [2021-11-20 23:14:30,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-20 23:14:30,345 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 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 28 [2021-11-20 23:14:30,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:14:30,349 INFO L225 Difference]: With dead ends: 393 [2021-11-20 23:14:30,349 INFO L226 Difference]: Without dead ends: 386 [2021-11-20 23:14:30,349 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 44 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2021-11-20 23:14:30,350 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 62 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 82 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-20 23:14:30,350 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 67 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 613 Invalid, 0 Unknown, 82 Unchecked, 0.5s Time] [2021-11-20 23:14:30,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2021-11-20 23:14:30,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 308. [2021-11-20 23:14:30,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 307 states have (on average 3.2801302931596092) internal successors, (1007), 307 states have internal predecessors, (1007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:14:30,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 1007 transitions. [2021-11-20 23:14:30,365 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 1007 transitions. Word has length 28 [2021-11-20 23:14:30,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:14:30,366 INFO L470 AbstractCegarLoop]: Abstraction has 308 states and 1007 transitions. [2021-11-20 23:14:30,366 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 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-20 23:14:30,366 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 1007 transitions. [2021-11-20 23:14:30,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:14:30,368 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:14:30,368 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:14:30,404 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-20 23:14:30,580 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:14:30,581 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:14:30,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:14:30,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1059068149, now seen corresponding path program 7 times [2021-11-20 23:14:30,581 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:14:30,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908947622] [2021-11-20 23:14:30,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:14:30,582 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:14:30,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:14:31,075 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:14:31,075 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:14:31,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908947622] [2021-11-20 23:14:31,075 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908947622] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:14:31,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979135862] [2021-11-20 23:14:31,076 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-20 23:14:31,076 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:14:31,076 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:14:31,077 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:14:31,100 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-20 23:14:31,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:14:31,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 72 conjunts are in the unsatisfiable core [2021-11-20 23:14:31,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:14:31,676 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-11-20 23:14:31,677 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 41 treesize of output 29 [2021-11-20 23:14:31,705 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:14:31,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:14:34,028 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:14:34,028 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 20 treesize of output 21 [2021-11-20 23:14:34,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:14:34,048 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:14:34,048 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 20 treesize of output 13 [2021-11-20 23:14:34,128 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:14:34,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [979135862] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:14:34,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1957398584] [2021-11-20 23:14:34,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-20 23:14:34,131 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:14:34,131 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 6] total 14 [2021-11-20 23:14:34,131 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067757243] [2021-11-20 23:14:34,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:14:34,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-20 23:14:34,132 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:14:34,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-20 23:14:34,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2021-11-20 23:14:34,133 INFO L87 Difference]: Start difference. First operand 308 states and 1007 transitions. Second operand has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 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-20 23:14:34,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:14:34,580 INFO L93 Difference]: Finished difference Result 379 states and 1234 transitions. [2021-11-20 23:14:34,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-20 23:14:34,581 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 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 28 [2021-11-20 23:14:34,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:14:34,584 INFO L225 Difference]: With dead ends: 379 [2021-11-20 23:14:34,585 INFO L226 Difference]: Without dead ends: 372 [2021-11-20 23:14:34,585 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 44 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2021-11-20 23:14:34,586 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 63 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 137 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-20 23:14:34,586 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 45 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 519 Invalid, 0 Unknown, 137 Unchecked, 0.4s Time] [2021-11-20 23:14:34,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2021-11-20 23:14:34,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 312. [2021-11-20 23:14:34,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 311 states have (on average 3.282958199356913) internal successors, (1021), 311 states have internal predecessors, (1021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:14:34,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 1021 transitions. [2021-11-20 23:14:34,600 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 1021 transitions. Word has length 28 [2021-11-20 23:14:34,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:14:34,600 INFO L470 AbstractCegarLoop]: Abstraction has 312 states and 1021 transitions. [2021-11-20 23:14:34,600 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 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-20 23:14:34,601 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 1021 transitions. [2021-11-20 23:14:34,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:14:34,602 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:14:34,602 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:14:34,627 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-20 23:14:34,814 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-11-20 23:14:34,815 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:14:34,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:14:34,815 INFO L85 PathProgramCache]: Analyzing trace with hash 387765723, now seen corresponding path program 8 times [2021-11-20 23:14:34,815 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:14:34,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052988202] [2021-11-20 23:14:34,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:14:34,815 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:14:34,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:14:35,334 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:14:35,334 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:14:35,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052988202] [2021-11-20 23:14:35,334 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052988202] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:14:35,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510321746] [2021-11-20 23:14:35,335 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 23:14:35,335 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:14:35,335 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:14:35,335 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:14:35,338 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-20 23:14:35,448 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-11-20 23:14:35,448 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:14:35,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 82 conjunts are in the unsatisfiable core [2021-11-20 23:14:35,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:14:35,494 INFO L354 Elim1Store]: treesize reduction 93, result has 14.7 percent of original size [2021-11-20 23:14:35,495 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 21 [2021-11-20 23:14:35,549 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 23:14:35,549 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 14 [2021-11-20 23:14:35,651 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 23:14:35,651 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 11 treesize of output 11 [2021-11-20 23:14:35,962 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:14:35,992 INFO L354 Elim1Store]: treesize reduction 52, result has 30.7 percent of original size [2021-11-20 23:14:35,992 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 49 [2021-11-20 23:14:36,193 INFO L354 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2021-11-20 23:14:36,193 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 72 treesize of output 56 [2021-11-20 23:14:36,274 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:14:36,274 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:14:37,612 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((~C~0.offset Int)) (let ((.cse0 (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) (let ((.cse1 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse0))) (.cse2 (select (select |c_#memory_int| c_~B~0.base) (+ c_~B~0.offset .cse0)))) (<= (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) (+ ~C~0.offset .cse0) (+ .cse1 .cse2))) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork2_~i~0#1| 4) c_~A~0.offset))) (+ c_~csum~0 .cse1 .cse2))))) (forall ((~C~0.offset Int)) (let ((.cse5 (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) (let ((.cse3 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse5))) (.cse4 (select (select |c_#memory_int| c_~B~0.base) (+ c_~B~0.offset .cse5)))) (<= (+ c_~csum~0 .cse3 .cse4) (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) (+ ~C~0.offset .cse5) (+ .cse3 .cse4))) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork2_~i~0#1| 4) c_~A~0.offset)))))))) is different from false [2021-11-20 23:14:43,654 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:14:43,655 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 52 treesize of output 44 [2021-11-20 23:14:43,703 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:14:43,709 INFO L354 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2021-11-20 23:14:43,709 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 20 treesize of output 13 [2021-11-20 23:14:44,043 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2021-11-20 23:14:44,043 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [510321746] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:14:44,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [369273109] [2021-11-20 23:14:44,044 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-20 23:14:44,045 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:14:44,045 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2021-11-20 23:14:44,045 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225158358] [2021-11-20 23:14:44,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:14:44,045 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-11-20 23:14:44,046 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:14:44,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-20 23:14:44,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=391, Unknown=3, NotChecked=40, Total=506 [2021-11-20 23:14:44,046 INFO L87 Difference]: Start difference. First operand 312 states and 1021 transitions. Second operand has 23 states, 22 states have (on average 2.409090909090909) internal successors, (53), 22 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-20 23:14:44,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:14:44,378 INFO L93 Difference]: Finished difference Result 373 states and 1218 transitions. [2021-11-20 23:14:44,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-20 23:14:44,379 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.409090909090909) internal successors, (53), 22 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 28 [2021-11-20 23:14:44,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:14:44,382 INFO L225 Difference]: With dead ends: 373 [2021-11-20 23:14:44,382 INFO L226 Difference]: Without dead ends: 366 [2021-11-20 23:14:44,383 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 38 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=104, Invalid=547, Unknown=3, NotChecked=48, Total=702 [2021-11-20 23:14:44,384 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 67 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 273 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 23:14:44,384 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 50 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 214 Invalid, 0 Unknown, 273 Unchecked, 0.2s Time] [2021-11-20 23:14:44,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2021-11-20 23:14:44,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 308. [2021-11-20 23:14:44,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 307 states have (on average 3.2801302931596092) internal successors, (1007), 307 states have internal predecessors, (1007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:14:44,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 1007 transitions. [2021-11-20 23:14:44,398 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 1007 transitions. Word has length 28 [2021-11-20 23:14:44,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:14:44,398 INFO L470 AbstractCegarLoop]: Abstraction has 308 states and 1007 transitions. [2021-11-20 23:14:44,398 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.409090909090909) internal successors, (53), 22 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-20 23:14:44,399 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 1007 transitions. [2021-11-20 23:14:44,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:14:44,400 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:14:44,400 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:14:44,439 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-11-20 23:14:44,628 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-11-20 23:14:44,629 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:14:44,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:14:44,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1527031605, now seen corresponding path program 9 times [2021-11-20 23:14:44,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:14:44,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924625558] [2021-11-20 23:14:44,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:14:44,629 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:14:44,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:14:45,260 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:14:45,260 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:14:45,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924625558] [2021-11-20 23:14:45,261 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924625558] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:14:45,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770439911] [2021-11-20 23:14:45,261 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 23:14:45,261 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:14:45,261 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:14:45,262 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:14:45,263 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-20 23:14:45,358 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 23:14:45,358 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:14:45,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 84 conjunts are in the unsatisfiable core [2021-11-20 23:14:45,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:14:45,424 INFO L354 Elim1Store]: treesize reduction 93, result has 14.7 percent of original size [2021-11-20 23:14:45,424 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 21 [2021-11-20 23:14:45,514 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 23:14:45,514 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 14 [2021-11-20 23:14:45,598 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-20 23:14:45,599 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 16 treesize of output 18 [2021-11-20 23:14:45,970 INFO L354 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2021-11-20 23:14:45,970 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 42 [2021-11-20 23:14:46,767 INFO L354 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2021-11-20 23:14:46,768 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 43 treesize of output 31 [2021-11-20 23:14:46,812 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:14:46,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:14:48,002 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((~C~0.offset Int)) (let ((.cse2 (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse2))) (.cse1 (select (select |c_#memory_int| c_~B~0.base) (+ c_~B~0.offset .cse2)))) (<= (+ c_~csum~0 .cse0 .cse1) (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) (+ ~C~0.offset .cse2) (+ .cse0 .cse1))) c_~A~0.base) c_~A~0.offset)))))) (forall ((~C~0.offset Int)) (let ((.cse3 (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) (let ((.cse4 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse3))) (.cse5 (select (select |c_#memory_int| c_~B~0.base) (+ c_~B~0.offset .cse3)))) (<= (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) (+ ~C~0.offset .cse3) (+ .cse4 .cse5))) c_~A~0.base) c_~A~0.offset)) (+ c_~csum~0 .cse4 .cse5)))))) is different from false [2021-11-20 23:14:59,490 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:14:59,490 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 52 treesize of output 44 [2021-11-20 23:14:59,556 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:14:59,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:14:59,560 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:14:59,560 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 20 treesize of output 13 [2021-11-20 23:14:59,935 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2021-11-20 23:14:59,935 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770439911] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:14:59,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1141491714] [2021-11-20 23:14:59,936 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-20 23:14:59,938 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:14:59,938 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 32 [2021-11-20 23:14:59,938 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176996845] [2021-11-20 23:14:59,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:14:59,939 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-11-20 23:14:59,939 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:14:59,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-11-20 23:14:59,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=919, Unknown=7, NotChecked=62, Total=1122 [2021-11-20 23:14:59,941 INFO L87 Difference]: Start difference. First operand 308 states and 1007 transitions. Second operand has 34 states, 33 states have (on average 2.121212121212121) internal successors, (70), 33 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:00,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:15:00,599 INFO L93 Difference]: Finished difference Result 393 states and 1271 transitions. [2021-11-20 23:15:00,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-20 23:15:00,600 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.121212121212121) internal successors, (70), 33 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-11-20 23:15:00,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:15:00,604 INFO L225 Difference]: With dead ends: 393 [2021-11-20 23:15:00,604 INFO L226 Difference]: Without dead ends: 386 [2021-11-20 23:15:00,605 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=220, Invalid=1259, Unknown=7, NotChecked=74, Total=1560 [2021-11-20 23:15:00,605 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 108 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 343 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 23:15:00,606 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 79 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 427 Invalid, 0 Unknown, 343 Unchecked, 0.3s Time] [2021-11-20 23:15:00,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2021-11-20 23:15:00,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 296. [2021-11-20 23:15:00,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 295 states have (on average 3.2508474576271187) internal successors, (959), 295 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:00,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 959 transitions. [2021-11-20 23:15:00,620 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 959 transitions. Word has length 28 [2021-11-20 23:15:00,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:15:00,620 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 959 transitions. [2021-11-20 23:15:00,620 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.121212121212121) internal successors, (70), 33 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:00,621 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 959 transitions. [2021-11-20 23:15:00,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:15:00,622 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:15:00,622 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:15:00,661 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-11-20 23:15:00,835 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-11-20 23:15:00,835 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:15:00,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:15:00,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1085283333, now seen corresponding path program 10 times [2021-11-20 23:15:00,836 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:15:00,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872145035] [2021-11-20 23:15:00,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:15:00,836 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:15:00,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:15:01,336 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:15:01,336 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:15:01,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872145035] [2021-11-20 23:15:01,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872145035] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:15:01,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959309608] [2021-11-20 23:15:01,337 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-20 23:15:01,337 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:15:01,337 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:15:01,341 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:15:01,360 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-11-20 23:15:01,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:15:01,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 72 conjunts are in the unsatisfiable core [2021-11-20 23:15:01,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:15:01,923 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-11-20 23:15:01,924 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 41 treesize of output 29 [2021-11-20 23:15:01,950 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:15:01,950 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:15:06,697 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:15:06,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 38 treesize of output 107 [2021-11-20 23:15:07,058 INFO L354 Elim1Store]: treesize reduction 73, result has 24.7 percent of original size [2021-11-20 23:15:07,059 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 38 treesize of output 34 [2021-11-20 23:15:07,175 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:15:07,175 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959309608] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:15:07,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1877648238] [2021-11-20 23:15:07,176 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-20 23:15:07,189 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:15:07,190 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 6] total 14 [2021-11-20 23:15:07,190 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253950384] [2021-11-20 23:15:07,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:15:07,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-20 23:15:07,191 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:15:07,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-20 23:15:07,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2021-11-20 23:15:07,192 INFO L87 Difference]: Start difference. First operand 296 states and 959 transitions. Second operand has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 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-20 23:15:07,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:15:07,452 INFO L93 Difference]: Finished difference Result 355 states and 1148 transitions. [2021-11-20 23:15:07,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-20 23:15:07,453 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 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 28 [2021-11-20 23:15:07,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:15:07,456 INFO L225 Difference]: With dead ends: 355 [2021-11-20 23:15:07,456 INFO L226 Difference]: Without dead ends: 348 [2021-11-20 23:15:07,457 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 44 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2021-11-20 23:15:07,457 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 49 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 122 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 23:15:07,458 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 28 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 247 Invalid, 0 Unknown, 122 Unchecked, 0.2s Time] [2021-11-20 23:15:07,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2021-11-20 23:15:07,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 306. [2021-11-20 23:15:07,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 305 states have (on average 3.259016393442623) internal successors, (994), 305 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:07,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 994 transitions. [2021-11-20 23:15:07,472 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 994 transitions. Word has length 28 [2021-11-20 23:15:07,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:15:07,473 INFO L470 AbstractCegarLoop]: Abstraction has 306 states and 994 transitions. [2021-11-20 23:15:07,473 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 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-20 23:15:07,473 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 994 transitions. [2021-11-20 23:15:07,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:15:07,475 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:15:07,475 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:15:07,516 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-11-20 23:15:07,700 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-11-20 23:15:07,701 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:15:07,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:15:07,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1756585759, now seen corresponding path program 11 times [2021-11-20 23:15:07,701 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:15:07,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211752081] [2021-11-20 23:15:07,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:15:07,702 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:15:07,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:15:08,202 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:15:08,203 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:15:08,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211752081] [2021-11-20 23:15:08,203 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211752081] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:15:08,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596696464] [2021-11-20 23:15:08,204 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 23:15:08,204 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:15:08,204 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:15:08,205 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:15:08,206 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-11-20 23:15:08,318 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-11-20 23:15:08,318 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:15:08,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 82 conjunts are in the unsatisfiable core [2021-11-20 23:15:08,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:15:08,377 INFO L354 Elim1Store]: treesize reduction 93, result has 14.7 percent of original size [2021-11-20 23:15:08,378 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 21 [2021-11-20 23:15:08,426 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 23:15:08,428 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 14 [2021-11-20 23:15:08,477 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 23:15:08,477 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 11 treesize of output 11 [2021-11-20 23:15:08,780 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:15:08,802 INFO L354 Elim1Store]: treesize reduction 52, result has 30.7 percent of original size [2021-11-20 23:15:08,803 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 49 [2021-11-20 23:15:09,020 INFO L354 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2021-11-20 23:15:09,020 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 72 treesize of output 56 [2021-11-20 23:15:09,093 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:15:09,093 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:15:35,376 WARN L227 SmtUtils]: Spent 5.53s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-20 23:15:35,422 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:15:35,422 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 78 treesize of output 138 [2021-11-20 23:15:35,793 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:15:35,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:15:35,816 INFO L354 Elim1Store]: treesize reduction 61, result has 28.2 percent of original size [2021-11-20 23:15:35,816 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 38 treesize of output 34 [2021-11-20 23:15:36,113 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:15:36,114 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596696464] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:15:36,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1199359068] [2021-11-20 23:15:36,115 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-20 23:15:36,115 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:15:36,115 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 20 [2021-11-20 23:15:36,115 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390987905] [2021-11-20 23:15:36,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:15:36,116 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-11-20 23:15:36,116 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:15:36,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-20 23:15:36,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=379, Unknown=10, NotChecked=0, Total=462 [2021-11-20 23:15:36,117 INFO L87 Difference]: Start difference. First operand 306 states and 994 transitions. Second operand has 22 states, 21 states have (on average 2.380952380952381) internal successors, (50), 21 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:36,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:15:36,495 INFO L93 Difference]: Finished difference Result 345 states and 1122 transitions. [2021-11-20 23:15:36,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-20 23:15:36,496 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.380952380952381) internal successors, (50), 21 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-11-20 23:15:36,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:15:36,499 INFO L225 Difference]: With dead ends: 345 [2021-11-20 23:15:36,499 INFO L226 Difference]: Without dead ends: 338 [2021-11-20 23:15:36,500 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 39 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 26.7s TimeCoverageRelationStatistics Valid=117, Invalid=575, Unknown=10, NotChecked=0, Total=702 [2021-11-20 23:15:36,500 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 50 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 186 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 23:15:36,501 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 48 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 280 Invalid, 0 Unknown, 186 Unchecked, 0.2s Time] [2021-11-20 23:15:36,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2021-11-20 23:15:36,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 310. [2021-11-20 23:15:36,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 309 states have (on average 3.2750809061488675) internal successors, (1012), 309 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:36,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 1012 transitions. [2021-11-20 23:15:36,513 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 1012 transitions. Word has length 28 [2021-11-20 23:15:36,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:15:36,514 INFO L470 AbstractCegarLoop]: Abstraction has 310 states and 1012 transitions. [2021-11-20 23:15:36,514 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.380952380952381) internal successors, (50), 21 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:36,514 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 1012 transitions. [2021-11-20 23:15:36,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:15:36,516 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:15:36,516 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:15:36,554 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-11-20 23:15:36,740 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-11-20 23:15:36,741 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:15:36,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:15:36,741 INFO L85 PathProgramCache]: Analyzing trace with hash 330012347, now seen corresponding path program 12 times [2021-11-20 23:15:36,741 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:15:36,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702955783] [2021-11-20 23:15:36,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:15:36,742 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:15:36,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:15:37,562 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:15:37,562 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:15:37,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702955783] [2021-11-20 23:15:37,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702955783] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:15:37,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332528603] [2021-11-20 23:15:37,563 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 23:15:37,563 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:15:37,563 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:15:37,563 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:15:37,566 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-11-20 23:15:37,643 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 23:15:37,644 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:15:37,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 84 conjunts are in the unsatisfiable core [2021-11-20 23:15:37,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:15:37,687 INFO L354 Elim1Store]: treesize reduction 93, result has 14.7 percent of original size [2021-11-20 23:15:37,695 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 21 [2021-11-20 23:15:37,789 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-20 23:15:37,789 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-20 23:15:37,883 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-20 23:15:37,883 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 20 treesize of output 22 [2021-11-20 23:15:38,232 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:15:38,253 INFO L354 Elim1Store]: treesize reduction 52, result has 30.7 percent of original size [2021-11-20 23:15:38,254 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 49 [2021-11-20 23:15:38,559 INFO L354 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2021-11-20 23:15:38,560 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 72 treesize of output 56 [2021-11-20 23:15:38,618 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:15:38,619 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:15:50,812 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((~C~0.offset Int)) (let ((.cse2 (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse2))) (.cse1 (select (select |c_#memory_int| c_~B~0.base) (+ c_~B~0.offset .cse2)))) (<= (+ c_~csum~0 .cse0 .cse1) (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) (+ ~C~0.offset .cse2) (+ .cse0 .cse1))) c_~A~0.base) c_~A~0.offset)))))) (forall ((~C~0.offset Int)) (let ((.cse3 (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) (let ((.cse4 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse3))) (.cse5 (select (select |c_#memory_int| c_~B~0.base) (+ c_~B~0.offset .cse3)))) (<= (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) (+ ~C~0.offset .cse3) (+ .cse4 .cse5))) c_~A~0.base) c_~A~0.offset)) (+ c_~csum~0 .cse4 .cse5)))))) is different from false [2021-11-20 23:15:50,874 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:15:50,874 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 78 treesize of output 138 [2021-11-20 23:15:51,256 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:15:51,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:15:51,279 INFO L354 Elim1Store]: treesize reduction 65, result has 23.5 percent of original size [2021-11-20 23:15:51,279 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 38 treesize of output 30 [2021-11-20 23:15:51,676 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2021-11-20 23:15:51,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332528603] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:15:51,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1766639451] [2021-11-20 23:15:51,677 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-20 23:15:51,677 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:15:51,677 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 27 [2021-11-20 23:15:51,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399354867] [2021-11-20 23:15:51,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:15:51,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-11-20 23:15:51,678 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:15:51,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-11-20 23:15:51,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=649, Unknown=3, NotChecked=52, Total=812 [2021-11-20 23:15:51,679 INFO L87 Difference]: Start difference. First operand 310 states and 1012 transitions. Second operand has 29 states, 28 states have (on average 2.25) internal successors, (63), 28 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-20 23:15:52,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:15:52,243 INFO L93 Difference]: Finished difference Result 357 states and 1145 transitions. [2021-11-20 23:15:52,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-20 23:15:52,244 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.25) internal successors, (63), 28 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 28 [2021-11-20 23:15:52,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:15:52,246 INFO L225 Difference]: With dead ends: 357 [2021-11-20 23:15:52,246 INFO L226 Difference]: Without dead ends: 350 [2021-11-20 23:15:52,247 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 40 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=199, Invalid=992, Unknown=3, NotChecked=66, Total=1260 [2021-11-20 23:15:52,247 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 73 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 278 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 23:15:52,247 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 62 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 486 Invalid, 0 Unknown, 278 Unchecked, 0.3s Time] [2021-11-20 23:15:52,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2021-11-20 23:15:52,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 311. [2021-11-20 23:15:52,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 310 states have (on average 3.2774193548387096) internal successors, (1016), 310 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:52,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 1016 transitions. [2021-11-20 23:15:52,260 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 1016 transitions. Word has length 28 [2021-11-20 23:15:52,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:15:52,260 INFO L470 AbstractCegarLoop]: Abstraction has 311 states and 1016 transitions. [2021-11-20 23:15:52,261 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.25) internal successors, (63), 28 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-20 23:15:52,261 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 1016 transitions. [2021-11-20 23:15:52,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:15:52,262 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:15:52,263 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:15:52,304 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-11-20 23:15:52,476 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:15:52,477 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:15:52,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:15:52,477 INFO L85 PathProgramCache]: Analyzing trace with hash 56822115, now seen corresponding path program 13 times [2021-11-20 23:15:52,477 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:15:52,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407745538] [2021-11-20 23:15:52,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:15:52,478 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:15:52,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:15:53,297 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:15:53,297 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:15:53,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407745538] [2021-11-20 23:15:53,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407745538] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:15:53,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402207707] [2021-11-20 23:15:53,298 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-20 23:15:53,298 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:15:53,298 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:15:53,301 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:15:53,327 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-11-20 23:15:53,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:15:53,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 84 conjunts are in the unsatisfiable core [2021-11-20 23:15:53,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:15:53,445 INFO L354 Elim1Store]: treesize reduction 93, result has 14.7 percent of original size [2021-11-20 23:15:53,446 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 21 [2021-11-20 23:15:53,524 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-20 23:15:53,525 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-20 23:15:53,625 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-20 23:15:53,625 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2021-11-20 23:15:53,955 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:15:53,989 INFO L354 Elim1Store]: treesize reduction 89, result has 25.2 percent of original size [2021-11-20 23:15:53,990 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 64 [2021-11-20 23:15:56,400 INFO L354 Elim1Store]: treesize reduction 41, result has 36.9 percent of original size [2021-11-20 23:15:56,400 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 72 treesize of output 59 [2021-11-20 23:15:56,481 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:15:56,481 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:16:01,299 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:16:01,299 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 78 treesize of output 138 [2021-11-20 23:16:01,729 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:16:01,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:16:01,751 INFO L354 Elim1Store]: treesize reduction 65, result has 23.5 percent of original size [2021-11-20 23:16:01,752 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 38 treesize of output 30 [2021-11-20 23:16:02,159 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:16:02,159 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1402207707] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:16:02,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [62610515] [2021-11-20 23:16:02,160 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-20 23:16:02,161 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:16:02,161 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 28 [2021-11-20 23:16:02,162 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025096974] [2021-11-20 23:16:02,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:16:02,162 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-11-20 23:16:02,162 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:16:02,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-11-20 23:16:02,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=746, Unknown=2, NotChecked=0, Total=870 [2021-11-20 23:16:02,163 INFO L87 Difference]: Start difference. First operand 311 states and 1016 transitions. Second operand has 30 states, 29 states have (on average 2.206896551724138) internal successors, (64), 29 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:16:02,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:16:02,691 INFO L93 Difference]: Finished difference Result 373 states and 1216 transitions. [2021-11-20 23:16:02,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-20 23:16:02,692 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.206896551724138) internal successors, (64), 29 states have internal predecessors, (64), 0 states have call successors, (0), 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 28 [2021-11-20 23:16:02,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:16:02,695 INFO L225 Difference]: With dead ends: 373 [2021-11-20 23:16:02,696 INFO L226 Difference]: Without dead ends: 366 [2021-11-20 23:16:02,696 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=213, Invalid=1117, Unknown=2, NotChecked=0, Total=1332 [2021-11-20 23:16:02,697 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 64 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 145 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 23:16:02,697 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 69 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 462 Invalid, 0 Unknown, 145 Unchecked, 0.3s Time] [2021-11-20 23:16:02,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2021-11-20 23:16:02,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 322. [2021-11-20 23:16:02,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 321 states have (on average 3.305295950155763) internal successors, (1061), 321 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:16:02,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 1061 transitions. [2021-11-20 23:16:02,711 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 1061 transitions. Word has length 28 [2021-11-20 23:16:02,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:16:02,712 INFO L470 AbstractCegarLoop]: Abstraction has 322 states and 1061 transitions. [2021-11-20 23:16:02,712 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.206896551724138) internal successors, (64), 29 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:16:02,712 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 1061 transitions. [2021-11-20 23:16:02,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:16:02,713 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:16:02,714 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:16:02,747 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-11-20 23:16:02,928 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:16:02,929 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:16:02,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:16:02,929 INFO L85 PathProgramCache]: Analyzing trace with hash 458137341, now seen corresponding path program 14 times [2021-11-20 23:16:02,929 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:16:02,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935518493] [2021-11-20 23:16:02,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:16:02,930 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:16:02,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:16:03,665 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:16:03,665 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:16:03,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935518493] [2021-11-20 23:16:03,665 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935518493] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:16:03,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524295676] [2021-11-20 23:16:03,666 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 23:16:03,666 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:16:03,666 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:16:03,666 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:16:03,667 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-11-20 23:16:03,749 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-20 23:16:03,749 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:16:03,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 82 conjunts are in the unsatisfiable core [2021-11-20 23:16:03,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:16:03,799 INFO L354 Elim1Store]: treesize reduction 93, result has 14.7 percent of original size [2021-11-20 23:16:03,800 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 21 [2021-11-20 23:16:03,874 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 23:16:03,874 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 14 [2021-11-20 23:16:03,956 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 23:16:03,957 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 11 treesize of output 11 [2021-11-20 23:16:04,264 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:16:04,293 INFO L354 Elim1Store]: treesize reduction 89, result has 25.2 percent of original size [2021-11-20 23:16:04,293 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 64 [2021-11-20 23:16:06,697 INFO L354 Elim1Store]: treesize reduction 41, result has 36.9 percent of original size [2021-11-20 23:16:06,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 72 treesize of output 59 [2021-11-20 23:16:06,785 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:16:06,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:16:18,525 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:16:18,526 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 78 treesize of output 138 [2021-11-20 23:16:19,116 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:16:19,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:16:19,138 INFO L354 Elim1Store]: treesize reduction 57, result has 32.9 percent of original size [2021-11-20 23:16:19,138 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 38 treesize of output 38 [2021-11-20 23:16:19,467 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:16:19,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524295676] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:16:19,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [489487903] [2021-11-20 23:16:19,468 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-20 23:16:19,470 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:16:19,470 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 28 [2021-11-20 23:16:19,470 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691322360] [2021-11-20 23:16:19,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:16:19,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-11-20 23:16:19,471 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:16:19,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-11-20 23:16:19,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=744, Unknown=3, NotChecked=0, Total=870 [2021-11-20 23:16:19,471 INFO L87 Difference]: Start difference. First operand 322 states and 1061 transitions. Second operand has 30 states, 29 states have (on average 2.206896551724138) internal successors, (64), 29 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:16:19,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:16:19,871 INFO L93 Difference]: Finished difference Result 375 states and 1217 transitions. [2021-11-20 23:16:19,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-20 23:16:19,871 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.206896551724138) internal successors, (64), 29 states have internal predecessors, (64), 0 states have call successors, (0), 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 28 [2021-11-20 23:16:19,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:16:19,874 INFO L225 Difference]: With dead ends: 375 [2021-11-20 23:16:19,874 INFO L226 Difference]: Without dead ends: 368 [2021-11-20 23:16:19,875 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=215, Invalid=1042, Unknown=3, NotChecked=0, Total=1260 [2021-11-20 23:16:19,875 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 94 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 170 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 23:16:19,876 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 80 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 337 Invalid, 0 Unknown, 170 Unchecked, 0.2s Time] [2021-11-20 23:16:19,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2021-11-20 23:16:19,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 316. [2021-11-20 23:16:19,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 315 states have (on average 3.295238095238095) internal successors, (1038), 315 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:16:19,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 1038 transitions. [2021-11-20 23:16:19,887 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 1038 transitions. Word has length 28 [2021-11-20 23:16:19,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:16:19,888 INFO L470 AbstractCegarLoop]: Abstraction has 316 states and 1038 transitions. [2021-11-20 23:16:19,888 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.206896551724138) internal successors, (64), 29 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:16:19,888 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 1038 transitions. [2021-11-20 23:16:19,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:16:19,890 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:16:19,890 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:16:19,927 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-11-20 23:16:20,108 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-11-20 23:16:20,108 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:16:20,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:16:20,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1075872355, now seen corresponding path program 15 times [2021-11-20 23:16:20,109 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:16:20,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757971919] [2021-11-20 23:16:20,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:16:20,109 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:16:20,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:16:20,591 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:16:20,592 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:16:20,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757971919] [2021-11-20 23:16:20,592 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757971919] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:16:20,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072710040] [2021-11-20 23:16:20,592 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 23:16:20,592 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:16:20,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:16:20,593 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:16:20,612 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-11-20 23:16:20,696 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 23:16:20,696 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:16:20,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 84 conjunts are in the unsatisfiable core [2021-11-20 23:16:20,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:16:20,739 INFO L354 Elim1Store]: treesize reduction 93, result has 14.7 percent of original size [2021-11-20 23:16:20,739 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 21 [2021-11-20 23:16:20,791 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-20 23:16:20,791 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-20 23:16:20,872 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-20 23:16:20,872 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 20 treesize of output 22 [2021-11-20 23:16:21,148 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:16:21,170 INFO L354 Elim1Store]: treesize reduction 52, result has 30.7 percent of original size [2021-11-20 23:16:21,170 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 49 [2021-11-20 23:16:21,449 INFO L354 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2021-11-20 23:16:21,452 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 72 treesize of output 56 [2021-11-20 23:16:21,511 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:16:21,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:16:23,096 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((~C~0.offset Int)) (let ((.cse0 (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) (let ((.cse1 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse0))) (.cse2 (select (select |c_#memory_int| c_~B~0.base) (+ c_~B~0.offset .cse0)))) (<= (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) (+ ~C~0.offset .cse0) (+ .cse1 .cse2))) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork2_~i~0#1| 4) c_~A~0.offset))) (+ c_~csum~0 .cse1 .cse2))))) (forall ((~C~0.offset Int)) (let ((.cse5 (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) (let ((.cse3 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse5))) (.cse4 (select (select |c_#memory_int| c_~B~0.base) (+ c_~B~0.offset .cse5)))) (<= (+ c_~csum~0 .cse3 .cse4) (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) (+ ~C~0.offset .cse5) (+ .cse3 .cse4))) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork2_~i~0#1| 4) c_~A~0.offset)))))))) is different from false [2021-11-20 23:16:26,952 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:16:26,952 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 78 treesize of output 138 [2021-11-20 23:16:27,326 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:16:27,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:16:27,350 INFO L354 Elim1Store]: treesize reduction 65, result has 23.5 percent of original size [2021-11-20 23:16:27,350 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 38 treesize of output 30 [2021-11-20 23:16:27,726 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2021-11-20 23:16:27,726 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072710040] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:16:27,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [648676662] [2021-11-20 23:16:27,727 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-20 23:16:27,727 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:16:27,728 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2021-11-20 23:16:27,728 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940120823] [2021-11-20 23:16:27,728 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:16:27,728 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-11-20 23:16:27,728 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:16:27,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-20 23:16:27,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=386, Unknown=3, NotChecked=40, Total=506 [2021-11-20 23:16:27,729 INFO L87 Difference]: Start difference. First operand 316 states and 1038 transitions. Second operand has 23 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 22 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-20 23:16:28,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:16:28,008 INFO L93 Difference]: Finished difference Result 369 states and 1196 transitions. [2021-11-20 23:16:28,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-20 23:16:28,009 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 22 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 28 [2021-11-20 23:16:28,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:16:28,011 INFO L225 Difference]: With dead ends: 369 [2021-11-20 23:16:28,011 INFO L226 Difference]: Without dead ends: 362 [2021-11-20 23:16:28,012 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 39 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=122, Invalid=581, Unknown=3, NotChecked=50, Total=756 [2021-11-20 23:16:28,012 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 53 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 189 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 23:16:28,013 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 50 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 280 Invalid, 0 Unknown, 189 Unchecked, 0.2s Time] [2021-11-20 23:16:28,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2021-11-20 23:16:28,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 320. [2021-11-20 23:16:28,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 319 states have (on average 3.310344827586207) internal successors, (1056), 319 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:16:28,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 1056 transitions. [2021-11-20 23:16:28,024 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 1056 transitions. Word has length 28 [2021-11-20 23:16:28,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:16:28,025 INFO L470 AbstractCegarLoop]: Abstraction has 320 states and 1056 transitions. [2021-11-20 23:16:28,025 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 22 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-20 23:16:28,025 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 1056 transitions. [2021-11-20 23:16:28,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:16:28,027 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:16:28,027 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:16:28,064 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-11-20 23:16:28,240 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:16:28,241 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:16:28,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:16:28,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1132496835, now seen corresponding path program 16 times [2021-11-20 23:16:28,241 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:16:28,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042260563] [2021-11-20 23:16:28,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:16:28,241 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:16:28,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:16:28,767 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:16:28,767 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:16:28,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042260563] [2021-11-20 23:16:28,767 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042260563] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:16:28,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436153103] [2021-11-20 23:16:28,768 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-20 23:16:28,768 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:16:28,768 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:16:28,769 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:16:28,796 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-11-20 23:16:28,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:16:28,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 84 conjunts are in the unsatisfiable core [2021-11-20 23:16:28,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:16:28,938 INFO L354 Elim1Store]: treesize reduction 93, result has 14.7 percent of original size [2021-11-20 23:16:28,939 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 21 [2021-11-20 23:16:29,001 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-20 23:16:29,001 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-20 23:16:29,089 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-20 23:16:29,089 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 20 treesize of output 22 [2021-11-20 23:16:29,376 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:16:29,398 INFO L354 Elim1Store]: treesize reduction 52, result has 30.7 percent of original size [2021-11-20 23:16:29,399 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 49 [2021-11-20 23:16:29,841 INFO L354 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2021-11-20 23:16:29,841 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 72 treesize of output 56 [2021-11-20 23:16:29,914 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:16:29,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:16:32,005 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((~C~0.offset Int)) (let ((.cse0 (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) (let ((.cse1 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse0))) (.cse2 (select (select |c_#memory_int| c_~B~0.base) (+ c_~B~0.offset .cse0)))) (<= (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) (+ ~C~0.offset .cse0) (+ .cse1 .cse2))) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork2_~i~0#1| 4) c_~A~0.offset))) (+ c_~csum~0 .cse1 .cse2))))) (forall ((~C~0.offset Int)) (let ((.cse5 (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) (let ((.cse3 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse5))) (.cse4 (select (select |c_#memory_int| c_~B~0.base) (+ c_~B~0.offset .cse5)))) (<= (+ c_~csum~0 .cse3 .cse4) (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) (+ ~C~0.offset .cse5) (+ .cse3 .cse4))) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork2_~i~0#1| 4) c_~A~0.offset)))))))) is different from false [2021-11-20 23:16:42,225 WARN L227 SmtUtils]: Spent 5.04s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-20 23:16:42,263 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:16:42,263 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 78 treesize of output 138 [2021-11-20 23:16:42,929 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:16:42,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:16:42,947 INFO L354 Elim1Store]: treesize reduction 39, result has 29.1 percent of original size [2021-11-20 23:16:42,947 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 38 treesize of output 24 [2021-11-20 23:16:43,316 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2021-11-20 23:16:43,316 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436153103] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:16:43,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1527934883] [2021-11-20 23:16:43,317 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-20 23:16:43,317 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:16:43,317 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2021-11-20 23:16:43,317 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027172118] [2021-11-20 23:16:43,317 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:16:43,318 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-11-20 23:16:43,318 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:16:43,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-20 23:16:43,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=388, Unknown=2, NotChecked=40, Total=506 [2021-11-20 23:16:43,319 INFO L87 Difference]: Start difference. First operand 320 states and 1056 transitions. Second operand has 23 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 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-20 23:16:43,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:16:43,909 INFO L93 Difference]: Finished difference Result 367 states and 1183 transitions. [2021-11-20 23:16:43,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-20 23:16:43,909 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 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 28 [2021-11-20 23:16:43,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:16:43,916 INFO L225 Difference]: With dead ends: 367 [2021-11-20 23:16:43,916 INFO L226 Difference]: Without dead ends: 360 [2021-11-20 23:16:43,917 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=153, Invalid=605, Unknown=2, NotChecked=52, Total=812 [2021-11-20 23:16:43,918 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 82 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 241 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 23:16:43,918 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 56 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 465 Invalid, 0 Unknown, 241 Unchecked, 0.3s Time] [2021-11-20 23:16:43,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2021-11-20 23:16:43,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 317. [2021-11-20 23:16:43,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 316 states have (on average 3.3037974683544302) internal successors, (1044), 316 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:16:43,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 1044 transitions. [2021-11-20 23:16:43,930 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 1044 transitions. Word has length 28 [2021-11-20 23:16:43,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:16:43,931 INFO L470 AbstractCegarLoop]: Abstraction has 317 states and 1044 transitions. [2021-11-20 23:16:43,931 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 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-20 23:16:43,931 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 1044 transitions. [2021-11-20 23:16:43,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:16:43,933 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:16:43,933 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:16:43,967 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2021-11-20 23:16:44,160 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-11-20 23:16:44,161 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:16:44,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:16:44,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1950899159, now seen corresponding path program 17 times [2021-11-20 23:16:44,161 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:16:44,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500576674] [2021-11-20 23:16:44,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:16:44,162 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:16:44,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:16:44,832 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:16:44,832 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:16:44,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500576674] [2021-11-20 23:16:44,832 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500576674] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:16:44,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708459896] [2021-11-20 23:16:44,832 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 23:16:44,832 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:16:44,832 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:16:44,833 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:16:44,834 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-11-20 23:16:44,919 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-20 23:16:44,919 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:16:44,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 82 conjunts are in the unsatisfiable core [2021-11-20 23:16:44,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:16:44,968 INFO L354 Elim1Store]: treesize reduction 93, result has 14.7 percent of original size [2021-11-20 23:16:44,968 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 21 [2021-11-20 23:16:45,039 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 23:16:45,039 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 14 [2021-11-20 23:16:45,109 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 23:16:45,109 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 11 treesize of output 11 [2021-11-20 23:16:45,369 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:16:45,398 INFO L354 Elim1Store]: treesize reduction 89, result has 25.2 percent of original size [2021-11-20 23:16:45,399 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 64 [2021-11-20 23:16:48,038 INFO L354 Elim1Store]: treesize reduction 41, result has 36.9 percent of original size [2021-11-20 23:16:48,038 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 72 treesize of output 59 [2021-11-20 23:16:48,103 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:16:48,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:16:49,308 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((~C~0.offset Int)) (let ((.cse2 (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse2))) (.cse1 (select (select |c_#memory_int| c_~B~0.base) (+ c_~B~0.offset .cse2)))) (<= (+ c_~csum~0 .cse0 .cse1) (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) (+ ~C~0.offset .cse2) (+ .cse0 .cse1))) c_~A~0.base) c_~A~0.offset)))))) (forall ((~C~0.offset Int)) (let ((.cse3 (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) (let ((.cse4 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse3))) (.cse5 (select (select |c_#memory_int| c_~B~0.base) (+ c_~B~0.offset .cse3)))) (<= (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) (+ ~C~0.offset .cse3) (+ .cse4 .cse5))) c_~A~0.base) c_~A~0.offset)) (+ c_~csum~0 .cse4 .cse5)))))) is different from false [2021-11-20 23:16:49,345 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:16:49,346 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 78 treesize of output 138 [2021-11-20 23:16:49,751 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:16:49,773 INFO L354 Elim1Store]: treesize reduction 73, result has 24.7 percent of original size [2021-11-20 23:16:49,774 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 38 treesize of output 34 [2021-11-20 23:16:50,089 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2021-11-20 23:16:50,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708459896] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:16:50,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1389750015] [2021-11-20 23:16:50,091 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-20 23:16:50,092 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:16:50,092 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 28 [2021-11-20 23:16:50,092 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065777109] [2021-11-20 23:16:50,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:16:50,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-11-20 23:16:50,093 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:16:50,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-11-20 23:16:50,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=692, Unknown=2, NotChecked=54, Total=870 [2021-11-20 23:16:50,094 INFO L87 Difference]: Start difference. First operand 317 states and 1044 transitions. Second operand has 30 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 29 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:16:50,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:16:50,498 INFO L93 Difference]: Finished difference Result 393 states and 1262 transitions. [2021-11-20 23:16:50,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-20 23:16:50,498 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 29 states have internal predecessors, (65), 0 states have call successors, (0), 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 28 [2021-11-20 23:16:50,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:16:50,501 INFO L225 Difference]: With dead ends: 393 [2021-11-20 23:16:50,501 INFO L226 Difference]: Without dead ends: 386 [2021-11-20 23:16:50,502 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=214, Invalid=978, Unknown=2, NotChecked=66, Total=1260 [2021-11-20 23:16:50,502 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 71 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 177 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 23:16:50,502 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 61 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 318 Invalid, 0 Unknown, 177 Unchecked, 0.2s Time] [2021-11-20 23:16:50,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2021-11-20 23:16:50,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 321. [2021-11-20 23:16:50,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 320 states have (on average 3.30625) internal successors, (1058), 320 states have internal predecessors, (1058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:16:50,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 1058 transitions. [2021-11-20 23:16:50,514 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 1058 transitions. Word has length 28 [2021-11-20 23:16:50,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:16:50,514 INFO L470 AbstractCegarLoop]: Abstraction has 321 states and 1058 transitions. [2021-11-20 23:16:50,514 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 29 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:16:50,515 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 1058 transitions. [2021-11-20 23:16:50,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:16:50,516 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:16:50,516 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:16:50,553 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2021-11-20 23:16:50,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:16:50,731 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:16:50,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:16:50,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1942752911, now seen corresponding path program 18 times [2021-11-20 23:16:50,732 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:16:50,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86024029] [2021-11-20 23:16:50,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:16:50,732 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:16:50,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:16:51,352 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:16:51,352 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:16:51,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86024029] [2021-11-20 23:16:51,352 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86024029] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:16:51,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511567394] [2021-11-20 23:16:51,352 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 23:16:51,352 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:16:51,352 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:16:51,354 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:16:51,354 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-11-20 23:16:51,429 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 23:16:51,429 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:16:51,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 84 conjunts are in the unsatisfiable core [2021-11-20 23:16:51,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:16:51,476 INFO L354 Elim1Store]: treesize reduction 93, result has 14.7 percent of original size [2021-11-20 23:16:51,477 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 21 [2021-11-20 23:16:51,551 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-20 23:16:51,551 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-20 23:16:51,628 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-20 23:16:51,628 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 20 treesize of output 22 [2021-11-20 23:16:51,874 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:16:51,902 INFO L354 Elim1Store]: treesize reduction 89, result has 25.2 percent of original size [2021-11-20 23:16:51,902 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 64 [2021-11-20 23:16:56,397 INFO L354 Elim1Store]: treesize reduction 41, result has 36.9 percent of original size [2021-11-20 23:16:56,397 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 72 treesize of output 59 [2021-11-20 23:16:56,452 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:16:56,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:16:59,387 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:16:59,387 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 78 treesize of output 138 [2021-11-20 23:16:59,891 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:16:59,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:16:59,913 INFO L354 Elim1Store]: treesize reduction 61, result has 28.2 percent of original size [2021-11-20 23:16:59,913 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 38 treesize of output 34 [2021-11-20 23:17:00,360 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:17:00,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511567394] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:17:00,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [780208573] [2021-11-20 23:17:00,361 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-20 23:17:00,361 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:17:00,362 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 28 [2021-11-20 23:17:00,362 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000205483] [2021-11-20 23:17:00,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:17:00,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-11-20 23:17:00,362 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:17:00,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-11-20 23:17:00,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=746, Unknown=2, NotChecked=0, Total=870 [2021-11-20 23:17:00,363 INFO L87 Difference]: Start difference. First operand 321 states and 1058 transitions. Second operand has 30 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 29 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:00,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:17:00,876 INFO L93 Difference]: Finished difference Result 411 states and 1319 transitions. [2021-11-20 23:17:00,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-20 23:17:00,876 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 29 states have internal predecessors, (65), 0 states have call successors, (0), 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 28 [2021-11-20 23:17:00,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:17:00,879 INFO L225 Difference]: With dead ends: 411 [2021-11-20 23:17:00,879 INFO L226 Difference]: Without dead ends: 404 [2021-11-20 23:17:00,880 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=214, Invalid=1044, Unknown=2, NotChecked=0, Total=1260 [2021-11-20 23:17:00,880 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 74 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 293 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 23:17:00,880 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 97 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 548 Invalid, 0 Unknown, 293 Unchecked, 0.3s Time] [2021-11-20 23:17:00,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2021-11-20 23:17:00,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 317. [2021-11-20 23:17:00,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 316 states have (on average 3.3037974683544302) internal successors, (1044), 316 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:00,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 1044 transitions. [2021-11-20 23:17:00,902 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 1044 transitions. Word has length 28 [2021-11-20 23:17:00,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:17:00,902 INFO L470 AbstractCegarLoop]: Abstraction has 317 states and 1044 transitions. [2021-11-20 23:17:00,903 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 29 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:00,903 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 1044 transitions. [2021-11-20 23:17:00,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:17:00,905 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:17:00,905 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:17:00,930 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2021-11-20 23:17:01,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-11-20 23:17:01,124 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:17:01,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:17:01,124 INFO L85 PathProgramCache]: Analyzing trace with hash -2089796367, now seen corresponding path program 19 times [2021-11-20 23:17:01,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:17:01,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501548290] [2021-11-20 23:17:01,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:17:01,124 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:17:01,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:17:01,762 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:17:01,762 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:17:01,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501548290] [2021-11-20 23:17:01,763 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501548290] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:17:01,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064595467] [2021-11-20 23:17:01,764 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-20 23:17:01,764 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:17:01,764 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:17:01,765 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:17:01,766 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-11-20 23:17:01,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:17:01,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 84 conjunts are in the unsatisfiable core [2021-11-20 23:17:01,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:17:01,875 INFO L354 Elim1Store]: treesize reduction 93, result has 14.7 percent of original size [2021-11-20 23:17:01,875 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 21 [2021-11-20 23:17:01,953 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-20 23:17:01,953 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-20 23:17:02,061 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-20 23:17:02,062 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 20 treesize of output 22 [2021-11-20 23:17:02,347 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:17:02,384 INFO L354 Elim1Store]: treesize reduction 93, result has 21.8 percent of original size [2021-11-20 23:17:02,385 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 60 [2021-11-20 23:17:04,918 INFO L354 Elim1Store]: treesize reduction 41, result has 36.9 percent of original size [2021-11-20 23:17:04,918 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 72 treesize of output 59 [2021-11-20 23:17:04,972 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:17:04,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:17:10,734 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:17:10,734 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 78 treesize of output 138 [2021-11-20 23:17:11,120 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:17:11,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:17:11,146 INFO L354 Elim1Store]: treesize reduction 57, result has 32.9 percent of original size [2021-11-20 23:17:11,147 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 38 treesize of output 38 [2021-11-20 23:17:11,554 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:17:11,554 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064595467] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:17:11,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [875791028] [2021-11-20 23:17:11,555 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-20 23:17:11,555 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:17:11,555 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 28 [2021-11-20 23:17:11,556 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505374652] [2021-11-20 23:17:11,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:17:11,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-11-20 23:17:11,556 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:17:11,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-11-20 23:17:11,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=747, Unknown=1, NotChecked=0, Total=870 [2021-11-20 23:17:11,557 INFO L87 Difference]: Start difference. First operand 317 states and 1044 transitions. Second operand has 30 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 29 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:11,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:17:11,974 INFO L93 Difference]: Finished difference Result 397 states and 1280 transitions. [2021-11-20 23:17:11,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-20 23:17:11,975 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 29 states have internal predecessors, (65), 0 states have call successors, (0), 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 28 [2021-11-20 23:17:11,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:17:11,977 INFO L225 Difference]: With dead ends: 397 [2021-11-20 23:17:11,978 INFO L226 Difference]: Without dead ends: 390 [2021-11-20 23:17:11,978 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=214, Invalid=1045, Unknown=1, NotChecked=0, Total=1260 [2021-11-20 23:17:11,979 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 76 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 146 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 23:17:11,979 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 64 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 367 Invalid, 0 Unknown, 146 Unchecked, 0.2s Time] [2021-11-20 23:17:11,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2021-11-20 23:17:11,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 321. [2021-11-20 23:17:11,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 320 states have (on average 3.315625) internal successors, (1061), 320 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:11,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 1061 transitions. [2021-11-20 23:17:11,989 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 1061 transitions. Word has length 28 [2021-11-20 23:17:11,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:17:11,989 INFO L470 AbstractCegarLoop]: Abstraction has 321 states and 1061 transitions. [2021-11-20 23:17:11,989 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 29 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:11,989 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 1061 transitions. [2021-11-20 23:17:11,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:17:11,991 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:17:11,991 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:17:12,035 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2021-11-20 23:17:12,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-11-20 23:17:12,217 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:17:12,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:17:12,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1455589317, now seen corresponding path program 20 times [2021-11-20 23:17:12,217 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:17:12,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825557702] [2021-11-20 23:17:12,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:17:12,218 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:17:12,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:17:13,027 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:17:13,027 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:17:13,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825557702] [2021-11-20 23:17:13,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825557702] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:17:13,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055419900] [2021-11-20 23:17:13,028 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 23:17:13,028 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:17:13,028 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:17:13,033 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:17:13,048 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2021-11-20 23:17:13,151 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-20 23:17:13,151 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:17:13,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 82 conjunts are in the unsatisfiable core [2021-11-20 23:17:13,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:17:13,202 INFO L354 Elim1Store]: treesize reduction 93, result has 14.7 percent of original size [2021-11-20 23:17:13,203 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 21 [2021-11-20 23:17:13,287 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 23:17:13,288 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 14 [2021-11-20 23:17:13,371 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 23:17:13,372 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 11 treesize of output 11 [2021-11-20 23:17:13,643 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:17:13,671 INFO L354 Elim1Store]: treesize reduction 93, result has 21.8 percent of original size [2021-11-20 23:17:13,671 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 60 [2021-11-20 23:17:16,204 INFO L354 Elim1Store]: treesize reduction 41, result has 36.9 percent of original size [2021-11-20 23:17:16,205 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 72 treesize of output 59 [2021-11-20 23:17:16,267 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:17:16,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:17:17,585 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((~C~0.offset Int)) (let ((.cse2 (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse2))) (.cse1 (select (select |c_#memory_int| c_~B~0.base) (+ c_~B~0.offset .cse2)))) (<= (+ c_~csum~0 .cse0 .cse1) (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) (+ ~C~0.offset .cse2) (+ .cse0 .cse1))) c_~A~0.base) c_~A~0.offset)))))) (forall ((~C~0.offset Int)) (let ((.cse3 (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) (let ((.cse4 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse3))) (.cse5 (select (select |c_#memory_int| c_~B~0.base) (+ c_~B~0.offset .cse3)))) (<= (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) (+ ~C~0.offset .cse3) (+ .cse4 .cse5))) c_~A~0.base) c_~A~0.offset)) (+ c_~csum~0 .cse4 .cse5)))))) is different from false [2021-11-20 23:17:17,630 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:17:17,631 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 78 treesize of output 138 [2021-11-20 23:17:18,325 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:17:18,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:17:18,347 INFO L354 Elim1Store]: treesize reduction 57, result has 32.9 percent of original size [2021-11-20 23:17:18,347 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 38 treesize of output 38 [2021-11-20 23:17:18,671 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2021-11-20 23:17:18,671 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055419900] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:17:18,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2114994160] [2021-11-20 23:17:18,673 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-20 23:17:18,674 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:17:18,675 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 28 [2021-11-20 23:17:18,675 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83339921] [2021-11-20 23:17:18,675 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:17:18,675 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-11-20 23:17:18,676 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:17:18,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-11-20 23:17:18,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=692, Unknown=2, NotChecked=54, Total=870 [2021-11-20 23:17:18,676 INFO L87 Difference]: Start difference. First operand 321 states and 1061 transitions. Second operand has 30 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 29 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:19,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:17:19,177 INFO L93 Difference]: Finished difference Result 395 states and 1287 transitions. [2021-11-20 23:17:19,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-20 23:17:19,177 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 29 states have internal predecessors, (65), 0 states have call successors, (0), 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 28 [2021-11-20 23:17:19,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:17:19,180 INFO L225 Difference]: With dead ends: 395 [2021-11-20 23:17:19,180 INFO L226 Difference]: Without dead ends: 388 [2021-11-20 23:17:19,181 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=214, Invalid=978, Unknown=2, NotChecked=66, Total=1260 [2021-11-20 23:17:19,181 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 60 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 309 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 23:17:19,181 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 98 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 506 Invalid, 0 Unknown, 309 Unchecked, 0.3s Time] [2021-11-20 23:17:19,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2021-11-20 23:17:19,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 315. [2021-11-20 23:17:19,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 314 states have (on average 3.2929936305732483) internal successors, (1034), 314 states have internal predecessors, (1034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:19,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 1034 transitions. [2021-11-20 23:17:19,192 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 1034 transitions. Word has length 28 [2021-11-20 23:17:19,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:17:19,192 INFO L470 AbstractCegarLoop]: Abstraction has 315 states and 1034 transitions. [2021-11-20 23:17:19,193 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 29 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:19,193 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 1034 transitions. [2021-11-20 23:17:19,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:17:19,194 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:17:19,194 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:17:19,244 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2021-11-20 23:17:19,412 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-11-20 23:17:19,413 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:17:19,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:17:19,413 INFO L85 PathProgramCache]: Analyzing trace with hash 511892697, now seen corresponding path program 21 times [2021-11-20 23:17:19,413 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:17:19,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718922988] [2021-11-20 23:17:19,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:17:19,414 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:17:19,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:17:19,785 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:17:19,785 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:17:19,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718922988] [2021-11-20 23:17:19,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718922988] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:17:19,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528849317] [2021-11-20 23:17:19,785 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 23:17:19,785 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:17:19,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:17:19,786 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:17:19,791 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2021-11-20 23:17:19,870 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 23:17:19,870 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:17:19,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 72 conjunts are in the unsatisfiable core [2021-11-20 23:17:19,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:17:20,337 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-11-20 23:17:20,338 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 41 treesize of output 29 [2021-11-20 23:17:20,354 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:17:20,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:17:20,528 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:17:20,528 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 119 [2021-11-20 23:17:20,819 INFO L354 Elim1Store]: treesize reduction 81, result has 25.7 percent of original size [2021-11-20 23:17:20,820 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 38 [2021-11-20 23:17:20,959 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:17:20,959 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528849317] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:17:20,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1636306789] [2021-11-20 23:17:20,960 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-20 23:17:20,961 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:17:20,961 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 6] total 14 [2021-11-20 23:17:20,961 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965577008] [2021-11-20 23:17:20,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:17:20,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-20 23:17:20,962 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:17:20,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-20 23:17:20,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2021-11-20 23:17:20,962 INFO L87 Difference]: Start difference. First operand 315 states and 1034 transitions. Second operand has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 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-20 23:17:21,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:17:21,302 INFO L93 Difference]: Finished difference Result 368 states and 1201 transitions. [2021-11-20 23:17:21,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-20 23:17:21,303 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 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 28 [2021-11-20 23:17:21,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:17:21,306 INFO L225 Difference]: With dead ends: 368 [2021-11-20 23:17:21,306 INFO L226 Difference]: Without dead ends: 361 [2021-11-20 23:17:21,307 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 44 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2021-11-20 23:17:21,308 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 58 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 65 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 23:17:21,308 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 26 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 387 Invalid, 0 Unknown, 65 Unchecked, 0.3s Time] [2021-11-20 23:17:21,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2021-11-20 23:17:21,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 323. [2021-11-20 23:17:21,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 322 states have (on average 3.2950310559006213) internal successors, (1061), 322 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:21,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 1061 transitions. [2021-11-20 23:17:21,319 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 1061 transitions. Word has length 28 [2021-11-20 23:17:21,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:17:21,320 INFO L470 AbstractCegarLoop]: Abstraction has 323 states and 1061 transitions. [2021-11-20 23:17:21,320 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 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-20 23:17:21,320 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 1061 transitions. [2021-11-20 23:17:21,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:17:21,321 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:17:21,321 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:17:21,346 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2021-11-20 23:17:21,524 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-11-20 23:17:21,525 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:17:21,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:17:21,525 INFO L85 PathProgramCache]: Analyzing trace with hash 802760345, now seen corresponding path program 22 times [2021-11-20 23:17:21,525 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:17:21,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028017079] [2021-11-20 23:17:21,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:17:21,525 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:17:21,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:17:22,250 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-20 23:17:22,250 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:17:22,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028017079] [2021-11-20 23:17:22,250 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028017079] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:17:22,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821515698] [2021-11-20 23:17:22,250 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-20 23:17:22,250 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:17:22,250 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:17:22,251 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:17:22,252 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2021-11-20 23:17:22,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:17:22,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 81 conjunts are in the unsatisfiable core [2021-11-20 23:17:22,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:17:22,376 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-20 23:17:22,427 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 23:17:22,427 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 11 treesize of output 11 [2021-11-20 23:17:22,884 INFO L354 Elim1Store]: treesize reduction 56, result has 29.1 percent of original size [2021-11-20 23:17:22,885 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 52 [2021-11-20 23:17:24,111 INFO L354 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2021-11-20 23:17:24,111 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 49 treesize of output 49 [2021-11-20 23:17:24,195 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:17:24,195 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:17:26,280 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((~C~0.offset Int)) (let ((.cse2 (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse2))) (.cse1 (select (select |c_#memory_int| c_~B~0.base) (+ c_~B~0.offset .cse2)))) (<= (+ c_~csum~0 .cse0 .cse1) (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) (+ ~C~0.offset .cse2) (+ .cse0 .cse1))) c_~B~0.base) (+ c_~B~0.offset (* |c_thread2Thread1of1ForFork0_~i~1#1| 4)))))))) (forall ((~C~0.offset Int)) (let ((.cse3 (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) (let ((.cse4 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse3))) (.cse5 (select (select |c_#memory_int| c_~B~0.base) (+ c_~B~0.offset .cse3)))) (<= (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) (+ ~C~0.offset .cse3) (+ .cse4 .cse5))) c_~B~0.base) (+ c_~B~0.offset (* |c_thread2Thread1of1ForFork0_~i~1#1| 4)))) (+ c_~csum~0 .cse4 .cse5)))))) is different from false [2021-11-20 23:17:26,353 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:17:26,354 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 90 treesize of output 158 [2021-11-20 23:17:27,296 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:17:27,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:17:27,325 INFO L354 Elim1Store]: treesize reduction 69, result has 28.9 percent of original size [2021-11-20 23:17:27,326 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 42 treesize of output 38 [2021-11-20 23:17:27,674 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 25 treesize of output 23 [2021-11-20 23:17:27,686 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2021-11-20 23:17:27,687 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821515698] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:17:27,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1898658981] [2021-11-20 23:17:27,688 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-20 23:17:27,689 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:17:27,689 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 9] total 26 [2021-11-20 23:17:27,690 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861867843] [2021-11-20 23:17:27,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:17:27,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-11-20 23:17:27,690 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:17:27,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-11-20 23:17:27,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=591, Unknown=2, NotChecked=50, Total=756 [2021-11-20 23:17:27,692 INFO L87 Difference]: Start difference. First operand 323 states and 1061 transitions. Second operand has 28 states, 27 states have (on average 2.4814814814814814) internal successors, (67), 27 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:28,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:17:28,615 INFO L93 Difference]: Finished difference Result 360 states and 1183 transitions. [2021-11-20 23:17:28,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-20 23:17:28,616 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.4814814814814814) internal successors, (67), 27 states have internal predecessors, (67), 0 states have call successors, (0), 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 28 [2021-11-20 23:17:28,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:17:28,619 INFO L225 Difference]: With dead ends: 360 [2021-11-20 23:17:28,619 INFO L226 Difference]: Without dead ends: 353 [2021-11-20 23:17:28,619 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=244, Invalid=948, Unknown=2, NotChecked=66, Total=1260 [2021-11-20 23:17:28,620 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 104 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 103 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 23:17:28,621 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 44 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 408 Invalid, 0 Unknown, 103 Unchecked, 0.3s Time] [2021-11-20 23:17:28,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2021-11-20 23:17:28,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 329. [2021-11-20 23:17:28,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 328 states have (on average 3.3140243902439024) internal successors, (1087), 328 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:28,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 1087 transitions. [2021-11-20 23:17:28,632 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 1087 transitions. Word has length 28 [2021-11-20 23:17:28,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:17:28,632 INFO L470 AbstractCegarLoop]: Abstraction has 329 states and 1087 transitions. [2021-11-20 23:17:28,633 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.4814814814814814) internal successors, (67), 27 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:28,633 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 1087 transitions. [2021-11-20 23:17:28,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:17:28,634 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:17:28,634 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:17:28,659 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2021-11-20 23:17:28,834 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-11-20 23:17:28,835 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:17:28,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:17:28,835 INFO L85 PathProgramCache]: Analyzing trace with hash 665382745, now seen corresponding path program 23 times [2021-11-20 23:17:28,835 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:17:28,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397399160] [2021-11-20 23:17:28,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:17:28,836 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:17:28,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:17:29,761 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-20 23:17:29,762 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:17:29,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397399160] [2021-11-20 23:17:29,762 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397399160] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:17:29,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434991] [2021-11-20 23:17:29,762 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 23:17:29,762 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:17:29,762 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:17:29,765 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:17:29,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2021-11-20 23:17:29,875 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-20 23:17:29,875 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:17:29,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 81 conjunts are in the unsatisfiable core [2021-11-20 23:17:29,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:17:29,928 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-20 23:17:29,989 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 23:17:29,989 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 11 treesize of output 11 [2021-11-20 23:17:30,490 INFO L354 Elim1Store]: treesize reduction 56, result has 29.1 percent of original size [2021-11-20 23:17:30,490 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 52 [2021-11-20 23:17:30,885 INFO L354 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2021-11-20 23:17:30,885 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 49 treesize of output 49 [2021-11-20 23:17:30,954 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:17:30,954 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:17:40,018 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:17:40,020 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 90 treesize of output 158 [2021-11-20 23:17:41,068 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:17:41,099 INFO L354 Elim1Store]: treesize reduction 89, result has 18.3 percent of original size [2021-11-20 23:17:41,100 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 42 treesize of output 30 [2021-11-20 23:17:41,390 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 25 treesize of output 23 [2021-11-20 23:17:41,399 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:17:41,400 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434991] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:17:41,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1153131347] [2021-11-20 23:17:41,401 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-20 23:17:41,402 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:17:41,402 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 9] total 25 [2021-11-20 23:17:41,403 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567277601] [2021-11-20 23:17:41,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:17:41,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-11-20 23:17:41,403 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:17:41,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-11-20 23:17:41,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=588, Unknown=3, NotChecked=0, Total=702 [2021-11-20 23:17:41,405 INFO L87 Difference]: Start difference. First operand 329 states and 1087 transitions. Second operand has 27 states, 26 states have (on average 2.5) internal successors, (65), 26 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:42,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:17:42,284 INFO L93 Difference]: Finished difference Result 374 states and 1210 transitions. [2021-11-20 23:17:42,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-20 23:17:42,285 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.5) internal successors, (65), 26 states have internal predecessors, (65), 0 states have call successors, (0), 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 28 [2021-11-20 23:17:42,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:17:42,287 INFO L225 Difference]: With dead ends: 374 [2021-11-20 23:17:42,287 INFO L226 Difference]: Without dead ends: 367 [2021-11-20 23:17:42,288 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 39 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=256, Invalid=1001, Unknown=3, NotChecked=0, Total=1260 [2021-11-20 23:17:42,288 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 109 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 23:17:42,289 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 45 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 405 Invalid, 0 Unknown, 104 Unchecked, 0.3s Time] [2021-11-20 23:17:42,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2021-11-20 23:17:42,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 335. [2021-11-20 23:17:42,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 334 states have (on average 3.2964071856287425) internal successors, (1101), 334 states have internal predecessors, (1101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:42,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 1101 transitions. [2021-11-20 23:17:42,299 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 1101 transitions. Word has length 28 [2021-11-20 23:17:42,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:17:42,299 INFO L470 AbstractCegarLoop]: Abstraction has 335 states and 1101 transitions. [2021-11-20 23:17:42,299 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.5) internal successors, (65), 26 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:42,299 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 1101 transitions. [2021-11-20 23:17:42,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:17:42,301 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:17:42,301 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:17:42,326 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2021-11-20 23:17:42,510 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:17:42,510 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:17:42,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:17:42,511 INFO L85 PathProgramCache]: Analyzing trace with hash 875210353, now seen corresponding path program 24 times [2021-11-20 23:17:42,511 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:17:42,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305702256] [2021-11-20 23:17:42,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:17:42,511 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:17:42,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:17:42,981 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:17:42,982 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:17:42,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305702256] [2021-11-20 23:17:42,982 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305702256] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:17:42,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994487015] [2021-11-20 23:17:42,982 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 23:17:42,982 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:17:42,982 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:17:42,985 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:17:43,007 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2021-11-20 23:17:43,099 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 23:17:43,099 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:17:43,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 81 conjunts are in the unsatisfiable core [2021-11-20 23:17:43,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:17:43,145 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-20 23:17:43,201 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 23:17:43,202 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 11 treesize of output 11 [2021-11-20 23:17:43,544 INFO L354 Elim1Store]: treesize reduction 56, result has 29.1 percent of original size [2021-11-20 23:17:43,545 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 52 [2021-11-20 23:17:43,920 INFO L354 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2021-11-20 23:17:43,920 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 49 treesize of output 49 [2021-11-20 23:17:43,992 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:17:43,992 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:17:45,877 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((~C~0.offset Int)) (let ((.cse2 (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse2))) (.cse1 (select (select |c_#memory_int| c_~B~0.base) (+ c_~B~0.offset .cse2)))) (<= (+ c_~csum~0 .cse0 .cse1) (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) (+ ~C~0.offset .cse2) (+ .cse0 .cse1))) c_~B~0.base) (+ c_~B~0.offset (* |c_thread2Thread1of1ForFork0_~i~1#1| 4)))))))) (forall ((~C~0.offset Int)) (let ((.cse3 (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) (let ((.cse4 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse3))) (.cse5 (select (select |c_#memory_int| c_~B~0.base) (+ c_~B~0.offset .cse3)))) (<= (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) (+ ~C~0.offset .cse3) (+ .cse4 .cse5))) c_~B~0.base) (+ c_~B~0.offset (* |c_thread2Thread1of1ForFork0_~i~1#1| 4)))) (+ c_~csum~0 .cse4 .cse5)))))) is different from false [2021-11-20 23:17:45,942 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:17:45,942 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 90 treesize of output 158 [2021-11-20 23:17:46,368 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:17:46,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:17:46,394 INFO L354 Elim1Store]: treesize reduction 77, result has 20.6 percent of original size [2021-11-20 23:17:46,395 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 42 treesize of output 30 [2021-11-20 23:17:46,644 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 25 treesize of output 23 [2021-11-20 23:17:46,653 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2021-11-20 23:17:46,653 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994487015] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:17:46,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [141045689] [2021-11-20 23:17:46,654 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-20 23:17:46,655 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:17:46,655 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 19 [2021-11-20 23:17:46,655 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302953406] [2021-11-20 23:17:46,655 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:17:46,655 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-20 23:17:46,655 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:17:46,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-20 23:17:46,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=306, Unknown=1, NotChecked=36, Total=420 [2021-11-20 23:17:46,656 INFO L87 Difference]: Start difference. First operand 335 states and 1101 transitions. Second operand has 21 states, 20 states have (on average 2.65) internal successors, (53), 20 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-20 23:17:47,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:17:47,048 INFO L93 Difference]: Finished difference Result 369 states and 1199 transitions. [2021-11-20 23:17:47,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-20 23:17:47,049 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.65) internal successors, (53), 20 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 28 [2021-11-20 23:17:47,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:17:47,051 INFO L225 Difference]: With dead ends: 369 [2021-11-20 23:17:47,051 INFO L226 Difference]: Without dead ends: 365 [2021-11-20 23:17:47,052 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 40 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=137, Invalid=466, Unknown=1, NotChecked=46, Total=650 [2021-11-20 23:17:47,053 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 44 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 131 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 23:17:47,053 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 34 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 382 Invalid, 0 Unknown, 131 Unchecked, 0.2s Time] [2021-11-20 23:17:47,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2021-11-20 23:17:47,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 336. [2021-11-20 23:17:47,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 335 states have (on average 3.2955223880597013) internal successors, (1104), 335 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:47,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 1104 transitions. [2021-11-20 23:17:47,063 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 1104 transitions. Word has length 28 [2021-11-20 23:17:47,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:17:47,063 INFO L470 AbstractCegarLoop]: Abstraction has 336 states and 1104 transitions. [2021-11-20 23:17:47,064 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.65) internal successors, (53), 20 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-20 23:17:47,064 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 1104 transitions. [2021-11-20 23:17:47,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:17:47,065 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:17:47,065 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:17:47,116 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2021-11-20 23:17:47,293 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:17:47,294 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:17:47,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:17:47,295 INFO L85 PathProgramCache]: Analyzing trace with hash 737832753, now seen corresponding path program 25 times [2021-11-20 23:17:47,295 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:17:47,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000432111] [2021-11-20 23:17:47,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:17:47,295 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:17:47,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:17:48,014 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-20 23:17:48,015 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:17:48,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000432111] [2021-11-20 23:17:48,015 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000432111] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:17:48,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312847659] [2021-11-20 23:17:48,015 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-20 23:17:48,015 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:17:48,015 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:17:48,016 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:17:48,018 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2021-11-20 23:17:48,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:17:48,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 81 conjunts are in the unsatisfiable core [2021-11-20 23:17:48,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:17:48,143 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-20 23:17:48,202 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 23:17:48,202 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 11 treesize of output 11 [2021-11-20 23:17:48,637 INFO L354 Elim1Store]: treesize reduction 56, result has 29.1 percent of original size [2021-11-20 23:17:48,637 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 52 [2021-11-20 23:17:49,202 INFO L354 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2021-11-20 23:17:49,202 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 49 treesize of output 49 [2021-11-20 23:17:49,280 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:17:49,281 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:18:04,357 WARN L227 SmtUtils]: Spent 6.97s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-20 23:18:04,450 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:18:04,450 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 90 treesize of output 158 [2021-11-20 23:18:05,485 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:18:05,517 INFO L354 Elim1Store]: treesize reduction 81, result has 25.7 percent of original size [2021-11-20 23:18:05,517 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 42 treesize of output 38 [2021-11-20 23:18:05,871 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 25 treesize of output 23 [2021-11-20 23:18:05,882 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:18:05,882 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312847659] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:18:05,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1720503170] [2021-11-20 23:18:05,883 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-20 23:18:05,885 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:18:05,885 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 9] total 26 [2021-11-20 23:18:05,886 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660314886] [2021-11-20 23:18:05,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:18:05,886 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-11-20 23:18:05,886 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:18:05,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-11-20 23:18:05,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=641, Unknown=0, NotChecked=0, Total=756 [2021-11-20 23:18:05,888 INFO L87 Difference]: Start difference. First operand 336 states and 1104 transitions. Second operand has 28 states, 27 states have (on average 2.5555555555555554) internal successors, (69), 27 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:06,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:18:06,562 INFO L93 Difference]: Finished difference Result 395 states and 1281 transitions. [2021-11-20 23:18:06,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-20 23:18:06,563 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.5555555555555554) internal successors, (69), 27 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-11-20 23:18:06,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:18:06,566 INFO L225 Difference]: With dead ends: 395 [2021-11-20 23:18:06,566 INFO L226 Difference]: Without dead ends: 388 [2021-11-20 23:18:06,567 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=211, Invalid=979, Unknown=0, NotChecked=0, Total=1190 [2021-11-20 23:18:06,568 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 61 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 242 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 23:18:06,568 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 54 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 495 Invalid, 0 Unknown, 242 Unchecked, 0.3s Time] [2021-11-20 23:18:06,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2021-11-20 23:18:06,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 335. [2021-11-20 23:18:06,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 334 states have (on average 3.2964071856287425) internal successors, (1101), 334 states have internal predecessors, (1101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:06,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 1101 transitions. [2021-11-20 23:18:06,578 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 1101 transitions. Word has length 28 [2021-11-20 23:18:06,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:18:06,578 INFO L470 AbstractCegarLoop]: Abstraction has 335 states and 1101 transitions. [2021-11-20 23:18:06,578 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.5555555555555554) internal successors, (69), 27 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:06,578 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 1101 transitions. [2021-11-20 23:18:06,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:18:06,580 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:18:06,580 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:18:06,609 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2021-11-20 23:18:06,792 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2021-11-20 23:18:06,794 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:18:06,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:18:06,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1589424289, now seen corresponding path program 26 times [2021-11-20 23:18:06,794 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:18:06,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102407806] [2021-11-20 23:18:06,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:18:06,795 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:18:06,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:18:07,193 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:18:07,193 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:18:07,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102407806] [2021-11-20 23:18:07,194 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102407806] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:18:07,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344873337] [2021-11-20 23:18:07,194 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 23:18:07,194 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:18:07,194 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:18:07,201 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:18:07,220 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2021-11-20 23:18:07,341 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-11-20 23:18:07,342 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:18:07,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 72 conjunts are in the unsatisfiable core [2021-11-20 23:18:07,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:18:07,847 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-11-20 23:18:07,848 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 41 treesize of output 29 [2021-11-20 23:18:07,863 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:18:07,863 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:18:09,494 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:18:09,495 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 119 [2021-11-20 23:18:09,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:09,820 INFO L354 Elim1Store]: treesize reduction 69, result has 28.9 percent of original size [2021-11-20 23:18:09,820 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 38 [2021-11-20 23:18:10,010 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:18:10,011 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1344873337] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:18:10,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1947710908] [2021-11-20 23:18:10,011 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-20 23:18:10,011 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:18:10,012 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 6] total 14 [2021-11-20 23:18:10,012 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682101048] [2021-11-20 23:18:10,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:18:10,012 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-20 23:18:10,012 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:18:10,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-20 23:18:10,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2021-11-20 23:18:10,013 INFO L87 Difference]: Start difference. First operand 335 states and 1101 transitions. Second operand has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 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-20 23:18:10,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:18:10,485 INFO L93 Difference]: Finished difference Result 384 states and 1255 transitions. [2021-11-20 23:18:10,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-20 23:18:10,485 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 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 28 [2021-11-20 23:18:10,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:18:10,490 INFO L225 Difference]: With dead ends: 384 [2021-11-20 23:18:10,490 INFO L226 Difference]: Without dead ends: 377 [2021-11-20 23:18:10,490 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 44 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2021-11-20 23:18:10,491 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 49 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-20 23:18:10,491 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 31 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 528 Invalid, 0 Unknown, 39 Unchecked, 0.4s Time] [2021-11-20 23:18:10,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2021-11-20 23:18:10,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 339. [2021-11-20 23:18:10,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 338 states have (on average 3.298816568047337) internal successors, (1115), 338 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:10,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 1115 transitions. [2021-11-20 23:18:10,504 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 1115 transitions. Word has length 28 [2021-11-20 23:18:10,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:18:10,505 INFO L470 AbstractCegarLoop]: Abstraction has 339 states and 1115 transitions. [2021-11-20 23:18:10,505 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 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-20 23:18:10,505 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 1115 transitions. [2021-11-20 23:18:10,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:18:10,506 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:18:10,507 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:18:10,548 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2021-11-20 23:18:10,732 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:18:10,732 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:18:10,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:18:10,733 INFO L85 PathProgramCache]: Analyzing trace with hash -225912513, now seen corresponding path program 27 times [2021-11-20 23:18:10,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:18:10,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351503001] [2021-11-20 23:18:10,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:18:10,733 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:18:10,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:18:11,674 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:18:11,674 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:18:11,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351503001] [2021-11-20 23:18:11,674 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351503001] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:18:11,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206804882] [2021-11-20 23:18:11,674 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 23:18:11,675 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:18:11,676 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:18:11,676 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:18:11,677 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2021-11-20 23:18:11,763 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 23:18:11,763 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:18:11,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 84 conjunts are in the unsatisfiable core [2021-11-20 23:18:11,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:18:11,822 INFO L354 Elim1Store]: treesize reduction 93, result has 14.7 percent of original size [2021-11-20 23:18:11,823 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 21 [2021-11-20 23:18:11,910 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-20 23:18:11,910 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-20 23:18:12,009 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-20 23:18:12,009 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 20 treesize of output 22 [2021-11-20 23:18:12,396 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:18:12,397 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:18:12,431 INFO L354 Elim1Store]: treesize reduction 109, result has 19.3 percent of original size [2021-11-20 23:18:12,431 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 79 treesize of output 60 [2021-11-20 23:18:12,670 INFO L354 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2021-11-20 23:18:12,670 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 72 treesize of output 56 [2021-11-20 23:18:12,774 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:18:12,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:18:14,653 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((~C~0.offset Int)) (let ((.cse0 (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) (let ((.cse1 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse0))) (.cse2 (select (select |c_#memory_int| c_~B~0.base) (+ c_~B~0.offset .cse0)))) (<= (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) (+ ~C~0.offset .cse0) (+ .cse1 .cse2))) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork2_~i~0#1| 4) c_~A~0.offset))) (+ c_~csum~0 .cse1 .cse2))))) (forall ((~C~0.offset Int)) (let ((.cse5 (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) (let ((.cse3 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse5))) (.cse4 (select (select |c_#memory_int| c_~B~0.base) (+ c_~B~0.offset .cse5)))) (<= (+ c_~csum~0 .cse3 .cse4) (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) (+ ~C~0.offset .cse5) (+ .cse3 .cse4))) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork2_~i~0#1| 4) c_~A~0.offset)))))))) is different from false [2021-11-20 23:18:14,722 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:18:14,723 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 90 treesize of output 158 [2021-11-20 23:18:15,199 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:18:15,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:15,229 INFO L354 Elim1Store]: treesize reduction 69, result has 28.9 percent of original size [2021-11-20 23:18:15,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, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 38 [2021-11-20 23:18:15,760 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2021-11-20 23:18:15,761 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206804882] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:18:15,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [455343296] [2021-11-20 23:18:15,761 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-20 23:18:15,761 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:18:15,762 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 27 [2021-11-20 23:18:15,762 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478112777] [2021-11-20 23:18:15,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:18:15,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-11-20 23:18:15,762 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:18:15,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-11-20 23:18:15,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=643, Unknown=1, NotChecked=52, Total=812 [2021-11-20 23:18:15,764 INFO L87 Difference]: Start difference. First operand 339 states and 1115 transitions. Second operand has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 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-20 23:18:16,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:18:16,709 INFO L93 Difference]: Finished difference Result 412 states and 1344 transitions. [2021-11-20 23:18:16,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-20 23:18:16,709 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 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 28 [2021-11-20 23:18:16,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:18:16,713 INFO L225 Difference]: With dead ends: 412 [2021-11-20 23:18:16,713 INFO L226 Difference]: Without dead ends: 405 [2021-11-20 23:18:16,713 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=267, Invalid=1296, Unknown=1, NotChecked=76, Total=1640 [2021-11-20 23:18:16,714 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 86 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 290 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-20 23:18:16,714 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 71 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 480 Invalid, 0 Unknown, 290 Unchecked, 0.4s Time] [2021-11-20 23:18:16,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2021-11-20 23:18:16,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 343. [2021-11-20 23:18:16,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 342 states have (on average 3.3128654970760234) internal successors, (1133), 342 states have internal predecessors, (1133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:16,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 1133 transitions. [2021-11-20 23:18:16,725 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 1133 transitions. Word has length 28 [2021-11-20 23:18:16,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:18:16,725 INFO L470 AbstractCegarLoop]: Abstraction has 343 states and 1133 transitions. [2021-11-20 23:18:16,725 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 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-20 23:18:16,726 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 1133 transitions. [2021-11-20 23:18:16,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:18:16,727 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:18:16,727 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:18:16,766 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2021-11-20 23:18:16,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2021-11-20 23:18:16,945 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:18:16,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:18:16,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1860685593, now seen corresponding path program 28 times [2021-11-20 23:18:16,945 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:18:16,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460080782] [2021-11-20 23:18:16,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:18:16,946 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:18:17,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:18:17,574 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:18:17,574 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:18:17,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460080782] [2021-11-20 23:18:17,575 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460080782] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:18:17,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409921845] [2021-11-20 23:18:17,575 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-20 23:18:17,575 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:18:17,575 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:18:17,576 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:18:17,592 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2021-11-20 23:18:17,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:18:17,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 84 conjunts are in the unsatisfiable core [2021-11-20 23:18:17,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:18:17,754 INFO L354 Elim1Store]: treesize reduction 93, result has 14.7 percent of original size [2021-11-20 23:18:17,755 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 21 [2021-11-20 23:18:17,832 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-20 23:18:17,832 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-20 23:18:17,965 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-20 23:18:17,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 20 treesize of output 22 [2021-11-20 23:18:18,397 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:18:18,421 INFO L354 Elim1Store]: treesize reduction 52, result has 30.7 percent of original size [2021-11-20 23:18:18,421 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 49 [2021-11-20 23:18:20,753 INFO L354 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2021-11-20 23:18:20,753 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 72 treesize of output 56 [2021-11-20 23:18:20,815 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:18:20,815 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:18:22,904 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((~C~0.offset Int)) (let ((.cse0 (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) (let ((.cse1 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse0))) (.cse2 (select (select |c_#memory_int| c_~B~0.base) (+ c_~B~0.offset .cse0)))) (<= (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) (+ ~C~0.offset .cse0) (+ .cse1 .cse2))) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork2_~i~0#1| 4) c_~A~0.offset))) (+ c_~csum~0 .cse1 .cse2))))) (forall ((~C~0.offset Int)) (let ((.cse5 (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) (let ((.cse3 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse5))) (.cse4 (select (select |c_#memory_int| c_~B~0.base) (+ c_~B~0.offset .cse5)))) (<= (+ c_~csum~0 .cse3 .cse4) (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) (+ ~C~0.offset .cse5) (+ .cse3 .cse4))) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork2_~i~0#1| 4) c_~A~0.offset)))))))) is different from false [2021-11-20 23:18:22,949 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:18:22,949 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 90 treesize of output 158 [2021-11-20 23:18:23,398 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:18:23,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:23,421 INFO L354 Elim1Store]: treesize reduction 77, result has 20.6 percent of original size [2021-11-20 23:18:23,421 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 42 treesize of output 30 [2021-11-20 23:18:23,786 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2021-11-20 23:18:23,786 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409921845] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:18:23,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2027453882] [2021-11-20 23:18:23,787 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-20 23:18:23,787 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:18:23,788 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2021-11-20 23:18:23,788 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693486402] [2021-11-20 23:18:23,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:18:23,789 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-11-20 23:18:23,789 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:18:23,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-20 23:18:23,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=380, Unknown=2, NotChecked=40, Total=506 [2021-11-20 23:18:23,790 INFO L87 Difference]: Start difference. First operand 343 states and 1133 transitions. Second operand has 23 states, 22 states have (on average 2.5) internal successors, (55), 22 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-20 23:18:24,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:18:24,254 INFO L93 Difference]: Finished difference Result 386 states and 1252 transitions. [2021-11-20 23:18:24,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-20 23:18:24,255 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.5) internal successors, (55), 22 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 28 [2021-11-20 23:18:24,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:18:24,258 INFO L225 Difference]: With dead ends: 386 [2021-11-20 23:18:24,258 INFO L226 Difference]: Without dead ends: 379 [2021-11-20 23:18:24,258 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 39 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=176, Invalid=582, Unknown=2, NotChecked=52, Total=812 [2021-11-20 23:18:24,258 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 65 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 178 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 23:18:24,259 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 29 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 359 Invalid, 0 Unknown, 178 Unchecked, 0.2s Time] [2021-11-20 23:18:24,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2021-11-20 23:18:24,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 339. [2021-11-20 23:18:24,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 338 states have (on average 3.3136094674556213) internal successors, (1120), 338 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:24,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 1120 transitions. [2021-11-20 23:18:24,276 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 1120 transitions. Word has length 28 [2021-11-20 23:18:24,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:18:24,276 INFO L470 AbstractCegarLoop]: Abstraction has 339 states and 1120 transitions. [2021-11-20 23:18:24,276 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.5) internal successors, (55), 22 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-20 23:18:24,276 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 1120 transitions. [2021-11-20 23:18:24,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:18:24,277 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:18:24,277 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:18:24,299 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2021-11-20 23:18:24,477 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:18:24,478 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:18:24,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:18:24,479 INFO L85 PathProgramCache]: Analyzing trace with hash 389376075, now seen corresponding path program 29 times [2021-11-20 23:18:24,479 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:18:24,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554701882] [2021-11-20 23:18:24,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:18:24,479 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:18:24,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:18:24,966 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:18:24,966 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:18:24,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554701882] [2021-11-20 23:18:24,966 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554701882] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:18:24,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733891160] [2021-11-20 23:18:24,966 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 23:18:24,967 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:18:24,967 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:18:24,969 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:18:24,992 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2021-11-20 23:18:25,090 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-20 23:18:25,090 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:18:25,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 82 conjunts are in the unsatisfiable core [2021-11-20 23:18:25,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:18:25,142 INFO L354 Elim1Store]: treesize reduction 93, result has 14.7 percent of original size [2021-11-20 23:18:25,142 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 21 [2021-11-20 23:18:25,203 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 23:18:25,204 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 14 [2021-11-20 23:18:25,260 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 23:18:25,260 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 11 treesize of output 11 [2021-11-20 23:18:25,575 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:18:25,609 INFO L354 Elim1Store]: treesize reduction 52, result has 30.7 percent of original size [2021-11-20 23:18:25,609 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 49 [2021-11-20 23:18:25,989 INFO L354 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2021-11-20 23:18:25,990 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 72 treesize of output 56 [2021-11-20 23:18:26,064 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:18:26,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:18:27,777 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((~C~0.offset Int)) (let ((.cse0 (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) (let ((.cse1 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse0))) (.cse2 (select (select |c_#memory_int| c_~B~0.base) (+ c_~B~0.offset .cse0)))) (<= (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) (+ ~C~0.offset .cse0) (+ .cse1 .cse2))) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork2_~i~0#1| 4) c_~A~0.offset))) (+ c_~csum~0 .cse1 .cse2))))) (forall ((~C~0.offset Int)) (let ((.cse5 (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) (let ((.cse3 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse5))) (.cse4 (select (select |c_#memory_int| c_~B~0.base) (+ c_~B~0.offset .cse5)))) (<= (+ c_~csum~0 .cse3 .cse4) (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) (+ ~C~0.offset .cse5) (+ .cse3 .cse4))) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork2_~i~0#1| 4) c_~A~0.offset)))))))) is different from false [2021-11-20 23:18:27,814 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:18:27,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 90 treesize of output 158 [2021-11-20 23:18:28,479 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:18:28,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:28,503 INFO L354 Elim1Store]: treesize reduction 69, result has 28.9 percent of original size [2021-11-20 23:18:28,503 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 42 treesize of output 38 [2021-11-20 23:18:28,845 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2021-11-20 23:18:28,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733891160] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:18:28,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1602078393] [2021-11-20 23:18:28,845 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-20 23:18:28,846 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:18:28,847 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 20 [2021-11-20 23:18:28,847 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482445759] [2021-11-20 23:18:28,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:18:28,847 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-11-20 23:18:28,847 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:18:28,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-20 23:18:28,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=344, Unknown=1, NotChecked=38, Total=462 [2021-11-20 23:18:28,848 INFO L87 Difference]: Start difference. First operand 339 states and 1120 transitions. Second operand has 22 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 21 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-20 23:18:29,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:18:29,252 INFO L93 Difference]: Finished difference Result 387 states and 1259 transitions. [2021-11-20 23:18:29,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-20 23:18:29,253 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 21 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 28 [2021-11-20 23:18:29,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:18:29,256 INFO L225 Difference]: With dead ends: 387 [2021-11-20 23:18:29,256 INFO L226 Difference]: Without dead ends: 380 [2021-11-20 23:18:29,256 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 39 SyntacticMatches, 6 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=154, Invalid=551, Unknown=1, NotChecked=50, Total=756 [2021-11-20 23:18:29,257 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 58 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 120 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 23:18:29,257 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 25 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 311 Invalid, 0 Unknown, 120 Unchecked, 0.2s Time] [2021-11-20 23:18:29,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2021-11-20 23:18:29,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 342. [2021-11-20 23:18:29,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 341 states have (on average 3.3196480938416424) internal successors, (1132), 341 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:29,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 1132 transitions. [2021-11-20 23:18:29,269 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 1132 transitions. Word has length 28 [2021-11-20 23:18:29,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:18:29,269 INFO L470 AbstractCegarLoop]: Abstraction has 342 states and 1132 transitions. [2021-11-20 23:18:29,270 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 21 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-20 23:18:29,270 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 1132 transitions. [2021-11-20 23:18:29,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:18:29,271 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:18:29,272 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:18:29,308 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2021-11-20 23:18:29,484 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2021-11-20 23:18:29,485 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:18:29,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:18:29,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1818993115, now seen corresponding path program 30 times [2021-11-20 23:18:29,485 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:18:29,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574482273] [2021-11-20 23:18:29,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:18:29,486 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:18:29,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:18:30,394 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:18:30,394 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:18:30,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574482273] [2021-11-20 23:18:30,394 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574482273] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:18:30,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882482658] [2021-11-20 23:18:30,395 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 23:18:30,395 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:18:30,395 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:18:30,395 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:18:30,396 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2021-11-20 23:18:30,485 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 23:18:30,485 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:18:30,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 84 conjunts are in the unsatisfiable core [2021-11-20 23:18:30,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:18:30,533 INFO L354 Elim1Store]: treesize reduction 93, result has 14.7 percent of original size [2021-11-20 23:18:30,533 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 21 [2021-11-20 23:18:30,626 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 23:18:30,626 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 14 [2021-11-20 23:18:30,706 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-20 23:18:30,707 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 16 treesize of output 18 [2021-11-20 23:18:31,228 INFO L354 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2021-11-20 23:18:31,229 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 42 [2021-11-20 23:18:31,546 INFO L354 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2021-11-20 23:18:31,547 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 43 treesize of output 31 [2021-11-20 23:18:31,597 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:18:31,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:18:33,352 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((~C~0.offset Int)) (let ((.cse0 (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) (let ((.cse1 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse0))) (.cse2 (select (select |c_#memory_int| c_~B~0.base) (+ c_~B~0.offset .cse0)))) (<= (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) (+ ~C~0.offset .cse0) (+ .cse1 .cse2))) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork2_~i~0#1| 4) c_~A~0.offset))) (+ c_~csum~0 .cse1 .cse2))))) (forall ((~C~0.offset Int)) (let ((.cse5 (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) (let ((.cse3 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse5))) (.cse4 (select (select |c_#memory_int| c_~B~0.base) (+ c_~B~0.offset .cse5)))) (<= (+ c_~csum~0 .cse3 .cse4) (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) (+ ~C~0.offset .cse5) (+ .cse3 .cse4))) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork2_~i~0#1| 4) c_~A~0.offset)))))))) is different from false [2021-11-20 23:18:33,398 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:18:33,398 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 90 treesize of output 158 [2021-11-20 23:18:34,248 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:18:34,295 INFO L354 Elim1Store]: treesize reduction 46, result has 57.8 percent of original size [2021-11-20 23:18:34,296 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 42 treesize of output 73 [2021-11-20 23:18:34,896 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2021-11-20 23:18:34,896 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882482658] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:18:34,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1427945735] [2021-11-20 23:18:34,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-20 23:18:34,901 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:18:34,901 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 32 [2021-11-20 23:18:34,901 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497920993] [2021-11-20 23:18:34,901 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:18:34,902 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-11-20 23:18:34,902 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:18:34,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-11-20 23:18:34,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=902, Unknown=1, NotChecked=62, Total=1122 [2021-11-20 23:18:34,904 INFO L87 Difference]: Start difference. First operand 342 states and 1132 transitions. Second operand has 34 states, 33 states have (on average 2.121212121212121) internal successors, (70), 33 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:35,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:18:35,745 INFO L93 Difference]: Finished difference Result 401 states and 1303 transitions. [2021-11-20 23:18:35,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-20 23:18:35,745 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.121212121212121) internal successors, (70), 33 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-11-20 23:18:35,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:18:35,748 INFO L225 Difference]: With dead ends: 401 [2021-11-20 23:18:35,748 INFO L226 Difference]: Without dead ends: 394 [2021-11-20 23:18:35,749 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=301, Invalid=1342, Unknown=1, NotChecked=78, Total=1722 [2021-11-20 23:18:35,749 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 103 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 195 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-20 23:18:35,750 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 52 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 567 Invalid, 0 Unknown, 195 Unchecked, 0.4s Time] [2021-11-20 23:18:35,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2021-11-20 23:18:35,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 335. [2021-11-20 23:18:35,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 334 states have (on average 3.2964071856287425) internal successors, (1101), 334 states have internal predecessors, (1101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:35,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 1101 transitions. [2021-11-20 23:18:35,759 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 1101 transitions. Word has length 28 [2021-11-20 23:18:35,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:18:35,760 INFO L470 AbstractCegarLoop]: Abstraction has 335 states and 1101 transitions. [2021-11-20 23:18:35,760 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.121212121212121) internal successors, (70), 33 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:35,760 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 1101 transitions. [2021-11-20 23:18:35,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:18:35,761 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:18:35,761 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:18:35,793 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2021-11-20 23:18:35,988 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2021-11-20 23:18:35,989 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:18:35,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:18:35,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1893378847, now seen corresponding path program 31 times [2021-11-20 23:18:35,989 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:18:35,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33438101] [2021-11-20 23:18:35,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:18:35,990 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:18:36,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:18:36,526 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:18:36,526 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:18:36,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33438101] [2021-11-20 23:18:36,527 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33438101] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:18:36,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111645439] [2021-11-20 23:18:36,527 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-20 23:18:36,527 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:18:36,527 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:18:36,528 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:18:36,529 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2021-11-20 23:18:36,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:18:36,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 84 conjunts are in the unsatisfiable core [2021-11-20 23:18:36,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:18:36,669 INFO L354 Elim1Store]: treesize reduction 93, result has 14.7 percent of original size [2021-11-20 23:18:36,670 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 21 [2021-11-20 23:18:36,722 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 23:18:36,722 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 14 [2021-11-20 23:18:36,790 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-20 23:18:36,791 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 16 treesize of output 18 [2021-11-20 23:18:37,107 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:18:37,123 INFO L354 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2021-11-20 23:18:37,124 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 39 [2021-11-20 23:18:37,568 INFO L354 Elim1Store]: treesize reduction 29, result has 21.6 percent of original size [2021-11-20 23:18:37,568 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 53 treesize of output 37 [2021-11-20 23:18:37,607 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:18:37,607 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:18:37,755 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:18:37,755 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 195 treesize of output 239 [2021-11-20 23:18:39,948 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:18:39,948 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:18:40,010 INFO L354 Elim1Store]: treesize reduction 46, result has 57.8 percent of original size [2021-11-20 23:18:40,010 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 42 treesize of output 73 [2021-11-20 23:18:40,791 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:18:40,792 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111645439] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:18:40,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1369206285] [2021-11-20 23:18:40,792 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-20 23:18:40,792 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:18:40,793 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2021-11-20 23:18:40,793 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476737120] [2021-11-20 23:18:40,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:18:40,794 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-11-20 23:18:40,794 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:18:40,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-20 23:18:40,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2021-11-20 23:18:40,795 INFO L87 Difference]: Start difference. First operand 335 states and 1101 transitions. Second operand has 23 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 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-20 23:18:41,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:18:41,274 INFO L93 Difference]: Finished difference Result 374 states and 1232 transitions. [2021-11-20 23:18:41,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-20 23:18:41,275 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 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 28 [2021-11-20 23:18:41,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:18:41,278 INFO L225 Difference]: With dead ends: 374 [2021-11-20 23:18:41,278 INFO L226 Difference]: Without dead ends: 367 [2021-11-20 23:18:41,279 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=173, Invalid=639, Unknown=0, NotChecked=0, Total=812 [2021-11-20 23:18:41,279 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 53 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 23:18:41,279 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 36 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 319 Invalid, 0 Unknown, 91 Unchecked, 0.3s Time] [2021-11-20 23:18:41,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2021-11-20 23:18:41,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 343. [2021-11-20 23:18:41,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 342 states have (on average 3.3216374269005846) internal successors, (1136), 342 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:41,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 1136 transitions. [2021-11-20 23:18:41,289 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 1136 transitions. Word has length 28 [2021-11-20 23:18:41,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:18:41,289 INFO L470 AbstractCegarLoop]: Abstraction has 343 states and 1136 transitions. [2021-11-20 23:18:41,289 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 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-20 23:18:41,289 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 1136 transitions. [2021-11-20 23:18:41,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:18:41,290 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:18:41,290 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:18:41,316 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2021-11-20 23:18:41,491 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2021-11-20 23:18:41,491 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:18:41,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:18:41,491 INFO L85 PathProgramCache]: Analyzing trace with hash -2030756447, now seen corresponding path program 32 times [2021-11-20 23:18:41,492 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:18:41,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624504333] [2021-11-20 23:18:41,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:18:41,492 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:18:41,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:18:42,521 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:18:42,521 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:18:42,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624504333] [2021-11-20 23:18:42,521 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624504333] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:18:42,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602854802] [2021-11-20 23:18:42,521 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 23:18:42,522 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:18:42,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:18:42,522 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:18:42,524 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2021-11-20 23:18:42,623 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-11-20 23:18:42,623 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:18:42,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 84 conjunts are in the unsatisfiable core [2021-11-20 23:18:42,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:18:42,666 INFO L354 Elim1Store]: treesize reduction 93, result has 14.7 percent of original size [2021-11-20 23:18:42,666 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 21 [2021-11-20 23:18:42,737 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 23:18:42,737 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 14 [2021-11-20 23:18:42,806 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-20 23:18:42,806 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2021-11-20 23:18:43,152 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:18:43,168 INFO L354 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2021-11-20 23:18:43,168 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 39 [2021-11-20 23:18:43,670 INFO L354 Elim1Store]: treesize reduction 29, result has 21.6 percent of original size [2021-11-20 23:18:43,670 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 53 treesize of output 37 [2021-11-20 23:18:43,712 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:18:43,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:18:43,896 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:18:43,897 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 195 treesize of output 239 [2021-11-20 23:18:45,905 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:18:45,905 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:18:45,961 INFO L354 Elim1Store]: treesize reduction 46, result has 57.8 percent of original size [2021-11-20 23:18:45,961 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 42 treesize of output 73 [2021-11-20 23:18:46,713 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:18:46,713 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602854802] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:18:46,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1201186969] [2021-11-20 23:18:46,714 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-20 23:18:46,715 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:18:46,715 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 28 [2021-11-20 23:18:46,716 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586233076] [2021-11-20 23:18:46,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:18:46,716 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-11-20 23:18:46,716 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:18:46,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-11-20 23:18:46,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=742, Unknown=0, NotChecked=0, Total=870 [2021-11-20 23:18:46,717 INFO L87 Difference]: Start difference. First operand 343 states and 1136 transitions. Second operand has 30 states, 29 states have (on average 2.3793103448275863) internal successors, (69), 29 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:48,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:18:48,034 INFO L93 Difference]: Finished difference Result 388 states and 1259 transitions. [2021-11-20 23:18:48,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-20 23:18:48,035 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.3793103448275863) internal successors, (69), 29 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-11-20 23:18:48,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:18:48,038 INFO L225 Difference]: With dead ends: 388 [2021-11-20 23:18:48,038 INFO L226 Difference]: Without dead ends: 381 [2021-11-20 23:18:48,039 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=296, Invalid=1264, Unknown=0, NotChecked=0, Total=1560 [2021-11-20 23:18:48,039 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 80 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 126 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 23:18:48,039 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 51 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 293 Invalid, 0 Unknown, 126 Unchecked, 0.2s Time] [2021-11-20 23:18:48,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2021-11-20 23:18:48,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 341. [2021-11-20 23:18:48,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 3.3117647058823527) internal successors, (1126), 340 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:48,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 1126 transitions. [2021-11-20 23:18:48,048 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 1126 transitions. Word has length 28 [2021-11-20 23:18:48,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:18:48,049 INFO L470 AbstractCegarLoop]: Abstraction has 341 states and 1126 transitions. [2021-11-20 23:18:48,049 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.3793103448275863) internal successors, (69), 29 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:48,049 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 1126 transitions. [2021-11-20 23:18:48,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:18:48,050 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:18:48,050 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:18:48,076 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2021-11-20 23:18:48,250 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2021-11-20 23:18:48,251 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:18:48,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:18:48,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1442977767, now seen corresponding path program 33 times [2021-11-20 23:18:48,251 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:18:48,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786494302] [2021-11-20 23:18:48,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:18:48,252 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:18:48,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:18:49,200 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:18:49,200 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:18:49,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786494302] [2021-11-20 23:18:49,200 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786494302] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:18:49,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86558918] [2021-11-20 23:18:49,201 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 23:18:49,201 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:18:49,201 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:18:49,202 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:18:49,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2021-11-20 23:18:49,281 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 23:18:49,281 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:18:49,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 84 conjunts are in the unsatisfiable core [2021-11-20 23:18:49,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:18:49,319 INFO L354 Elim1Store]: treesize reduction 93, result has 14.7 percent of original size [2021-11-20 23:18:49,319 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 21 [2021-11-20 23:18:49,389 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 23:18:49,389 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 14 [2021-11-20 23:18:49,458 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-20 23:18:49,458 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 16 treesize of output 18 [2021-11-20 23:18:49,788 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:18:49,804 INFO L354 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2021-11-20 23:18:49,805 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 39 [2021-11-20 23:18:49,976 INFO L354 Elim1Store]: treesize reduction 29, result has 21.6 percent of original size [2021-11-20 23:18:49,977 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 53 treesize of output 37 [2021-11-20 23:18:50,028 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:18:50,028 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:18:50,165 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:18:50,166 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 195 treesize of output 239 [2021-11-20 23:18:51,976 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:18:51,976 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:18:52,024 INFO L354 Elim1Store]: treesize reduction 46, result has 57.8 percent of original size [2021-11-20 23:18:52,025 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 73 [2021-11-20 23:18:52,627 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:18:52,627 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86558918] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:18:52,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1420665089] [2021-11-20 23:18:52,628 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-20 23:18:52,629 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:18:52,629 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 28 [2021-11-20 23:18:52,629 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893220615] [2021-11-20 23:18:52,629 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:18:52,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-11-20 23:18:52,630 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:18:52,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-11-20 23:18:52,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=742, Unknown=0, NotChecked=0, Total=870 [2021-11-20 23:18:52,630 INFO L87 Difference]: Start difference. First operand 341 states and 1126 transitions. Second operand has 30 states, 29 states have (on average 2.103448275862069) internal successors, (61), 29 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-20 23:18:53,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:18:53,099 INFO L93 Difference]: Finished difference Result 383 states and 1259 transitions. [2021-11-20 23:18:53,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-20 23:18:53,100 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.103448275862069) internal successors, (61), 29 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 28 [2021-11-20 23:18:53,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:18:53,103 INFO L225 Difference]: With dead ends: 383 [2021-11-20 23:18:53,103 INFO L226 Difference]: Without dead ends: 376 [2021-11-20 23:18:53,103 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=246, Invalid=1086, Unknown=0, NotChecked=0, Total=1332 [2021-11-20 23:18:53,104 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 104 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 117 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 23:18:53,104 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 41 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 344 Invalid, 0 Unknown, 117 Unchecked, 0.2s Time] [2021-11-20 23:18:53,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2021-11-20 23:18:53,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 344. [2021-11-20 23:18:53,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 343 states have (on average 3.309037900874636) internal successors, (1135), 343 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:53,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 1135 transitions. [2021-11-20 23:18:53,112 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 1135 transitions. Word has length 28 [2021-11-20 23:18:53,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:18:53,113 INFO L470 AbstractCegarLoop]: Abstraction has 344 states and 1135 transitions. [2021-11-20 23:18:53,113 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.103448275862069) internal successors, (61), 29 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-20 23:18:53,113 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 1135 transitions. [2021-11-20 23:18:53,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:18:53,114 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:18:53,115 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:18:53,144 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2021-11-20 23:18:53,328 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2021-11-20 23:18:53,328 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:18:53,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:18:53,329 INFO L85 PathProgramCache]: Analyzing trace with hash 47841369, now seen corresponding path program 34 times [2021-11-20 23:18:53,329 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:18:53,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843805543] [2021-11-20 23:18:53,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:18:53,329 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:18:53,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:18:54,243 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:18:54,244 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:18:54,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843805543] [2021-11-20 23:18:54,244 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843805543] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:18:54,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251352368] [2021-11-20 23:18:54,244 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-20 23:18:54,244 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:18:54,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:18:54,249 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:18:54,268 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2021-11-20 23:18:54,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:18:54,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 84 conjunts are in the unsatisfiable core [2021-11-20 23:18:54,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:18:54,406 INFO L354 Elim1Store]: treesize reduction 93, result has 14.7 percent of original size [2021-11-20 23:18:54,407 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 21 [2021-11-20 23:18:54,517 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 23:18:54,517 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 14 [2021-11-20 23:18:54,617 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-20 23:18:54,618 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 16 treesize of output 18 [2021-11-20 23:18:55,011 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:18:55,027 INFO L354 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2021-11-20 23:18:55,027 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 39 [2021-11-20 23:18:55,479 INFO L354 Elim1Store]: treesize reduction 29, result has 21.6 percent of original size [2021-11-20 23:18:55,479 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 53 treesize of output 37 [2021-11-20 23:18:55,519 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:18:55,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:18:55,681 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:18:55,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 195 treesize of output 239 [2021-11-20 23:18:57,804 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:18:57,804 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:18:57,856 INFO L354 Elim1Store]: treesize reduction 46, result has 57.8 percent of original size [2021-11-20 23:18:57,857 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 42 treesize of output 73 [2021-11-20 23:18:58,593 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:18:58,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [251352368] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:18:58,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [280887302] [2021-11-20 23:18:58,594 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-20 23:18:58,594 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:18:58,594 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 28 [2021-11-20 23:18:58,595 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498965026] [2021-11-20 23:18:58,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:18:58,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-11-20 23:18:58,595 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:18:58,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-11-20 23:18:58,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=742, Unknown=0, NotChecked=0, Total=870 [2021-11-20 23:18:58,597 INFO L87 Difference]: Start difference. First operand 344 states and 1135 transitions. Second operand has 30 states, 29 states have (on average 2.3793103448275863) internal successors, (69), 29 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:59,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:18:59,309 INFO L93 Difference]: Finished difference Result 412 states and 1338 transitions. [2021-11-20 23:18:59,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-20 23:18:59,310 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.3793103448275863) internal successors, (69), 29 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-11-20 23:18:59,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:18:59,314 INFO L225 Difference]: With dead ends: 412 [2021-11-20 23:18:59,315 INFO L226 Difference]: Without dead ends: 408 [2021-11-20 23:18:59,316 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=246, Invalid=1086, Unknown=0, NotChecked=0, Total=1332 [2021-11-20 23:18:59,316 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 62 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 164 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-20 23:18:59,317 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 54 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 436 Invalid, 0 Unknown, 164 Unchecked, 0.4s Time] [2021-11-20 23:18:59,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2021-11-20 23:18:59,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 354. [2021-11-20 23:18:59,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 353 states have (on average 3.303116147308782) internal successors, (1166), 353 states have internal predecessors, (1166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:59,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 1166 transitions. [2021-11-20 23:18:59,329 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 1166 transitions. Word has length 28 [2021-11-20 23:18:59,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:18:59,330 INFO L470 AbstractCegarLoop]: Abstraction has 354 states and 1166 transitions. [2021-11-20 23:18:59,330 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.3793103448275863) internal successors, (69), 29 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:59,330 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 1166 transitions. [2021-11-20 23:18:59,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:18:59,331 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:18:59,331 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:18:59,358 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2021-11-20 23:18:59,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2021-11-20 23:18:59,532 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:18:59,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:18:59,532 INFO L85 PathProgramCache]: Analyzing trace with hash 12757255, now seen corresponding path program 35 times [2021-11-20 23:18:59,532 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:18:59,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607107707] [2021-11-20 23:18:59,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:18:59,533 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:18:59,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:19:00,770 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:19:00,770 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:19:00,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607107707] [2021-11-20 23:19:00,771 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607107707] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:19:00,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078255751] [2021-11-20 23:19:00,771 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 23:19:00,771 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:19:00,771 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:19:00,772 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:19:00,792 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2021-11-20 23:19:00,898 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-20 23:19:00,898 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:19:00,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 86 conjunts are in the unsatisfiable core [2021-11-20 23:19:00,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:19:00,957 INFO L354 Elim1Store]: treesize reduction 93, result has 14.7 percent of original size [2021-11-20 23:19:00,957 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 21 [2021-11-20 23:19:01,082 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-20 23:19:01,083 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-20 23:19:01,208 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-11-20 23:19:01,209 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-11-20 23:19:01,797 INFO L354 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2021-11-20 23:19:01,798 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 39 [2021-11-20 23:19:02,217 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-11-20 23:19:02,217 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 51 treesize of output 27 [2021-11-20 23:19:02,262 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:19:02,263 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:19:02,448 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:19:02,449 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 195 treesize of output 239 [2021-11-20 23:19:04,442 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:19:04,443 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:19:04,500 INFO L354 Elim1Store]: treesize reduction 46, result has 57.8 percent of original size [2021-11-20 23:19:04,501 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 42 treesize of output 73 [2021-11-20 23:19:05,401 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:19:05,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078255751] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:19:05,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1267058347] [2021-11-20 23:19:05,402 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-20 23:19:05,403 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:19:05,403 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 32 [2021-11-20 23:19:05,403 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693910885] [2021-11-20 23:19:05,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:19:05,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-11-20 23:19:05,404 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:19:05,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-11-20 23:19:05,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=958, Unknown=0, NotChecked=0, Total=1122 [2021-11-20 23:19:05,405 INFO L87 Difference]: Start difference. First operand 354 states and 1166 transitions. Second operand has 34 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 33 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:19:06,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:19:06,754 INFO L93 Difference]: Finished difference Result 399 states and 1295 transitions. [2021-11-20 23:19:06,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-20 23:19:06,754 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 33 states have internal predecessors, (72), 0 states have call successors, (0), 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 28 [2021-11-20 23:19:06,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:19:06,757 INFO L225 Difference]: With dead ends: 399 [2021-11-20 23:19:06,757 INFO L226 Difference]: Without dead ends: 392 [2021-11-20 23:19:06,758 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=340, Invalid=1552, Unknown=0, NotChecked=0, Total=1892 [2021-11-20 23:19:06,759 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 111 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 129 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 23:19:06,759 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 57 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 453 Invalid, 0 Unknown, 129 Unchecked, 0.3s Time] [2021-11-20 23:19:06,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2021-11-20 23:19:06,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 352. [2021-11-20 23:19:06,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 351 states have (on average 3.304843304843305) internal successors, (1160), 351 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:19:06,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 1160 transitions. [2021-11-20 23:19:06,773 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 1160 transitions. Word has length 28 [2021-11-20 23:19:06,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:19:06,773 INFO L470 AbstractCegarLoop]: Abstraction has 352 states and 1160 transitions. [2021-11-20 23:19:06,774 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 33 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:19:06,774 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 1160 transitions. [2021-11-20 23:19:06,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:19:06,775 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:19:06,776 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:19:06,805 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2021-11-20 23:19:06,988 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:19:06,989 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:19:06,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:19:06,989 INFO L85 PathProgramCache]: Analyzing trace with hash -161529471, now seen corresponding path program 36 times [2021-11-20 23:19:06,989 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:19:06,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813760570] [2021-11-20 23:19:06,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:19:06,990 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:19:07,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:19:07,512 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:19:07,512 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:19:07,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813760570] [2021-11-20 23:19:07,512 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813760570] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:19:07,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099653772] [2021-11-20 23:19:07,513 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 23:19:07,513 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:19:07,513 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:19:07,517 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:19:07,540 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2021-11-20 23:19:07,647 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 23:19:07,647 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:19:07,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 84 conjunts are in the unsatisfiable core [2021-11-20 23:19:07,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:19:07,709 INFO L354 Elim1Store]: treesize reduction 93, result has 14.7 percent of original size [2021-11-20 23:19:07,709 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 21 [2021-11-20 23:19:07,775 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 23:19:07,776 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 14 [2021-11-20 23:19:07,847 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-20 23:19:07,848 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 16 treesize of output 18 [2021-11-20 23:19:08,189 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:19:08,212 INFO L354 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2021-11-20 23:19:08,212 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 39 [2021-11-20 23:19:08,617 INFO L354 Elim1Store]: treesize reduction 29, result has 21.6 percent of original size [2021-11-20 23:19:08,617 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 53 treesize of output 37 [2021-11-20 23:19:08,667 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:19:08,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:19:08,875 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:19:08,876 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 179 treesize of output 219 [2021-11-20 23:19:10,727 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:19:10,727 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:19:10,786 INFO L354 Elim1Store]: treesize reduction 40, result has 58.8 percent of original size [2021-11-20 23:19:10,786 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 67 [2021-11-20 23:19:11,381 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:19:11,381 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099653772] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:19:11,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [601642893] [2021-11-20 23:19:11,382 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-20 23:19:11,382 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:19:11,382 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2021-11-20 23:19:11,382 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59882089] [2021-11-20 23:19:11,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:19:11,383 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-11-20 23:19:11,383 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:19:11,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-20 23:19:11,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2021-11-20 23:19:11,384 INFO L87 Difference]: Start difference. First operand 352 states and 1160 transitions. Second operand has 24 states, 23 states have (on average 2.391304347826087) internal successors, (55), 23 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-20 23:19:11,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:19:11,806 INFO L93 Difference]: Finished difference Result 423 states and 1396 transitions. [2021-11-20 23:19:11,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-20 23:19:11,807 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.391304347826087) internal successors, (55), 23 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 28 [2021-11-20 23:19:11,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:19:11,809 INFO L225 Difference]: With dead ends: 423 [2021-11-20 23:19:11,809 INFO L226 Difference]: Without dead ends: 416 [2021-11-20 23:19:11,810 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=151, Invalid=661, Unknown=0, NotChecked=0, Total=812 [2021-11-20 23:19:11,810 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 43 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 266 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 23:19:11,811 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 91 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 421 Invalid, 0 Unknown, 266 Unchecked, 0.3s Time] [2021-11-20 23:19:11,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2021-11-20 23:19:11,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 367. [2021-11-20 23:19:11,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 366 states have (on average 3.3333333333333335) internal successors, (1220), 366 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:19:11,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 1220 transitions. [2021-11-20 23:19:11,820 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 1220 transitions. Word has length 28 [2021-11-20 23:19:11,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:19:11,820 INFO L470 AbstractCegarLoop]: Abstraction has 367 states and 1220 transitions. [2021-11-20 23:19:11,820 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.391304347826087) internal successors, (55), 23 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-20 23:19:11,821 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 1220 transitions. [2021-11-20 23:19:11,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:19:11,822 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:19:11,822 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:19:11,848 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2021-11-20 23:19:12,023 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:19:12,023 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:19:12,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:19:12,024 INFO L85 PathProgramCache]: Analyzing trace with hash 239785755, now seen corresponding path program 37 times [2021-11-20 23:19:12,024 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:19:12,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063911182] [2021-11-20 23:19:12,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:19:12,025 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:19:12,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:19:12,570 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:19:12,570 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:19:12,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063911182] [2021-11-20 23:19:12,570 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063911182] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:19:12,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629365148] [2021-11-20 23:19:12,570 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-20 23:19:12,571 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:19:12,571 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:19:12,572 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:19:12,592 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2021-11-20 23:19:12,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:19:12,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 86 conjunts are in the unsatisfiable core [2021-11-20 23:19:12,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:19:12,760 INFO L354 Elim1Store]: treesize reduction 93, result has 14.7 percent of original size [2021-11-20 23:19:12,761 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 21 [2021-11-20 23:19:12,844 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-20 23:19:12,844 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-20 23:19:12,983 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-11-20 23:19:12,984 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-11-20 23:19:13,501 INFO L354 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2021-11-20 23:19:13,502 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 39 [2021-11-20 23:19:13,976 INFO L354 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2021-11-20 23:19:13,976 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 57 treesize of output 33 [2021-11-20 23:19:14,021 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:19:14,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:19:14,188 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:19:14,188 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 179 treesize of output 219 [2021-11-20 23:19:15,979 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:19:15,980 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:19:16,039 INFO L354 Elim1Store]: treesize reduction 40, result has 58.8 percent of original size [2021-11-20 23:19:16,039 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 67 [2021-11-20 23:19:16,747 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:19:16,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629365148] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:19:16,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1369950384] [2021-11-20 23:19:16,748 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-20 23:19:16,748 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:19:16,748 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2021-11-20 23:19:16,749 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486728672] [2021-11-20 23:19:16,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:19:16,749 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-11-20 23:19:16,749 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:19:16,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-11-20 23:19:16,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=690, Unknown=0, NotChecked=0, Total=812 [2021-11-20 23:19:16,750 INFO L87 Difference]: Start difference. First operand 367 states and 1220 transitions. Second operand has 29 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 28 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-20 23:19:17,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:19:17,107 INFO L93 Difference]: Finished difference Result 427 states and 1407 transitions. [2021-11-20 23:19:17,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-20 23:19:17,107 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 28 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 28 [2021-11-20 23:19:17,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:19:17,110 INFO L225 Difference]: With dead ends: 427 [2021-11-20 23:19:17,110 INFO L226 Difference]: Without dead ends: 420 [2021-11-20 23:19:17,111 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=168, Invalid=888, Unknown=0, NotChecked=0, Total=1056 [2021-11-20 23:19:17,112 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 56 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 108 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 23:19:17,112 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 76 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 317 Invalid, 0 Unknown, 108 Unchecked, 0.2s Time] [2021-11-20 23:19:17,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2021-11-20 23:19:17,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 367. [2021-11-20 23:19:17,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 366 states have (on average 3.3333333333333335) internal successors, (1220), 366 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:19:17,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 1220 transitions. [2021-11-20 23:19:17,123 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 1220 transitions. Word has length 28 [2021-11-20 23:19:17,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:19:17,123 INFO L470 AbstractCegarLoop]: Abstraction has 367 states and 1220 transitions. [2021-11-20 23:19:17,123 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 28 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-20 23:19:17,123 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 1220 transitions. [2021-11-20 23:19:17,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:19:17,124 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:19:17,124 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:19:17,154 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2021-11-20 23:19:17,325 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:19:17,325 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:19:17,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:19:17,326 INFO L85 PathProgramCache]: Analyzing trace with hash 92742299, now seen corresponding path program 38 times [2021-11-20 23:19:17,326 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:19:17,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085738679] [2021-11-20 23:19:17,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:19:17,327 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:19:17,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:19:17,859 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:19:17,859 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:19:17,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085738679] [2021-11-20 23:19:17,859 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085738679] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:19:17,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953805178] [2021-11-20 23:19:17,860 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 23:19:17,860 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:19:17,860 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:19:17,865 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:19:17,893 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2021-11-20 23:19:18,002 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-20 23:19:18,002 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:19:18,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 84 conjunts are in the unsatisfiable core [2021-11-20 23:19:18,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:19:18,063 INFO L354 Elim1Store]: treesize reduction 93, result has 14.7 percent of original size [2021-11-20 23:19:18,063 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 21 [2021-11-20 23:19:18,139 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 23:19:18,139 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 14 [2021-11-20 23:19:18,229 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-20 23:19:18,229 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 16 treesize of output 18 [2021-11-20 23:19:18,557 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:19:18,582 INFO L354 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2021-11-20 23:19:18,582 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 39 [2021-11-20 23:19:19,030 INFO L354 Elim1Store]: treesize reduction 29, result has 21.6 percent of original size [2021-11-20 23:19:19,030 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 53 treesize of output 37 [2021-11-20 23:19:19,068 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:19:19,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:19:19,234 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:19:19,235 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 179 treesize of output 219 [2021-11-20 23:19:21,019 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:19:21,020 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:19:21,077 INFO L354 Elim1Store]: treesize reduction 40, result has 58.8 percent of original size [2021-11-20 23:19:21,077 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 67 [2021-11-20 23:19:21,594 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:19:21,595 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953805178] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:19:21,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1009686117] [2021-11-20 23:19:21,595 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-20 23:19:21,595 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:19:21,595 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2021-11-20 23:19:21,596 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684297036] [2021-11-20 23:19:21,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:19:21,596 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-11-20 23:19:21,596 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:19:21,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-20 23:19:21,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2021-11-20 23:19:21,597 INFO L87 Difference]: Start difference. First operand 367 states and 1220 transitions. Second operand has 24 states, 23 states have (on average 2.391304347826087) internal successors, (55), 23 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-20 23:19:21,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:19:21,950 INFO L93 Difference]: Finished difference Result 434 states and 1431 transitions. [2021-11-20 23:19:21,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-20 23:19:21,950 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.391304347826087) internal successors, (55), 23 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 28 [2021-11-20 23:19:21,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:19:21,952 INFO L225 Difference]: With dead ends: 434 [2021-11-20 23:19:21,952 INFO L226 Difference]: Without dead ends: 427 [2021-11-20 23:19:21,952 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=151, Invalid=661, Unknown=0, NotChecked=0, Total=812 [2021-11-20 23:19:21,953 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 70 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 189 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 23:19:21,953 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 68 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 396 Invalid, 0 Unknown, 189 Unchecked, 0.2s Time] [2021-11-20 23:19:21,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2021-11-20 23:19:21,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 372. [2021-11-20 23:19:21,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 371 states have (on average 3.353099730458221) internal successors, (1244), 371 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:19:21,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1244 transitions. [2021-11-20 23:19:21,961 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1244 transitions. Word has length 28 [2021-11-20 23:19:21,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:19:21,961 INFO L470 AbstractCegarLoop]: Abstraction has 372 states and 1244 transitions. [2021-11-20 23:19:21,961 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.391304347826087) internal successors, (55), 23 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-20 23:19:21,961 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1244 transitions. [2021-11-20 23:19:21,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:19:21,962 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:19:21,962 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:19:21,983 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2021-11-20 23:19:22,164 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2021-11-20 23:19:22,165 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:19:22,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:19:22,165 INFO L85 PathProgramCache]: Analyzing trace with hash 726949349, now seen corresponding path program 39 times [2021-11-20 23:19:22,165 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:19:22,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238766355] [2021-11-20 23:19:22,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:19:22,165 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:19:22,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:19:22,583 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:19:22,583 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:19:22,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238766355] [2021-11-20 23:19:22,583 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238766355] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:19:22,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562004111] [2021-11-20 23:19:22,584 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 23:19:22,584 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:19:22,584 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:19:22,589 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:19:22,608 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2021-11-20 23:19:22,689 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 23:19:22,689 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:19:22,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 84 conjunts are in the unsatisfiable core [2021-11-20 23:19:22,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:19:22,735 INFO L354 Elim1Store]: treesize reduction 93, result has 14.7 percent of original size [2021-11-20 23:19:22,736 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 21 [2021-11-20 23:19:22,792 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 23:19:22,792 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 14 [2021-11-20 23:19:22,858 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-20 23:19:22,858 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 16 treesize of output 18 [2021-11-20 23:19:23,136 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:19:23,151 INFO L354 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2021-11-20 23:19:23,151 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 39 [2021-11-20 23:19:23,535 INFO L354 Elim1Store]: treesize reduction 29, result has 21.6 percent of original size [2021-11-20 23:19:23,536 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 53 treesize of output 37 [2021-11-20 23:19:23,578 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:19:23,578 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:19:23,735 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:19:23,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, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 179 treesize of output 219 [2021-11-20 23:19:25,481 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:19:25,482 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:19:25,529 INFO L354 Elim1Store]: treesize reduction 40, result has 58.8 percent of original size [2021-11-20 23:19:25,529 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 38 treesize of output 67 [2021-11-20 23:19:26,055 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:19:26,056 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562004111] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:19:26,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1159932896] [2021-11-20 23:19:26,056 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-20 23:19:26,056 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:19:26,057 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2021-11-20 23:19:26,057 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309714428] [2021-11-20 23:19:26,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:19:26,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-11-20 23:19:26,057 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:19:26,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-20 23:19:26,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2021-11-20 23:19:26,058 INFO L87 Difference]: Start difference. First operand 372 states and 1244 transitions. Second operand has 24 states, 23 states have (on average 2.391304347826087) internal successors, (55), 23 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-20 23:19:26,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:19:26,463 INFO L93 Difference]: Finished difference Result 452 states and 1479 transitions. [2021-11-20 23:19:26,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-20 23:19:26,464 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.391304347826087) internal successors, (55), 23 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 28 [2021-11-20 23:19:26,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:19:26,465 INFO L225 Difference]: With dead ends: 452 [2021-11-20 23:19:26,466 INFO L226 Difference]: Without dead ends: 445 [2021-11-20 23:19:26,466 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=132, Invalid=624, Unknown=0, NotChecked=0, Total=756 [2021-11-20 23:19:26,466 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 59 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 238 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 23:19:26,466 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 89 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 441 Invalid, 0 Unknown, 238 Unchecked, 0.3s Time] [2021-11-20 23:19:26,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2021-11-20 23:19:26,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 366. [2021-11-20 23:19:26,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 365 states have (on average 3.326027397260274) internal successors, (1214), 365 states have internal predecessors, (1214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:19:26,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 1214 transitions. [2021-11-20 23:19:26,476 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 1214 transitions. Word has length 28 [2021-11-20 23:19:26,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:19:26,476 INFO L470 AbstractCegarLoop]: Abstraction has 366 states and 1214 transitions. [2021-11-20 23:19:26,476 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.391304347826087) internal successors, (55), 23 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-20 23:19:26,476 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 1214 transitions. [2021-11-20 23:19:26,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:19:26,477 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:19:26,477 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:19:26,502 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2021-11-20 23:19:26,677 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:19:26,678 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:19:26,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:19:26,678 INFO L85 PathProgramCache]: Analyzing trace with hash -494966527, now seen corresponding path program 40 times [2021-11-20 23:19:26,678 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:19:26,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037617651] [2021-11-20 23:19:26,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:19:26,679 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:19:26,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:19:27,556 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:19:27,556 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:19:27,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037617651] [2021-11-20 23:19:27,556 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037617651] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:19:27,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504116277] [2021-11-20 23:19:27,557 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-20 23:19:27,557 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:19:27,557 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:19:27,558 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:19:27,559 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2021-11-20 23:19:27,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:19:27,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 84 conjunts are in the unsatisfiable core [2021-11-20 23:19:27,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:19:27,696 INFO L354 Elim1Store]: treesize reduction 93, result has 14.7 percent of original size [2021-11-20 23:19:27,696 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 21 [2021-11-20 23:19:27,781 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 23:19:27,781 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 14 [2021-11-20 23:19:27,859 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-20 23:19:27,859 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 16 treesize of output 18 [2021-11-20 23:19:28,173 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:19:28,191 INFO L354 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2021-11-20 23:19:28,191 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 39 [2021-11-20 23:19:28,814 INFO L354 Elim1Store]: treesize reduction 29, result has 21.6 percent of original size [2021-11-20 23:19:28,814 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 53 treesize of output 37 [2021-11-20 23:19:28,857 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:19:28,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:19:29,053 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:19:29,053 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 179 treesize of output 219 [2021-11-20 23:19:30,694 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:19:30,694 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:19:30,756 INFO L354 Elim1Store]: treesize reduction 40, result has 58.8 percent of original size [2021-11-20 23:19:30,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, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 67 [2021-11-20 23:19:31,425 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:19:31,426 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1504116277] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:19:31,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1133316992] [2021-11-20 23:19:31,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-20 23:19:31,426 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:19:31,427 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 29 [2021-11-20 23:19:31,427 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058809453] [2021-11-20 23:19:31,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:19:31,427 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-11-20 23:19:31,427 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:19:31,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-11-20 23:19:31,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=802, Unknown=0, NotChecked=0, Total=930 [2021-11-20 23:19:31,428 INFO L87 Difference]: Start difference. First operand 366 states and 1214 transitions. Second operand has 31 states, 30 states have (on average 2.3333333333333335) internal successors, (70), 30 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:19:32,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:19:32,513 INFO L93 Difference]: Finished difference Result 417 states and 1378 transitions. [2021-11-20 23:19:32,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-20 23:19:32,513 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.3333333333333335) internal successors, (70), 30 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-11-20 23:19:32,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:19:32,515 INFO L225 Difference]: With dead ends: 417 [2021-11-20 23:19:32,515 INFO L226 Difference]: Without dead ends: 410 [2021-11-20 23:19:32,516 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=238, Invalid=1244, Unknown=0, NotChecked=0, Total=1482 [2021-11-20 23:19:32,517 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 81 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 311 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-20 23:19:32,517 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 82 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 550 Invalid, 0 Unknown, 311 Unchecked, 0.4s Time] [2021-11-20 23:19:32,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2021-11-20 23:19:32,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 370. [2021-11-20 23:19:32,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 369 states have (on average 3.3279132791327912) internal successors, (1228), 369 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:19:32,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 1228 transitions. [2021-11-20 23:19:32,526 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 1228 transitions. Word has length 28 [2021-11-20 23:19:32,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:19:32,526 INFO L470 AbstractCegarLoop]: Abstraction has 370 states and 1228 transitions. [2021-11-20 23:19:32,527 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.3333333333333335) internal successors, (70), 30 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:19:32,527 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 1228 transitions. [2021-11-20 23:19:32,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:19:32,528 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:19:32,528 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:19:32,553 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2021-11-20 23:19:32,728 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2021-11-20 23:19:32,728 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:19:32,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:19:32,729 INFO L85 PathProgramCache]: Analyzing trace with hash 489393865, now seen corresponding path program 41 times [2021-11-20 23:19:32,729 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:19:32,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323958880] [2021-11-20 23:19:32,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:19:32,730 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:19:32,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:19:33,545 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:19:33,545 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:19:33,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323958880] [2021-11-20 23:19:33,545 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323958880] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:19:33,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532196225] [2021-11-20 23:19:33,545 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 23:19:33,546 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:19:33,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:19:33,546 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:19:33,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2021-11-20 23:19:33,674 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-11-20 23:19:33,674 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:19:33,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 84 conjunts are in the unsatisfiable core [2021-11-20 23:19:33,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:19:33,735 INFO L354 Elim1Store]: treesize reduction 93, result has 14.7 percent of original size [2021-11-20 23:19:33,736 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 21 [2021-11-20 23:19:33,868 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 23:19:33,868 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 14 [2021-11-20 23:19:33,962 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-20 23:19:33,962 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 16 treesize of output 18 [2021-11-20 23:19:34,270 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:19:34,287 INFO L354 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2021-11-20 23:19:34,288 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 39 [2021-11-20 23:19:34,615 INFO L354 Elim1Store]: treesize reduction 29, result has 21.6 percent of original size [2021-11-20 23:19:34,616 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 53 treesize of output 37 [2021-11-20 23:19:34,677 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:19:34,677 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:19:34,894 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:19:34,894 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 179 treesize of output 219 [2021-11-20 23:19:37,455 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:19:37,456 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:19:37,513 INFO L354 Elim1Store]: treesize reduction 40, result has 58.8 percent of original size [2021-11-20 23:19:37,514 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 38 treesize of output 67 [2021-11-20 23:19:38,169 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:19:38,169 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532196225] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:19:38,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1975562523] [2021-11-20 23:19:38,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-20 23:19:38,170 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:19:38,170 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 29 [2021-11-20 23:19:38,170 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606288209] [2021-11-20 23:19:38,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:19:38,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-11-20 23:19:38,171 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:19:38,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-11-20 23:19:38,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=802, Unknown=0, NotChecked=0, Total=930 [2021-11-20 23:19:38,172 INFO L87 Difference]: Start difference. First operand 370 states and 1228 transitions. Second operand has 31 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 30 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:19:38,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:19:38,696 INFO L93 Difference]: Finished difference Result 414 states and 1369 transitions. [2021-11-20 23:19:38,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-20 23:19:38,697 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 30 states have internal predecessors, (64), 0 states have call successors, (0), 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 28 [2021-11-20 23:19:38,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:19:38,698 INFO L225 Difference]: With dead ends: 414 [2021-11-20 23:19:38,698 INFO L226 Difference]: Without dead ends: 407 [2021-11-20 23:19:38,699 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=220, Invalid=1112, Unknown=0, NotChecked=0, Total=1332 [2021-11-20 23:19:38,699 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 92 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 117 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 23:19:38,700 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 56 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 351 Invalid, 0 Unknown, 117 Unchecked, 0.3s Time] [2021-11-20 23:19:38,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2021-11-20 23:19:38,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 377. [2021-11-20 23:19:38,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 376 states have (on average 3.3351063829787235) internal successors, (1254), 376 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:19:38,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1254 transitions. [2021-11-20 23:19:38,726 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1254 transitions. Word has length 28 [2021-11-20 23:19:38,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:19:38,727 INFO L470 AbstractCegarLoop]: Abstraction has 377 states and 1254 transitions. [2021-11-20 23:19:38,727 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 30 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:19:38,727 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1254 transitions. [2021-11-20 23:19:38,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:19:38,728 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:19:38,729 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:19:38,776 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2021-11-20 23:19:38,942 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2021-11-20 23:19:38,943 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:19:38,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:19:38,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1496151935, now seen corresponding path program 42 times [2021-11-20 23:19:38,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:19:38,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578003408] [2021-11-20 23:19:38,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:19:38,944 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:19:38,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:19:39,913 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:19:39,913 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:19:39,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578003408] [2021-11-20 23:19:39,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578003408] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:19:39,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293099537] [2021-11-20 23:19:39,914 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 23:19:39,914 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:19:39,914 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:19:39,915 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:19:39,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2021-11-20 23:19:40,039 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 23:19:40,039 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:19:40,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 84 conjunts are in the unsatisfiable core [2021-11-20 23:19:40,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:19:40,097 INFO L354 Elim1Store]: treesize reduction 93, result has 14.7 percent of original size [2021-11-20 23:19:40,098 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 21 [2021-11-20 23:19:40,200 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 23:19:40,201 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 14 [2021-11-20 23:19:40,321 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-20 23:19:40,321 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 16 treesize of output 18 [2021-11-20 23:19:40,664 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:19:40,682 INFO L354 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2021-11-20 23:19:40,682 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 39 [2021-11-20 23:19:41,085 INFO L354 Elim1Store]: treesize reduction 29, result has 21.6 percent of original size [2021-11-20 23:19:41,085 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 53 treesize of output 37 [2021-11-20 23:19:41,141 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:19:41,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:19:41,346 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:19:41,347 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 179 treesize of output 219 [2021-11-20 23:19:43,867 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:19:43,868 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:19:43,928 INFO L354 Elim1Store]: treesize reduction 40, result has 58.8 percent of original size [2021-11-20 23:19:43,929 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 38 treesize of output 67 [2021-11-20 23:19:44,599 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:19:44,599 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293099537] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:19:44,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1102164449] [2021-11-20 23:19:44,600 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-20 23:19:44,600 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:19:44,600 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 29 [2021-11-20 23:19:44,601 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468367687] [2021-11-20 23:19:44,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:19:44,601 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-11-20 23:19:44,601 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:19:44,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-11-20 23:19:44,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=802, Unknown=0, NotChecked=0, Total=930 [2021-11-20 23:19:44,602 INFO L87 Difference]: Start difference. First operand 377 states and 1254 transitions. Second operand has 31 states, 30 states have (on average 2.2) internal successors, (66), 30 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-20 23:19:45,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:19:45,103 INFO L93 Difference]: Finished difference Result 440 states and 1448 transitions. [2021-11-20 23:19:45,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-20 23:19:45,104 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.2) internal successors, (66), 30 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 28 [2021-11-20 23:19:45,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:19:45,105 INFO L225 Difference]: With dead ends: 440 [2021-11-20 23:19:45,105 INFO L226 Difference]: Without dead ends: 433 [2021-11-20 23:19:45,106 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=187, Invalid=1073, Unknown=0, NotChecked=0, Total=1260 [2021-11-20 23:19:45,106 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 73 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 207 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 23:19:45,107 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 44 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 295 Invalid, 0 Unknown, 207 Unchecked, 0.3s Time] [2021-11-20 23:19:45,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2021-11-20 23:19:45,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 368. [2021-11-20 23:19:45,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 367 states have (on average 3.329700272479564) internal successors, (1222), 367 states have internal predecessors, (1222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:19:45,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 1222 transitions. [2021-11-20 23:19:45,117 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 1222 transitions. Word has length 28 [2021-11-20 23:19:45,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:19:45,117 INFO L470 AbstractCegarLoop]: Abstraction has 368 states and 1222 transitions. [2021-11-20 23:19:45,118 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.2) internal successors, (66), 30 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-20 23:19:45,118 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 1222 transitions. [2021-11-20 23:19:45,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:19:45,119 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:19:45,120 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:19:45,154 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2021-11-20 23:19:45,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2021-11-20 23:19:45,336 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:19:45,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:19:45,336 INFO L85 PathProgramCache]: Analyzing trace with hash -2123249925, now seen corresponding path program 43 times [2021-11-20 23:19:45,336 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:19:45,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661600613] [2021-11-20 23:19:45,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:19:45,337 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:19:45,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:19:45,730 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:19:45,731 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:19:45,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661600613] [2021-11-20 23:19:45,731 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661600613] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:19:45,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953551155] [2021-11-20 23:19:45,731 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-20 23:19:45,731 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:19:45,731 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:19:45,732 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:19:45,734 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2021-11-20 23:19:45,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:19:45,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 72 conjunts are in the unsatisfiable core [2021-11-20 23:19:45,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:19:46,366 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-11-20 23:19:46,367 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 41 treesize of output 29 [2021-11-20 23:19:46,386 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:19:46,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:19:46,580 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:19:46,580 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 34 treesize of output 95 [2021-11-20 23:19:46,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:19:46,783 INFO L354 Elim1Store]: treesize reduction 53, result has 31.2 percent of original size [2021-11-20 23:19:46,783 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 34 treesize of output 34 [2021-11-20 23:19:46,897 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:19:46,897 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953551155] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:19:46,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1931214102] [2021-11-20 23:19:46,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-20 23:19:46,898 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:19:46,898 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 6] total 14 [2021-11-20 23:19:46,898 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800993925] [2021-11-20 23:19:46,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:19:46,899 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-20 23:19:46,899 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:19:46,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-20 23:19:46,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2021-11-20 23:19:46,900 INFO L87 Difference]: Start difference. First operand 368 states and 1222 transitions. Second operand has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 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-20 23:19:47,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:19:47,417 INFO L93 Difference]: Finished difference Result 483 states and 1583 transitions. [2021-11-20 23:19:47,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-20 23:19:47,417 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 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 28 [2021-11-20 23:19:47,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:19:47,419 INFO L225 Difference]: With dead ends: 483 [2021-11-20 23:19:47,419 INFO L226 Difference]: Without dead ends: 476 [2021-11-20 23:19:47,419 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 44 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2021-11-20 23:19:47,420 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 70 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-20 23:19:47,420 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 58 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 640 Invalid, 0 Unknown, 70 Unchecked, 0.4s Time] [2021-11-20 23:19:47,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2021-11-20 23:19:47,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 380. [2021-11-20 23:19:47,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 379 states have (on average 3.3271767810026387) internal successors, (1261), 379 states have internal predecessors, (1261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:19:47,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1261 transitions. [2021-11-20 23:19:47,430 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1261 transitions. Word has length 28 [2021-11-20 23:19:47,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:19:47,430 INFO L470 AbstractCegarLoop]: Abstraction has 380 states and 1261 transitions. [2021-11-20 23:19:47,430 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 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-20 23:19:47,430 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1261 transitions. [2021-11-20 23:19:47,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:19:47,431 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:19:47,431 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:19:47,455 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 [2021-11-20 23:19:47,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2021-11-20 23:19:47,632 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:19:47,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:19:47,633 INFO L85 PathProgramCache]: Analyzing trace with hash -91449987, now seen corresponding path program 44 times [2021-11-20 23:19:47,633 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:19:47,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793161196] [2021-11-20 23:19:47,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:19:47,634 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:19:47,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:19:48,055 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:19:48,055 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:19:48,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793161196] [2021-11-20 23:19:48,055 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793161196] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:19:48,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275577115] [2021-11-20 23:19:48,056 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 23:19:48,056 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:19:48,056 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:19:48,057 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:19:48,058 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2021-11-20 23:19:48,165 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-20 23:19:48,165 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:19:48,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 72 conjunts are in the unsatisfiable core [2021-11-20 23:19:48,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:19:48,714 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-11-20 23:19:48,714 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 41 treesize of output 29 [2021-11-20 23:19:48,744 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:19:48,744 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:19:48,969 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:19:48,969 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 34 treesize of output 95 [2021-11-20 23:19:49,263 INFO L354 Elim1Store]: treesize reduction 65, result has 23.5 percent of original size [2021-11-20 23:19:49,263 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 34 treesize of output 30 [2021-11-20 23:19:49,412 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:19:49,413 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275577115] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:19:49,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1447753612] [2021-11-20 23:19:49,413 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-20 23:19:49,414 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:19:49,414 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 6] total 14 [2021-11-20 23:19:49,414 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094507217] [2021-11-20 23:19:49,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:19:49,414 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-20 23:19:49,415 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:19:49,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-20 23:19:49,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2021-11-20 23:19:49,415 INFO L87 Difference]: Start difference. First operand 380 states and 1261 transitions. Second operand has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 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-20 23:19:49,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:19:49,878 INFO L93 Difference]: Finished difference Result 439 states and 1447 transitions. [2021-11-20 23:19:49,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-20 23:19:49,879 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 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 28 [2021-11-20 23:19:49,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:19:49,881 INFO L225 Difference]: With dead ends: 439 [2021-11-20 23:19:49,881 INFO L226 Difference]: Without dead ends: 432 [2021-11-20 23:19:49,881 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 44 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2021-11-20 23:19:49,882 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 52 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 129 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-20 23:19:49,882 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 44 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 541 Invalid, 0 Unknown, 129 Unchecked, 0.4s Time] [2021-11-20 23:19:49,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2021-11-20 23:19:49,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 386. [2021-11-20 23:19:49,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 385 states have (on average 3.327272727272727) internal successors, (1281), 385 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:19:49,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1281 transitions. [2021-11-20 23:19:49,895 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1281 transitions. Word has length 28 [2021-11-20 23:19:49,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:19:49,895 INFO L470 AbstractCegarLoop]: Abstraction has 386 states and 1281 transitions. [2021-11-20 23:19:49,895 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 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-20 23:19:49,896 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1281 transitions. [2021-11-20 23:19:49,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:19:49,897 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:19:49,897 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:19:49,927 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2021-11-20 23:19:50,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,48 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:19:50,100 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:19:50,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:19:50,100 INFO L85 PathProgramCache]: Analyzing trace with hash 199417661, now seen corresponding path program 45 times [2021-11-20 23:19:50,100 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:19:50,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232636183] [2021-11-20 23:19:50,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:19:50,100 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:19:50,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:19:50,523 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:19:50,523 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:19:50,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232636183] [2021-11-20 23:19:50,523 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232636183] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:19:50,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383489065] [2021-11-20 23:19:50,523 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 23:19:50,523 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:19:50,524 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:19:50,524 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:19:50,525 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2021-11-20 23:19:50,619 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 23:19:50,619 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:19:50,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 81 conjunts are in the unsatisfiable core [2021-11-20 23:19:50,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:19:50,660 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-20 23:19:50,718 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 23:19:50,718 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 11 treesize of output 11 [2021-11-20 23:19:51,156 INFO L354 Elim1Store]: treesize reduction 56, result has 29.1 percent of original size [2021-11-20 23:19:51,156 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 52 [2021-11-20 23:19:51,667 INFO L354 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2021-11-20 23:19:51,667 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 59 treesize of output 51 [2021-11-20 23:19:51,752 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:19:51,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:19:58,615 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((~C~0.offset Int)) (let ((.cse0 (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset)) (.cse1 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (<= (+ c_~csum~0 .cse0 .cse1) (+ (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) ~C~0.offset (+ .cse0 .cse1))) c_~B~0.base) (+ c_~B~0.offset (* |c_thread2Thread1of1ForFork0_~i~1#1| 4))) c_~asum~0 c_~bsum~0)))) (forall ((~C~0.offset Int)) (let ((.cse2 (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset)) (.cse3 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (<= (+ (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) ~C~0.offset (+ .cse2 .cse3))) c_~B~0.base) (+ c_~B~0.offset (* |c_thread2Thread1of1ForFork0_~i~1#1| 4))) c_~asum~0 c_~bsum~0) (+ c_~csum~0 .cse2 .cse3))))) is different from false [2021-11-20 23:19:58,675 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:19:58,675 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 126 [2021-11-20 23:19:59,521 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:19:59,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:19:59,539 INFO L354 Elim1Store]: treesize reduction 23, result has 51.1 percent of original size [2021-11-20 23:19:59,539 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 34 treesize of output 32 [2021-11-20 23:19:59,764 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 25 treesize of output 23 [2021-11-20 23:19:59,774 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2021-11-20 23:19:59,774 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383489065] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:19:59,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [776465699] [2021-11-20 23:19:59,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-20 23:19:59,775 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:19:59,775 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 19 [2021-11-20 23:19:59,775 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855354565] [2021-11-20 23:19:59,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:19:59,776 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-20 23:19:59,776 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:19:59,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-20 23:19:59,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=313, Unknown=2, NotChecked=36, Total=420 [2021-11-20 23:19:59,776 INFO L87 Difference]: Start difference. First operand 386 states and 1281 transitions. Second operand has 21 states, 20 states have (on average 2.6) internal successors, (52), 20 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:20:00,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:20:00,130 INFO L93 Difference]: Finished difference Result 451 states and 1492 transitions. [2021-11-20 23:20:00,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-20 23:20:00,131 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.6) internal successors, (52), 20 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-11-20 23:20:00,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:20:00,132 INFO L225 Difference]: With dead ends: 451 [2021-11-20 23:20:00,132 INFO L226 Difference]: Without dead ends: 444 [2021-11-20 23:20:00,133 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 39 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=119, Invalid=435, Unknown=2, NotChecked=44, Total=600 [2021-11-20 23:20:00,133 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 50 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 165 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 23:20:00,134 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 44 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 399 Invalid, 0 Unknown, 165 Unchecked, 0.2s Time] [2021-11-20 23:20:00,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2021-11-20 23:20:00,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 404. [2021-11-20 23:20:00,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 403 states have (on average 3.3424317617866004) internal successors, (1347), 403 states have internal predecessors, (1347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:20:00,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 1347 transitions. [2021-11-20 23:20:00,145 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 1347 transitions. Word has length 28 [2021-11-20 23:20:00,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:20:00,145 INFO L470 AbstractCegarLoop]: Abstraction has 404 states and 1347 transitions. [2021-11-20 23:20:00,145 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.6) internal successors, (52), 20 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:20:00,145 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 1347 transitions. [2021-11-20 23:20:00,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:20:00,146 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:20:00,146 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:20:00,169 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2021-11-20 23:20:00,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2021-11-20 23:20:00,347 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:20:00,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:20:00,347 INFO L85 PathProgramCache]: Analyzing trace with hash 62040061, now seen corresponding path program 46 times [2021-11-20 23:20:00,347 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:20:00,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490957808] [2021-11-20 23:20:00,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:20:00,348 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:20:00,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:20:00,785 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:20:00,785 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:20:00,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490957808] [2021-11-20 23:20:00,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490957808] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:20:00,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249899363] [2021-11-20 23:20:00,786 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-20 23:20:00,786 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:20:00,786 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:20:00,787 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:20:00,788 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2021-11-20 23:20:00,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:20:00,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 81 conjunts are in the unsatisfiable core [2021-11-20 23:20:00,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:20:00,908 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-20 23:20:00,953 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 23:20:00,953 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 11 treesize of output 11 [2021-11-20 23:20:01,348 INFO L354 Elim1Store]: treesize reduction 56, result has 29.1 percent of original size [2021-11-20 23:20:01,348 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 52 [2021-11-20 23:20:02,661 INFO L354 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2021-11-20 23:20:02,662 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 49 treesize of output 49 [2021-11-20 23:20:02,723 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:20:02,724 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:20:11,791 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((~C~0.offset Int)) (let ((.cse0 (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset)) (.cse1 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (<= (+ c_~csum~0 .cse0 .cse1) (+ (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) ~C~0.offset (+ .cse0 .cse1))) c_~B~0.base) (+ c_~B~0.offset (* |c_thread2Thread1of1ForFork0_~i~1#1| 4))) c_~asum~0 c_~bsum~0)))) (forall ((~C~0.offset Int)) (let ((.cse2 (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset)) (.cse3 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (<= (+ (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) ~C~0.offset (+ .cse2 .cse3))) c_~B~0.base) (+ c_~B~0.offset (* |c_thread2Thread1of1ForFork0_~i~1#1| 4))) c_~asum~0 c_~bsum~0) (+ c_~csum~0 .cse2 .cse3))))) is different from false [2021-11-20 23:20:11,871 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:20:11,871 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 126 [2021-11-20 23:20:12,292 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:20:12,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:20:12,319 INFO L354 Elim1Store]: treesize reduction 53, result has 31.2 percent of original size [2021-11-20 23:20:12,319 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 34 treesize of output 34 [2021-11-20 23:20:12,583 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 25 treesize of output 23 [2021-11-20 23:20:12,593 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2021-11-20 23:20:12,594 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249899363] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:20:12,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [818188921] [2021-11-20 23:20:12,594 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-20 23:20:12,594 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:20:12,595 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 19 [2021-11-20 23:20:12,595 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940460147] [2021-11-20 23:20:12,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:20:12,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-20 23:20:12,595 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:20:12,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-20 23:20:12,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=4, NotChecked=36, Total=420 [2021-11-20 23:20:12,596 INFO L87 Difference]: Start difference. First operand 404 states and 1347 transitions. Second operand has 21 states, 20 states have (on average 2.7) internal successors, (54), 20 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-20 23:20:12,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:20:12,964 INFO L93 Difference]: Finished difference Result 482 states and 1595 transitions. [2021-11-20 23:20:12,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-20 23:20:12,964 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.7) internal successors, (54), 20 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 28 [2021-11-20 23:20:12,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:20:12,966 INFO L225 Difference]: With dead ends: 482 [2021-11-20 23:20:12,966 INFO L226 Difference]: Without dead ends: 475 [2021-11-20 23:20:12,967 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 40 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=119, Invalid=433, Unknown=4, NotChecked=44, Total=600 [2021-11-20 23:20:12,967 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 60 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 197 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 23:20:12,967 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 62 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 355 Invalid, 0 Unknown, 197 Unchecked, 0.3s Time] [2021-11-20 23:20:12,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2021-11-20 23:20:12,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 400. [2021-11-20 23:20:12,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 399 states have (on average 3.3333333333333335) internal successors, (1330), 399 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:20:12,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 1330 transitions. [2021-11-20 23:20:12,983 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 1330 transitions. Word has length 28 [2021-11-20 23:20:12,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:20:12,984 INFO L470 AbstractCegarLoop]: Abstraction has 400 states and 1330 transitions. [2021-11-20 23:20:12,984 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.7) internal successors, (54), 20 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-20 23:20:12,984 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 1330 transitions. [2021-11-20 23:20:12,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:20:12,986 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:20:12,986 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:20:13,028 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2021-11-20 23:20:13,200 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable52 [2021-11-20 23:20:13,201 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:20:13,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:20:13,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1739462667, now seen corresponding path program 47 times [2021-11-20 23:20:13,201 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:20:13,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138433944] [2021-11-20 23:20:13,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:20:13,202 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:20:13,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:20:13,724 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:20:13,725 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:20:13,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138433944] [2021-11-20 23:20:13,725 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138433944] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:20:13,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726743420] [2021-11-20 23:20:13,725 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 23:20:13,725 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:20:13,726 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:20:13,729 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:20:13,748 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2021-11-20 23:20:13,897 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-11-20 23:20:13,897 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:20:13,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 81 conjunts are in the unsatisfiable core [2021-11-20 23:20:13,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:20:13,954 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-20 23:20:14,039 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 23:20:14,039 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 11 treesize of output 11 [2021-11-20 23:20:14,657 INFO L354 Elim1Store]: treesize reduction 56, result has 29.1 percent of original size [2021-11-20 23:20:14,657 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 52 [2021-11-20 23:20:14,935 INFO L354 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2021-11-20 23:20:14,935 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 49 treesize of output 49 [2021-11-20 23:20:15,011 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:20:15,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:20:17,090 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((~C~0.offset Int)) (let ((.cse2 (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse2))) (.cse1 (select (select |c_#memory_int| c_~B~0.base) (+ c_~B~0.offset .cse2)))) (<= (+ c_~csum~0 .cse0 .cse1) (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) (+ ~C~0.offset .cse2) (+ .cse0 .cse1))) c_~B~0.base) (+ c_~B~0.offset (* |c_thread2Thread1of1ForFork0_~i~1#1| 4)))))))) (forall ((~C~0.offset Int)) (let ((.cse3 (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) (let ((.cse4 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse3))) (.cse5 (select (select |c_#memory_int| c_~B~0.base) (+ c_~B~0.offset .cse3)))) (<= (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) (+ ~C~0.offset .cse3) (+ .cse4 .cse5))) c_~B~0.base) (+ c_~B~0.offset (* |c_thread2Thread1of1ForFork0_~i~1#1| 4)))) (+ c_~csum~0 .cse4 .cse5)))))) is different from false [2021-11-20 23:20:18,771 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((~C~0.offset Int)) (let ((.cse0 (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset)) (.cse1 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (<= (+ c_~csum~0 .cse0 .cse1) (+ (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) ~C~0.offset (+ .cse0 .cse1))) c_~B~0.base) (+ c_~B~0.offset (* |c_thread2Thread1of1ForFork0_~i~1#1| 4))) c_~asum~0 c_~bsum~0)))) (forall ((~C~0.offset Int)) (let ((.cse2 (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset)) (.cse3 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (<= (+ (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) ~C~0.offset (+ .cse2 .cse3))) c_~B~0.base) (+ c_~B~0.offset (* |c_thread2Thread1of1ForFork0_~i~1#1| 4))) c_~asum~0 c_~bsum~0) (+ c_~csum~0 .cse2 .cse3))))) is different from false [2021-11-20 23:20:18,846 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:20:18,846 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 126 [2021-11-20 23:20:19,450 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:20:19,479 INFO L354 Elim1Store]: treesize reduction 61, result has 28.2 percent of original size [2021-11-20 23:20:19,479 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 34 treesize of output 34 [2021-11-20 23:20:19,749 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 25 treesize of output 23 [2021-11-20 23:20:19,759 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2021-11-20 23:20:19,760 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726743420] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:20:19,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1054761626] [2021-11-20 23:20:19,760 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-20 23:20:19,760 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:20:19,761 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 19 [2021-11-20 23:20:19,761 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703139999] [2021-11-20 23:20:19,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:20:19,761 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-20 23:20:19,761 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:20:19,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-20 23:20:19,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=280, Unknown=2, NotChecked=70, Total=420 [2021-11-20 23:20:19,762 INFO L87 Difference]: Start difference. First operand 400 states and 1330 transitions. Second operand has 21 states, 20 states have (on average 2.6) internal successors, (52), 20 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:20:20,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:20:20,273 INFO L93 Difference]: Finished difference Result 464 states and 1528 transitions. [2021-11-20 23:20:20,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-20 23:20:20,274 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.6) internal successors, (52), 20 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-11-20 23:20:20,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:20:20,276 INFO L225 Difference]: With dead ends: 464 [2021-11-20 23:20:20,276 INFO L226 Difference]: Without dead ends: 457 [2021-11-20 23:20:20,276 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 39 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=118, Invalid=394, Unknown=2, NotChecked=86, Total=600 [2021-11-20 23:20:20,276 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 47 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 202 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-20 23:20:20,277 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 60 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 563 Invalid, 0 Unknown, 202 Unchecked, 0.4s Time] [2021-11-20 23:20:20,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2021-11-20 23:20:20,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 405. [2021-11-20 23:20:20,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 404 states have (on average 3.3415841584158414) internal successors, (1350), 404 states have internal predecessors, (1350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:20:20,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 1350 transitions. [2021-11-20 23:20:20,289 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 1350 transitions. Word has length 28 [2021-11-20 23:20:20,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:20:20,289 INFO L470 AbstractCegarLoop]: Abstraction has 405 states and 1350 transitions. [2021-11-20 23:20:20,290 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.6) internal successors, (52), 20 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:20:20,290 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 1350 transitions. [2021-11-20 23:20:20,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:20:20,291 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:20:20,291 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:20:20,317 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2021-11-20 23:20:20,491 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,51 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:20:20,492 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:20:20,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:20:20,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1602085067, now seen corresponding path program 48 times [2021-11-20 23:20:20,492 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:20:20,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791685591] [2021-11-20 23:20:20,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:20:20,493 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:20:20,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:20:20,987 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:20:20,987 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:20:20,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791685591] [2021-11-20 23:20:20,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791685591] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:20:20,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926509665] [2021-11-20 23:20:20,988 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 23:20:20,988 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:20:20,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:20:20,989 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:20:21,013 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2021-11-20 23:20:21,112 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 23:20:21,112 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:20:21,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 81 conjunts are in the unsatisfiable core [2021-11-20 23:20:21,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:20:21,156 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-20 23:20:21,228 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 23:20:21,228 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 11 treesize of output 11 [2021-11-20 23:20:21,735 INFO L354 Elim1Store]: treesize reduction 56, result has 29.1 percent of original size [2021-11-20 23:20:21,736 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 52 [2021-11-20 23:20:22,224 INFO L354 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2021-11-20 23:20:22,224 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 49 treesize of output 49 [2021-11-20 23:20:22,297 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:20:22,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:20:24,357 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((~C~0.offset Int)) (let ((.cse2 (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse2))) (.cse1 (select (select |c_#memory_int| c_~B~0.base) (+ c_~B~0.offset .cse2)))) (<= (+ c_~csum~0 .cse0 .cse1) (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) (+ ~C~0.offset .cse2) (+ .cse0 .cse1))) c_~B~0.base) (+ c_~B~0.offset (* |c_thread2Thread1of1ForFork0_~i~1#1| 4)))))))) (forall ((~C~0.offset Int)) (let ((.cse3 (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) (let ((.cse4 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse3))) (.cse5 (select (select |c_#memory_int| c_~B~0.base) (+ c_~B~0.offset .cse3)))) (<= (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) (+ ~C~0.offset .cse3) (+ .cse4 .cse5))) c_~B~0.base) (+ c_~B~0.offset (* |c_thread2Thread1of1ForFork0_~i~1#1| 4)))) (+ c_~csum~0 .cse4 .cse5)))))) is different from false [2021-11-20 23:20:29,929 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:20:29,930 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 126 [2021-11-20 23:20:30,893 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:20:30,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:20:30,920 INFO L354 Elim1Store]: treesize reduction 53, result has 31.2 percent of original size [2021-11-20 23:20:30,920 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 34 treesize of output 34 [2021-11-20 23:20:31,182 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 25 treesize of output 23 [2021-11-20 23:20:31,192 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2021-11-20 23:20:31,193 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926509665] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:20:31,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1129839470] [2021-11-20 23:20:31,193 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-20 23:20:31,195 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:20:31,195 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 19 [2021-11-20 23:20:31,195 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203460043] [2021-11-20 23:20:31,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:20:31,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-20 23:20:31,196 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:20:31,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-20 23:20:31,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=311, Unknown=3, NotChecked=36, Total=420 [2021-11-20 23:20:31,196 INFO L87 Difference]: Start difference. First operand 405 states and 1350 transitions. Second operand has 21 states, 20 states have (on average 2.7) internal successors, (54), 20 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-20 23:20:31,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:20:31,549 INFO L93 Difference]: Finished difference Result 458 states and 1493 transitions. [2021-11-20 23:20:31,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-20 23:20:31,549 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.7) internal successors, (54), 20 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 28 [2021-11-20 23:20:31,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:20:31,551 INFO L225 Difference]: With dead ends: 458 [2021-11-20 23:20:31,551 INFO L226 Difference]: Without dead ends: 451 [2021-11-20 23:20:31,551 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 40 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=112, Invalid=441, Unknown=3, NotChecked=44, Total=600 [2021-11-20 23:20:31,552 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 75 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 200 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 23:20:31,552 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 47 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 325 Invalid, 0 Unknown, 200 Unchecked, 0.2s Time] [2021-11-20 23:20:31,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2021-11-20 23:20:31,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 395. [2021-11-20 23:20:31,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 394 states have (on average 3.3375634517766497) internal successors, (1315), 394 states have internal predecessors, (1315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:20:31,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1315 transitions. [2021-11-20 23:20:31,563 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1315 transitions. Word has length 28 [2021-11-20 23:20:31,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:20:31,563 INFO L470 AbstractCegarLoop]: Abstraction has 395 states and 1315 transitions. [2021-11-20 23:20:31,563 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.7) internal successors, (54), 20 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-20 23:20:31,563 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1315 transitions. [2021-11-20 23:20:31,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:20:31,564 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:20:31,565 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:20:31,589 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Ended with exit code 0 [2021-11-20 23:20:31,765 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,52 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:20:31,765 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:20:31,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:20:31,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1811912675, now seen corresponding path program 49 times [2021-11-20 23:20:31,766 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:20:31,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650618218] [2021-11-20 23:20:31,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:20:31,766 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:20:31,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:20:32,259 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:20:32,259 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:20:32,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650618218] [2021-11-20 23:20:32,260 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650618218] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:20:32,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16821702] [2021-11-20 23:20:32,260 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-20 23:20:32,260 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:20:32,260 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:20:32,265 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:20:32,284 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2021-11-20 23:20:32,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:20:32,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 81 conjunts are in the unsatisfiable core [2021-11-20 23:20:32,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:20:32,472 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-20 23:20:32,519 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 23:20:32,520 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 11 treesize of output 11 [2021-11-20 23:20:32,939 INFO L354 Elim1Store]: treesize reduction 56, result has 29.1 percent of original size [2021-11-20 23:20:32,939 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 52 [2021-11-20 23:20:33,398 INFO L354 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2021-11-20 23:20:33,398 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 49 treesize of output 49 [2021-11-20 23:20:33,481 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:20:33,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:20:46,120 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:20:46,121 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 126 [2021-11-20 23:20:46,771 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:20:46,800 INFO L354 Elim1Store]: treesize reduction 57, result has 32.9 percent of original size [2021-11-20 23:20:46,800 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 34 treesize of output 38 [2021-11-20 23:20:47,083 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 25 treesize of output 23 [2021-11-20 23:20:47,093 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:20:47,093 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16821702] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:20:47,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [903869829] [2021-11-20 23:20:47,093 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-20 23:20:47,095 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:20:47,095 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 19 [2021-11-20 23:20:47,095 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227754615] [2021-11-20 23:20:47,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:20:47,095 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-20 23:20:47,095 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:20:47,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-20 23:20:47,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=344, Unknown=5, NotChecked=0, Total=420 [2021-11-20 23:20:47,096 INFO L87 Difference]: Start difference. First operand 395 states and 1315 transitions. Second operand has 21 states, 20 states have (on average 2.65) internal successors, (53), 20 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-20 23:20:50,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:20:50,643 INFO L93 Difference]: Finished difference Result 439 states and 1444 transitions. [2021-11-20 23:20:50,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-20 23:20:50,644 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.65) internal successors, (53), 20 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 28 [2021-11-20 23:20:50,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:20:50,646 INFO L225 Difference]: With dead ends: 439 [2021-11-20 23:20:50,646 INFO L226 Difference]: Without dead ends: 435 [2021-11-20 23:20:50,646 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=131, Invalid=512, Unknown=7, NotChecked=0, Total=650 [2021-11-20 23:20:50,646 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 85 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 197 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 23:20:50,646 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 41 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 341 Invalid, 0 Unknown, 197 Unchecked, 0.2s Time] [2021-11-20 23:20:50,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2021-11-20 23:20:50,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 396. [2021-11-20 23:20:50,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 395 states have (on average 3.3367088607594937) internal successors, (1318), 395 states have internal predecessors, (1318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:20:50,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1318 transitions. [2021-11-20 23:20:50,656 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1318 transitions. Word has length 28 [2021-11-20 23:20:50,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:20:50,656 INFO L470 AbstractCegarLoop]: Abstraction has 396 states and 1318 transitions. [2021-11-20 23:20:50,657 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.65) internal successors, (53), 20 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-20 23:20:50,657 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1318 transitions. [2021-11-20 23:20:50,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:20:50,658 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:20:50,658 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:20:50,683 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Forceful destruction successful, exit code 0 [2021-11-20 23:20:50,858 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2021-11-20 23:20:50,859 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:20:50,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:20:50,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1674535075, now seen corresponding path program 50 times [2021-11-20 23:20:50,859 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:20:50,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119011049] [2021-11-20 23:20:50,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:20:50,859 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:20:50,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:20:51,372 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:20:51,373 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:20:51,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119011049] [2021-11-20 23:20:51,373 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119011049] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:20:51,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952912879] [2021-11-20 23:20:51,373 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 23:20:51,373 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:20:51,373 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:20:51,374 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:20:51,375 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2021-11-20 23:20:51,488 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-20 23:20:51,488 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:20:51,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 81 conjunts are in the unsatisfiable core [2021-11-20 23:20:51,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:20:51,530 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-20 23:20:51,584 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 23:20:51,584 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 11 treesize of output 11 [2021-11-20 23:20:52,033 INFO L354 Elim1Store]: treesize reduction 102, result has 20.3 percent of original size [2021-11-20 23:20:52,033 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 58 [2021-11-20 23:20:53,330 INFO L354 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2021-11-20 23:20:53,331 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 72 treesize of output 56 [2021-11-20 23:20:53,401 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:20:53,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:20:55,490 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((~C~0.offset Int)) (let ((.cse2 (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse2))) (.cse1 (select (select |c_#memory_int| c_~B~0.base) (+ c_~B~0.offset .cse2)))) (<= (+ c_~csum~0 .cse0 .cse1) (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) (+ ~C~0.offset .cse2) (+ .cse0 .cse1))) c_~B~0.base) (+ c_~B~0.offset (* |c_thread2Thread1of1ForFork0_~i~1#1| 4)))))))) (forall ((~C~0.offset Int)) (let ((.cse3 (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) (let ((.cse4 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse3))) (.cse5 (select (select |c_#memory_int| c_~B~0.base) (+ c_~B~0.offset .cse3)))) (<= (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) (+ ~C~0.offset .cse3) (+ .cse4 .cse5))) c_~B~0.base) (+ c_~B~0.offset (* |c_thread2Thread1of1ForFork0_~i~1#1| 4)))) (+ c_~csum~0 .cse4 .cse5)))))) is different from false [2021-11-20 23:20:56,907 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((~C~0.offset Int)) (let ((.cse0 (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset)) (.cse1 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (<= (+ c_~csum~0 .cse0 .cse1) (+ (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) ~C~0.offset (+ .cse0 .cse1))) c_~B~0.base) (+ c_~B~0.offset (* |c_thread2Thread1of1ForFork0_~i~1#1| 4))) c_~asum~0 c_~bsum~0)))) (forall ((~C~0.offset Int)) (let ((.cse2 (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset)) (.cse3 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (<= (+ (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) ~C~0.offset (+ .cse2 .cse3))) c_~B~0.base) (+ c_~B~0.offset (* |c_thread2Thread1of1ForFork0_~i~1#1| 4))) c_~asum~0 c_~bsum~0) (+ c_~csum~0 .cse2 .cse3))))) is different from false [2021-11-20 23:20:56,973 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:20:56,974 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 126 [2021-11-20 23:20:57,895 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:20:57,924 INFO L354 Elim1Store]: treesize reduction 61, result has 28.2 percent of original size [2021-11-20 23:20:57,924 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 34 treesize of output 34 [2021-11-20 23:20:58,219 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 25 treesize of output 23 [2021-11-20 23:20:58,230 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2021-11-20 23:20:58,230 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952912879] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:20:58,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1895000917] [2021-11-20 23:20:58,230 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-20 23:20:58,231 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:20:58,231 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 20 [2021-11-20 23:20:58,231 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146665043] [2021-11-20 23:20:58,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:20:58,231 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-11-20 23:20:58,232 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:20:58,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-20 23:20:58,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=315, Unknown=2, NotChecked=74, Total=462 [2021-11-20 23:20:58,232 INFO L87 Difference]: Start difference. First operand 396 states and 1318 transitions. Second operand has 22 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 21 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-20 23:20:58,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:20:58,740 INFO L93 Difference]: Finished difference Result 437 states and 1434 transitions. [2021-11-20 23:20:58,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-20 23:20:58,741 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 21 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 28 [2021-11-20 23:20:58,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:20:58,743 INFO L225 Difference]: With dead ends: 437 [2021-11-20 23:20:58,743 INFO L226 Difference]: Without dead ends: 433 [2021-11-20 23:20:58,743 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=121, Invalid=437, Unknown=2, NotChecked=90, Total=650 [2021-11-20 23:20:58,743 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 67 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 206 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-20 23:20:58,743 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 54 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 538 Invalid, 0 Unknown, 206 Unchecked, 0.4s Time] [2021-11-20 23:20:58,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2021-11-20 23:20:58,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 392. [2021-11-20 23:20:58,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 391 states have (on average 3.340153452685422) internal successors, (1306), 391 states have internal predecessors, (1306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:20:58,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1306 transitions. [2021-11-20 23:20:58,752 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1306 transitions. Word has length 28 [2021-11-20 23:20:58,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:20:58,752 INFO L470 AbstractCegarLoop]: Abstraction has 392 states and 1306 transitions. [2021-11-20 23:20:58,753 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 21 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-20 23:20:58,753 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1306 transitions. [2021-11-20 23:20:58,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:20:58,754 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:20:58,754 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:20:58,775 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Forceful destruction successful, exit code 0 [2021-11-20 23:20:58,954 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56,54 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:20:58,955 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:20:58,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:20:58,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1709078909, now seen corresponding path program 51 times [2021-11-20 23:20:58,955 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:20:58,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198642859] [2021-11-20 23:20:58,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:20:58,955 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:20:58,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:20:59,691 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-20 23:20:59,691 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:20:59,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198642859] [2021-11-20 23:20:59,691 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198642859] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:20:59,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461130942] [2021-11-20 23:20:59,692 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 23:20:59,692 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:20:59,692 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:20:59,693 INFO L229 MonitoredProcess]: Starting monitored process 55 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:20:59,694 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2021-11-20 23:20:59,787 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 23:20:59,787 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:20:59,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 81 conjunts are in the unsatisfiable core [2021-11-20 23:20:59,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:20:59,844 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-20 23:20:59,926 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 23:20:59,926 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 11 treesize of output 11 [2021-11-20 23:21:00,338 INFO L354 Elim1Store]: treesize reduction 56, result has 29.1 percent of original size [2021-11-20 23:21:00,338 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 52 [2021-11-20 23:21:01,967 INFO L354 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2021-11-20 23:21:01,967 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 49 treesize of output 49 [2021-11-20 23:21:02,056 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:21:02,057 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:21:03,863 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((~C~0.offset Int)) (let ((.cse2 (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse2))) (.cse1 (select (select |c_#memory_int| c_~B~0.base) (+ c_~B~0.offset .cse2)))) (<= (+ c_~csum~0 .cse0 .cse1) (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) (+ ~C~0.offset .cse2) (+ .cse0 .cse1))) c_~B~0.base) (+ c_~B~0.offset (* |c_thread2Thread1of1ForFork0_~i~1#1| 4)))))))) (forall ((~C~0.offset Int)) (let ((.cse3 (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) (let ((.cse4 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse3))) (.cse5 (select (select |c_#memory_int| c_~B~0.base) (+ c_~B~0.offset .cse3)))) (<= (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) (+ ~C~0.offset .cse3) (+ .cse4 .cse5))) c_~B~0.base) (+ c_~B~0.offset (* |c_thread2Thread1of1ForFork0_~i~1#1| 4)))) (+ c_~csum~0 .cse4 .cse5)))))) is different from false [2021-11-20 23:21:05,147 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((~C~0.offset Int)) (let ((.cse0 (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset)) (.cse1 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (<= (+ c_~csum~0 .cse0 .cse1) (+ (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) ~C~0.offset (+ .cse0 .cse1))) c_~B~0.base) (+ c_~B~0.offset (* |c_thread2Thread1of1ForFork0_~i~1#1| 4))) c_~asum~0 c_~bsum~0)))) (forall ((~C~0.offset Int)) (let ((.cse2 (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset)) (.cse3 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (<= (+ (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) ~C~0.offset (+ .cse2 .cse3))) c_~B~0.base) (+ c_~B~0.offset (* |c_thread2Thread1of1ForFork0_~i~1#1| 4))) c_~asum~0 c_~bsum~0) (+ c_~csum~0 .cse2 .cse3))))) is different from false [2021-11-20 23:21:05,198 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:21:05,198 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 126 [2021-11-20 23:21:05,651 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:21:05,677 INFO L354 Elim1Store]: treesize reduction 65, result has 23.5 percent of original size [2021-11-20 23:21:05,678 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 34 treesize of output 30 [2021-11-20 23:21:05,925 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 25 treesize of output 23 [2021-11-20 23:21:05,934 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2021-11-20 23:21:05,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [461130942] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:21:05,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [595333944] [2021-11-20 23:21:05,934 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-20 23:21:05,935 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:21:05,936 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 9] total 25 [2021-11-20 23:21:05,936 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104370994] [2021-11-20 23:21:05,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:21:05,936 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-11-20 23:21:05,936 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:21:05,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-11-20 23:21:05,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=504, Unknown=3, NotChecked=94, Total=702 [2021-11-20 23:21:05,937 INFO L87 Difference]: Start difference. First operand 392 states and 1306 transitions. Second operand has 27 states, 26 states have (on average 2.5) internal successors, (65), 26 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:21:06,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:21:06,617 INFO L93 Difference]: Finished difference Result 465 states and 1524 transitions. [2021-11-20 23:21:06,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-20 23:21:06,617 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.5) internal successors, (65), 26 states have internal predecessors, (65), 0 states have call successors, (0), 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 28 [2021-11-20 23:21:06,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:21:06,619 INFO L225 Difference]: With dead ends: 465 [2021-11-20 23:21:06,619 INFO L226 Difference]: Without dead ends: 458 [2021-11-20 23:21:06,620 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 38 SyntacticMatches, 7 SemanticMatches, 31 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=175, Invalid=760, Unknown=3, NotChecked=118, Total=1056 [2021-11-20 23:21:06,620 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 63 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 365 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-20 23:21:06,620 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 72 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 725 Invalid, 0 Unknown, 365 Unchecked, 0.4s Time] [2021-11-20 23:21:06,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2021-11-20 23:21:06,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 380. [2021-11-20 23:21:06,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 379 states have (on average 3.3271767810026387) internal successors, (1261), 379 states have internal predecessors, (1261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:21:06,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1261 transitions. [2021-11-20 23:21:06,634 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1261 transitions. Word has length 28 [2021-11-20 23:21:06,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:21:06,634 INFO L470 AbstractCegarLoop]: Abstraction has 380 states and 1261 transitions. [2021-11-20 23:21:06,634 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.5) internal successors, (65), 26 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:21:06,635 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1261 transitions. [2021-11-20 23:21:06,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:21:06,636 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:21:06,636 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:21:06,664 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Ended with exit code 0 [2021-11-20 23:21:06,840 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2021-11-20 23:21:06,841 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:21:06,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:21:06,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1215458355, now seen corresponding path program 52 times [2021-11-20 23:21:06,841 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:21:06,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485261001] [2021-11-20 23:21:06,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:21:06,842 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:21:06,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:21:07,234 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:21:07,235 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:21:07,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485261001] [2021-11-20 23:21:07,235 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485261001] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:21:07,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750318247] [2021-11-20 23:21:07,235 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-20 23:21:07,235 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:21:07,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:21:07,236 INFO L229 MonitoredProcess]: Starting monitored process 56 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:21:07,239 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2021-11-20 23:21:07,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:21:07,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 72 conjunts are in the unsatisfiable core [2021-11-20 23:21:07,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:21:07,843 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-11-20 23:21:07,844 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 41 treesize of output 29 [2021-11-20 23:21:07,862 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:21:07,862 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:21:08,054 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:21:08,054 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 34 treesize of output 95 [2021-11-20 23:21:08,474 INFO L354 Elim1Store]: treesize reduction 61, result has 28.2 percent of original size [2021-11-20 23:21:08,474 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 34 treesize of output 34 [2021-11-20 23:21:08,617 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:21:08,617 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [750318247] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:21:08,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1940101069] [2021-11-20 23:21:08,617 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-20 23:21:08,618 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:21:08,618 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 6] total 14 [2021-11-20 23:21:08,618 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355455308] [2021-11-20 23:21:08,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:21:08,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-20 23:21:08,618 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:21:08,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-20 23:21:08,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2021-11-20 23:21:08,619 INFO L87 Difference]: Start difference. First operand 380 states and 1261 transitions. Second operand has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 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-20 23:21:08,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:21:08,994 INFO L93 Difference]: Finished difference Result 491 states and 1611 transitions. [2021-11-20 23:21:08,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-20 23:21:08,995 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 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 28 [2021-11-20 23:21:08,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:21:08,996 INFO L225 Difference]: With dead ends: 491 [2021-11-20 23:21:08,997 INFO L226 Difference]: Without dead ends: 484 [2021-11-20 23:21:08,997 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 44 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2021-11-20 23:21:08,997 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 77 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 64 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 23:21:08,997 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 42 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 414 Invalid, 0 Unknown, 64 Unchecked, 0.3s Time] [2021-11-20 23:21:08,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2021-11-20 23:21:09,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 386. [2021-11-20 23:21:09,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 385 states have (on average 3.327272727272727) internal successors, (1281), 385 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:21:09,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1281 transitions. [2021-11-20 23:21:09,009 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1281 transitions. Word has length 28 [2021-11-20 23:21:09,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:21:09,009 INFO L470 AbstractCegarLoop]: Abstraction has 386 states and 1281 transitions. [2021-11-20 23:21:09,009 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 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-20 23:21:09,010 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1281 transitions. [2021-11-20 23:21:09,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:21:09,011 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:21:09,011 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:21:09,070 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Forceful destruction successful, exit code 0 [2021-11-20 23:21:09,225 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 56 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2021-11-20 23:21:09,225 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:21:09,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:21:09,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1265298519, now seen corresponding path program 53 times [2021-11-20 23:21:09,226 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:21:09,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928202826] [2021-11-20 23:21:09,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:21:09,226 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:21:09,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:21:09,721 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:21:09,722 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:21:09,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928202826] [2021-11-20 23:21:09,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928202826] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:21:09,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069768296] [2021-11-20 23:21:09,722 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 23:21:09,722 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:21:09,723 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:21:09,724 INFO L229 MonitoredProcess]: Starting monitored process 57 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:21:09,748 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2021-11-20 23:21:09,867 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-20 23:21:09,868 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:21:09,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 72 conjunts are in the unsatisfiable core [2021-11-20 23:21:09,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:21:10,601 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-11-20 23:21:10,601 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 41 treesize of output 29 [2021-11-20 23:21:10,629 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:21:10,629 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:21:17,109 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:21:17,109 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 34 treesize of output 95 [2021-11-20 23:21:17,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:17,454 INFO L354 Elim1Store]: treesize reduction 49, result has 36.4 percent of original size [2021-11-20 23:21:17,454 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 34 treesize of output 38 [2021-11-20 23:21:17,587 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:21:17,587 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069768296] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:21:17,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1142790214] [2021-11-20 23:21:17,587 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-20 23:21:17,588 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:21:17,588 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 6] total 14 [2021-11-20 23:21:17,588 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190791428] [2021-11-20 23:21:17,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:21:17,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-20 23:21:17,589 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:21:17,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-20 23:21:17,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=190, Unknown=1, NotChecked=0, Total=240 [2021-11-20 23:21:17,589 INFO L87 Difference]: Start difference. First operand 386 states and 1281 transitions. Second operand has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 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-20 23:21:17,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:21:17,925 INFO L93 Difference]: Finished difference Result 445 states and 1469 transitions. [2021-11-20 23:21:17,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-20 23:21:17,925 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 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 28 [2021-11-20 23:21:17,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:21:17,927 INFO L225 Difference]: With dead ends: 445 [2021-11-20 23:21:17,927 INFO L226 Difference]: Without dead ends: 438 [2021-11-20 23:21:17,927 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 44 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=76, Invalid=265, Unknown=1, NotChecked=0, Total=342 [2021-11-20 23:21:17,928 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 53 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 128 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 23:21:17,928 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 28 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 325 Invalid, 0 Unknown, 128 Unchecked, 0.3s Time] [2021-11-20 23:21:17,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2021-11-20 23:21:17,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 390. [2021-11-20 23:21:17,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 389 states have (on average 3.329048843187661) internal successors, (1295), 389 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:21:17,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1295 transitions. [2021-11-20 23:21:17,938 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1295 transitions. Word has length 28 [2021-11-20 23:21:17,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:21:17,938 INFO L470 AbstractCegarLoop]: Abstraction has 390 states and 1295 transitions. [2021-11-20 23:21:17,938 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 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-20 23:21:17,938 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1295 transitions. [2021-11-20 23:21:17,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:21:17,939 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:21:17,939 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:21:17,968 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Forceful destruction successful, exit code 0 [2021-11-20 23:21:18,140 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 57 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2021-11-20 23:21:18,141 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:21:18,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:21:18,141 INFO L85 PathProgramCache]: Analyzing trace with hash 593996093, now seen corresponding path program 54 times [2021-11-20 23:21:18,141 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:21:18,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369839649] [2021-11-20 23:21:18,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:21:18,142 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:21:18,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:21:18,648 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:21:18,648 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:21:18,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369839649] [2021-11-20 23:21:18,648 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369839649] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:21:18,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976655041] [2021-11-20 23:21:18,648 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 23:21:18,648 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:21:18,649 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:21:18,650 INFO L229 MonitoredProcess]: Starting monitored process 58 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:21:18,650 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2021-11-20 23:21:18,743 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 23:21:18,743 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:21:18,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 84 conjunts are in the unsatisfiable core [2021-11-20 23:21:18,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:21:18,795 INFO L354 Elim1Store]: treesize reduction 93, result has 14.7 percent of original size [2021-11-20 23:21:18,795 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 21 [2021-11-20 23:21:18,852 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-20 23:21:18,853 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-20 23:21:18,960 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-20 23:21:18,960 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 20 treesize of output 22 [2021-11-20 23:21:19,333 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:21:19,359 INFO L354 Elim1Store]: treesize reduction 52, result has 30.7 percent of original size [2021-11-20 23:21:19,360 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 49 [2021-11-20 23:21:19,620 INFO L354 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2021-11-20 23:21:19,620 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 72 treesize of output 56 [2021-11-20 23:21:19,721 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:21:19,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:21:21,847 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((~C~0.offset Int)) (let ((.cse0 (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) (let ((.cse1 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse0))) (.cse2 (select (select |c_#memory_int| c_~B~0.base) (+ c_~B~0.offset .cse0)))) (<= (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) (+ ~C~0.offset .cse0) (+ .cse1 .cse2))) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork2_~i~0#1| 4) c_~A~0.offset))) (+ c_~csum~0 .cse1 .cse2))))) (forall ((~C~0.offset Int)) (let ((.cse5 (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) (let ((.cse3 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse5))) (.cse4 (select (select |c_#memory_int| c_~B~0.base) (+ c_~B~0.offset .cse5)))) (<= (+ c_~csum~0 .cse3 .cse4) (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) (+ ~C~0.offset .cse5) (+ .cse3 .cse4))) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork2_~i~0#1| 4) c_~A~0.offset)))))))) is different from false [2021-11-20 23:21:32,302 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:21:32,302 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 126 [2021-11-20 23:21:33,158 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:21:33,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:33,178 INFO L354 Elim1Store]: treesize reduction 23, result has 51.1 percent of original size [2021-11-20 23:21:33,179 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 34 treesize of output 32 [2021-11-20 23:21:33,612 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2021-11-20 23:21:33,612 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976655041] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:21:33,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1385706231] [2021-11-20 23:21:33,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-20 23:21:33,613 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:21:33,613 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2021-11-20 23:21:33,613 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495777032] [2021-11-20 23:21:33,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:21:33,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-11-20 23:21:33,614 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:21:33,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-20 23:21:33,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=4, NotChecked=40, Total=506 [2021-11-20 23:21:33,614 INFO L87 Difference]: Start difference. First operand 390 states and 1295 transitions. Second operand has 23 states, 22 states have (on average 2.409090909090909) internal successors, (53), 22 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-20 23:21:33,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:21:33,840 INFO L93 Difference]: Finished difference Result 467 states and 1548 transitions. [2021-11-20 23:21:33,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-20 23:21:33,841 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.409090909090909) internal successors, (53), 22 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 28 [2021-11-20 23:21:33,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:21:33,843 INFO L225 Difference]: With dead ends: 467 [2021-11-20 23:21:33,843 INFO L226 Difference]: Without dead ends: 461 [2021-11-20 23:21:33,843 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 39 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=84, Invalid=422, Unknown=4, NotChecked=42, Total=552 [2021-11-20 23:21:33,843 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 22 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 206 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 23:21:33,844 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 48 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 194 Invalid, 0 Unknown, 206 Unchecked, 0.2s Time] [2021-11-20 23:21:33,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2021-11-20 23:21:33,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 410. [2021-11-20 23:21:33,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 409 states have (on average 3.34718826405868) internal successors, (1369), 409 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:21:33,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 1369 transitions. [2021-11-20 23:21:33,855 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 1369 transitions. Word has length 28 [2021-11-20 23:21:33,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:21:33,855 INFO L470 AbstractCegarLoop]: Abstraction has 410 states and 1369 transitions. [2021-11-20 23:21:33,856 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.409090909090909) internal successors, (53), 22 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-20 23:21:33,856 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 1369 transitions. [2021-11-20 23:21:33,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:21:33,857 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:21:33,857 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:21:33,886 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Forceful destruction successful, exit code 0 [2021-11-20 23:21:34,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,58 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:21:34,058 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:21:34,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:21:34,058 INFO L85 PathProgramCache]: Analyzing trace with hash 460667291, now seen corresponding path program 55 times [2021-11-20 23:21:34,058 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:21:34,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515141111] [2021-11-20 23:21:34,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:21:34,058 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:21:34,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:21:35,046 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:21:35,046 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:21:35,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515141111] [2021-11-20 23:21:35,047 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515141111] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:21:35,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [902692238] [2021-11-20 23:21:35,047 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-20 23:21:35,047 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:21:35,047 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:21:35,048 INFO L229 MonitoredProcess]: Starting monitored process 59 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:21:35,049 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2021-11-20 23:21:35,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:21:35,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 84 conjunts are in the unsatisfiable core [2021-11-20 23:21:35,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:21:35,187 INFO L354 Elim1Store]: treesize reduction 93, result has 14.7 percent of original size [2021-11-20 23:21:35,187 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 21 [2021-11-20 23:21:35,283 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-20 23:21:35,283 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-20 23:21:35,382 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-20 23:21:35,382 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 20 treesize of output 22 [2021-11-20 23:21:35,802 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:21:35,828 INFO L354 Elim1Store]: treesize reduction 52, result has 30.7 percent of original size [2021-11-20 23:21:35,828 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 49 [2021-11-20 23:21:36,088 INFO L354 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2021-11-20 23:21:36,088 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 72 treesize of output 56 [2021-11-20 23:21:36,186 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:21:36,186 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:21:52,919 WARN L227 SmtUtils]: Spent 5.64s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-20 23:21:54,930 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((~C~0.offset Int)) (let ((.cse0 (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset)) (.cse1 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (<= (+ c_~csum~0 .cse0 .cse1) (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) ~C~0.offset (+ .cse0 .cse1))) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork2_~i~0#1| 4) c_~A~0.offset)))))) (forall ((~C~0.offset Int)) (let ((.cse2 (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset)) (.cse3 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (<= (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) ~C~0.offset (+ .cse2 .cse3))) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork2_~i~0#1| 4) c_~A~0.offset))) (+ c_~csum~0 .cse2 .cse3))))) is different from false [2021-11-20 23:21:54,974 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:21:54,974 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 126 [2021-11-20 23:21:55,531 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:21:55,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:55,553 INFO L354 Elim1Store]: treesize reduction 57, result has 26.0 percent of original size [2021-11-20 23:21:55,553 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 34 treesize of output 30 [2021-11-20 23:21:55,931 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:21:55,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [902692238] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:21:55,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1102216292] [2021-11-20 23:21:55,932 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-20 23:21:55,932 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:21:55,932 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 27 [2021-11-20 23:21:55,932 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174092582] [2021-11-20 23:21:55,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:21:55,933 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-11-20 23:21:55,933 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:21:55,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-11-20 23:21:55,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=640, Unknown=7, NotChecked=52, Total=812 [2021-11-20 23:21:55,933 INFO L87 Difference]: Start difference. First operand 410 states and 1369 transitions. Second operand has 29 states, 28 states have (on average 2.142857142857143) internal successors, (60), 28 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:21:56,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:21:56,350 INFO L93 Difference]: Finished difference Result 481 states and 1603 transitions. [2021-11-20 23:21:56,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-20 23:21:56,351 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.142857142857143) internal successors, (60), 28 states have internal predecessors, (60), 0 states have call successors, (0), 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 28 [2021-11-20 23:21:56,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:21:56,352 INFO L225 Difference]: With dead ends: 481 [2021-11-20 23:21:56,352 INFO L226 Difference]: Without dead ends: 474 [2021-11-20 23:21:56,353 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 37 SyntacticMatches, 6 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 19.6s TimeCoverageRelationStatistics Valid=184, Invalid=935, Unknown=7, NotChecked=64, Total=1190 [2021-11-20 23:21:56,353 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 69 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 216 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 23:21:56,353 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 70 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 377 Invalid, 0 Unknown, 216 Unchecked, 0.2s Time] [2021-11-20 23:21:56,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2021-11-20 23:21:56,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 413. [2021-11-20 23:21:56,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 412 states have (on average 3.3567961165048543) internal successors, (1383), 412 states have internal predecessors, (1383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:21:56,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 1383 transitions. [2021-11-20 23:21:56,366 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 1383 transitions. Word has length 28 [2021-11-20 23:21:56,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:21:56,366 INFO L470 AbstractCegarLoop]: Abstraction has 413 states and 1383 transitions. [2021-11-20 23:21:56,367 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.142857142857143) internal successors, (60), 28 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:21:56,367 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 1383 transitions. [2021-11-20 23:21:56,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:21:56,368 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:21:56,368 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:21:56,403 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Forceful destruction successful, exit code 0 [2021-11-20 23:21:56,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,59 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:21:56,582 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:21:56,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:21:56,583 INFO L85 PathProgramCache]: Analyzing trace with hash -119838283, now seen corresponding path program 56 times [2021-11-20 23:21:56,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:21:56,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008771167] [2021-11-20 23:21:56,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:21:56,583 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:21:56,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:21:56,989 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:21:56,989 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:21:56,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008771167] [2021-11-20 23:21:56,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008771167] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:21:56,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074774435] [2021-11-20 23:21:56,989 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 23:21:56,990 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:21:56,990 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:21:56,993 INFO L229 MonitoredProcess]: Starting monitored process 60 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:21:57,008 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2021-11-20 23:21:57,106 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-20 23:21:57,106 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:21:57,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 72 conjunts are in the unsatisfiable core [2021-11-20 23:21:57,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:21:57,678 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-11-20 23:21:57,678 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 41 treesize of output 29 [2021-11-20 23:21:57,693 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:21:57,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:21:57,846 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:21:57,847 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 119 [2021-11-20 23:21:58,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:58,162 INFO L354 Elim1Store]: treesize reduction 77, result has 20.6 percent of original size [2021-11-20 23:21:58,162 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 30 [2021-11-20 23:21:58,314 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:21:58,314 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074774435] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:21:58,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [65137117] [2021-11-20 23:21:58,315 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-20 23:21:58,315 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:21:58,315 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 6] total 14 [2021-11-20 23:21:58,316 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088667466] [2021-11-20 23:21:58,316 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:21:58,316 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-20 23:21:58,316 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:21:58,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-20 23:21:58,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2021-11-20 23:21:58,317 INFO L87 Difference]: Start difference. First operand 413 states and 1383 transitions. Second operand has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 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-20 23:21:58,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:21:58,665 INFO L93 Difference]: Finished difference Result 466 states and 1550 transitions. [2021-11-20 23:21:58,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-20 23:21:58,666 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 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 28 [2021-11-20 23:21:58,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:21:58,668 INFO L225 Difference]: With dead ends: 466 [2021-11-20 23:21:58,668 INFO L226 Difference]: Without dead ends: 459 [2021-11-20 23:21:58,669 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 44 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2021-11-20 23:21:58,669 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 63 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 23:21:58,669 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 19 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 336 Invalid, 0 Unknown, 37 Unchecked, 0.2s Time] [2021-11-20 23:21:58,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2021-11-20 23:21:58,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 421. [2021-11-20 23:21:58,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 3.357142857142857) internal successors, (1410), 420 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:21:58,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 1410 transitions. [2021-11-20 23:21:58,684 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 1410 transitions. Word has length 28 [2021-11-20 23:21:58,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:21:58,685 INFO L470 AbstractCegarLoop]: Abstraction has 421 states and 1410 transitions. [2021-11-20 23:21:58,685 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 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-20 23:21:58,685 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 1410 transitions. [2021-11-20 23:21:58,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:21:58,687 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:21:58,687 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:21:58,726 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Forceful destruction successful, exit code 0 [2021-11-20 23:21:58,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable62 [2021-11-20 23:21:58,911 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:21:58,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:21:58,912 INFO L85 PathProgramCache]: Analyzing trace with hash 171029365, now seen corresponding path program 57 times [2021-11-20 23:21:58,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:21:58,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558324518] [2021-11-20 23:21:58,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:21:58,912 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:21:58,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:21:59,671 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-20 23:21:59,672 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:21:59,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558324518] [2021-11-20 23:21:59,672 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558324518] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:21:59,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84522478] [2021-11-20 23:21:59,672 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 23:21:59,672 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:21:59,672 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:21:59,674 INFO L229 MonitoredProcess]: Starting monitored process 61 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:21:59,676 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2021-11-20 23:21:59,762 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 23:21:59,762 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:21:59,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 81 conjunts are in the unsatisfiable core [2021-11-20 23:21:59,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:21:59,839 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-20 23:21:59,928 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 23:21:59,929 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 11 treesize of output 11 [2021-11-20 23:22:00,427 INFO L354 Elim1Store]: treesize reduction 56, result has 29.1 percent of original size [2021-11-20 23:22:00,427 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 52 [2021-11-20 23:22:00,720 INFO L354 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2021-11-20 23:22:00,720 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 49 treesize of output 49 [2021-11-20 23:22:00,795 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:22:00,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:22:02,878 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((~C~0.offset Int)) (let ((.cse2 (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse2))) (.cse1 (select (select |c_#memory_int| c_~B~0.base) (+ c_~B~0.offset .cse2)))) (<= (+ c_~csum~0 .cse0 .cse1) (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) (+ ~C~0.offset .cse2) (+ .cse0 .cse1))) c_~B~0.base) (+ c_~B~0.offset (* |c_thread2Thread1of1ForFork0_~i~1#1| 4)))))))) (forall ((~C~0.offset Int)) (let ((.cse3 (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) (let ((.cse4 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse3))) (.cse5 (select (select |c_#memory_int| c_~B~0.base) (+ c_~B~0.offset .cse3)))) (<= (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) (+ ~C~0.offset .cse3) (+ .cse4 .cse5))) c_~B~0.base) (+ c_~B~0.offset (* |c_thread2Thread1of1ForFork0_~i~1#1| 4)))) (+ c_~csum~0 .cse4 .cse5)))))) is different from false [2021-11-20 23:22:02,954 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:22:02,955 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 90 treesize of output 158 [2021-11-20 23:22:03,716 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:22:03,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:22:03,735 INFO L354 Elim1Store]: treesize reduction 31, result has 43.6 percent of original size [2021-11-20 23:22:03,736 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 42 treesize of output 32 [2021-11-20 23:22:04,085 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 25 treesize of output 23 [2021-11-20 23:22:04,096 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2021-11-20 23:22:04,097 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84522478] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:22:04,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [684608369] [2021-11-20 23:22:04,097 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-20 23:22:04,097 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:22:04,097 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 9] total 26 [2021-11-20 23:22:04,098 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170303179] [2021-11-20 23:22:04,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:22:04,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-11-20 23:22:04,099 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:22:04,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-11-20 23:22:04,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=592, Unknown=1, NotChecked=50, Total=756 [2021-11-20 23:22:04,100 INFO L87 Difference]: Start difference. First operand 421 states and 1410 transitions. Second operand has 28 states, 27 states have (on average 2.4814814814814814) internal successors, (67), 27 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:22:05,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:22:05,213 INFO L93 Difference]: Finished difference Result 468 states and 1558 transitions. [2021-11-20 23:22:05,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-20 23:22:05,213 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.4814814814814814) internal successors, (67), 27 states have internal predecessors, (67), 0 states have call successors, (0), 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 28 [2021-11-20 23:22:05,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:22:05,216 INFO L225 Difference]: With dead ends: 468 [2021-11-20 23:22:05,216 INFO L226 Difference]: Without dead ends: 461 [2021-11-20 23:22:05,216 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=248, Invalid=1015, Unknown=1, NotChecked=68, Total=1332 [2021-11-20 23:22:05,217 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 113 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 192 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-20 23:22:05,217 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 50 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 478 Invalid, 0 Unknown, 192 Unchecked, 0.4s Time] [2021-11-20 23:22:05,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2021-11-20 23:22:05,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 421. [2021-11-20 23:22:05,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 3.357142857142857) internal successors, (1410), 420 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:22:05,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 1410 transitions. [2021-11-20 23:22:05,235 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 1410 transitions. Word has length 28 [2021-11-20 23:22:05,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:22:05,235 INFO L470 AbstractCegarLoop]: Abstraction has 421 states and 1410 transitions. [2021-11-20 23:22:05,235 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.4814814814814814) internal successors, (67), 27 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:22:05,236 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 1410 transitions. [2021-11-20 23:22:05,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:22:05,237 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:22:05,238 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:22:05,285 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Forceful destruction successful, exit code 0 [2021-11-20 23:22:05,456 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 61 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable63 [2021-11-20 23:22:05,457 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:22:05,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:22:05,457 INFO L85 PathProgramCache]: Analyzing trace with hash 957693309, now seen corresponding path program 58 times [2021-11-20 23:22:05,457 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:22:05,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000215958] [2021-11-20 23:22:05,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:22:05,458 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:22:05,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:22:05,861 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:22:05,861 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:22:05,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000215958] [2021-11-20 23:22:05,861 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000215958] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:22:05,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248263061] [2021-11-20 23:22:05,862 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-20 23:22:05,862 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:22:05,862 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:22:05,863 INFO L229 MonitoredProcess]: Starting monitored process 62 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:22:05,867 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2021-11-20 23:22:05,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:22:05,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 72 conjunts are in the unsatisfiable core [2021-11-20 23:22:05,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:22:06,522 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-11-20 23:22:06,522 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 41 treesize of output 29 [2021-11-20 23:22:06,541 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:22:06,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:22:10,296 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:22:10,296 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 119 [2021-11-20 23:22:10,737 INFO L354 Elim1Store]: treesize reduction 81, result has 25.7 percent of original size [2021-11-20 23:22:10,737 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 38 [2021-11-20 23:22:10,908 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:22:10,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248263061] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:22:10,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [967044393] [2021-11-20 23:22:10,909 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-20 23:22:10,910 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:22:10,911 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 6] total 14 [2021-11-20 23:22:10,911 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980075899] [2021-11-20 23:22:10,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:22:10,911 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-20 23:22:10,911 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:22:10,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-20 23:22:10,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2021-11-20 23:22:10,912 INFO L87 Difference]: Start difference. First operand 421 states and 1410 transitions. Second operand has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 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-20 23:22:11,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:22:11,333 INFO L93 Difference]: Finished difference Result 468 states and 1559 transitions. [2021-11-20 23:22:11,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-20 23:22:11,333 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 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 28 [2021-11-20 23:22:11,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:22:11,335 INFO L225 Difference]: With dead ends: 468 [2021-11-20 23:22:11,335 INFO L226 Difference]: Without dead ends: 461 [2021-11-20 23:22:11,335 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 44 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2021-11-20 23:22:11,336 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 56 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 23:22:11,336 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 22 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 373 Invalid, 0 Unknown, 38 Unchecked, 0.3s Time] [2021-11-20 23:22:11,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2021-11-20 23:22:11,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 423. [2021-11-20 23:22:11,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 422 states have (on average 3.362559241706161) internal successors, (1419), 422 states have internal predecessors, (1419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:22:11,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 1419 transitions. [2021-11-20 23:22:11,350 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 1419 transitions. Word has length 28 [2021-11-20 23:22:11,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:22:11,351 INFO L470 AbstractCegarLoop]: Abstraction has 423 states and 1419 transitions. [2021-11-20 23:22:11,351 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 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-20 23:22:11,351 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 1419 transitions. [2021-11-20 23:22:11,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:22:11,352 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:22:11,352 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:22:11,378 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Forceful destruction successful, exit code 0 [2021-11-20 23:22:11,552 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,62 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:22:11,553 INFO L402 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:22:11,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:22:11,553 INFO L85 PathProgramCache]: Analyzing trace with hash -186341067, now seen corresponding path program 59 times [2021-11-20 23:22:11,554 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:22:11,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015434982] [2021-11-20 23:22:11,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:22:11,554 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:22:11,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:22:12,075 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:22:12,075 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:22:12,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015434982] [2021-11-20 23:22:12,075 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015434982] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:22:12,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798635307] [2021-11-20 23:22:12,076 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 23:22:12,076 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:22:12,076 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:22:12,077 INFO L229 MonitoredProcess]: Starting monitored process 63 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:22:12,100 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2021-11-20 23:22:12,218 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-20 23:22:12,218 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:22:12,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 72 conjunts are in the unsatisfiable core [2021-11-20 23:22:12,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:22:12,922 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-11-20 23:22:12,922 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 41 treesize of output 29 [2021-11-20 23:22:12,942 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:22:12,942 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:22:18,512 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:22:18,512 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 119 [2021-11-20 23:22:18,919 INFO L354 Elim1Store]: treesize reduction 81, result has 25.7 percent of original size [2021-11-20 23:22:18,919 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 38 [2021-11-20 23:22:19,088 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:22:19,088 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798635307] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:22:19,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [64036973] [2021-11-20 23:22:19,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-20 23:22:19,089 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:22:19,089 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 6] total 14 [2021-11-20 23:22:19,089 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113559009] [2021-11-20 23:22:19,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:22:19,090 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-20 23:22:19,090 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:22:19,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-20 23:22:19,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=185, Unknown=1, NotChecked=0, Total=240 [2021-11-20 23:22:19,091 INFO L87 Difference]: Start difference. First operand 423 states and 1419 transitions. Second operand has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 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-20 23:22:19,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:22:19,548 INFO L93 Difference]: Finished difference Result 501 states and 1653 transitions. [2021-11-20 23:22:19,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-20 23:22:19,548 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 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 28 [2021-11-20 23:22:19,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:22:19,550 INFO L225 Difference]: With dead ends: 501 [2021-11-20 23:22:19,551 INFO L226 Difference]: Without dead ends: 494 [2021-11-20 23:22:19,551 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 44 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=96, Invalid=283, Unknown=1, NotChecked=0, Total=380 [2021-11-20 23:22:19,552 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 54 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 59 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-20 23:22:19,552 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 25 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 458 Invalid, 0 Unknown, 59 Unchecked, 0.4s Time] [2021-11-20 23:22:19,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2021-11-20 23:22:19,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 421. [2021-11-20 23:22:19,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 3.357142857142857) internal successors, (1410), 420 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:22:19,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 1410 transitions. [2021-11-20 23:22:19,568 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 1410 transitions. Word has length 28 [2021-11-20 23:22:19,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:22:19,569 INFO L470 AbstractCegarLoop]: Abstraction has 421 states and 1410 transitions. [2021-11-20 23:22:19,569 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 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-20 23:22:19,569 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 1410 transitions. [2021-11-20 23:22:19,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:22:19,571 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:22:19,571 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:22:19,624 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Forceful destruction successful, exit code 0 [2021-11-20 23:22:19,796 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65,63 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:22:19,797 INFO L402 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:22:19,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:22:19,797 INFO L85 PathProgramCache]: Analyzing trace with hash -857643493, now seen corresponding path program 60 times [2021-11-20 23:22:19,797 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:22:19,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869836997] [2021-11-20 23:22:19,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:22:19,798 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:22:19,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:22:20,794 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:22:20,794 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:22:20,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869836997] [2021-11-20 23:22:20,795 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869836997] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:22:20,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362533359] [2021-11-20 23:22:20,795 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 23:22:20,795 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:22:20,795 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:22:20,797 INFO L229 MonitoredProcess]: Starting monitored process 64 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:22:20,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2021-11-20 23:22:20,906 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 23:22:20,906 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:22:20,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 84 conjunts are in the unsatisfiable core [2021-11-20 23:22:20,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:22:20,966 INFO L354 Elim1Store]: treesize reduction 93, result has 14.7 percent of original size [2021-11-20 23:22:20,966 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 21 [2021-11-20 23:22:21,094 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-20 23:22:21,094 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-20 23:22:21,219 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-20 23:22:21,219 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 20 treesize of output 22 [2021-11-20 23:22:21,656 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:22:21,657 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:22:21,711 INFO L354 Elim1Store]: treesize reduction 101, result has 25.2 percent of original size [2021-11-20 23:22:21,711 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 79 treesize of output 68 [2021-11-20 23:22:22,001 INFO L354 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2021-11-20 23:22:22,001 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 72 treesize of output 56 [2021-11-20 23:22:22,073 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:22:22,073 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:22:24,173 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((~C~0.offset Int)) (let ((.cse0 (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) (let ((.cse1 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse0))) (.cse2 (select (select |c_#memory_int| c_~B~0.base) (+ c_~B~0.offset .cse0)))) (<= (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) (+ ~C~0.offset .cse0) (+ .cse1 .cse2))) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork2_~i~0#1| 4) c_~A~0.offset))) (+ c_~csum~0 .cse1 .cse2))))) (forall ((~C~0.offset Int)) (let ((.cse5 (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) (let ((.cse3 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse5))) (.cse4 (select (select |c_#memory_int| c_~B~0.base) (+ c_~B~0.offset .cse5)))) (<= (+ c_~csum~0 .cse3 .cse4) (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) (+ ~C~0.offset .cse5) (+ .cse3 .cse4))) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork2_~i~0#1| 4) c_~A~0.offset)))))))) is different from false [2021-11-20 23:22:24,231 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:22:24,232 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 90 treesize of output 158 [2021-11-20 23:22:24,799 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:22:24,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:22:24,843 INFO L354 Elim1Store]: treesize reduction 69, result has 28.9 percent of original size [2021-11-20 23:22:24,843 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 42 treesize of output 38 [2021-11-20 23:22:25,392 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2021-11-20 23:22:25,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362533359] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:22:25,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [441831122] [2021-11-20 23:22:25,393 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-20 23:22:25,393 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:22:25,394 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 27 [2021-11-20 23:22:25,394 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656060241] [2021-11-20 23:22:25,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:22:25,394 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-11-20 23:22:25,394 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:22:25,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-11-20 23:22:25,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=643, Unknown=1, NotChecked=52, Total=812 [2021-11-20 23:22:25,395 INFO L87 Difference]: Start difference. First operand 421 states and 1410 transitions. Second operand has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 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-20 23:22:26,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:22:26,066 INFO L93 Difference]: Finished difference Result 464 states and 1548 transitions. [2021-11-20 23:22:26,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-20 23:22:26,079 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 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 28 [2021-11-20 23:22:26,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:22:26,082 INFO L225 Difference]: With dead ends: 464 [2021-11-20 23:22:26,083 INFO L226 Difference]: Without dead ends: 457 [2021-11-20 23:22:26,083 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=188, Invalid=937, Unknown=1, NotChecked=64, Total=1190 [2021-11-20 23:22:26,084 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 60 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 201 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-20 23:22:26,084 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 49 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 452 Invalid, 0 Unknown, 201 Unchecked, 0.4s Time] [2021-11-20 23:22:26,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2021-11-20 23:22:26,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 421. [2021-11-20 23:22:26,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 3.357142857142857) internal successors, (1410), 420 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:22:26,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 1410 transitions. [2021-11-20 23:22:26,100 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 1410 transitions. Word has length 28 [2021-11-20 23:22:26,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:22:26,101 INFO L470 AbstractCegarLoop]: Abstraction has 421 states and 1410 transitions. [2021-11-20 23:22:26,101 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 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-20 23:22:26,101 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 1410 transitions. [2021-11-20 23:22:26,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:22:26,103 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:22:26,103 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:22:26,145 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Forceful destruction successful, exit code 0 [2021-11-20 23:22:26,328 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 64 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable66 [2021-11-20 23:22:26,329 INFO L402 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:22:26,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:22:26,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1769857469, now seen corresponding path program 61 times [2021-11-20 23:22:26,329 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:22:26,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305133137] [2021-11-20 23:22:26,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:22:26,330 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:22:26,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:22:26,860 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:22:26,860 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:22:26,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305133137] [2021-11-20 23:22:26,861 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305133137] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:22:26,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47104090] [2021-11-20 23:22:26,861 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-20 23:22:26,861 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:22:26,861 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:22:26,862 INFO L229 MonitoredProcess]: Starting monitored process 65 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:22:26,863 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2021-11-20 23:22:26,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:22:26,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 84 conjunts are in the unsatisfiable core [2021-11-20 23:22:26,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:22:27,015 INFO L354 Elim1Store]: treesize reduction 93, result has 14.7 percent of original size [2021-11-20 23:22:27,016 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 21 [2021-11-20 23:22:27,093 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 23:22:27,094 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 14 [2021-11-20 23:22:27,182 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-20 23:22:27,182 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 16 treesize of output 18 [2021-11-20 23:22:27,662 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:22:27,680 INFO L354 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2021-11-20 23:22:27,681 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 39 [2021-11-20 23:22:28,146 INFO L354 Elim1Store]: treesize reduction 29, result has 21.6 percent of original size [2021-11-20 23:22:28,146 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 53 treesize of output 37 [2021-11-20 23:22:28,190 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:22:28,190 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:22:28,354 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:22:28,354 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 195 treesize of output 239 [2021-11-20 23:22:30,968 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:22:30,969 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:22:31,029 INFO L354 Elim1Store]: treesize reduction 46, result has 57.8 percent of original size [2021-11-20 23:22:31,029 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 42 treesize of output 73 [2021-11-20 23:22:31,885 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:22:31,885 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47104090] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:22:31,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1048243714] [2021-11-20 23:22:31,886 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-20 23:22:31,887 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:22:31,887 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2021-11-20 23:22:31,887 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364376259] [2021-11-20 23:22:31,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:22:31,887 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-11-20 23:22:31,887 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:22:31,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-20 23:22:31,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2021-11-20 23:22:31,888 INFO L87 Difference]: Start difference. First operand 421 states and 1410 transitions. Second operand has 23 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 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-20 23:22:32,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:22:32,439 INFO L93 Difference]: Finished difference Result 468 states and 1560 transitions. [2021-11-20 23:22:32,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-20 23:22:32,440 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 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 28 [2021-11-20 23:22:32,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:22:32,441 INFO L225 Difference]: With dead ends: 468 [2021-11-20 23:22:32,442 INFO L226 Difference]: Without dead ends: 461 [2021-11-20 23:22:32,442 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=173, Invalid=639, Unknown=0, NotChecked=0, Total=812 [2021-11-20 23:22:32,442 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 88 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 180 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 23:22:32,442 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 32 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 365 Invalid, 0 Unknown, 180 Unchecked, 0.3s Time] [2021-11-20 23:22:32,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2021-11-20 23:22:32,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 425. [2021-11-20 23:22:32,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 424 states have (on average 3.358490566037736) internal successors, (1424), 424 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:22:32,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 1424 transitions. [2021-11-20 23:22:32,452 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 1424 transitions. Word has length 28 [2021-11-20 23:22:32,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:22:32,453 INFO L470 AbstractCegarLoop]: Abstraction has 425 states and 1424 transitions. [2021-11-20 23:22:32,453 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 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-20 23:22:32,453 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 1424 transitions. [2021-11-20 23:22:32,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:22:32,454 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:22:32,454 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:22:32,481 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Forceful destruction successful, exit code 0 [2021-11-20 23:22:32,654 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67,65 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:22:32,655 INFO L402 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:22:32,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:22:32,655 INFO L85 PathProgramCache]: Analyzing trace with hash -2074708747, now seen corresponding path program 62 times [2021-11-20 23:22:32,655 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:22:32,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623650807] [2021-11-20 23:22:32,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:22:32,656 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:22:32,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:22:33,605 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:22:33,605 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:22:33,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623650807] [2021-11-20 23:22:33,605 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623650807] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:22:33,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183543404] [2021-11-20 23:22:33,606 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 23:22:33,606 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:22:33,606 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:22:33,607 INFO L229 MonitoredProcess]: Starting monitored process 66 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:22:33,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2021-11-20 23:22:33,786 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-11-20 23:22:33,786 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:22:33,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 86 conjunts are in the unsatisfiable core [2021-11-20 23:22:33,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:22:33,834 INFO L354 Elim1Store]: treesize reduction 93, result has 14.7 percent of original size [2021-11-20 23:22:33,834 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 21 [2021-11-20 23:22:33,941 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-20 23:22:33,941 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-20 23:22:34,038 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-11-20 23:22:34,039 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-11-20 23:22:34,603 INFO L354 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2021-11-20 23:22:34,603 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 39 [2021-11-20 23:22:34,827 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-11-20 23:22:34,828 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 51 treesize of output 27 [2021-11-20 23:22:34,902 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:22:34,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:22:35,088 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:22:35,088 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 195 treesize of output 239 [2021-11-20 23:22:37,178 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:22:37,179 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:22:37,240 INFO L354 Elim1Store]: treesize reduction 46, result has 57.8 percent of original size [2021-11-20 23:22:37,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, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 73 [2021-11-20 23:22:38,078 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:22:38,078 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183543404] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:22:38,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [210037207] [2021-11-20 23:22:38,079 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-20 23:22:38,079 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:22:38,079 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 32 [2021-11-20 23:22:38,080 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385435842] [2021-11-20 23:22:38,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:22:38,084 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-11-20 23:22:38,085 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:22:38,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-11-20 23:22:38,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=958, Unknown=0, NotChecked=0, Total=1122 [2021-11-20 23:22:38,086 INFO L87 Difference]: Start difference. First operand 425 states and 1424 transitions. Second operand has 34 states, 33 states have (on average 2.0) internal successors, (66), 33 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-20 23:22:38,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:22:38,841 INFO L93 Difference]: Finished difference Result 459 states and 1535 transitions. [2021-11-20 23:22:38,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-20 23:22:38,841 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.0) internal successors, (66), 33 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 28 [2021-11-20 23:22:38,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:22:38,843 INFO L225 Difference]: With dead ends: 459 [2021-11-20 23:22:38,843 INFO L226 Difference]: Without dead ends: 452 [2021-11-20 23:22:38,843 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 445 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=290, Invalid=1350, Unknown=0, NotChecked=0, Total=1640 [2021-11-20 23:22:38,844 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 108 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 23:22:38,844 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 33 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 352 Invalid, 0 Unknown, 55 Unchecked, 0.3s Time] [2021-11-20 23:22:38,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2021-11-20 23:22:38,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 428. [2021-11-20 23:22:38,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 427 states have (on average 3.370023419203747) internal successors, (1439), 427 states have internal predecessors, (1439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:22:38,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 1439 transitions. [2021-11-20 23:22:38,854 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 1439 transitions. Word has length 28 [2021-11-20 23:22:38,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:22:38,854 INFO L470 AbstractCegarLoop]: Abstraction has 428 states and 1439 transitions. [2021-11-20 23:22:38,854 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.0) internal successors, (66), 33 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-20 23:22:38,854 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 1439 transitions. [2021-11-20 23:22:38,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:22:38,855 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:22:38,855 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:22:38,881 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Ended with exit code 0 [2021-11-20 23:22:39,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable68 [2021-11-20 23:22:39,056 INFO L402 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:22:39,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:22:39,056 INFO L85 PathProgramCache]: Analyzing trace with hash 797880893, now seen corresponding path program 63 times [2021-11-20 23:22:39,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:22:39,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572603986] [2021-11-20 23:22:39,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:22:39,057 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:22:39,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:22:39,701 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:22:39,702 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:22:39,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572603986] [2021-11-20 23:22:39,702 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572603986] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:22:39,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613492808] [2021-11-20 23:22:39,702 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 23:22:39,702 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:22:39,702 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:22:39,703 INFO L229 MonitoredProcess]: Starting monitored process 67 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:22:39,707 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2021-11-20 23:22:39,827 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 23:22:39,828 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:22:39,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 84 conjunts are in the unsatisfiable core [2021-11-20 23:22:39,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:22:39,887 INFO L354 Elim1Store]: treesize reduction 93, result has 14.7 percent of original size [2021-11-20 23:22:39,887 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 21 [2021-11-20 23:22:39,961 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 23:22:39,961 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 14 [2021-11-20 23:22:40,034 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-20 23:22:40,034 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 16 treesize of output 18 [2021-11-20 23:22:40,375 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:22:40,393 INFO L354 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2021-11-20 23:22:40,393 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 39 [2021-11-20 23:22:40,651 INFO L354 Elim1Store]: treesize reduction 29, result has 21.6 percent of original size [2021-11-20 23:22:40,652 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 53 treesize of output 37 [2021-11-20 23:22:40,706 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:22:40,706 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:22:40,866 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:22:40,866 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 195 treesize of output 239 [2021-11-20 23:22:43,013 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:22:43,014 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:22:43,073 INFO L354 Elim1Store]: treesize reduction 46, result has 57.8 percent of original size [2021-11-20 23:22:43,073 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 73 [2021-11-20 23:22:43,754 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:22:43,755 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613492808] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:22:43,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1502563801] [2021-11-20 23:22: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-20 23:22:43,755 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:22:43,756 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2021-11-20 23:22:43,756 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422117412] [2021-11-20 23:22:43,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:22:43,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-11-20 23:22:43,756 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:22:43,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-20 23:22:43,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2021-11-20 23:22:43,757 INFO L87 Difference]: Start difference. First operand 428 states and 1439 transitions. Second operand has 23 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 22 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:22:44,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:22:44,265 INFO L93 Difference]: Finished difference Result 486 states and 1616 transitions. [2021-11-20 23:22:44,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-20 23:22:44,265 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 22 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-11-20 23:22:44,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:22:44,267 INFO L225 Difference]: With dead ends: 486 [2021-11-20 23:22:44,268 INFO L226 Difference]: Without dead ends: 479 [2021-11-20 23:22:44,268 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=139, Invalid=617, Unknown=0, NotChecked=0, Total=756 [2021-11-20 23:22:44,268 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 43 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 209 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 23:22:44,269 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 41 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 394 Invalid, 0 Unknown, 209 Unchecked, 0.3s Time] [2021-11-20 23:22:44,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2021-11-20 23:22:44,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 426. [2021-11-20 23:22:44,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 425 states have (on average 3.3694117647058826) internal successors, (1432), 425 states have internal predecessors, (1432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:22:44,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 1432 transitions. [2021-11-20 23:22:44,285 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 1432 transitions. Word has length 28 [2021-11-20 23:22:44,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:22:44,285 INFO L470 AbstractCegarLoop]: Abstraction has 426 states and 1432 transitions. [2021-11-20 23:22:44,286 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 22 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:22:44,286 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 1432 transitions. [2021-11-20 23:22:44,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:22:44,288 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:22:44,288 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:22:44,334 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Ended with exit code 0 [2021-11-20 23:22:44,500 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 67 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable69 [2021-11-20 23:22:44,501 INFO L402 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:22:44,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:22:44,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1410488297, now seen corresponding path program 64 times [2021-11-20 23:22:44,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:22:44,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575217646] [2021-11-20 23:22:44,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:22:44,502 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:22:44,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:22:45,407 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-20 23:22:45,407 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:22:45,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575217646] [2021-11-20 23:22:45,407 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575217646] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:22:45,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173839363] [2021-11-20 23:22:45,407 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-20 23:22:45,407 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:22:45,408 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:22:45,408 INFO L229 MonitoredProcess]: Starting monitored process 68 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:22:45,409 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2021-11-20 23:22:45,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:22:45,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 86 conjunts are in the unsatisfiable core [2021-11-20 23:22:45,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:22:45,547 INFO L354 Elim1Store]: treesize reduction 93, result has 14.7 percent of original size [2021-11-20 23:22:45,547 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 21 [2021-11-20 23:22:45,647 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-20 23:22:45,648 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-20 23:22:45,737 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-11-20 23:22:45,738 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-11-20 23:22:46,298 INFO L354 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2021-11-20 23:22:46,299 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 39 [2021-11-20 23:22:46,628 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-11-20 23:22:46,628 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 51 treesize of output 27 [2021-11-20 23:22:46,678 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:22:46,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:22:46,855 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:22:46,856 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 195 treesize of output 239 [2021-11-20 23:22:49,031 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:22:49,032 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:22:49,096 INFO L354 Elim1Store]: treesize reduction 46, result has 57.8 percent of original size [2021-11-20 23:22:49,096 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 73 [2021-11-20 23:22:50,006 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:22:50,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173839363] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:22:50,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2067431083] [2021-11-20 23:22:50,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-20 23:22:50,007 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:22:50,008 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 31 [2021-11-20 23:22:50,008 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327000422] [2021-11-20 23:22:50,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:22:50,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-11-20 23:22:50,008 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:22:50,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-11-20 23:22:50,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=899, Unknown=0, NotChecked=0, Total=1056 [2021-11-20 23:22:50,009 INFO L87 Difference]: Start difference. First operand 426 states and 1432 transitions. Second operand has 33 states, 32 states have (on average 2.1875) internal successors, (70), 32 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:22:51,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:22:51,047 INFO L93 Difference]: Finished difference Result 526 states and 1726 transitions. [2021-11-20 23:22:51,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-20 23:22:51,048 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.1875) internal successors, (70), 32 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-11-20 23:22:51,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:22:51,049 INFO L225 Difference]: With dead ends: 526 [2021-11-20 23:22:51,049 INFO L226 Difference]: Without dead ends: 519 [2021-11-20 23:22:51,050 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=327, Invalid=1653, Unknown=0, NotChecked=0, Total=1980 [2021-11-20 23:22:51,050 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 123 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 178 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-20 23:22:51,050 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 64 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 558 Invalid, 0 Unknown, 178 Unchecked, 0.4s Time] [2021-11-20 23:22:51,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2021-11-20 23:22:51,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 427. [2021-11-20 23:22:51,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 426 states have (on average 3.3732394366197185) internal successors, (1437), 426 states have internal predecessors, (1437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:22:51,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 1437 transitions. [2021-11-20 23:22:51,060 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 1437 transitions. Word has length 28 [2021-11-20 23:22:51,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:22:51,061 INFO L470 AbstractCegarLoop]: Abstraction has 427 states and 1437 transitions. [2021-11-20 23:22:51,061 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.1875) internal successors, (70), 32 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:22:51,061 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 1437 transitions. [2021-11-20 23:22:51,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:22:51,062 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:22:51,062 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:22:51,088 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Forceful destruction successful, exit code 0 [2021-11-20 23:22:51,262 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,68 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:22:51,263 INFO L402 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:22:51,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:22:51,263 INFO L85 PathProgramCache]: Analyzing trace with hash -503279429, now seen corresponding path program 65 times [2021-11-20 23:22:51,263 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:22:51,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500893641] [2021-11-20 23:22:51,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:22:51,264 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:22:51,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:22:52,304 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:22:52,305 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:22:52,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500893641] [2021-11-20 23:22:52,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500893641] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:22:52,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310645300] [2021-11-20 23:22:52,305 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 23:22:52,305 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:22:52,305 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:22:52,306 INFO L229 MonitoredProcess]: Starting monitored process 69 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:22:52,307 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2021-11-20 23:22:52,408 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-20 23:22:52,408 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:22:52,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 84 conjunts are in the unsatisfiable core [2021-11-20 23:22:52,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:22:52,456 INFO L354 Elim1Store]: treesize reduction 93, result has 14.7 percent of original size [2021-11-20 23:22:52,456 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 21 [2021-11-20 23:22:52,547 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 23:22:52,547 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 14 [2021-11-20 23:22:52,645 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-20 23:22:52,646 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 16 treesize of output 18 [2021-11-20 23:22:53,049 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:22:53,067 INFO L354 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2021-11-20 23:22:53,068 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 39 [2021-11-20 23:22:53,359 INFO L354 Elim1Store]: treesize reduction 29, result has 21.6 percent of original size [2021-11-20 23:22:53,359 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 53 treesize of output 37 [2021-11-20 23:22:53,420 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:22:53,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:22:53,597 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:22:53,597 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 195 treesize of output 239 [2021-11-20 23:22:55,713 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:22:55,714 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:22:55,775 INFO L354 Elim1Store]: treesize reduction 46, result has 57.8 percent of original size [2021-11-20 23:22:55,776 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 42 treesize of output 73 [2021-11-20 23:22:56,632 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:22:56,632 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310645300] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:22:56,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [650243409] [2021-11-20 23:22:56,633 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-20 23:22:56,634 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:22:56,634 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 28 [2021-11-20 23:22:56,634 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510824178] [2021-11-20 23:22:56,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:22:56,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-11-20 23:22:56,635 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:22:56,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-11-20 23:22:56,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=742, Unknown=0, NotChecked=0, Total=870 [2021-11-20 23:22:56,635 INFO L87 Difference]: Start difference. First operand 427 states and 1437 transitions. Second operand has 30 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:22:58,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:22:58,082 INFO L93 Difference]: Finished difference Result 470 states and 1558 transitions. [2021-11-20 23:22:58,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-20 23:22:58,082 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-11-20 23:22:58,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:22:58,084 INFO L225 Difference]: With dead ends: 470 [2021-11-20 23:22:58,084 INFO L226 Difference]: Without dead ends: 463 [2021-11-20 23:22:58,084 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=296, Invalid=1264, Unknown=0, NotChecked=0, Total=1560 [2021-11-20 23:22:58,084 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 99 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-20 23:22:58,084 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 57 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 457 Invalid, 0 Unknown, 105 Unchecked, 0.4s Time] [2021-11-20 23:22:58,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2021-11-20 23:22:58,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 422. [2021-11-20 23:22:58,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 421 states have (on average 3.36104513064133) internal successors, (1415), 421 states have internal predecessors, (1415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:22:58,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 1415 transitions. [2021-11-20 23:22:58,094 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 1415 transitions. Word has length 28 [2021-11-20 23:22:58,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:22:58,094 INFO L470 AbstractCegarLoop]: Abstraction has 422 states and 1415 transitions. [2021-11-20 23:22:58,094 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:22:58,095 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 1415 transitions. [2021-11-20 23:22:58,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:22:58,096 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:22:58,096 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:22:58,122 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Forceful destruction successful, exit code 0 [2021-11-20 23:22:58,296 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,69 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:22:58,296 INFO L402 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:22:58,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:22:58,297 INFO L85 PathProgramCache]: Analyzing trace with hash 417141299, now seen corresponding path program 66 times [2021-11-20 23:22:58,297 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:22:58,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993022476] [2021-11-20 23:22:58,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:22:58,297 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:22:58,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:22:59,164 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:22:59,164 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:22:59,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993022476] [2021-11-20 23:22:59,165 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993022476] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:22:59,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083786019] [2021-11-20 23:22:59,165 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 23:22:59,165 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:22:59,165 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:22:59,167 INFO L229 MonitoredProcess]: Starting monitored process 70 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:22:59,194 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Waiting until timeout for monitored process [2021-11-20 23:22:59,297 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 23:22:59,298 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:22:59,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 84 conjunts are in the unsatisfiable core [2021-11-20 23:22:59,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:22:59,360 INFO L354 Elim1Store]: treesize reduction 93, result has 14.7 percent of original size [2021-11-20 23:22:59,360 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 21 [2021-11-20 23:22:59,485 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-20 23:22:59,485 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-20 23:22:59,623 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-20 23:22:59,623 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 20 treesize of output 22 [2021-11-20 23:23:00,069 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:23:00,094 INFO L354 Elim1Store]: treesize reduction 52, result has 30.7 percent of original size [2021-11-20 23:23:00,094 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 49 [2021-11-20 23:23:02,463 INFO L354 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2021-11-20 23:23:02,464 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 72 treesize of output 56 [2021-11-20 23:23:02,539 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:23:02,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:23:04,420 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((~C~0.offset Int)) (let ((.cse0 (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) (let ((.cse1 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse0))) (.cse2 (select (select |c_#memory_int| c_~B~0.base) (+ c_~B~0.offset .cse0)))) (<= (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) (+ ~C~0.offset .cse0) (+ .cse1 .cse2))) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork2_~i~0#1| 4) c_~A~0.offset))) (+ c_~csum~0 .cse1 .cse2))))) (forall ((~C~0.offset Int)) (let ((.cse5 (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) (let ((.cse3 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse5))) (.cse4 (select (select |c_#memory_int| c_~B~0.base) (+ c_~B~0.offset .cse5)))) (<= (+ c_~csum~0 .cse3 .cse4) (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) (+ ~C~0.offset .cse5) (+ .cse3 .cse4))) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork2_~i~0#1| 4) c_~A~0.offset)))))))) is different from false [2021-11-20 23:23:06,170 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((~C~0.offset Int)) (let ((.cse2 (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse2))) (.cse1 (select (select |c_#memory_int| c_~B~0.base) (+ c_~B~0.offset .cse2)))) (<= (+ c_~csum~0 .cse0 .cse1) (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) (+ ~C~0.offset .cse2) (+ .cse0 .cse1))) c_~A~0.base) c_~A~0.offset)))))) (forall ((~C~0.offset Int)) (let ((.cse3 (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) (let ((.cse4 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse3))) (.cse5 (select (select |c_#memory_int| c_~B~0.base) (+ c_~B~0.offset .cse3)))) (<= (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) (+ ~C~0.offset .cse3) (+ .cse4 .cse5))) c_~A~0.base) c_~A~0.offset)) (+ c_~csum~0 .cse4 .cse5)))))) is different from false [2021-11-20 23:23:06,227 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:23:06,228 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 78 treesize of output 138 [2021-11-20 23:23:06,520 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:23:06,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:06,548 INFO L354 Elim1Store]: treesize reduction 61, result has 28.2 percent of original size [2021-11-20 23:23:06,549 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 38 treesize of output 34 [2021-11-20 23:23:06,993 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2021-11-20 23:23:06,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083786019] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:23:06,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [90518439] [2021-11-20 23:23:06,994 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-20 23:23:06,995 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:23:06,995 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 25 [2021-11-20 23:23:06,996 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139051758] [2021-11-20 23:23:06,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:23:06,996 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-11-20 23:23:06,996 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:23:06,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-11-20 23:23:06,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=512, Unknown=3, NotChecked=94, Total=702 [2021-11-20 23:23:06,997 INFO L87 Difference]: Start difference. First operand 422 states and 1415 transitions. Second operand has 27 states, 26 states have (on average 2.230769230769231) internal successors, (58), 26 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-20 23:23:08,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:23:08,009 INFO L93 Difference]: Finished difference Result 536 states and 1772 transitions. [2021-11-20 23:23:08,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-20 23:23:08,010 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.230769230769231) internal successors, (58), 26 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 28 [2021-11-20 23:23:08,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:23:08,011 INFO L225 Difference]: With dead ends: 536 [2021-11-20 23:23:08,011 INFO L226 Difference]: Without dead ends: 530 [2021-11-20 23:23:08,011 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 37 SyntacticMatches, 6 SemanticMatches, 39 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=311, Invalid=1176, Unknown=3, NotChecked=150, Total=1640 [2021-11-20 23:23:08,012 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 154 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 247 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 23:23:08,012 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 53 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 323 Invalid, 0 Unknown, 247 Unchecked, 0.3s Time] [2021-11-20 23:23:08,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2021-11-20 23:23:08,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 425. [2021-11-20 23:23:08,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 424 states have (on average 3.3726415094339623) internal successors, (1430), 424 states have internal predecessors, (1430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:23:08,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 1430 transitions. [2021-11-20 23:23:08,023 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 1430 transitions. Word has length 28 [2021-11-20 23:23:08,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:23:08,023 INFO L470 AbstractCegarLoop]: Abstraction has 425 states and 1430 transitions. [2021-11-20 23:23:08,023 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.230769230769231) internal successors, (58), 26 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-20 23:23:08,023 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 1430 transitions. [2021-11-20 23:23:08,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:23:08,024 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:23:08,024 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:23:08,050 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Forceful destruction successful, exit code 0 [2021-11-20 23:23:08,224 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72,70 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:23:08,225 INFO L402 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:23:08,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:23:08,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1791227891, now seen corresponding path program 67 times [2021-11-20 23:23:08,225 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:23:08,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519597389] [2021-11-20 23:23:08,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:23:08,226 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:23:08,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:23:08,807 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:23:08,808 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:23:08,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519597389] [2021-11-20 23:23:08,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519597389] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:23:08,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556731760] [2021-11-20 23:23:08,808 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-20 23:23:08,808 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:23:08,809 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:23:08,810 INFO L229 MonitoredProcess]: Starting monitored process 71 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:23:08,815 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Waiting until timeout for monitored process [2021-11-20 23:23:08,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:23:08,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 84 conjunts are in the unsatisfiable core [2021-11-20 23:23:08,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:23:08,958 INFO L354 Elim1Store]: treesize reduction 93, result has 14.7 percent of original size [2021-11-20 23:23:08,959 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 21 [2021-11-20 23:23:09,020 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-20 23:23:09,020 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-20 23:23:09,125 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-20 23:23:09,125 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 20 treesize of output 22 [2021-11-20 23:23:09,524 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:23:09,559 INFO L354 Elim1Store]: treesize reduction 52, result has 30.7 percent of original size [2021-11-20 23:23:09,559 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 49 [2021-11-20 23:23:10,017 INFO L354 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2021-11-20 23:23:10,017 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 72 treesize of output 56 [2021-11-20 23:23:10,089 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:23:10,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:23:11,927 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((~C~0.offset Int)) (let ((.cse0 (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) (let ((.cse1 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse0))) (.cse2 (select (select |c_#memory_int| c_~B~0.base) (+ c_~B~0.offset .cse0)))) (<= (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) (+ ~C~0.offset .cse0) (+ .cse1 .cse2))) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork2_~i~0#1| 4) c_~A~0.offset))) (+ c_~csum~0 .cse1 .cse2))))) (forall ((~C~0.offset Int)) (let ((.cse5 (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) (let ((.cse3 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse5))) (.cse4 (select (select |c_#memory_int| c_~B~0.base) (+ c_~B~0.offset .cse5)))) (<= (+ c_~csum~0 .cse3 .cse4) (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) (+ ~C~0.offset .cse5) (+ .cse3 .cse4))) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork2_~i~0#1| 4) c_~A~0.offset)))))))) is different from false [2021-11-20 23:23:15,605 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:23:15,606 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 78 treesize of output 138 [2021-11-20 23:23:16,588 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:23:16,617 INFO L354 Elim1Store]: treesize reduction 77, result has 20.6 percent of original size [2021-11-20 23:23:16,618 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 38 treesize of output 30 [2021-11-20 23:23:17,042 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2021-11-20 23:23:17,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556731760] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:23:17,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [478743314] [2021-11-20 23:23:17,042 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-20 23:23:17,043 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:23:17,043 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2021-11-20 23:23:17,043 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114301092] [2021-11-20 23:23:17,043 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:23:17,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-11-20 23:23:17,044 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:23:17,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-20 23:23:17,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=425, Unknown=3, NotChecked=42, Total=552 [2021-11-20 23:23:17,044 INFO L87 Difference]: Start difference. First operand 425 states and 1430 transitions. Second operand has 24 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 23 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-20 23:23:17,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:23:17,604 INFO L93 Difference]: Finished difference Result 489 states and 1617 transitions. [2021-11-20 23:23:17,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-20 23:23:17,605 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 23 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 28 [2021-11-20 23:23:17,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:23:17,606 INFO L225 Difference]: With dead ends: 489 [2021-11-20 23:23:17,606 INFO L226 Difference]: Without dead ends: 483 [2021-11-20 23:23:17,606 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 38 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=156, Invalid=601, Unknown=3, NotChecked=52, Total=812 [2021-11-20 23:23:17,607 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 79 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 338 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 23:23:17,607 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 44 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 349 Invalid, 0 Unknown, 338 Unchecked, 0.3s Time] [2021-11-20 23:23:17,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2021-11-20 23:23:17,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 420. [2021-11-20 23:23:17,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 419 states have (on average 3.3579952267303104) internal successors, (1407), 419 states have internal predecessors, (1407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:23:17,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 1407 transitions. [2021-11-20 23:23:17,618 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 1407 transitions. Word has length 28 [2021-11-20 23:23:17,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:23:17,618 INFO L470 AbstractCegarLoop]: Abstraction has 420 states and 1407 transitions. [2021-11-20 23:23:17,619 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 23 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-20 23:23:17,619 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 1407 transitions. [2021-11-20 23:23:17,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:23:17,620 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:23:17,621 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:23:17,651 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Forceful destruction successful, exit code 0 [2021-11-20 23:23:17,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 71 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable73 [2021-11-20 23:23:17,825 INFO L402 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:23:17,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:23:17,825 INFO L85 PathProgramCache]: Analyzing trace with hash -2071505717, now seen corresponding path program 68 times [2021-11-20 23:23:17,826 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:23:17,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366762002] [2021-11-20 23:23:17,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:23:17,826 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:23:17,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:23:18,330 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:23:18,331 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:23:18,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366762002] [2021-11-20 23:23:18,331 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366762002] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:23:18,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139192103] [2021-11-20 23:23:18,331 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 23:23:18,331 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:23:18,331 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:23:18,332 INFO L229 MonitoredProcess]: Starting monitored process 72 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:23:18,334 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Waiting until timeout for monitored process [2021-11-20 23:23:18,433 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-20 23:23:18,433 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:23:18,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 82 conjunts are in the unsatisfiable core [2021-11-20 23:23:18,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:23:18,481 INFO L354 Elim1Store]: treesize reduction 93, result has 14.7 percent of original size [2021-11-20 23:23:18,481 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 21 [2021-11-20 23:23:18,538 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 23:23:18,538 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 14 [2021-11-20 23:23:18,625 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 23:23:18,626 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 11 treesize of output 11 [2021-11-20 23:23:19,071 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:23:19,104 INFO L354 Elim1Store]: treesize reduction 52, result has 30.7 percent of original size [2021-11-20 23:23:19,105 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 49 [2021-11-20 23:23:21,726 INFO L354 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2021-11-20 23:23:21,726 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 72 treesize of output 56 [2021-11-20 23:23:21,806 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:23:21,806 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:23:33,850 WARN L227 SmtUtils]: Spent 5.20s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-20 23:23:33,900 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:23:33,901 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 78 treesize of output 138 [2021-11-20 23:23:34,969 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:23:34,998 INFO L354 Elim1Store]: treesize reduction 73, result has 24.7 percent of original size [2021-11-20 23:23:34,998 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 38 treesize of output 34 [2021-11-20 23:23:35,380 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:23:35,380 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139192103] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:23:35,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [13874393] [2021-11-20 23:23:35,380 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-20 23:23:35,381 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:23:35,381 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2021-11-20 23:23:35,381 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561526583] [2021-11-20 23:23:35,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:23:35,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-11-20 23:23:35,381 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:23:35,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-20 23:23:35,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2021-11-20 23:23:35,382 INFO L87 Difference]: Start difference. First operand 420 states and 1407 transitions. Second operand has 24 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 23 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-20 23:23:35,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:23:35,939 INFO L93 Difference]: Finished difference Result 509 states and 1679 transitions. [2021-11-20 23:23:35,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-20 23:23:35,940 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 23 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 28 [2021-11-20 23:23:35,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:23:35,941 INFO L225 Difference]: With dead ends: 509 [2021-11-20 23:23:35,941 INFO L226 Difference]: Without dead ends: 503 [2021-11-20 23:23:35,942 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=155, Invalid=657, Unknown=0, NotChecked=0, Total=812 [2021-11-20 23:23:35,942 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 80 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 253 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 23:23:35,942 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 71 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 457 Invalid, 0 Unknown, 253 Unchecked, 0.3s Time] [2021-11-20 23:23:35,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2021-11-20 23:23:35,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 411. [2021-11-20 23:23:35,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 410 states have (on average 3.3390243902439023) internal successors, (1369), 410 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:23:35,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 1369 transitions. [2021-11-20 23:23:35,953 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 1369 transitions. Word has length 28 [2021-11-20 23:23:35,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:23:35,953 INFO L470 AbstractCegarLoop]: Abstraction has 411 states and 1369 transitions. [2021-11-20 23:23:35,953 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 23 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-20 23:23:35,953 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 1369 transitions. [2021-11-20 23:23:35,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:23:35,954 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:23:35,955 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:23:35,981 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Forceful destruction successful, exit code 0 [2021-11-20 23:23:36,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 72 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable74 [2021-11-20 23:23:36,155 INFO L402 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:23:36,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:23:36,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1792352533, now seen corresponding path program 69 times [2021-11-20 23:23:36,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:23:36,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855955711] [2021-11-20 23:23:36,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:23:36,156 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:23:36,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:23:36,788 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:23:36,788 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:23:36,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855955711] [2021-11-20 23:23:36,788 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855955711] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:23:36,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136879182] [2021-11-20 23:23:36,788 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 23:23:36,789 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:23:36,789 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:23:36,790 INFO L229 MonitoredProcess]: Starting monitored process 73 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:23:36,812 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process [2021-11-20 23:23:36,912 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 23:23:36,913 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:23:36,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 84 conjunts are in the unsatisfiable core [2021-11-20 23:23:36,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:23:36,973 INFO L354 Elim1Store]: treesize reduction 93, result has 14.7 percent of original size [2021-11-20 23:23:36,973 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 21 [2021-11-20 23:23:37,050 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 23:23:37,050 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 14 [2021-11-20 23:23:37,144 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-20 23:23:37,144 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 16 treesize of output 18 [2021-11-20 23:23:37,496 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:23:37,514 INFO L354 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2021-11-20 23:23:37,515 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 39 [2021-11-20 23:23:38,041 INFO L354 Elim1Store]: treesize reduction 29, result has 21.6 percent of original size [2021-11-20 23:23:38,042 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 53 treesize of output 37 [2021-11-20 23:23:38,087 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:23:38,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:23:38,257 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:23:38,257 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 195 treesize of output 239 [2021-11-20 23:23:40,080 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:23:40,081 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:23:40,160 INFO L354 Elim1Store]: treesize reduction 46, result has 57.8 percent of original size [2021-11-20 23:23:40,160 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 73 [2021-11-20 23:23:40,820 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:23:40,820 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136879182] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:23:40,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1395087844] [2021-11-20 23:23:40,821 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-20 23:23:40,822 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:23:40,822 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2021-11-20 23:23:40,822 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718745628] [2021-11-20 23:23:40,823 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:23:40,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-11-20 23:23:40,823 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:23:40,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-20 23:23:40,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2021-11-20 23:23:40,823 INFO L87 Difference]: Start difference. First operand 411 states and 1369 transitions. Second operand has 23 states, 22 states have (on average 2.590909090909091) internal successors, (57), 22 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-20 23:23:41,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:23:41,348 INFO L93 Difference]: Finished difference Result 462 states and 1527 transitions. [2021-11-20 23:23:41,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-20 23:23:41,349 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.590909090909091) internal successors, (57), 22 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 28 [2021-11-20 23:23:41,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:23:41,350 INFO L225 Difference]: With dead ends: 462 [2021-11-20 23:23:41,350 INFO L226 Difference]: Without dead ends: 456 [2021-11-20 23:23:41,350 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=173, Invalid=639, Unknown=0, NotChecked=0, Total=812 [2021-11-20 23:23:41,350 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 73 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 23:23:41,351 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 35 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 365 Invalid, 0 Unknown, 54 Unchecked, 0.3s Time] [2021-11-20 23:23:41,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2021-11-20 23:23:41,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 410. [2021-11-20 23:23:41,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 409 states have (on average 3.3398533007334965) internal successors, (1366), 409 states have internal predecessors, (1366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:23:41,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 1366 transitions. [2021-11-20 23:23:41,361 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 1366 transitions. Word has length 28 [2021-11-20 23:23:41,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:23:41,361 INFO L470 AbstractCegarLoop]: Abstraction has 410 states and 1366 transitions. [2021-11-20 23:23:41,361 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.590909090909091) internal successors, (57), 22 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-20 23:23:41,361 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 1366 transitions. [2021-11-20 23:23:41,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:23:41,362 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:23:41,362 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:23:41,392 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Ended with exit code 0 [2021-11-20 23:23:41,564 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75,73 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:23:41,565 INFO L402 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:23:41,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:23:41,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1177474195, now seen corresponding path program 70 times [2021-11-20 23:23:41,565 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:23:41,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368931629] [2021-11-20 23:23:41,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:23:41,566 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:23:41,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:23:42,225 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:23:42,225 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:23:42,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368931629] [2021-11-20 23:23:42,225 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368931629] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:23:42,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217980829] [2021-11-20 23:23:42,225 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-20 23:23:42,226 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:23:42,226 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:23:42,226 INFO L229 MonitoredProcess]: Starting monitored process 74 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:23:42,228 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Waiting until timeout for monitored process [2021-11-20 23:23:42,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:23:42,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 84 conjunts are in the unsatisfiable core [2021-11-20 23:23:42,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:23:42,369 INFO L354 Elim1Store]: treesize reduction 93, result has 14.7 percent of original size [2021-11-20 23:23:42,370 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 21 [2021-11-20 23:23:42,432 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 23:23:42,433 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 14 [2021-11-20 23:23:42,500 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-20 23:23:42,500 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 16 treesize of output 18 [2021-11-20 23:23:42,823 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:23:42,841 INFO L354 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2021-11-20 23:23:42,841 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 39 [2021-11-20 23:23:43,401 INFO L354 Elim1Store]: treesize reduction 29, result has 21.6 percent of original size [2021-11-20 23:23:43,401 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 53 treesize of output 37 [2021-11-20 23:23:43,445 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:23:43,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:23:43,617 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:23:43,617 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 195 treesize of output 239 [2021-11-20 23:23:45,470 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:23:45,470 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:23:45,530 INFO L354 Elim1Store]: treesize reduction 46, result has 57.8 percent of original size [2021-11-20 23:23:45,531 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 73 [2021-11-20 23:23:46,196 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:23:46,196 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [217980829] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:23:46,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [844138284] [2021-11-20 23:23:46,197 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-20 23:23:46,197 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:23:46,197 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2021-11-20 23:23:46,197 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928769232] [2021-11-20 23:23:46,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:23:46,198 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-11-20 23:23:46,198 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:23:46,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-20 23:23:46,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2021-11-20 23:23:46,198 INFO L87 Difference]: Start difference. First operand 410 states and 1366 transitions. Second operand has 23 states, 22 states have (on average 2.590909090909091) internal successors, (57), 22 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-20 23:23:46,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:23:46,660 INFO L93 Difference]: Finished difference Result 458 states and 1503 transitions. [2021-11-20 23:23:46,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-20 23:23:46,661 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.590909090909091) internal successors, (57), 22 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 28 [2021-11-20 23:23:46,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:23:46,662 INFO L225 Difference]: With dead ends: 458 [2021-11-20 23:23:46,662 INFO L226 Difference]: Without dead ends: 452 [2021-11-20 23:23:46,663 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=139, Invalid=617, Unknown=0, NotChecked=0, Total=756 [2021-11-20 23:23:46,663 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 41 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 57 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 23:23:46,663 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 40 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 389 Invalid, 0 Unknown, 57 Unchecked, 0.3s Time] [2021-11-20 23:23:46,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2021-11-20 23:23:46,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 405. [2021-11-20 23:23:46,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 404 states have (on average 3.3242574257425743) internal successors, (1343), 404 states have internal predecessors, (1343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:23:46,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 1343 transitions. [2021-11-20 23:23:46,675 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 1343 transitions. Word has length 28 [2021-11-20 23:23:46,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:23:46,676 INFO L470 AbstractCegarLoop]: Abstraction has 405 states and 1343 transitions. [2021-11-20 23:23:46,676 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.590909090909091) internal successors, (57), 22 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-20 23:23:46,676 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 1343 transitions. [2021-11-20 23:23:46,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:23:46,677 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:23:46,677 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:23:46,706 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Forceful destruction successful, exit code 0 [2021-11-20 23:23:46,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76,74 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:23:46,878 INFO L402 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:23:46,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:23:46,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1430421931, now seen corresponding path program 71 times [2021-11-20 23:23:46,878 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:23:46,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371056757] [2021-11-20 23:23:46,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:23:46,879 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:23:46,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:23:47,370 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:23:47,371 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:23:47,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371056757] [2021-11-20 23:23:47,371 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371056757] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:23:47,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461956071] [2021-11-20 23:23:47,371 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 23:23:47,371 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:23:47,371 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:23:47,372 INFO L229 MonitoredProcess]: Starting monitored process 75 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:23:47,374 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process [2021-11-20 23:23:47,486 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-11-20 23:23:47,486 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:23:47,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 84 conjunts are in the unsatisfiable core [2021-11-20 23:23:47,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:23:47,537 INFO L354 Elim1Store]: treesize reduction 93, result has 14.7 percent of original size [2021-11-20 23:23:47,537 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 21 [2021-11-20 23:23:47,593 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 23:23:47,593 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 14 [2021-11-20 23:23:47,662 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-20 23:23:47,662 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 16 treesize of output 18 [2021-11-20 23:23:47,980 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:23:47,999 INFO L354 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2021-11-20 23:23:47,999 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 39 [2021-11-20 23:23:48,552 INFO L354 Elim1Store]: treesize reduction 29, result has 21.6 percent of original size [2021-11-20 23:23:48,552 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 53 treesize of output 37 [2021-11-20 23:23:48,595 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:23:48,596 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:23:48,765 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:23:48,765 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 195 treesize of output 239 [2021-11-20 23:23:50,787 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:23:50,788 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:23:50,849 INFO L354 Elim1Store]: treesize reduction 46, result has 57.8 percent of original size [2021-11-20 23:23:50,850 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 42 treesize of output 73 [2021-11-20 23:23:51,563 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:23:51,563 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [461956071] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:23:51,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1057228769] [2021-11-20 23:23:51,564 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-20 23:23:51,564 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:23:51,564 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2021-11-20 23:23:51,565 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120324844] [2021-11-20 23:23:51,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:23:51,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-11-20 23:23:51,565 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:23:51,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-20 23:23:51,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2021-11-20 23:23:51,566 INFO L87 Difference]: Start difference. First operand 405 states and 1343 transitions. Second operand has 23 states, 22 states have (on average 2.590909090909091) internal successors, (57), 22 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-20 23:23:52,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:23:52,035 INFO L93 Difference]: Finished difference Result 462 states and 1527 transitions. [2021-11-20 23:23:52,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-20 23:23:52,036 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.590909090909091) internal successors, (57), 22 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 28 [2021-11-20 23:23:52,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:23:52,037 INFO L225 Difference]: With dead ends: 462 [2021-11-20 23:23:52,037 INFO L226 Difference]: Without dead ends: 458 [2021-11-20 23:23:52,038 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=139, Invalid=617, Unknown=0, NotChecked=0, Total=756 [2021-11-20 23:23:52,038 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 45 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 145 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 23:23:52,039 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 46 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 333 Invalid, 0 Unknown, 145 Unchecked, 0.3s Time] [2021-11-20 23:23:52,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2021-11-20 23:23:52,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 409. [2021-11-20 23:23:52,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 408 states have (on average 3.3308823529411766) internal successors, (1359), 408 states have internal predecessors, (1359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:23:52,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 1359 transitions. [2021-11-20 23:23:52,053 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 1359 transitions. Word has length 28 [2021-11-20 23:23:52,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:23:52,053 INFO L470 AbstractCegarLoop]: Abstraction has 409 states and 1359 transitions. [2021-11-20 23:23:52,053 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.590909090909091) internal successors, (57), 22 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-20 23:23:52,053 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 1359 transitions. [2021-11-20 23:23:52,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:23:52,055 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:23:52,055 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:23:52,081 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Forceful destruction successful, exit code 0 [2021-11-20 23:23:52,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 75 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable77 [2021-11-20 23:23:52,256 INFO L402 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:23:52,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:23:52,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1567799531, now seen corresponding path program 72 times [2021-11-20 23:23:52,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:23:52,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332888876] [2021-11-20 23:23:52,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:23:52,256 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:23:52,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:23:52,879 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:23:52,880 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:23:52,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332888876] [2021-11-20 23:23:52,880 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332888876] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:23:52,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402863346] [2021-11-20 23:23:52,880 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 23:23:52,880 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:23:52,880 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:23:52,882 INFO L229 MonitoredProcess]: Starting monitored process 76 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:23:52,908 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Waiting until timeout for monitored process [2021-11-20 23:23:53,007 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 23:23:53,007 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:23:53,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 84 conjunts are in the unsatisfiable core [2021-11-20 23:23:53,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:23:53,055 INFO L354 Elim1Store]: treesize reduction 93, result has 14.7 percent of original size [2021-11-20 23:23:53,055 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 21 [2021-11-20 23:23:53,114 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 23:23:53,114 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 14 [2021-11-20 23:23:53,183 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-20 23:23:53,183 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 16 treesize of output 18 [2021-11-20 23:23:53,530 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:23:53,550 INFO L354 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2021-11-20 23:23:53,550 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 39 [2021-11-20 23:23:54,158 INFO L354 Elim1Store]: treesize reduction 29, result has 21.6 percent of original size [2021-11-20 23:23:54,158 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 53 treesize of output 37 [2021-11-20 23:23:54,195 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:23:54,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:23:54,367 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:23:54,368 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 195 treesize of output 239 [2021-11-20 23:23:56,436 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:23:56,437 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:23:56,500 INFO L354 Elim1Store]: treesize reduction 46, result has 57.8 percent of original size [2021-11-20 23:23:56,500 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 42 treesize of output 73 [2021-11-20 23:23:57,246 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:23:57,247 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402863346] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:23:57,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [208955025] [2021-11-20 23:23:57,247 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-20 23:23:57,247 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:23:57,248 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2021-11-20 23:23:57,248 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754182673] [2021-11-20 23:23:57,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:23:57,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-11-20 23:23:57,248 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:23:57,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-20 23:23:57,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2021-11-20 23:23:57,249 INFO L87 Difference]: Start difference. First operand 409 states and 1359 transitions. Second operand has 24 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 23 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:23:57,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:23:57,901 INFO L93 Difference]: Finished difference Result 472 states and 1549 transitions. [2021-11-20 23:23:57,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-20 23:23:57,901 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 23 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-11-20 23:23:57,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:23:57,903 INFO L225 Difference]: With dead ends: 472 [2021-11-20 23:23:57,903 INFO L226 Difference]: Without dead ends: 466 [2021-11-20 23:23:57,903 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=184, Invalid=686, Unknown=0, NotChecked=0, Total=870 [2021-11-20 23:23:57,903 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 68 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 179 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-20 23:23:57,903 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 46 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 484 Invalid, 0 Unknown, 179 Unchecked, 0.4s Time] [2021-11-20 23:23:57,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2021-11-20 23:23:57,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 405. [2021-11-20 23:23:57,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 404 states have (on average 3.3242574257425743) internal successors, (1343), 404 states have internal predecessors, (1343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:23:57,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 1343 transitions. [2021-11-20 23:23:57,915 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 1343 transitions. Word has length 28 [2021-11-20 23:23:57,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:23:57,915 INFO L470 AbstractCegarLoop]: Abstraction has 405 states and 1343 transitions. [2021-11-20 23:23:57,915 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 23 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:23:57,915 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 1343 transitions. [2021-11-20 23:23:57,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:23:57,916 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:23:57,916 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:23:57,942 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Forceful destruction successful, exit code 0 [2021-11-20 23:23:58,117 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78,76 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:23:58,117 INFO L402 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:23:58,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:23:58,118 INFO L85 PathProgramCache]: Analyzing trace with hash 510798285, now seen corresponding path program 73 times [2021-11-20 23:23:58,118 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:23:58,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823658145] [2021-11-20 23:23:58,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:23:58,118 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:23:58,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:23:58,658 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:23:58,658 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:23:58,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823658145] [2021-11-20 23:23:58,658 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823658145] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:23:58,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040805358] [2021-11-20 23:23:58,659 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-20 23:23:58,659 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:23:58,659 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:23:58,660 INFO L229 MonitoredProcess]: Starting monitored process 77 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:23:58,660 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process [2021-11-20 23:23:58,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:23:58,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 84 conjunts are in the unsatisfiable core [2021-11-20 23:23:58,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:23:58,801 INFO L354 Elim1Store]: treesize reduction 93, result has 14.7 percent of original size [2021-11-20 23:23:58,802 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 21 [2021-11-20 23:23:58,859 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 23:23:58,859 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 14 [2021-11-20 23:23:58,923 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-20 23:23:58,923 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 16 treesize of output 18 [2021-11-20 23:23:59,256 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:23:59,274 INFO L354 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2021-11-20 23:23:59,274 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 39 [2021-11-20 23:23:59,875 INFO L354 Elim1Store]: treesize reduction 29, result has 21.6 percent of original size [2021-11-20 23:23:59,875 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 53 treesize of output 37 [2021-11-20 23:23:59,913 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:23:59,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:24:00,083 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:24:00,083 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 195 treesize of output 239 [2021-11-20 23:24:02,235 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:24:02,235 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:24:02,285 INFO L354 Elim1Store]: treesize reduction 46, result has 57.8 percent of original size [2021-11-20 23:24:02,286 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 73 [2021-11-20 23:24:02,996 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:24:02,996 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040805358] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:24:02,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [923539212] [2021-11-20 23:24:02,997 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-20 23:24:02,997 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:24:02,997 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2021-11-20 23:24:02,997 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336546409] [2021-11-20 23:24:02,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:24:02,998 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-11-20 23:24:02,998 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:24:02,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-20 23:24:02,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2021-11-20 23:24:02,998 INFO L87 Difference]: Start difference. First operand 405 states and 1343 transitions. Second operand has 23 states, 22 states have (on average 2.6818181818181817) internal successors, (59), 22 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-20 23:24:03,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:24:03,497 INFO L93 Difference]: Finished difference Result 457 states and 1491 transitions. [2021-11-20 23:24:03,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-20 23:24:03,497 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.6818181818181817) internal successors, (59), 22 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 28 [2021-11-20 23:24:03,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:24:03,498 INFO L225 Difference]: With dead ends: 457 [2021-11-20 23:24:03,499 INFO L226 Difference]: Without dead ends: 451 [2021-11-20 23:24:03,499 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=173, Invalid=639, Unknown=0, NotChecked=0, Total=812 [2021-11-20 23:24:03,499 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 46 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 23:24:03,499 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 48 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 333 Invalid, 0 Unknown, 105 Unchecked, 0.3s Time] [2021-11-20 23:24:03,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2021-11-20 23:24:03,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 403. [2021-11-20 23:24:03,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 402 states have (on average 3.325870646766169) internal successors, (1337), 402 states have internal predecessors, (1337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:24:03,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 1337 transitions. [2021-11-20 23:24:03,507 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 1337 transitions. Word has length 28 [2021-11-20 23:24:03,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:24:03,507 INFO L470 AbstractCegarLoop]: Abstraction has 403 states and 1337 transitions. [2021-11-20 23:24:03,507 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.6818181818181817) internal successors, (59), 22 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-20 23:24:03,507 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 1337 transitions. [2021-11-20 23:24:03,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:24:03,508 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:24:03,508 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:24:03,532 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Forceful destruction successful, exit code 0 [2021-11-20 23:24:03,708 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 77 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable79 [2021-11-20 23:24:03,709 INFO L402 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:24:03,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:24:03,709 INFO L85 PathProgramCache]: Analyzing trace with hash -419675445, now seen corresponding path program 74 times [2021-11-20 23:24:03,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:24:03,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658520384] [2021-11-20 23:24:03,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:24:03,710 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:24:03,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:24:04,718 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:24:04,718 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:24:04,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658520384] [2021-11-20 23:24:04,718 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658520384] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:24:04,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569832330] [2021-11-20 23:24:04,718 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 23:24:04,718 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:24:04,719 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:24:04,719 INFO L229 MonitoredProcess]: Starting monitored process 78 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:24:04,720 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2021-11-20 23:24:04,837 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-20 23:24:04,837 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:24:04,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 86 conjunts are in the unsatisfiable core [2021-11-20 23:24:04,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:24:04,899 INFO L354 Elim1Store]: treesize reduction 93, result has 14.7 percent of original size [2021-11-20 23:24:04,900 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 21 [2021-11-20 23:24:05,029 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-20 23:24:05,030 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-20 23:24:05,156 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-11-20 23:24:05,156 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-11-20 23:24:05,648 INFO L354 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2021-11-20 23:24:05,648 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 39 [2021-11-20 23:24:06,114 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-11-20 23:24:06,114 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 51 treesize of output 27 [2021-11-20 23:24:06,161 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:24:06,161 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:24:06,359 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:24:06,359 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 195 treesize of output 239 [2021-11-20 23:24:08,599 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:24:08,600 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:24:08,660 INFO L354 Elim1Store]: treesize reduction 46, result has 57.8 percent of original size [2021-11-20 23:24:08,661 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 73 [2021-11-20 23:24:09,370 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:24:09,370 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569832330] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:24:09,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [882600937] [2021-11-20 23:24:09,371 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-20 23:24:09,371 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:24:09,371 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 32 [2021-11-20 23:24:09,371 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646463956] [2021-11-20 23:24:09,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:24:09,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-11-20 23:24:09,372 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:24:09,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-11-20 23:24:09,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=958, Unknown=0, NotChecked=0, Total=1122 [2021-11-20 23:24:09,372 INFO L87 Difference]: Start difference. First operand 403 states and 1337 transitions. Second operand has 34 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 33 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:24:10,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:24:10,703 INFO L93 Difference]: Finished difference Result 453 states and 1483 transitions. [2021-11-20 23:24:10,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-20 23:24:10,704 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 33 states have internal predecessors, (72), 0 states have call successors, (0), 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 28 [2021-11-20 23:24:10,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:24:10,705 INFO L225 Difference]: With dead ends: 453 [2021-11-20 23:24:10,705 INFO L226 Difference]: Without dead ends: 447 [2021-11-20 23:24:10,705 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=340, Invalid=1552, Unknown=0, NotChecked=0, Total=1892 [2021-11-20 23:24:10,706 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 112 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 225 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-20 23:24:10,706 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 54 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 522 Invalid, 0 Unknown, 225 Unchecked, 0.4s Time] [2021-11-20 23:24:10,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2021-11-20 23:24:10,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 396. [2021-11-20 23:24:10,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 395 states have (on average 3.331645569620253) internal successors, (1316), 395 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:24:10,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1316 transitions. [2021-11-20 23:24:10,713 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1316 transitions. Word has length 28 [2021-11-20 23:24:10,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:24:10,714 INFO L470 AbstractCegarLoop]: Abstraction has 396 states and 1316 transitions. [2021-11-20 23:24:10,714 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 33 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:24:10,714 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1316 transitions. [2021-11-20 23:24:10,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:24:10,715 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:24:10,715 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:24:10,737 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Forceful destruction successful, exit code 0 [2021-11-20 23:24:10,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80,78 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:24:10,916 INFO L402 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:24:10,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:24:10,916 INFO L85 PathProgramCache]: Analyzing trace with hash -898386379, now seen corresponding path program 75 times [2021-11-20 23:24:10,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:24:10,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757195528] [2021-11-20 23:24:10,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:24:10,916 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:24:10,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:24:11,405 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:24:11,406 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:24:11,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757195528] [2021-11-20 23:24:11,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757195528] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:24:11,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059697831] [2021-11-20 23:24:11,406 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 23:24:11,406 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:24:11,406 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:24:11,408 INFO L229 MonitoredProcess]: Starting monitored process 79 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:24:11,436 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Waiting until timeout for monitored process [2021-11-20 23:24:11,532 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 23:24:11,532 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:24:11,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 84 conjunts are in the unsatisfiable core [2021-11-20 23:24:11,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:24:11,613 INFO L354 Elim1Store]: treesize reduction 93, result has 14.7 percent of original size [2021-11-20 23:24:11,614 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 21 [2021-11-20 23:24:11,679 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 23:24:11,679 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 14 [2021-11-20 23:24:11,773 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-20 23:24:11,774 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 16 treesize of output 18 [2021-11-20 23:24:12,108 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:24:12,130 INFO L354 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2021-11-20 23:24:12,130 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 39 [2021-11-20 23:24:12,517 INFO L354 Elim1Store]: treesize reduction 29, result has 21.6 percent of original size [2021-11-20 23:24:12,517 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 53 treesize of output 37 [2021-11-20 23:24:12,554 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:24:12,555 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:24:12,719 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:24:12,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 179 treesize of output 219 [2021-11-20 23:24:14,345 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:24:14,345 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:24:14,390 INFO L354 Elim1Store]: treesize reduction 40, result has 58.8 percent of original size [2021-11-20 23:24:14,391 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 67 [2021-11-20 23:24:14,832 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:24:14,833 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059697831] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:24:14,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [649123256] [2021-11-20 23:24:14,833 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-20 23:24:14,833 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:24:14,833 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2021-11-20 23:24:14,834 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109392960] [2021-11-20 23:24:14,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:24:14,834 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-11-20 23:24:14,834 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:24:14,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-11-20 23:24:14,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2021-11-20 23:24:14,834 INFO L87 Difference]: Start difference. First operand 396 states and 1316 transitions. Second operand has 26 states, 25 states have (on average 2.44) internal successors, (61), 25 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-20 23:24:15,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:24:15,146 INFO L93 Difference]: Finished difference Result 477 states and 1573 transitions. [2021-11-20 23:24:15,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-20 23:24:15,147 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.44) internal successors, (61), 25 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 28 [2021-11-20 23:24:15,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:24:15,148 INFO L225 Difference]: With dead ends: 477 [2021-11-20 23:24:15,148 INFO L226 Difference]: Without dead ends: 471 [2021-11-20 23:24:15,148 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=138, Invalid=732, Unknown=0, NotChecked=0, Total=870 [2021-11-20 23:24:15,148 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 53 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 182 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 23:24:15,148 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 69 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 399 Invalid, 0 Unknown, 182 Unchecked, 0.2s Time] [2021-11-20 23:24:15,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2021-11-20 23:24:15,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 384. [2021-11-20 23:24:15,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 383 states have (on average 3.3159268929503916) internal successors, (1270), 383 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:24:15,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1270 transitions. [2021-11-20 23:24:15,158 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1270 transitions. Word has length 28 [2021-11-20 23:24:15,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:24:15,159 INFO L470 AbstractCegarLoop]: Abstraction has 384 states and 1270 transitions. [2021-11-20 23:24:15,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.44) internal successors, (61), 25 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-20 23:24:15,159 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1270 transitions. [2021-11-20 23:24:15,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:24:15,160 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:24:15,160 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:24:15,187 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Ended with exit code 0 [2021-11-20 23:24:15,368 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81,79 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:24:15,369 INFO L402 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:24:15,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:24:15,369 INFO L85 PathProgramCache]: Analyzing trace with hash -816939309, now seen corresponding path program 76 times [2021-11-20 23:24:15,369 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:24:15,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862549742] [2021-11-20 23:24:15,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:24:15,369 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:24:15,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:24:15,714 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:24:15,714 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:24:15,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862549742] [2021-11-20 23:24:15,715 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862549742] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:24:15,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546492184] [2021-11-20 23:24:15,715 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-20 23:24:15,715 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:24:15,715 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:24:15,716 INFO L229 MonitoredProcess]: Starting monitored process 80 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:24:15,716 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Waiting until timeout for monitored process [2021-11-20 23:24:15,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:24:15,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 84 conjunts are in the unsatisfiable core [2021-11-20 23:24:15,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:24:15,826 INFO L354 Elim1Store]: treesize reduction 93, result has 14.7 percent of original size [2021-11-20 23:24:15,826 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 21 [2021-11-20 23:24:15,892 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-20 23:24:15,892 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-20 23:24:15,965 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-20 23:24:15,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 20 treesize of output 22 [2021-11-20 23:24:16,259 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:24:16,280 INFO L354 Elim1Store]: treesize reduction 52, result has 30.7 percent of original size [2021-11-20 23:24:16,280 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 49 [2021-11-20 23:24:16,452 INFO L354 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2021-11-20 23:24:16,452 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 72 treesize of output 56 [2021-11-20 23:24:16,534 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:24:16,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:24:26,212 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((~C~0.offset Int)) (let ((.cse0 (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset)) (.cse1 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (<= (+ c_~csum~0 .cse0 .cse1) (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) ~C~0.offset (+ .cse0 .cse1))) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork2_~i~0#1| 4) c_~A~0.offset)))))) (forall ((~C~0.offset Int)) (let ((.cse2 (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset)) (.cse3 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (<= (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) ~C~0.offset (+ .cse2 .cse3))) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork2_~i~0#1| 4) c_~A~0.offset))) (+ c_~csum~0 .cse2 .cse3))))) is different from false [2021-11-20 23:24:26,270 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:24:26,271 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 126 [2021-11-20 23:24:26,634 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:24:26,656 INFO L354 Elim1Store]: treesize reduction 57, result has 32.9 percent of original size [2021-11-20 23:24:26,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 34 treesize of output 38 [2021-11-20 23:24:26,999 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2021-11-20 23:24:27,000 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546492184] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:24:27,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2060599523] [2021-11-20 23:24:27,000 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-20 23:24:27,000 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:24:27,000 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2021-11-20 23:24:27,001 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560215567] [2021-11-20 23:24:27,001 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:24:27,001 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-11-20 23:24:27,001 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:24:27,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-20 23:24:27,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=425, Unknown=4, NotChecked=42, Total=552 [2021-11-20 23:24:27,002 INFO L87 Difference]: Start difference. First operand 384 states and 1270 transitions. Second operand has 24 states, 23 states have (on average 2.391304347826087) internal successors, (55), 23 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-20 23:24:27,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:24:27,259 INFO L93 Difference]: Finished difference Result 452 states and 1477 transitions. [2021-11-20 23:24:27,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-20 23:24:27,260 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.391304347826087) internal successors, (55), 23 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 28 [2021-11-20 23:24:27,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:24:27,261 INFO L225 Difference]: With dead ends: 452 [2021-11-20 23:24:27,261 INFO L226 Difference]: Without dead ends: 445 [2021-11-20 23:24:27,261 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=127, Invalid=629, Unknown=4, NotChecked=52, Total=812 [2021-11-20 23:24:27,262 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 39 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 202 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 23:24:27,262 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 53 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 191 Invalid, 0 Unknown, 202 Unchecked, 0.1s Time] [2021-11-20 23:24:27,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2021-11-20 23:24:27,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 393. [2021-11-20 23:24:27,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 392 states have (on average 3.308673469387755) internal successors, (1297), 392 states have internal predecessors, (1297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:24:27,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1297 transitions. [2021-11-20 23:24:27,272 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1297 transitions. Word has length 28 [2021-11-20 23:24:27,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:24:27,273 INFO L470 AbstractCegarLoop]: Abstraction has 393 states and 1297 transitions. [2021-11-20 23:24:27,273 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.391304347826087) internal successors, (55), 23 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-20 23:24:27,273 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1297 transitions. [2021-11-20 23:24:27,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:24:27,275 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:24:27,275 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:24:27,310 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Forceful destruction successful, exit code 0 [2021-11-20 23:24:27,500 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82,80 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:24:27,501 INFO L402 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:24:27,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:24:27,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1269658797, now seen corresponding path program 77 times [2021-11-20 23:24:27,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:24:27,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678066831] [2021-11-20 23:24:27,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:24:27,502 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:24:27,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:24:28,234 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:24:28,234 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:24:28,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678066831] [2021-11-20 23:24:28,235 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678066831] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:24:28,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094955398] [2021-11-20 23:24:28,235 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 23:24:28,235 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:24:28,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:24:28,236 INFO L229 MonitoredProcess]: Starting monitored process 81 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:24:28,236 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Waiting until timeout for monitored process [2021-11-20 23:24:28,333 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-20 23:24:28,333 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:24:28,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 82 conjunts are in the unsatisfiable core [2021-11-20 23:24:28,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:24:28,380 INFO L354 Elim1Store]: treesize reduction 93, result has 14.7 percent of original size [2021-11-20 23:24:28,381 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 21 [2021-11-20 23:24:28,479 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 23:24:28,480 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 14 [2021-11-20 23:24:28,576 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 23:24:28,577 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 11 treesize of output 11 [2021-11-20 23:24:28,948 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:24:28,948 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:24:28,977 INFO L354 Elim1Store]: treesize reduction 105, result has 22.2 percent of original size [2021-11-20 23:24:28,978 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 79 treesize of output 64 [2021-11-20 23:24:29,301 INFO L354 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2021-11-20 23:24:29,301 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 72 treesize of output 56 [2021-11-20 23:24:29,358 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:24:29,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:24:50,888 WARN L227 SmtUtils]: Spent 6.11s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-20 23:24:50,932 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:24:50,932 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 126 [2021-11-20 23:24:51,815 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:24:51,841 INFO L354 Elim1Store]: treesize reduction 61, result has 28.2 percent of original size [2021-11-20 23:24:51,841 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 34 treesize of output 34 [2021-11-20 23:24:52,235 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:24:52,235 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094955398] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:24:52,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [949328444] [2021-11-20 23:24:52,235 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-20 23:24:52,236 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:24:52,236 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 27 [2021-11-20 23:24:52,236 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14758503] [2021-11-20 23:24:52,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:24:52,236 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-11-20 23:24:52,236 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:24:52,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-11-20 23:24:52,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=698, Unknown=6, NotChecked=0, Total=812 [2021-11-20 23:24:52,237 INFO L87 Difference]: Start difference. First operand 393 states and 1297 transitions. Second operand has 29 states, 28 states have (on average 2.25) internal successors, (63), 28 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-20 23:24:52,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:24:52,835 INFO L93 Difference]: Finished difference Result 478 states and 1574 transitions. [2021-11-20 23:24:52,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-20 23:24:52,836 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.25) internal successors, (63), 28 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 28 [2021-11-20 23:24:52,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:24:52,837 INFO L225 Difference]: With dead ends: 478 [2021-11-20 23:24:52,837 INFO L226 Difference]: Without dead ends: 471 [2021-11-20 23:24:52,837 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 22.5s TimeCoverageRelationStatistics Valid=200, Invalid=984, Unknown=6, NotChecked=0, Total=1190 [2021-11-20 23:24:52,837 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 109 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 306 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 23:24:52,837 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 55 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 413 Invalid, 0 Unknown, 306 Unchecked, 0.3s Time] [2021-11-20 23:24:52,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2021-11-20 23:24:52,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 351. [2021-11-20 23:24:52,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 350 states have (on average 3.28) internal successors, (1148), 350 states have internal predecessors, (1148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:24:52,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 1148 transitions. [2021-11-20 23:24:52,844 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 1148 transitions. Word has length 28 [2021-11-20 23:24:52,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:24:52,844 INFO L470 AbstractCegarLoop]: Abstraction has 351 states and 1148 transitions. [2021-11-20 23:24:52,844 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.25) internal successors, (63), 28 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-20 23:24:52,844 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 1148 transitions. [2021-11-20 23:24:52,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:24:52,845 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:24:52,845 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:24:52,866 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Forceful destruction successful, exit code 0 [2021-11-20 23:24:53,045 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83,81 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:24:53,046 INFO L402 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:24:53,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:24:53,047 INFO L85 PathProgramCache]: Analyzing trace with hash -654080167, now seen corresponding path program 78 times [2021-11-20 23:24:53,047 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:24:53,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589056557] [2021-11-20 23:24:53,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:24:53,048 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:24:53,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:24:53,400 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:24:53,400 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:24:53,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589056557] [2021-11-20 23:24:53,400 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589056557] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:24:53,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021503545] [2021-11-20 23:24:53,401 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 23:24:53,401 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:24:53,401 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:24:53,402 INFO L229 MonitoredProcess]: Starting monitored process 82 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:24:53,403 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Waiting until timeout for monitored process [2021-11-20 23:24:53,486 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 23:24:53,487 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:24:53,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 72 conjunts are in the unsatisfiable core [2021-11-20 23:24:53,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:24:53,986 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-11-20 23:24:53,986 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 41 treesize of output 29 [2021-11-20 23:24:54,003 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:24:54,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:24:55,820 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:24:55,820 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 119 [2021-11-20 23:24:56,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:56,148 INFO L354 Elim1Store]: treesize reduction 69, result has 28.9 percent of original size [2021-11-20 23:24:56,149 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 38 [2021-11-20 23:24:56,306 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:24:56,306 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1021503545] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:24:56,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [802563661] [2021-11-20 23:24:56,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-20 23:24:56,307 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:24:56,307 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 6] total 14 [2021-11-20 23:24:56,307 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004765333] [2021-11-20 23:24:56,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:24:56,307 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-20 23:24:56,307 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:24:56,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-20 23:24:56,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2021-11-20 23:24:56,308 INFO L87 Difference]: Start difference. First operand 351 states and 1148 transitions. Second operand has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 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-20 23:24:56,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:24:56,779 INFO L93 Difference]: Finished difference Result 425 states and 1370 transitions. [2021-11-20 23:24:56,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-20 23:24:56,779 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 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 28 [2021-11-20 23:24:56,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:24:56,780 INFO L225 Difference]: With dead ends: 425 [2021-11-20 23:24:56,780 INFO L226 Difference]: Without dead ends: 419 [2021-11-20 23:24:56,781 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 44 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2021-11-20 23:24:56,781 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 45 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 64 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-20 23:24:56,781 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 34 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 557 Invalid, 0 Unknown, 64 Unchecked, 0.4s Time] [2021-11-20 23:24:56,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2021-11-20 23:24:56,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 345. [2021-11-20 23:24:56,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 344 states have (on average 3.2790697674418605) internal successors, (1128), 344 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:24:56,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1128 transitions. [2021-11-20 23:24:56,787 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 1128 transitions. Word has length 28 [2021-11-20 23:24:56,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:24:56,787 INFO L470 AbstractCegarLoop]: Abstraction has 345 states and 1128 transitions. [2021-11-20 23:24:56,788 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 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-20 23:24:56,788 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 1128 transitions. [2021-11-20 23:24:56,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:24:56,789 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:24:56,789 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:24:56,811 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Forceful destruction successful, exit code 0 [2021-11-20 23:24:56,989 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 82 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable84 [2021-11-20 23:24:56,990 INFO L402 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:24:56,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:24:56,990 INFO L85 PathProgramCache]: Analyzing trace with hash 436299075, now seen corresponding path program 79 times [2021-11-20 23:24:56,990 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:24:56,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507106049] [2021-11-20 23:24:56,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:24:56,991 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:24:57,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:24:57,925 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:24:57,925 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:24:57,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507106049] [2021-11-20 23:24:57,925 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507106049] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:24:57,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225612432] [2021-11-20 23:24:57,925 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-20 23:24:57,926 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:24:57,926 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:24:57,927 INFO L229 MonitoredProcess]: Starting monitored process 83 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:24:57,928 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Waiting until timeout for monitored process [2021-11-20 23:24:58,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:24:58,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 86 conjunts are in the unsatisfiable core [2021-11-20 23:24:58,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:24:58,057 INFO L354 Elim1Store]: treesize reduction 93, result has 14.7 percent of original size [2021-11-20 23:24:58,057 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 21 [2021-11-20 23:24:58,164 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-20 23:24:58,165 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-20 23:24:58,265 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-11-20 23:24:58,265 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-11-20 23:24:58,676 INFO L354 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2021-11-20 23:24:58,676 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 39 [2021-11-20 23:24:58,912 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-11-20 23:24:58,913 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 51 treesize of output 27 [2021-11-20 23:24:58,967 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:24:58,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:24:59,174 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:24:59,174 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 195 treesize of output 239 [2021-11-20 23:25:01,640 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:25:01,640 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:25:01,688 INFO L354 Elim1Store]: treesize reduction 46, result has 57.8 percent of original size [2021-11-20 23:25:01,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 42 treesize of output 73 [2021-11-20 23:25:02,342 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:25:02,342 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1225612432] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:25:02,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [926590992] [2021-11-20 23:25:02,342 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-20 23:25:02,342 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:25:02,343 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 32 [2021-11-20 23:25:02,343 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533203824] [2021-11-20 23:25:02,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:25:02,343 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-11-20 23:25:02,343 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:25:02,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-11-20 23:25:02,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=958, Unknown=0, NotChecked=0, Total=1122 [2021-11-20 23:25:02,344 INFO L87 Difference]: Start difference. First operand 345 states and 1128 transitions. Second operand has 34 states, 33 states have (on average 2.0) internal successors, (66), 33 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-20 23:25:03,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:25:03,576 INFO L93 Difference]: Finished difference Result 394 states and 1280 transitions. [2021-11-20 23:25:03,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-20 23:25:03,577 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.0) internal successors, (66), 33 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 28 [2021-11-20 23:25:03,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:25:03,578 INFO L225 Difference]: With dead ends: 394 [2021-11-20 23:25:03,578 INFO L226 Difference]: Without dead ends: 388 [2021-11-20 23:25:03,578 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=340, Invalid=1552, Unknown=0, NotChecked=0, Total=1892 [2021-11-20 23:25:03,578 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 111 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 82 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 23:25:03,578 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 52 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 503 Invalid, 0 Unknown, 82 Unchecked, 0.3s Time] [2021-11-20 23:25:03,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2021-11-20 23:25:03,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 346. [2021-11-20 23:25:03,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 345 states have (on average 3.2840579710144926) internal successors, (1133), 345 states have internal predecessors, (1133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:25:03,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 1133 transitions. [2021-11-20 23:25:03,585 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 1133 transitions. Word has length 28 [2021-11-20 23:25:03,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:25:03,585 INFO L470 AbstractCegarLoop]: Abstraction has 346 states and 1133 transitions. [2021-11-20 23:25:03,585 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.0) internal successors, (66), 33 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-20 23:25:03,585 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 1133 transitions. [2021-11-20 23:25:03,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:25:03,586 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:25:03,586 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:25:03,610 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Forceful destruction successful, exit code 0 [2021-11-20 23:25:03,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 83 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable85 [2021-11-20 23:25:03,787 INFO L402 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:25:03,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:25:03,787 INFO L85 PathProgramCache]: Analyzing trace with hash -986078581, now seen corresponding path program 80 times [2021-11-20 23:25:03,787 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:25:03,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324200756] [2021-11-20 23:25:03,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:25:03,788 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:25:03,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:25:04,555 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:25:04,555 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:25:04,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324200756] [2021-11-20 23:25:04,556 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324200756] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:25:04,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836997647] [2021-11-20 23:25:04,556 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 23:25:04,556 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:25:04,557 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:25:04,557 INFO L229 MonitoredProcess]: Starting monitored process 84 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:25:04,558 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Waiting until timeout for monitored process [2021-11-20 23:25:04,650 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-11-20 23:25:04,650 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:25:04,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 86 conjunts are in the unsatisfiable core [2021-11-20 23:25:04,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:25:04,689 INFO L354 Elim1Store]: treesize reduction 93, result has 14.7 percent of original size [2021-11-20 23:25:04,689 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 21 [2021-11-20 23:25:04,762 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-20 23:25:04,763 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-20 23:25:04,843 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-11-20 23:25:04,844 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-11-20 23:25:05,251 INFO L354 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2021-11-20 23:25:05,251 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 39 [2021-11-20 23:25:05,533 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-11-20 23:25:05,533 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 51 treesize of output 27 [2021-11-20 23:25:05,578 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:25:05,578 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:25:05,732 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:25:05,732 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 195 treesize of output 239 [2021-11-20 23:25:07,768 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:25:07,769 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:25:07,822 INFO L354 Elim1Store]: treesize reduction 46, result has 57.8 percent of original size [2021-11-20 23:25:07,822 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 42 treesize of output 73 [2021-11-20 23:25:08,559 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:25:08,559 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836997647] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:25:08,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [57419102] [2021-11-20 23:25:08,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-20 23:25:08,560 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:25:08,560 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 32 [2021-11-20 23:25:08,560 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418281944] [2021-11-20 23:25:08,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:25:08,561 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-11-20 23:25:08,561 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:25:08,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-11-20 23:25:08,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=958, Unknown=0, NotChecked=0, Total=1122 [2021-11-20 23:25:08,561 INFO L87 Difference]: Start difference. First operand 346 states and 1133 transitions. Second operand has 34 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 33 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-20 23:25:09,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:25:09,583 INFO L93 Difference]: Finished difference Result 441 states and 1411 transitions. [2021-11-20 23:25:09,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-20 23:25:09,583 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 33 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 28 [2021-11-20 23:25:09,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:25:09,584 INFO L225 Difference]: With dead ends: 441 [2021-11-20 23:25:09,584 INFO L226 Difference]: Without dead ends: 435 [2021-11-20 23:25:09,584 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=389, Invalid=1773, Unknown=0, NotChecked=0, Total=2162 [2021-11-20 23:25:09,584 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 131 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 279 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 23:25:09,584 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 70 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 547 Invalid, 0 Unknown, 279 Unchecked, 0.3s Time] [2021-11-20 23:25:09,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2021-11-20 23:25:09,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 338. [2021-11-20 23:25:09,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 337 states have (on average 3.264094955489614) internal successors, (1100), 337 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:25:09,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 1100 transitions. [2021-11-20 23:25:09,590 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 1100 transitions. Word has length 28 [2021-11-20 23:25:09,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:25:09,590 INFO L470 AbstractCegarLoop]: Abstraction has 338 states and 1100 transitions. [2021-11-20 23:25:09,591 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 33 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-20 23:25:09,591 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 1100 transitions. [2021-11-20 23:25:09,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:25:09,591 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:25:09,592 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:25:09,614 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Forceful destruction successful, exit code 0 [2021-11-20 23:25:09,792 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86,84 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:25:09,795 INFO L402 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:25:09,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:25:09,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1832128145, now seen corresponding path program 81 times [2021-11-20 23:25:09,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:25:09,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515462175] [2021-11-20 23:25:09,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:25:09,796 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:25:09,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:25:10,206 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:25:10,206 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:25:10,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515462175] [2021-11-20 23:25:10,206 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515462175] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:25:10,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801675563] [2021-11-20 23:25:10,206 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 23:25:10,206 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:25:10,206 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:25:10,208 INFO L229 MonitoredProcess]: Starting monitored process 85 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:25:10,210 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Waiting until timeout for monitored process [2021-11-20 23:25:10,286 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 23:25:10,286 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:25:10,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 72 conjunts are in the unsatisfiable core [2021-11-20 23:25:10,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:25:10,750 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-11-20 23:25:10,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 41 treesize of output 29 [2021-11-20 23:25:10,766 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:25:10,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:25:15,154 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:25:15,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 38 treesize of output 107 [2021-11-20 23:25:15,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:15,391 INFO L354 Elim1Store]: treesize reduction 69, result has 22.5 percent of original size [2021-11-20 23:25:15,392 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 38 treesize of output 30 [2021-11-20 23:25:15,509 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:25:15,510 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801675563] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:25:15,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [545366050] [2021-11-20 23:25:15,510 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-20 23:25:15,511 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:25:15,511 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 6] total 14 [2021-11-20 23:25:15,511 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030752614] [2021-11-20 23:25:15,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:25:15,511 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-20 23:25:15,511 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:25:15,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-20 23:25:15,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=190, Unknown=1, NotChecked=0, Total=240 [2021-11-20 23:25:15,512 INFO L87 Difference]: Start difference. First operand 338 states and 1100 transitions. Second operand has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 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-20 23:25:15,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:25:15,742 INFO L93 Difference]: Finished difference Result 395 states and 1282 transitions. [2021-11-20 23:25:15,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-20 23:25:15,742 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 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 28 [2021-11-20 23:25:15,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:25:15,743 INFO L225 Difference]: With dead ends: 395 [2021-11-20 23:25:15,743 INFO L226 Difference]: Without dead ends: 388 [2021-11-20 23:25:15,743 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 44 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=76, Invalid=265, Unknown=1, NotChecked=0, Total=342 [2021-11-20 23:25:15,743 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 55 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 117 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 23:25:15,744 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 30 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 220 Invalid, 0 Unknown, 117 Unchecked, 0.2s Time] [2021-11-20 23:25:15,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2021-11-20 23:25:15,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 346. [2021-11-20 23:25:15,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 345 states have (on average 3.2695652173913046) internal successors, (1128), 345 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:25:15,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 1128 transitions. [2021-11-20 23:25:15,750 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 1128 transitions. Word has length 28 [2021-11-20 23:25:15,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:25:15,750 INFO L470 AbstractCegarLoop]: Abstraction has 346 states and 1128 transitions. [2021-11-20 23:25:15,750 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 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-20 23:25:15,750 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 1128 transitions. [2021-11-20 23:25:15,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:25:15,751 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:25:15,752 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:25:15,776 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Forceful destruction successful, exit code 0 [2021-11-20 23:25:15,956 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87,85 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:25:15,957 INFO L402 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:25:15,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:25:15,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1791536725, now seen corresponding path program 82 times [2021-11-20 23:25:15,957 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:25:15,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192476565] [2021-11-20 23:25:15,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:25:15,957 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:25:15,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:25:16,602 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:25:16,602 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:25:16,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192476565] [2021-11-20 23:25:16,602 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192476565] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:25:16,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355971490] [2021-11-20 23:25:16,602 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-20 23:25:16,602 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:25:16,602 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:25:16,603 INFO L229 MonitoredProcess]: Starting monitored process 86 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:25:16,605 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Waiting until timeout for monitored process [2021-11-20 23:25:16,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:25:16,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 84 conjunts are in the unsatisfiable core [2021-11-20 23:25:16,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:25:16,719 INFO L354 Elim1Store]: treesize reduction 93, result has 14.7 percent of original size [2021-11-20 23:25:16,719 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 21 [2021-11-20 23:25:16,797 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-20 23:25:16,797 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-20 23:25:16,876 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-20 23:25:16,876 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 20 treesize of output 22 [2021-11-20 23:25:17,202 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:25:17,203 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:25:17,235 INFO L354 Elim1Store]: treesize reduction 101, result has 25.2 percent of original size [2021-11-20 23:25:17,235 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 79 treesize of output 68 [2021-11-20 23:25:17,425 INFO L354 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2021-11-20 23:25:17,425 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 72 treesize of output 56 [2021-11-20 23:25:17,489 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:25:17,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:25:19,388 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((~C~0.offset Int)) (let ((.cse0 (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) (let ((.cse1 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse0))) (.cse2 (select (select |c_#memory_int| c_~B~0.base) (+ c_~B~0.offset .cse0)))) (<= (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) (+ ~C~0.offset .cse0) (+ .cse1 .cse2))) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork2_~i~0#1| 4) c_~A~0.offset))) (+ c_~csum~0 .cse1 .cse2))))) (forall ((~C~0.offset Int)) (let ((.cse5 (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) (let ((.cse3 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse5))) (.cse4 (select (select |c_#memory_int| c_~B~0.base) (+ c_~B~0.offset .cse5)))) (<= (+ c_~csum~0 .cse3 .cse4) (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) (+ ~C~0.offset .cse5) (+ .cse3 .cse4))) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork2_~i~0#1| 4) c_~A~0.offset)))))))) is different from false [2021-11-20 23:25:25,136 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:25:25,137 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 78 treesize of output 138 [2021-11-20 23:25:26,010 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:25:26,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:26,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:26,030 INFO L354 Elim1Store]: treesize reduction 27, result has 37.2 percent of original size [2021-11-20 23:25:26,030 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 38 treesize of output 24 [2021-11-20 23:25:26,414 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2021-11-20 23:25:26,414 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355971490] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:25:26,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [345507302] [2021-11-20 23:25:26,415 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-20 23:25:26,416 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:25:26,417 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 27 [2021-11-20 23:25:26,417 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309653894] [2021-11-20 23:25:26,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:25:26,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-11-20 23:25:26,418 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:25:26,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-11-20 23:25:26,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=650, Unknown=1, NotChecked=52, Total=812 [2021-11-20 23:25:26,418 INFO L87 Difference]: Start difference. First operand 346 states and 1128 transitions. Second operand has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 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-20 23:25:27,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:25:27,132 INFO L93 Difference]: Finished difference Result 431 states and 1394 transitions. [2021-11-20 23:25:27,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-20 23:25:27,133 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 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 28 [2021-11-20 23:25:27,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:25:27,134 INFO L225 Difference]: With dead ends: 431 [2021-11-20 23:25:27,134 INFO L226 Difference]: Without dead ends: 424 [2021-11-20 23:25:27,134 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=221, Invalid=1188, Unknown=1, NotChecked=72, Total=1482 [2021-11-20 23:25:27,134 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 80 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 347 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 23:25:27,134 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 87 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 468 Invalid, 0 Unknown, 347 Unchecked, 0.3s Time] [2021-11-20 23:25:27,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2021-11-20 23:25:27,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 342. [2021-11-20 23:25:27,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 341 states have (on average 3.2668621700879767) internal successors, (1114), 341 states have internal predecessors, (1114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:25:27,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 1114 transitions. [2021-11-20 23:25:27,144 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 1114 transitions. Word has length 28 [2021-11-20 23:25:27,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:25:27,145 INFO L470 AbstractCegarLoop]: Abstraction has 342 states and 1114 transitions. [2021-11-20 23:25:27,145 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 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-20 23:25:27,145 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 1114 transitions. [2021-11-20 23:25:27,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:25:27,146 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:25:27,146 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:25:27,181 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Forceful destruction successful, exit code 0 [2021-11-20 23:25:27,360 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 86 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable88 [2021-11-20 23:25:27,361 INFO L402 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:25:27,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:25:27,361 INFO L85 PathProgramCache]: Analyzing trace with hash -690022697, now seen corresponding path program 83 times [2021-11-20 23:25:27,361 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:25:27,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605954818] [2021-11-20 23:25:27,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:25:27,362 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:25:27,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:25:27,808 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:25:27,812 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:25:27,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605954818] [2021-11-20 23:25:27,813 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605954818] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:25:27,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607485698] [2021-11-20 23:25:27,813 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 23:25:27,813 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:25:27,813 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:25:27,814 INFO L229 MonitoredProcess]: Starting monitored process 87 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:25:27,817 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Waiting until timeout for monitored process [2021-11-20 23:25:27,896 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-20 23:25:27,896 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:25:27,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 82 conjunts are in the unsatisfiable core [2021-11-20 23:25:27,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:25:27,941 INFO L354 Elim1Store]: treesize reduction 93, result has 14.7 percent of original size [2021-11-20 23:25:27,941 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 21 [2021-11-20 23:25:27,986 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 23:25:27,986 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 14 [2021-11-20 23:25:28,037 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 23:25:28,037 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 11 treesize of output 11 [2021-11-20 23:25:28,334 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:25:28,355 INFO L354 Elim1Store]: treesize reduction 52, result has 30.7 percent of original size [2021-11-20 23:25:28,355 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 49 [2021-11-20 23:25:28,761 INFO L354 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2021-11-20 23:25:28,762 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 72 treesize of output 56 [2021-11-20 23:25:28,834 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:25:28,834 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:25:30,763 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((~C~0.offset Int)) (let ((.cse2 (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse2))) (.cse1 (select (select |c_#memory_int| c_~B~0.base) (+ c_~B~0.offset .cse2)))) (<= (+ c_~csum~0 .cse0 .cse1) (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) (+ ~C~0.offset .cse2) (+ .cse0 .cse1))) c_~A~0.base) c_~A~0.offset)))))) (forall ((~C~0.offset Int)) (let ((.cse3 (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) (let ((.cse4 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse3))) (.cse5 (select (select |c_#memory_int| c_~B~0.base) (+ c_~B~0.offset .cse3)))) (<= (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) (+ ~C~0.offset .cse3) (+ .cse4 .cse5))) c_~A~0.base) c_~A~0.offset)) (+ c_~csum~0 .cse4 .cse5)))))) is different from false [2021-11-20 23:25:30,812 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:25:30,812 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 78 treesize of output 138 [2021-11-20 23:25:31,529 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:25:31,551 INFO L354 Elim1Store]: treesize reduction 77, result has 20.6 percent of original size [2021-11-20 23:25:31,552 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 30 [2021-11-20 23:25:31,840 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2021-11-20 23:25:31,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607485698] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:25:31,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2142021005] [2021-11-20 23:25:31,841 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-20 23:25:31,841 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:25:31,841 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2021-11-20 23:25:31,841 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296992713] [2021-11-20 23:25:31,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:25:31,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-11-20 23:25:31,842 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:25:31,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-20 23:25:31,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=386, Unknown=1, NotChecked=40, Total=506 [2021-11-20 23:25:31,843 INFO L87 Difference]: Start difference. First operand 342 states and 1114 transitions. Second operand has 23 states, 22 states have (on average 2.409090909090909) internal successors, (53), 22 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-20 23:25:32,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:25:32,238 INFO L93 Difference]: Finished difference Result 413 states and 1350 transitions. [2021-11-20 23:25:32,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-20 23:25:32,239 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.409090909090909) internal successors, (53), 22 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 28 [2021-11-20 23:25:32,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:25:32,239 INFO L225 Difference]: With dead ends: 413 [2021-11-20 23:25:32,240 INFO L226 Difference]: Without dead ends: 406 [2021-11-20 23:25:32,240 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 38 SyntacticMatches, 6 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=132, Invalid=573, Unknown=1, NotChecked=50, Total=756 [2021-11-20 23:25:32,240 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 40 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 127 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 23:25:32,240 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 73 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 428 Invalid, 0 Unknown, 127 Unchecked, 0.2s Time] [2021-11-20 23:25:32,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2021-11-20 23:25:32,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 346. [2021-11-20 23:25:32,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 345 states have (on average 3.260869565217391) internal successors, (1125), 345 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:25:32,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 1125 transitions. [2021-11-20 23:25:32,250 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 1125 transitions. Word has length 28 [2021-11-20 23:25:32,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:25:32,251 INFO L470 AbstractCegarLoop]: Abstraction has 346 states and 1125 transitions. [2021-11-20 23:25:32,251 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.409090909090909) internal successors, (53), 22 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-20 23:25:32,251 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 1125 transitions. [2021-11-20 23:25:32,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:25:32,252 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:25:32,252 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:25:32,291 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Forceful destruction successful, exit code 0 [2021-11-20 23:25:32,472 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89,87 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:25:32,472 INFO L402 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 23:25:32,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:25:32,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1919661719, now seen corresponding path program 84 times [2021-11-20 23:25:32,473 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:25:32,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756851068] [2021-11-20 23:25:32,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:25:32,473 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:25:32,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:25:33,132 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:25:33,132 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:25:33,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756851068] [2021-11-20 23:25:33,132 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756851068] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:25:33,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658968600] [2021-11-20 23:25:33,132 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 23:25:33,132 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:25:33,132 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:25:33,133 INFO L229 MonitoredProcess]: Starting monitored process 88 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:25:33,134 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f57cfc86-13e7-458d-b6e5-5aff7ec8c6ba/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Waiting until timeout for monitored process [2021-11-20 23:25:33,207 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 23:25:33,207 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:25:33,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 84 conjunts are in the unsatisfiable core [2021-11-20 23:25:33,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:25:33,242 INFO L354 Elim1Store]: treesize reduction 93, result has 14.7 percent of original size [2021-11-20 23:25:33,243 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 21 [2021-11-20 23:25:33,321 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-20 23:25:33,321 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-20 23:25:33,394 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-20 23:25:33,395 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 20 treesize of output 22 [2021-11-20 23:25:33,669 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:25:33,697 INFO L354 Elim1Store]: treesize reduction 93, result has 21.8 percent of original size [2021-11-20 23:25:33,697 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 60 [2021-11-20 23:25:36,008 INFO L354 Elim1Store]: treesize reduction 41, result has 36.9 percent of original size [2021-11-20 23:25:36,008 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 72 treesize of output 59 [2021-11-20 23:25:36,073 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:25:36,073 INFO L328 TraceCheckSpWp]: Computing backward predicates...