./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/parallel-parallel-sum-equiv.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/parallel-parallel-sum-equiv.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d721a74d879c75d156b7dfbd9383140c70ef6831602ea84a0f8988cd7fdc0c32 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-11-25 20:38:44,203 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-25 20:38:44,206 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-25 20:38:44,261 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-25 20:38:44,262 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-25 20:38:44,266 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-25 20:38:44,267 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-25 20:38:44,271 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-25 20:38:44,274 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-25 20:38:44,280 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-25 20:38:44,281 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-25 20:38:44,283 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-25 20:38:44,283 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-25 20:38:44,286 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-25 20:38:44,288 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-25 20:38:44,292 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-25 20:38:44,294 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-25 20:38:44,295 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-25 20:38:44,297 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-25 20:38:44,304 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-25 20:38:44,306 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-25 20:38:44,308 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-25 20:38:44,311 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-25 20:38:44,312 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-25 20:38:44,321 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-25 20:38:44,322 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-25 20:38:44,322 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-25 20:38:44,324 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-25 20:38:44,325 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-25 20:38:44,326 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-25 20:38:44,327 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-25 20:38:44,327 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-25 20:38:44,330 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-25 20:38:44,331 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-25 20:38:44,333 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-25 20:38:44,333 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-25 20:38:44,334 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-25 20:38:44,334 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-25 20:38:44,334 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-25 20:38:44,335 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-25 20:38:44,336 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-25 20:38:44,337 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-25 20:38:44,386 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-25 20:38:44,387 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-25 20:38:44,387 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-25 20:38:44,388 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-25 20:38:44,388 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-25 20:38:44,395 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-25 20:38:44,395 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-25 20:38:44,395 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-25 20:38:44,395 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-25 20:38:44,396 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-25 20:38:44,397 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-25 20:38:44,397 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-25 20:38:44,397 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-25 20:38:44,397 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-25 20:38:44,397 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-25 20:38:44,398 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-25 20:38:44,398 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-25 20:38:44,398 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-25 20:38:44,399 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-25 20:38:44,400 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-25 20:38:44,400 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-25 20:38:44,400 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-25 20:38:44,400 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-25 20:38:44,400 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-25 20:38:44,400 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-25 20:38:44,401 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-25 20:38:44,402 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-25 20:38:44,402 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-25 20:38:44,403 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-25 20:38:44,403 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-25 20:38:44,403 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-25 20:38:44,403 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-25 20:38:44,404 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 20:38:44,404 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-25 20:38:44,404 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-25 20:38:44,404 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-25 20:38:44,404 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-25 20:38:44,405 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-25 20:38:44,405 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-25 20:38:44,405 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-25 20:38:44,405 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-25 20:38:44,405 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_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d721a74d879c75d156b7dfbd9383140c70ef6831602ea84a0f8988cd7fdc0c32 [2021-11-25 20:38:44,675 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-25 20:38:44,696 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-25 20:38:44,698 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-25 20:38:44,699 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-25 20:38:44,700 INFO L275 PluginConnector]: CDTParser initialized [2021-11-25 20:38:44,701 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/../../sv-benchmarks/c/weaver/parallel-parallel-sum-equiv.wvr.c [2021-11-25 20:38:44,779 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/data/6232399a7/75238b9cb74a40d4a54c91041ca2c840/FLAG3ffcf039d [2021-11-25 20:38:45,387 INFO L306 CDTParser]: Found 1 translation units. [2021-11-25 20:38:45,389 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/sv-benchmarks/c/weaver/parallel-parallel-sum-equiv.wvr.c [2021-11-25 20:38:45,403 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/data/6232399a7/75238b9cb74a40d4a54c91041ca2c840/FLAG3ffcf039d [2021-11-25 20:38:45,707 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/data/6232399a7/75238b9cb74a40d4a54c91041ca2c840 [2021-11-25 20:38:45,709 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-25 20:38:45,711 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-25 20:38:45,716 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-25 20:38:45,717 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-25 20:38:45,728 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-25 20:38:45,728 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:38:45" (1/1) ... [2021-11-25 20:38:45,729 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31d7d8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:38:45, skipping insertion in model container [2021-11-25 20:38:45,730 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:38:45" (1/1) ... [2021-11-25 20:38:45,737 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-25 20:38:45,775 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-25 20:38:46,001 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_9cb546b6-2612-4067-a4c7-3efb4ec796cc/sv-benchmarks/c/weaver/parallel-parallel-sum-equiv.wvr.c[3770,3783] [2021-11-25 20:38:46,025 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 20:38:46,041 INFO L203 MainTranslator]: Completed pre-run [2021-11-25 20:38:46,093 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_9cb546b6-2612-4067-a4c7-3efb4ec796cc/sv-benchmarks/c/weaver/parallel-parallel-sum-equiv.wvr.c[3770,3783] [2021-11-25 20:38:46,109 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 20:38:46,141 INFO L208 MainTranslator]: Completed translation [2021-11-25 20:38:46,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:38:46 WrapperNode [2021-11-25 20:38:46,142 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-25 20:38:46,143 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-25 20:38:46,143 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-25 20:38:46,144 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-25 20:38:46,153 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:38:46" (1/1) ... [2021-11-25 20:38:46,182 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:38:46" (1/1) ... [2021-11-25 20:38:46,229 INFO L137 Inliner]: procedures = 27, calls = 73, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 245 [2021-11-25 20:38:46,230 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-25 20:38:46,232 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-25 20:38:46,232 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-25 20:38:46,232 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-25 20:38:46,240 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:38:46" (1/1) ... [2021-11-25 20:38:46,241 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:38:46" (1/1) ... [2021-11-25 20:38:46,256 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:38:46" (1/1) ... [2021-11-25 20:38:46,257 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:38:46" (1/1) ... [2021-11-25 20:38:46,271 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:38:46" (1/1) ... [2021-11-25 20:38:46,276 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:38:46" (1/1) ... [2021-11-25 20:38:46,278 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:38:46" (1/1) ... [2021-11-25 20:38:46,282 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-25 20:38:46,283 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-25 20:38:46,283 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-25 20:38:46,284 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-25 20:38:46,285 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:38:46" (1/1) ... [2021-11-25 20:38:46,296 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 20:38:46,312 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:38:46,326 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-25 20:38:46,338 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-25 20:38:46,384 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-25 20:38:46,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-25 20:38:46,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-25 20:38:46,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-25 20:38:46,385 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-11-25 20:38:46,386 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-11-25 20:38:46,386 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-11-25 20:38:46,386 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-11-25 20:38:46,386 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-11-25 20:38:46,387 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-11-25 20:38:46,387 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2021-11-25 20:38:46,387 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2021-11-25 20:38:46,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-25 20:38:46,387 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-11-25 20:38:46,388 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-11-25 20:38:46,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-25 20:38:46,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-25 20:38:46,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-25 20:38:46,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-25 20:38:46,390 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-11-25 20:38:46,488 INFO L236 CfgBuilder]: Building ICFG [2021-11-25 20:38:46,489 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-25 20:38:46,992 INFO L277 CfgBuilder]: Performing block encoding [2021-11-25 20:38:47,171 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-25 20:38:47,174 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-25 20:38:47,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:38:47 BoogieIcfgContainer [2021-11-25 20:38:47,178 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-25 20:38:47,180 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-25 20:38:47,180 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-25 20:38:47,185 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-25 20:38:47,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:38:45" (1/3) ... [2021-11-25 20:38:47,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6df2f0a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:38:47, skipping insertion in model container [2021-11-25 20:38:47,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:38:46" (2/3) ... [2021-11-25 20:38:47,187 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6df2f0a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:38:47, skipping insertion in model container [2021-11-25 20:38:47,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:38:47" (3/3) ... [2021-11-25 20:38:47,189 INFO L111 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-equiv.wvr.c [2021-11-25 20:38:47,195 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-25 20:38:47,195 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-25 20:38:47,195 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-25 20:38:47,196 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-25 20:38:47,279 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,279 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,279 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,279 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,280 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,280 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,280 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,280 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,281 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,281 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,281 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,281 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,290 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,290 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,291 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,291 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,291 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,291 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,291 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,292 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,292 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,292 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,292 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,292 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,292 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,293 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,293 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,293 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,293 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,293 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,293 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,294 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,294 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,294 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,294 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,294 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,294 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,294 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,303 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,303 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,303 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,304 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,304 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,304 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,304 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,304 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,305 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,305 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,305 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,305 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,305 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,306 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,306 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,306 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,306 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,306 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,322 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,323 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,323 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,323 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,323 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,324 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,325 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,325 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,325 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,326 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,326 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,327 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,328 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,329 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,330 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,330 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,330 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,330 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,331 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,332 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,332 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,332 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,332 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,333 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,334 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,334 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,334 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,334 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,335 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,335 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,336 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,336 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,337 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,337 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,337 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,337 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,338 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,338 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,338 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,338 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,339 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,339 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,339 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,339 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,339 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,339 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,340 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,340 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,340 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,342 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,342 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,342 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,343 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,343 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,343 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,343 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,344 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,344 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,344 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,344 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,345 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,345 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,345 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,345 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,345 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,345 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,346 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,346 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,346 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,346 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,346 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,347 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,347 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,347 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,347 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,348 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,348 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,348 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,348 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,348 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,349 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,349 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,349 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,349 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,349 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,349 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,350 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,350 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,350 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,351 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,351 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,351 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,351 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,351 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,352 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,352 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,352 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,352 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,353 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,353 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,353 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,353 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,353 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,355 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,355 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,356 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,356 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,356 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,357 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,357 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,357 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,357 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,358 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,358 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,358 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,358 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~ret18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,359 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,359 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,359 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,360 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,360 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,361 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,361 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,361 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~ret18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,361 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,361 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,361 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,362 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,367 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,368 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,368 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,368 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,369 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~ret18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,369 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,369 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,369 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,369 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,370 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,370 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,370 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,371 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,376 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,376 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,377 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,377 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,401 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,402 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,402 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,402 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,403 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,409 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,409 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,410 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,410 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,411 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,411 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,411 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,411 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,411 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,412 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,412 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,412 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,412 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,412 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,413 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,413 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,413 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,414 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,414 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,414 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,415 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,415 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,415 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,415 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,415 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,417 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,417 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,417 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,417 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,418 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,418 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,418 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,419 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,419 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,419 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,419 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,419 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,420 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,420 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,420 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,420 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,420 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,421 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,421 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,421 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,422 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,422 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,422 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,422 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,422 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,423 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,423 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,423 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,423 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,423 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:38:47,428 INFO L148 ThreadInstanceAdder]: Constructed 10 joinOtherThreadTransitions. [2021-11-25 20:38:47,480 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-25 20:38:47,489 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-25 20:38:47,489 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-11-25 20:38:47,509 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-11-25 20:38:47,522 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 204 places, 205 transitions, 454 flow [2021-11-25 20:38:47,525 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 204 places, 205 transitions, 454 flow [2021-11-25 20:38:47,527 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 204 places, 205 transitions, 454 flow [2021-11-25 20:38:47,618 INFO L129 PetriNetUnfolder]: 14/190 cut-off events. [2021-11-25 20:38:47,618 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-11-25 20:38:47,626 INFO L84 FinitePrefix]: Finished finitePrefix Result has 209 conditions, 190 events. 14/190 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 162 event pairs, 0 based on Foata normal form. 0/175 useless extension candidates. Maximal degree in co-relation 162. Up to 3 conditions per place. [2021-11-25 20:38:47,631 INFO L116 LiptonReduction]: Number of co-enabled transitions 2612 [2021-11-25 20:38:55,062 INFO L131 LiptonReduction]: Checked pairs total: 7840 [2021-11-25 20:38:55,062 INFO L133 LiptonReduction]: Total number of compositions: 182 [2021-11-25 20:38:55,078 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 56 places, 49 transitions, 142 flow [2021-11-25 20:38:55,156 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 471 states, 470 states have (on average 3.3957446808510636) internal successors, (1596), 470 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:38:55,160 INFO L276 IsEmpty]: Start isEmpty. Operand has 471 states, 470 states have (on average 3.3957446808510636) internal successors, (1596), 470 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:38:55,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-25 20:38:55,196 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:38:55,196 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, 1, 1, 1] [2021-11-25 20:38:55,198 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:38:55,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:38:55,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1226819905, now seen corresponding path program 1 times [2021-11-25 20:38:55,216 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:38:55,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173498916] [2021-11-25 20:38:55,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:38:55,218 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:38:55,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:38:55,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:38:55,703 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:38:55,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173498916] [2021-11-25 20:38:55,706 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173498916] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:38:55,707 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:38:55,707 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 20:38:55,709 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444007799] [2021-11-25 20:38:55,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:38:55,717 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 20:38:55,718 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:38:55,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 20:38:55,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 20:38:55,746 INFO L87 Difference]: Start difference. First operand has 471 states, 470 states have (on average 3.3957446808510636) internal successors, (1596), 470 states have internal predecessors, (1596), 0 states have call successors, (0), 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 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:38:55,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:38:55,997 INFO L93 Difference]: Finished difference Result 1084 states and 3763 transitions. [2021-11-25 20:38:55,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 20:38:56,000 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-11-25 20:38:56,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:38:56,039 INFO L225 Difference]: With dead ends: 1084 [2021-11-25 20:38:56,039 INFO L226 Difference]: Without dead ends: 1065 [2021-11-25 20:38:56,040 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-25 20:38:56,044 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 34 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:38:56,045 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 36 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:38:56,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2021-11-25 20:38:56,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 721. [2021-11-25 20:38:56,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 721 states, 720 states have (on average 3.3930555555555557) internal successors, (2443), 720 states have internal predecessors, (2443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:38:56,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 2443 transitions. [2021-11-25 20:38:56,173 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 2443 transitions. Word has length 31 [2021-11-25 20:38:56,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:38:56,175 INFO L470 AbstractCegarLoop]: Abstraction has 721 states and 2443 transitions. [2021-11-25 20:38:56,175 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:38:56,175 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 2443 transitions. [2021-11-25 20:38:56,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-25 20:38:56,180 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:38:56,180 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, 1, 1, 1] [2021-11-25 20:38:56,180 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-25 20:38:56,181 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:38:56,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:38:56,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1480133907, now seen corresponding path program 2 times [2021-11-25 20:38:56,182 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:38:56,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655717603] [2021-11-25 20:38:56,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:38:56,183 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:38:56,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:38:56,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:38:56,348 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:38:56,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655717603] [2021-11-25 20:38:56,351 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655717603] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:38:56,351 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:38:56,351 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 20:38:56,351 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085770021] [2021-11-25 20:38:56,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:38:56,353 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 20:38:56,354 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:38:56,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 20:38:56,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 20:38:56,356 INFO L87 Difference]: Start difference. First operand 721 states and 2443 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:38:56,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:38:56,561 INFO L93 Difference]: Finished difference Result 1084 states and 3758 transitions. [2021-11-25 20:38:56,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 20:38:56,562 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-11-25 20:38:56,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:38:56,576 INFO L225 Difference]: With dead ends: 1084 [2021-11-25 20:38:56,576 INFO L226 Difference]: Without dead ends: 1065 [2021-11-25 20:38:56,577 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-25 20:38:56,581 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 35 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:38:56,582 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 48 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:38:56,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2021-11-25 20:38:56,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 725. [2021-11-25 20:38:56,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 724 states have (on average 3.388121546961326) internal successors, (2453), 724 states have internal predecessors, (2453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:38:56,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 2453 transitions. [2021-11-25 20:38:56,642 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 2453 transitions. Word has length 31 [2021-11-25 20:38:56,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:38:56,643 INFO L470 AbstractCegarLoop]: Abstraction has 725 states and 2453 transitions. [2021-11-25 20:38:56,644 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:38:56,644 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 2453 transitions. [2021-11-25 20:38:56,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-25 20:38:56,648 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:38:56,648 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, 1, 1, 1, 1] [2021-11-25 20:38:56,648 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-25 20:38:56,648 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:38:56,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:38:56,649 INFO L85 PathProgramCache]: Analyzing trace with hash -624962275, now seen corresponding path program 1 times [2021-11-25 20:38:56,649 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:38:56,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859180779] [2021-11-25 20:38:56,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:38:56,657 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:38:56,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:38:56,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:38:56,793 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:38:56,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859180779] [2021-11-25 20:38:56,794 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859180779] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:38:56,794 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:38:56,794 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 20:38:56,794 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862165882] [2021-11-25 20:38:56,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:38:56,795 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-25 20:38:56,795 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:38:56,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-25 20:38:56,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-25 20:38:56,796 INFO L87 Difference]: Start difference. First operand 725 states and 2453 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:38:56,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:38:56,986 INFO L93 Difference]: Finished difference Result 1433 states and 4719 transitions. [2021-11-25 20:38:56,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-25 20:38:56,987 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-25 20:38:56,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:38:57,001 INFO L225 Difference]: With dead ends: 1433 [2021-11-25 20:38:57,002 INFO L226 Difference]: Without dead ends: 1365 [2021-11-25 20:38:57,002 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-25 20:38:57,003 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 75 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:38:57,004 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 43 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:38:57,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2021-11-25 20:38:57,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 1235. [2021-11-25 20:38:57,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1235 states, 1234 states have (on average 3.3889789303079416) internal successors, (4182), 1234 states have internal predecessors, (4182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:38:57,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 4182 transitions. [2021-11-25 20:38:57,064 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 4182 transitions. Word has length 32 [2021-11-25 20:38:57,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:38:57,065 INFO L470 AbstractCegarLoop]: Abstraction has 1235 states and 4182 transitions. [2021-11-25 20:38:57,065 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:38:57,065 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 4182 transitions. [2021-11-25 20:38:57,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-25 20:38:57,071 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:38:57,071 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, 1, 1, 1, 1, 1] [2021-11-25 20:38:57,072 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-25 20:38:57,072 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:38:57,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:38:57,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1314025826, now seen corresponding path program 1 times [2021-11-25 20:38:57,073 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:38:57,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696485028] [2021-11-25 20:38:57,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:38:57,074 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:38:57,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:38:57,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:38:57,212 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:38:57,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696485028] [2021-11-25 20:38:57,217 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696485028] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:38:57,217 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:38:57,217 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 20:38:57,217 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169626140] [2021-11-25 20:38:57,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:38:57,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-25 20:38:57,220 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:38:57,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-25 20:38:57,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-25 20:38:57,222 INFO L87 Difference]: Start difference. First operand 1235 states and 4182 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:38:57,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:38:57,388 INFO L93 Difference]: Finished difference Result 937 states and 2817 transitions. [2021-11-25 20:38:57,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-25 20:38:57,389 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-11-25 20:38:57,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:38:57,396 INFO L225 Difference]: With dead ends: 937 [2021-11-25 20:38:57,397 INFO L226 Difference]: Without dead ends: 704 [2021-11-25 20:38:57,401 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-25 20:38:57,404 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 82 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:38:57,405 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 43 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:38:57,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2021-11-25 20:38:57,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 704. [2021-11-25 20:38:57,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 704 states, 703 states have (on average 3.193456614509246) internal successors, (2245), 703 states have internal predecessors, (2245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:38:57,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 2245 transitions. [2021-11-25 20:38:57,441 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 2245 transitions. Word has length 33 [2021-11-25 20:38:57,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:38:57,442 INFO L470 AbstractCegarLoop]: Abstraction has 704 states and 2245 transitions. [2021-11-25 20:38:57,442 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:38:57,442 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 2245 transitions. [2021-11-25 20:38:57,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-25 20:38:57,447 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:38:57,447 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, 1, 1, 1, 1, 1] [2021-11-25 20:38:57,447 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-25 20:38:57,447 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:38:57,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:38:57,449 INFO L85 PathProgramCache]: Analyzing trace with hash -551905392, now seen corresponding path program 1 times [2021-11-25 20:38:57,449 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:38:57,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777743690] [2021-11-25 20:38:57,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:38:57,449 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:38:57,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:38:57,594 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:38:57,594 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:38:57,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777743690] [2021-11-25 20:38:57,594 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777743690] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:38:57,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783419133] [2021-11-25 20:38:57,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:38:57,595 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:38:57,595 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:38:57,599 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:38:57,604 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-25 20:38:57,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:38:57,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-25 20:38:57,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:38:57,893 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:38:57,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:38:58,066 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:38:58,066 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783419133] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:38:58,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1015919989] [2021-11-25 20:38:58,073 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:38:58,076 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:38:58,076 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2021-11-25 20:38:58,076 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311216526] [2021-11-25 20:38:58,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:38:58,077 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-25 20:38:58,077 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:38:58,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-25 20:38:58,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-11-25 20:38:58,079 INFO L87 Difference]: Start difference. First operand 704 states and 2245 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:38:58,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:38:58,475 INFO L93 Difference]: Finished difference Result 1390 states and 4302 transitions. [2021-11-25 20:38:58,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-25 20:38:58,475 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-11-25 20:38:58,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:38:58,489 INFO L225 Difference]: With dead ends: 1390 [2021-11-25 20:38:58,489 INFO L226 Difference]: Without dead ends: 1234 [2021-11-25 20:38:58,489 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-11-25 20:38:58,490 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 193 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-25 20:38:58,491 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 130 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-25 20:38:58,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2021-11-25 20:38:58,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 1126. [2021-11-25 20:38:58,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1126 states, 1125 states have (on average 3.2071111111111112) internal successors, (3608), 1125 states have internal predecessors, (3608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:38:58,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 3608 transitions. [2021-11-25 20:38:58,549 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 3608 transitions. Word has length 33 [2021-11-25 20:38:58,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:38:58,550 INFO L470 AbstractCegarLoop]: Abstraction has 1126 states and 3608 transitions. [2021-11-25 20:38:58,550 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:38:58,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 3608 transitions. [2021-11-25 20:38:58,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-25 20:38:58,557 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:38:58,558 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, 1, 1, 1, 1, 1, 1] [2021-11-25 20:38:58,601 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-25 20:38:58,786 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:38:58,786 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:38:58,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:38:58,786 INFO L85 PathProgramCache]: Analyzing trace with hash 875842555, now seen corresponding path program 1 times [2021-11-25 20:38:58,787 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:38:58,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868520857] [2021-11-25 20:38:58,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:38:58,787 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:38:58,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:38:58,951 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:38:58,952 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:38:58,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868520857] [2021-11-25 20:38:58,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868520857] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:38:58,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973071074] [2021-11-25 20:38:58,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:38:58,953 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:38:58,953 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:38:58,960 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:38:58,965 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-25 20:38:59,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:38:59,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-25 20:38:59,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:38:59,321 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:38:59,322 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:38:59,424 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:38:59,424 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973071074] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:38:59,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1448930955] [2021-11-25 20:38:59,425 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:38:59,426 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:38:59,427 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2021-11-25 20:38:59,427 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429853775] [2021-11-25 20:38:59,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:38:59,428 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-25 20:38:59,428 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:38:59,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-25 20:38:59,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-11-25 20:38:59,429 INFO L87 Difference]: Start difference. First operand 1126 states and 3608 transitions. Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:38:59,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:38:59,658 INFO L93 Difference]: Finished difference Result 806 states and 2448 transitions. [2021-11-25 20:38:59,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-25 20:38:59,659 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-11-25 20:38:59,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:38:59,666 INFO L225 Difference]: With dead ends: 806 [2021-11-25 20:38:59,666 INFO L226 Difference]: Without dead ends: 705 [2021-11-25 20:38:59,666 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-11-25 20:38:59,667 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 69 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 20:38:59,667 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 74 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 20:38:59,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2021-11-25 20:38:59,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 705. [2021-11-25 20:38:59,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 704 states have (on average 3.190340909090909) internal successors, (2246), 704 states have internal predecessors, (2246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:38:59,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 2246 transitions. [2021-11-25 20:38:59,697 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 2246 transitions. Word has length 34 [2021-11-25 20:38:59,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:38:59,697 INFO L470 AbstractCegarLoop]: Abstraction has 705 states and 2246 transitions. [2021-11-25 20:38:59,698 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:38:59,698 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 2246 transitions. [2021-11-25 20:38:59,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-25 20:38:59,701 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:38:59,701 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:38:59,747 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-25 20:38:59,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-11-25 20:38:59,918 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:38:59,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:38:59,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1712857981, now seen corresponding path program 2 times [2021-11-25 20:38:59,919 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:38:59,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244653631] [2021-11-25 20:38:59,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:38:59,919 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:38:59,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:39:00,071 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 20:39:00,071 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:39:00,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244653631] [2021-11-25 20:39:00,072 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244653631] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:39:00,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232797050] [2021-11-25 20:39:00,072 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 20:39:00,073 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:39:00,073 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:39:00,074 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:39:00,090 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-25 20:39:00,225 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 20:39:00,225 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:39:00,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-25 20:39:00,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:39:00,387 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 20:39:00,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:39:00,502 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 20:39:00,502 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [232797050] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-25 20:39:00,502 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-25 20:39:00,503 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 11 [2021-11-25 20:39:00,503 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250700963] [2021-11-25 20:39:00,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:39:00,503 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-25 20:39:00,504 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:39:00,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-25 20:39:00,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-11-25 20:39:00,504 INFO L87 Difference]: Start difference. First operand 705 states and 2246 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:39:00,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:39:00,591 INFO L93 Difference]: Finished difference Result 573 states and 1864 transitions. [2021-11-25 20:39:00,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-25 20:39:00,591 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-11-25 20:39:00,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:39:00,597 INFO L225 Difference]: With dead ends: 573 [2021-11-25 20:39:00,598 INFO L226 Difference]: Without dead ends: 573 [2021-11-25 20:39:00,598 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-11-25 20:39:00,599 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 97 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:39:00,599 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 18 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:39:00,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2021-11-25 20:39:00,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 533. [2021-11-25 20:39:00,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 532 states have (on average 3.263157894736842) internal successors, (1736), 532 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:39:00,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 1736 transitions. [2021-11-25 20:39:00,657 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 1736 transitions. Word has length 34 [2021-11-25 20:39:00,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:39:00,658 INFO L470 AbstractCegarLoop]: Abstraction has 533 states and 1736 transitions. [2021-11-25 20:39:00,658 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:39:00,658 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 1736 transitions. [2021-11-25 20:39:00,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-25 20:39:00,661 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:39:00,662 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:39:00,703 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-25 20:39:00,886 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-11-25 20:39:00,887 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:39:00,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:39:00,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1930936914, now seen corresponding path program 2 times [2021-11-25 20:39:00,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:39:00,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093981345] [2021-11-25 20:39:00,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:39:00,888 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:39:00,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:39:01,041 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 20:39:01,041 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:39:01,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093981345] [2021-11-25 20:39:01,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093981345] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:39:01,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731323444] [2021-11-25 20:39:01,042 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 20:39:01,042 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:39:01,043 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:39:01,044 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:39:01,063 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-25 20:39:01,194 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 20:39:01,194 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:39:01,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-25 20:39:01,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:39:01,353 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 20:39:01,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:39:01,456 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 20:39:01,457 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731323444] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-25 20:39:01,457 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-25 20:39:01,457 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 10 [2021-11-25 20:39:01,458 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101440961] [2021-11-25 20:39:01,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:39:01,459 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-25 20:39:01,459 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:39:01,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-25 20:39:01,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-11-25 20:39:01,460 INFO L87 Difference]: Start difference. First operand 533 states and 1736 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:39:01,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:39:01,570 INFO L93 Difference]: Finished difference Result 639 states and 2104 transitions. [2021-11-25 20:39:01,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-25 20:39:01,570 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-11-25 20:39:01,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:39:01,577 INFO L225 Difference]: With dead ends: 639 [2021-11-25 20:39:01,577 INFO L226 Difference]: Without dead ends: 639 [2021-11-25 20:39:01,577 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-11-25 20:39:01,579 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 72 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:39:01,580 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 25 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:39:01,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2021-11-25 20:39:01,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 639. [2021-11-25 20:39:01,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 638 states have (on average 3.2978056426332287) internal successors, (2104), 638 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:39:01,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 2104 transitions. [2021-11-25 20:39:01,605 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 2104 transitions. Word has length 35 [2021-11-25 20:39:01,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:39:01,606 INFO L470 AbstractCegarLoop]: Abstraction has 639 states and 2104 transitions. [2021-11-25 20:39:01,606 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:39:01,607 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 2104 transitions. [2021-11-25 20:39:01,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-25 20:39:01,609 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:39:01,609 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:39:01,647 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-25 20:39:01,830 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2021-11-25 20:39:01,830 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:39:01,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:39:01,831 INFO L85 PathProgramCache]: Analyzing trace with hash 268824144, now seen corresponding path program 1 times [2021-11-25 20:39:01,831 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:39:01,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13544366] [2021-11-25 20:39:01,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:39:01,831 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:39:01,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:39:02,288 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:39:02,288 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:39:02,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13544366] [2021-11-25 20:39:02,289 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13544366] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:39:02,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799405791] [2021-11-25 20:39:02,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:39:02,289 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:39:02,289 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:39:02,294 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:39:02,313 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-25 20:39:02,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:39:02,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 56 conjunts are in the unsatisfiable core [2021-11-25 20:39:02,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:39:02,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:39:02,762 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-11-25 20:39:02,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:39:02,867 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-11-25 20:39:02,949 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-11-25 20:39:02,973 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:39:02,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:39:03,084 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_370 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_370) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) c_~s_2~0)) is different from false [2021-11-25 20:39:03,146 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_369 (Array Int Int)) (v_ArrVal_370 (Array Int Int))) (= c_~s_2~0 (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_369) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_370) c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) is different from false [2021-11-25 20:39:03,177 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_369 (Array Int Int)) (v_ArrVal_370 (Array Int Int))) (= (+ c_~s_2~0 c_~t_4~0) (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_369) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_370) c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) is different from false [2021-11-25 20:39:03,202 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:39:03,202 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 104 treesize of output 77 [2021-11-25 20:39:03,213 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 62 treesize of output 54 [2021-11-25 20:39:03,223 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 28 treesize of output 24 [2021-11-25 20:39:03,445 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2021-11-25 20:39:03,445 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [799405791] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:39:03,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [437983659] [2021-11-25 20:39:03,446 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:39:03,447 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:39:03,447 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 25 [2021-11-25 20:39:03,447 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203316408] [2021-11-25 20:39:03,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:39:03,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-11-25 20:39:03,448 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:39:03,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-11-25 20:39:03,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=485, Unknown=3, NotChecked=138, Total=702 [2021-11-25 20:39:03,450 INFO L87 Difference]: Start difference. First operand 639 states and 2104 transitions. Second operand has 27 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 26 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:39:05,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:39:05,709 INFO L93 Difference]: Finished difference Result 1596 states and 5408 transitions. [2021-11-25 20:39:05,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-25 20:39:05,709 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 26 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-25 20:39:05,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:39:05,727 INFO L225 Difference]: With dead ends: 1596 [2021-11-25 20:39:05,727 INFO L226 Difference]: Without dead ends: 1555 [2021-11-25 20:39:05,728 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 53 SyntacticMatches, 8 SemanticMatches, 43 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=363, Invalid=1368, Unknown=3, NotChecked=246, Total=1980 [2021-11-25 20:39:05,729 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 675 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 1320 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 675 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 1834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 1320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 377 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:39:05,730 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [675 Valid, 203 Invalid, 1834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 1320 Invalid, 0 Unknown, 377 Unchecked, 1.1s Time] [2021-11-25 20:39:05,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1555 states. [2021-11-25 20:39:05,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1555 to 903. [2021-11-25 20:39:05,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 903 states, 902 states have (on average 3.2971175166297115) internal successors, (2974), 902 states have internal predecessors, (2974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:39:05,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 2974 transitions. [2021-11-25 20:39:05,781 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 2974 transitions. Word has length 36 [2021-11-25 20:39:05,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:39:05,781 INFO L470 AbstractCegarLoop]: Abstraction has 903 states and 2974 transitions. [2021-11-25 20:39:05,782 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 26 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:39:05,782 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 2974 transitions. [2021-11-25 20:39:05,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-25 20:39:05,785 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:39:05,786 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:39:05,828 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-25 20:39:06,002 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:39:06,002 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:39:06,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:39:06,003 INFO L85 PathProgramCache]: Analyzing trace with hash 341339262, now seen corresponding path program 2 times [2021-11-25 20:39:06,003 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:39:06,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499669725] [2021-11-25 20:39:06,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:39:06,003 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:39:06,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:39:06,452 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:39:06,452 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:39:06,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499669725] [2021-11-25 20:39:06,453 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499669725] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:39:06,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734491284] [2021-11-25 20:39:06,453 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 20:39:06,453 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:39:06,454 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:39:06,454 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:39:06,474 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-25 20:39:06,616 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 20:39:06,617 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:39:06,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 66 conjunts are in the unsatisfiable core [2021-11-25 20:39:06,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:39:06,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:39:06,655 INFO L354 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2021-11-25 20:39:06,655 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 23 [2021-11-25 20:39:06,742 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-25 20:39:06,742 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 15 treesize of output 15 [2021-11-25 20:39:06,883 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-11-25 20:39:06,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:39:06,972 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-11-25 20:39:07,111 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-11-25 20:39:07,186 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:39:07,186 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:39:07,401 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_433 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_433) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_2~0 c_~t_4~0 1))) (forall ((v_ArrVal_433 (Array Int Int))) (<= (+ c_~s_2~0 c_~t_4~0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_433) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))) is different from false [2021-11-25 20:39:07,466 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_432 (Array Int Int)) (v_ArrVal_433 (Array Int Int))) (<= (+ c_~s_2~0 c_~t_4~0) (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_432) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_433) c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) (forall ((v_ArrVal_432 (Array Int Int)) (v_ArrVal_433 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_432) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_433) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_2~0 c_~t_4~0 1)))) is different from false [2021-11-25 20:39:07,508 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:39:07,508 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 108 treesize of output 81 [2021-11-25 20:39:07,513 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 66 treesize of output 58 [2021-11-25 20:39:07,518 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 30 treesize of output 26 [2021-11-25 20:39:07,671 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:39:07,672 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:39:07,678 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:39:07,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, 2 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-25 20:39:08,009 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:39:08,010 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734491284] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:39:08,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [811987587] [2021-11-25 20:39:08,010 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:39:08,012 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:39:08,012 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2021-11-25 20:39:08,013 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506212846] [2021-11-25 20:39:08,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:39:08,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-11-25 20:39:08,014 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:39:08,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-11-25 20:39:08,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=524, Unknown=2, NotChecked=94, Total=702 [2021-11-25 20:39:08,016 INFO L87 Difference]: Start difference. First operand 903 states and 2974 transitions. Second operand has 27 states, 26 states have (on average 3.1923076923076925) internal successors, (83), 26 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:39:09,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:39:09,690 INFO L93 Difference]: Finished difference Result 1322 states and 4473 transitions. [2021-11-25 20:39:09,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-25 20:39:09,691 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.1923076923076925) internal successors, (83), 26 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-25 20:39:09,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:39:09,704 INFO L225 Difference]: With dead ends: 1322 [2021-11-25 20:39:09,705 INFO L226 Difference]: Without dead ends: 1281 [2021-11-25 20:39:09,706 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 53 SyntacticMatches, 6 SemanticMatches, 41 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=285, Invalid=1361, Unknown=2, NotChecked=158, Total=1806 [2021-11-25 20:39:09,706 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 427 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 1108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 238 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-25 20:39:09,708 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [427 Valid, 143 Invalid, 1108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 788 Invalid, 0 Unknown, 238 Unchecked, 0.7s Time] [2021-11-25 20:39:09,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states. [2021-11-25 20:39:09,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 919. [2021-11-25 20:39:09,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 919 states, 918 states have (on average 3.3050108932461875) internal successors, (3034), 918 states have internal predecessors, (3034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:39:09,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 3034 transitions. [2021-11-25 20:39:09,752 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 3034 transitions. Word has length 36 [2021-11-25 20:39:09,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:39:09,753 INFO L470 AbstractCegarLoop]: Abstraction has 919 states and 3034 transitions. [2021-11-25 20:39:09,753 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.1923076923076925) internal successors, (83), 26 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:39:09,753 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 3034 transitions. [2021-11-25 20:39:09,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-25 20:39:09,757 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:39:09,757 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:39:09,798 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-25 20:39:09,974 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-11-25 20:39:09,974 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:39:09,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:39:09,975 INFO L85 PathProgramCache]: Analyzing trace with hash 899845916, now seen corresponding path program 3 times [2021-11-25 20:39:09,975 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:39:09,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379946095] [2021-11-25 20:39:09,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:39:09,975 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:39:10,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:39:10,392 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:39:10,392 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:39:10,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379946095] [2021-11-25 20:39:10,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379946095] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:39:10,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214238239] [2021-11-25 20:39:10,393 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 20:39:10,393 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:39:10,393 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:39:10,394 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:39:10,418 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-25 20:39:10,556 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 20:39:10,557 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:39:10,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 63 conjunts are in the unsatisfiable core [2021-11-25 20:39:10,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:39:10,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:39:10,589 INFO L354 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2021-11-25 20:39:10,589 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 23 [2021-11-25 20:39:10,687 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-25 20:39:10,688 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 15 treesize of output 15 [2021-11-25 20:39:10,819 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-11-25 20:39:10,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:39:10,900 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-11-25 20:39:10,981 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-11-25 20:39:11,075 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:39:11,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:39:11,265 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_495 (Array Int Int))) (< (+ c_~s_2~0 c_~t_4~0) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_495) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 1))) (forall ((v_ArrVal_495 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_495) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_2~0 c_~t_4~0)))) is different from false [2021-11-25 20:39:11,319 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_494 (Array Int Int)) (v_ArrVal_495 (Array Int Int))) (< (+ c_~s_2~0 c_~t_4~0) (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_494) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_495) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 1))) (forall ((v_ArrVal_494 (Array Int Int)) (v_ArrVal_495 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_494) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_495) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_2~0 c_~t_4~0)))) is different from false [2021-11-25 20:39:11,355 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:39:11,356 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 104 treesize of output 77 [2021-11-25 20:39:11,368 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2021-11-25 20:39:11,373 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 58 treesize of output 50 [2021-11-25 20:39:11,491 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:39:11,492 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:39:11,498 INFO L354 Elim1Store]: treesize reduction 11, result has 26.7 percent of original size [2021-11-25 20:39:11,499 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 12 [2021-11-25 20:39:11,739 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:39:11,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214238239] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:39:11,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1649103086] [2021-11-25 20:39:11,740 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:39:11,741 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:39:11,741 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 23 [2021-11-25 20:39:11,742 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900088693] [2021-11-25 20:39:11,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:39:11,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-25 20:39:11,743 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:39:11,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-25 20:39:11,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=439, Unknown=2, NotChecked=86, Total=600 [2021-11-25 20:39:11,744 INFO L87 Difference]: Start difference. First operand 919 states and 3034 transitions. Second operand has 25 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 24 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:39:13,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:39:13,363 INFO L93 Difference]: Finished difference Result 1276 states and 4321 transitions. [2021-11-25 20:39:13,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-25 20:39:13,364 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 24 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-25 20:39:13,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:39:13,377 INFO L225 Difference]: With dead ends: 1276 [2021-11-25 20:39:13,377 INFO L226 Difference]: Without dead ends: 1231 [2021-11-25 20:39:13,378 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 53 SyntacticMatches, 7 SemanticMatches, 37 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=229, Invalid=1109, Unknown=2, NotChecked=142, Total=1482 [2021-11-25 20:39:13,379 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 294 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 907 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 1477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 509 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-25 20:39:13,379 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [294 Valid, 184 Invalid, 1477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 907 Invalid, 0 Unknown, 509 Unchecked, 0.7s Time] [2021-11-25 20:39:13,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2021-11-25 20:39:13,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 943. [2021-11-25 20:39:13,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 943 states, 942 states have (on average 3.3184713375796178) internal successors, (3126), 942 states have internal predecessors, (3126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:39:13,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 3126 transitions. [2021-11-25 20:39:13,419 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 3126 transitions. Word has length 36 [2021-11-25 20:39:13,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:39:13,420 INFO L470 AbstractCegarLoop]: Abstraction has 943 states and 3126 transitions. [2021-11-25 20:39:13,420 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 24 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:39:13,420 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 3126 transitions. [2021-11-25 20:39:13,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-25 20:39:13,424 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:39:13,424 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:39:13,461 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-25 20:39:13,638 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:39:13,638 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:39:13,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:39:13,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1524486198, now seen corresponding path program 1 times [2021-11-25 20:39:13,639 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:39:13,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208777467] [2021-11-25 20:39:13,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:39:13,639 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:39:13,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:39:13,918 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:39:13,918 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:39:13,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208777467] [2021-11-25 20:39:13,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208777467] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:39:13,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489529318] [2021-11-25 20:39:13,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:39:13,919 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:39:13,919 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:39:13,920 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:39:13,947 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-25 20:39:14,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:39:14,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 54 conjunts are in the unsatisfiable core [2021-11-25 20:39:14,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:39:14,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:39:14,315 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-11-25 20:39:14,382 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-11-25 20:39:14,402 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:39:14,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:39:14,481 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_552 (Array Int Int))) (= c_~s_2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_552) c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) is different from false [2021-11-25 20:39:14,521 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_552 (Array Int Int))) (= (+ c_~s_2~0 c_~t_5~0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_552) c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) is different from false [2021-11-25 20:39:14,537 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:39:14,541 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 39 [2021-11-25 20:39:14,545 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 13 treesize of output 9 [2021-11-25 20:39:14,708 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2021-11-25 20:39:14,708 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1489529318] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:39:14,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1929452160] [2021-11-25 20:39:14,708 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:39:14,709 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:39:14,709 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 22 [2021-11-25 20:39:14,710 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160270810] [2021-11-25 20:39:14,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:39:14,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-11-25 20:39:14,711 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:39:14,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-25 20:39:14,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=389, Unknown=2, NotChecked=82, Total=552 [2021-11-25 20:39:14,712 INFO L87 Difference]: Start difference. First operand 943 states and 3126 transitions. Second operand has 24 states, 23 states have (on average 4.130434782608695) internal successors, (95), 23 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:39:16,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:39:16,206 INFO L93 Difference]: Finished difference Result 1676 states and 5687 transitions. [2021-11-25 20:39:16,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-25 20:39:16,207 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 4.130434782608695) internal successors, (95), 23 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-25 20:39:16,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:39:16,223 INFO L225 Difference]: With dead ends: 1676 [2021-11-25 20:39:16,224 INFO L226 Difference]: Without dead ends: 1643 [2021-11-25 20:39:16,225 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 54 SyntacticMatches, 6 SemanticMatches, 36 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=275, Invalid=991, Unknown=2, NotChecked=138, Total=1406 [2021-11-25 20:39:16,225 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 416 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 1243 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 1517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 217 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-25 20:39:16,226 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [416 Valid, 173 Invalid, 1517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1243 Invalid, 0 Unknown, 217 Unchecked, 0.9s Time] [2021-11-25 20:39:16,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1643 states. [2021-11-25 20:39:16,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1643 to 985. [2021-11-25 20:39:16,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 985 states, 984 states have (on average 3.3302845528455283) internal successors, (3277), 984 states have internal predecessors, (3277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:39:16,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 3277 transitions. [2021-11-25 20:39:16,278 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 3277 transitions. Word has length 36 [2021-11-25 20:39:16,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:39:16,278 INFO L470 AbstractCegarLoop]: Abstraction has 985 states and 3277 transitions. [2021-11-25 20:39:16,279 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 4.130434782608695) internal successors, (95), 23 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:39:16,279 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 3277 transitions. [2021-11-25 20:39:16,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-25 20:39:16,283 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:39:16,283 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:39:16,324 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-25 20:39:16,497 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-11-25 20:39:16,497 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:39:16,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:39:16,498 INFO L85 PathProgramCache]: Analyzing trace with hash -856137578, now seen corresponding path program 2 times [2021-11-25 20:39:16,498 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:39:16,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130292] [2021-11-25 20:39:16,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:39:16,498 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:39:16,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:39:16,785 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:39:16,786 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:39:16,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130292] [2021-11-25 20:39:16,786 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130292] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:39:16,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116405101] [2021-11-25 20:39:16,786 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 20:39:16,786 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:39:16,786 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:39:16,787 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:39:16,789 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-25 20:39:16,946 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-11-25 20:39:16,947 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:39:16,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 58 conjunts are in the unsatisfiable core [2021-11-25 20:39:16,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:39:17,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:39:17,187 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-11-25 20:39:17,264 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-11-25 20:39:17,336 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 20:39:17,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:39:17,492 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_609 (Array Int Int))) (< (+ c_~s_2~0 c_~t_5~0) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_609) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 1))) (forall ((v_ArrVal_609 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_609) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_2~0 c_~t_5~0)))) is different from false [2021-11-25 20:39:17,569 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:39:17,570 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 48 treesize of output 39 [2021-11-25 20:39:17,574 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 13 treesize of output 9 [2021-11-25 20:39:17,608 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:39:17,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:39:17,611 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 3 [2021-11-25 20:39:17,762 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:39:17,762 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116405101] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:39:17,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [3154361] [2021-11-25 20:39:17,763 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:39:17,763 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:39:17,763 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 22 [2021-11-25 20:39:17,763 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769375447] [2021-11-25 20:39:17,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:39:17,764 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-11-25 20:39:17,764 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:39:17,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-25 20:39:17,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=429, Unknown=1, NotChecked=42, Total=552 [2021-11-25 20:39:17,765 INFO L87 Difference]: Start difference. First operand 985 states and 3277 transitions. Second operand has 24 states, 23 states have (on average 3.8260869565217392) internal successors, (88), 23 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:39:18,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:39:18,719 INFO L93 Difference]: Finished difference Result 1298 states and 4426 transitions. [2021-11-25 20:39:18,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-25 20:39:18,719 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.8260869565217392) internal successors, (88), 23 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-25 20:39:18,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:39:18,730 INFO L225 Difference]: With dead ends: 1298 [2021-11-25 20:39:18,731 INFO L226 Difference]: Without dead ends: 1255 [2021-11-25 20:39:18,731 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=272, Invalid=991, Unknown=1, NotChecked=68, Total=1332 [2021-11-25 20:39:18,732 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 354 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 69 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-25 20:39:18,732 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [354 Valid, 119 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 722 Invalid, 0 Unknown, 69 Unchecked, 0.5s Time] [2021-11-25 20:39:18,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2021-11-25 20:39:18,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1007. [2021-11-25 20:39:18,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1007 states, 1006 states have (on average 3.3479125248508947) internal successors, (3368), 1006 states have internal predecessors, (3368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:39:18,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 3368 transitions. [2021-11-25 20:39:18,768 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 3368 transitions. Word has length 36 [2021-11-25 20:39:18,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:39:18,769 INFO L470 AbstractCegarLoop]: Abstraction has 1007 states and 3368 transitions. [2021-11-25 20:39:18,769 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.8260869565217392) internal successors, (88), 23 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:39:18,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 3368 transitions. [2021-11-25 20:39:18,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-25 20:39:18,773 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:39:18,773 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:39:18,811 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-25 20:39:18,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-11-25 20:39:18,992 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:39:18,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:39:18,993 INFO L85 PathProgramCache]: Analyzing trace with hash -198192426, now seen corresponding path program 3 times [2021-11-25 20:39:18,993 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:39:18,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854951745] [2021-11-25 20:39:18,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:39:18,994 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:39:19,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:39:19,349 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:39:19,350 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:39:19,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854951745] [2021-11-25 20:39:19,350 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854951745] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:39:19,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804640940] [2021-11-25 20:39:19,350 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 20:39:19,350 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:39:19,350 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:39:19,354 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:39:19,381 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-25 20:39:19,501 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 20:39:19,501 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:39:19,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 58 conjunts are in the unsatisfiable core [2021-11-25 20:39:19,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:39:19,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:39:19,707 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-11-25 20:39:19,817 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-11-25 20:39:19,855 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 20:39:19,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:39:20,001 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_666 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_666) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_2~0 c_~t_5~0 1))) (forall ((v_ArrVal_666 (Array Int Int))) (<= (+ c_~s_2~0 c_~t_5~0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_666) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))) is different from false [2021-11-25 20:39:20,069 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:39:20,069 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 50 treesize of output 41 [2021-11-25 20:39:20,118 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 14 treesize of output 10 [2021-11-25 20:39:20,146 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:39:20,152 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:39:20,152 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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-25 20:39:20,280 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:39:20,281 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804640940] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:39:20,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2004949606] [2021-11-25 20:39:20,281 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:39:20,282 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:39:20,282 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 23 [2021-11-25 20:39:20,282 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265957673] [2021-11-25 20:39:20,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:39:20,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-25 20:39:20,283 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:39:20,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-25 20:39:20,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=464, Unknown=1, NotChecked=44, Total=600 [2021-11-25 20:39:20,284 INFO L87 Difference]: Start difference. First operand 1007 states and 3368 transitions. Second operand has 25 states, 24 states have (on average 3.75) internal successors, (90), 24 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:39:21,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:39:21,203 INFO L93 Difference]: Finished difference Result 1332 states and 4540 transitions. [2021-11-25 20:39:21,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-25 20:39:21,204 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.75) internal successors, (90), 24 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-25 20:39:21,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:39:21,211 INFO L225 Difference]: With dead ends: 1332 [2021-11-25 20:39:21,211 INFO L226 Difference]: Without dead ends: 1299 [2021-11-25 20:39:21,212 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 54 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=272, Invalid=1063, Unknown=1, NotChecked=70, Total=1406 [2021-11-25 20:39:21,212 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 363 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 114 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-25 20:39:21,213 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [363 Valid, 110 Invalid, 883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 714 Invalid, 0 Unknown, 114 Unchecked, 0.4s Time] [2021-11-25 20:39:21,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1299 states. [2021-11-25 20:39:21,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1299 to 1007. [2021-11-25 20:39:21,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1007 states, 1006 states have (on average 3.3479125248508947) internal successors, (3368), 1006 states have internal predecessors, (3368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:39:21,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 3368 transitions. [2021-11-25 20:39:21,252 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 3368 transitions. Word has length 36 [2021-11-25 20:39:21,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:39:21,252 INFO L470 AbstractCegarLoop]: Abstraction has 1007 states and 3368 transitions. [2021-11-25 20:39:21,253 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.75) internal successors, (90), 24 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:39:21,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 3368 transitions. [2021-11-25 20:39:21,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-25 20:39:21,257 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:39:21,257 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:39:21,289 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-25 20:39:21,478 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:39:21,478 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:39:21,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:39:21,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1466398744, now seen corresponding path program 4 times [2021-11-25 20:39:21,479 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:39:21,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167490775] [2021-11-25 20:39:21,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:39:21,479 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:39:21,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:39:21,721 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:39:21,721 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:39:21,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167490775] [2021-11-25 20:39:21,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167490775] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:39:21,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7968730] [2021-11-25 20:39:21,722 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 20:39:21,722 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:39:21,722 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:39:21,726 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:39:21,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-25 20:39:21,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:39:21,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 49 conjunts are in the unsatisfiable core [2021-11-25 20:39:21,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:39:22,036 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-11-25 20:39:22,080 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:39:22,080 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:39:22,245 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:39:22,246 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 25 treesize of output 26 [2021-11-25 20:39:22,274 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:39:22,274 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 26 treesize of output 27 [2021-11-25 20:39:22,385 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:39:22,385 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [7968730] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:39:22,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1184435603] [2021-11-25 20:39:22,385 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:39:22,386 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:39:22,386 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 16 [2021-11-25 20:39:22,386 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288084244] [2021-11-25 20:39:22,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:39:22,386 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-25 20:39:22,387 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:39:22,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-25 20:39:22,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2021-11-25 20:39:22,388 INFO L87 Difference]: Start difference. First operand 1007 states and 3368 transitions. Second operand has 17 states, 16 states have (on average 4.125) internal successors, (66), 17 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:39:22,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:39:22,950 INFO L93 Difference]: Finished difference Result 1663 states and 5667 transitions. [2021-11-25 20:39:22,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-25 20:39:22,951 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.125) internal successors, (66), 17 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 36 [2021-11-25 20:39:22,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:39:22,956 INFO L225 Difference]: With dead ends: 1663 [2021-11-25 20:39:22,957 INFO L226 Difference]: Without dead ends: 1581 [2021-11-25 20:39:22,957 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=152, Invalid=604, Unknown=0, NotChecked=0, Total=756 [2021-11-25 20:39:22,958 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 266 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-25 20:39:22,958 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [266 Valid, 102 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-25 20:39:22,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1581 states. [2021-11-25 20:39:22,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1581 to 1139. [2021-11-25 20:39:22,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1139 states, 1138 states have (on average 3.4578207381370825) internal successors, (3935), 1138 states have internal predecessors, (3935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:39:23,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 3935 transitions. [2021-11-25 20:39:23,002 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 3935 transitions. Word has length 36 [2021-11-25 20:39:23,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:39:23,003 INFO L470 AbstractCegarLoop]: Abstraction has 1139 states and 3935 transitions. [2021-11-25 20:39:23,003 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.125) internal successors, (66), 17 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:39:23,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 3935 transitions. [2021-11-25 20:39:23,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-25 20:39:23,008 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:39:23,008 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:39:23,048 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2021-11-25 20:39:23,230 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-11-25 20:39:23,230 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:39:23,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:39:23,231 INFO L85 PathProgramCache]: Analyzing trace with hash -907892090, now seen corresponding path program 5 times [2021-11-25 20:39:23,231 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:39:23,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910441000] [2021-11-25 20:39:23,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:39:23,231 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:39:23,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:39:23,448 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:39:23,448 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:39:23,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910441000] [2021-11-25 20:39:23,449 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910441000] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:39:23,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480172230] [2021-11-25 20:39:23,449 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 20:39:23,450 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:39:23,450 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:39:23,454 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:39:23,477 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-25 20:39:23,614 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-11-25 20:39:23,615 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:39:23,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 59 conjunts are in the unsatisfiable core [2021-11-25 20:39:23,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:39:23,842 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:39:23,843 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2021-11-25 20:39:23,997 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:39:23,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:39:24,290 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:39:24,290 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 34 [2021-11-25 20:39:24,808 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:39:24,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [480172230] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:39:24,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1260460108] [2021-11-25 20:39:24,808 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:39:24,810 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:39:24,810 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 22 [2021-11-25 20:39:24,810 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389353398] [2021-11-25 20:39:24,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:39:24,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-11-25 20:39:24,812 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:39:24,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-25 20:39:24,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2021-11-25 20:39:24,813 INFO L87 Difference]: Start difference. First operand 1139 states and 3935 transitions. Second operand has 24 states, 23 states have (on average 3.608695652173913) internal successors, (83), 23 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:39:25,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:39:25,949 INFO L93 Difference]: Finished difference Result 1714 states and 5997 transitions. [2021-11-25 20:39:25,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-25 20:39:25,949 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.608695652173913) internal successors, (83), 23 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-25 20:39:25,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:39:25,954 INFO L225 Difference]: With dead ends: 1714 [2021-11-25 20:39:25,954 INFO L226 Difference]: Without dead ends: 1669 [2021-11-25 20:39:25,955 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=331, Invalid=1309, Unknown=0, NotChecked=0, Total=1640 [2021-11-25 20:39:25,955 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 395 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 1114 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 1320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 160 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-25 20:39:25,956 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [395 Valid, 265 Invalid, 1320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1114 Invalid, 0 Unknown, 160 Unchecked, 0.7s Time] [2021-11-25 20:39:25,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states. [2021-11-25 20:39:25,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 1135. [2021-11-25 20:39:25,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1135 states, 1134 states have (on average 3.4594356261022927) internal successors, (3923), 1134 states have internal predecessors, (3923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:39:26,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 3923 transitions. [2021-11-25 20:39:26,000 INFO L78 Accepts]: Start accepts. Automaton has 1135 states and 3923 transitions. Word has length 36 [2021-11-25 20:39:26,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:39:26,001 INFO L470 AbstractCegarLoop]: Abstraction has 1135 states and 3923 transitions. [2021-11-25 20:39:26,001 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.608695652173913) internal successors, (83), 23 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:39:26,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 3923 transitions. [2021-11-25 20:39:26,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-25 20:39:26,005 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:39:26,005 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:39:26,043 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-11-25 20:39:26,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-11-25 20:39:26,232 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:39:26,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:39:26,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1032329512, now seen corresponding path program 6 times [2021-11-25 20:39:26,232 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:39:26,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772178168] [2021-11-25 20:39:26,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:39:26,232 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:39:26,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:39:26,513 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:39:26,513 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:39:26,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772178168] [2021-11-25 20:39:26,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772178168] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:39:26,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498335439] [2021-11-25 20:39:26,514 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 20:39:26,514 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:39:26,514 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:39:26,518 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:39:26,538 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-11-25 20:39:26,678 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 20:39:26,678 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:39:26,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 53 conjunts are in the unsatisfiable core [2021-11-25 20:39:26,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:39:26,828 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-11-25 20:39:26,911 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 20:39:26,912 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:39:27,031 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:39:27,031 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 26 treesize of output 27 [2021-11-25 20:39:27,051 INFO L354 Elim1Store]: treesize reduction 14, result has 22.2 percent of original size [2021-11-25 20:39:27,051 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 25 treesize of output 12 [2021-11-25 20:39:27,151 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:39:27,151 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498335439] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:39:27,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [800074047] [2021-11-25 20:39:27,152 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:39:27,152 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:39:27,152 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 16 [2021-11-25 20:39:27,152 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056267944] [2021-11-25 20:39:27,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:39:27,153 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-25 20:39:27,153 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:39:27,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-25 20:39:27,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2021-11-25 20:39:27,154 INFO L87 Difference]: Start difference. First operand 1135 states and 3923 transitions. Second operand has 17 states, 16 states have (on average 4.0625) internal successors, (65), 17 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-25 20:39:27,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:39:27,556 INFO L93 Difference]: Finished difference Result 1428 states and 4956 transitions. [2021-11-25 20:39:27,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-25 20:39:27,556 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.0625) internal successors, (65), 17 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 36 [2021-11-25 20:39:27,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:39:27,562 INFO L225 Difference]: With dead ends: 1428 [2021-11-25 20:39:27,562 INFO L226 Difference]: Without dead ends: 1383 [2021-11-25 20:39:27,563 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 60 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552 [2021-11-25 20:39:27,564 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 152 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-25 20:39:27,564 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 155 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-25 20:39:27,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2021-11-25 20:39:27,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1163. [2021-11-25 20:39:27,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1163 states, 1162 states have (on average 3.4604130808950084) internal successors, (4021), 1162 states have internal predecessors, (4021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:39:27,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 4021 transitions. [2021-11-25 20:39:27,603 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 4021 transitions. Word has length 36 [2021-11-25 20:39:27,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:39:27,604 INFO L470 AbstractCegarLoop]: Abstraction has 1163 states and 4021 transitions. [2021-11-25 20:39:27,604 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.0625) internal successors, (65), 17 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-25 20:39:27,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 4021 transitions. [2021-11-25 20:39:27,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-25 20:39:27,608 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:39:27,609 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:39:27,657 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-11-25 20:39:27,834 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-11-25 20:39:27,834 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:39:27,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:39:27,834 INFO L85 PathProgramCache]: Analyzing trace with hash -587082962, now seen corresponding path program 4 times [2021-11-25 20:39:27,835 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:39:27,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397604226] [2021-11-25 20:39:27,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:39:27,835 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:39:27,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:39:28,039 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:39:28,039 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:39:28,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397604226] [2021-11-25 20:39:28,039 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397604226] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:39:28,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875868433] [2021-11-25 20:39:28,040 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 20:39:28,040 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:39:28,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:39:28,042 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:39:28,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-11-25 20:39:28,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:39:28,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 49 conjunts are in the unsatisfiable core [2021-11-25 20:39:28,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:39:28,330 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-11-25 20:39:28,399 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:39:28,399 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:39:28,554 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:39:28,555 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 26 treesize of output 27 [2021-11-25 20:39:28,579 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:39:28,580 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 25 treesize of output 26 [2021-11-25 20:39:28,714 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:39:28,715 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875868433] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:39:28,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2086960535] [2021-11-25 20:39:28,715 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:39:28,717 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:39:28,717 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 15 [2021-11-25 20:39:28,717 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538091780] [2021-11-25 20:39:28,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:39:28,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-25 20:39:28,718 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:39:28,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-25 20:39:28,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2021-11-25 20:39:28,719 INFO L87 Difference]: Start difference. First operand 1163 states and 4021 transitions. Second operand has 16 states, 15 states have (on average 4.333333333333333) internal successors, (65), 16 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-25 20:39:29,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:39:29,200 INFO L93 Difference]: Finished difference Result 1376 states and 4778 transitions. [2021-11-25 20:39:29,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-25 20:39:29,200 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.333333333333333) internal successors, (65), 16 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 36 [2021-11-25 20:39:29,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:39:29,205 INFO L225 Difference]: With dead ends: 1376 [2021-11-25 20:39:29,205 INFO L226 Difference]: Without dead ends: 1333 [2021-11-25 20:39:29,205 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 61 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2021-11-25 20:39:29,206 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 134 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-25 20:39:29,206 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 143 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 593 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-25 20:39:29,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333 states. [2021-11-25 20:39:29,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333 to 1163. [2021-11-25 20:39:29,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1163 states, 1162 states have (on average 3.4604130808950084) internal successors, (4021), 1162 states have internal predecessors, (4021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:39:29,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 4021 transitions. [2021-11-25 20:39:29,247 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 4021 transitions. Word has length 36 [2021-11-25 20:39:29,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:39:29,247 INFO L470 AbstractCegarLoop]: Abstraction has 1163 states and 4021 transitions. [2021-11-25 20:39:29,247 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.333333333333333) internal successors, (65), 16 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-25 20:39:29,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 4021 transitions. [2021-11-25 20:39:29,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-25 20:39:29,254 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:39:29,254 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:39:29,290 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-11-25 20:39:29,482 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:39:29,482 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:39:29,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:39:29,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1119336366, now seen corresponding path program 5 times [2021-11-25 20:39:29,482 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:39:29,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777134592] [2021-11-25 20:39:29,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:39:29,483 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:39:29,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:39:29,693 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:39:29,694 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:39:29,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777134592] [2021-11-25 20:39:29,694 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777134592] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:39:29,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604049018] [2021-11-25 20:39:29,694 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 20:39:29,695 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:39:29,695 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:39:29,698 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:39:29,718 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-11-25 20:39:29,890 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-11-25 20:39:29,891 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:39:29,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 59 conjunts are in the unsatisfiable core [2021-11-25 20:39:29,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:39:30,154 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:39:30,154 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2021-11-25 20:39:30,283 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:39:30,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:39:30,504 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:39:30,505 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 50 treesize of output 34 [2021-11-25 20:39:31,048 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:39:31,049 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604049018] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:39:31,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1704806723] [2021-11-25 20:39:31,049 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:39:31,050 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:39:31,050 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 21 [2021-11-25 20:39:31,051 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508197379] [2021-11-25 20:39:31,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:39:31,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-11-25 20:39:31,051 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:39:31,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-25 20:39:31,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2021-11-25 20:39:31,052 INFO L87 Difference]: Start difference. First operand 1163 states and 4021 transitions. Second operand has 23 states, 22 states have (on average 3.772727272727273) internal successors, (83), 22 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:39:31,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:39:31,780 INFO L93 Difference]: Finished difference Result 1518 states and 5283 transitions. [2021-11-25 20:39:31,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-25 20:39:31,781 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.772727272727273) internal successors, (83), 22 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-25 20:39:31,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:39:31,785 INFO L225 Difference]: With dead ends: 1518 [2021-11-25 20:39:31,786 INFO L226 Difference]: Without dead ends: 1475 [2021-11-25 20:39:31,786 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=228, Invalid=962, Unknown=0, NotChecked=0, Total=1190 [2021-11-25 20:39:31,788 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 245 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 107 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-25 20:39:31,788 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [245 Valid, 214 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 834 Invalid, 0 Unknown, 107 Unchecked, 0.4s Time] [2021-11-25 20:39:31,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1475 states. [2021-11-25 20:39:31,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1475 to 1177. [2021-11-25 20:39:31,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1177 states, 1176 states have (on average 3.4659863945578233) internal successors, (4076), 1176 states have internal predecessors, (4076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:39:31,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 4076 transitions. [2021-11-25 20:39:31,829 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 4076 transitions. Word has length 36 [2021-11-25 20:39:31,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:39:31,830 INFO L470 AbstractCegarLoop]: Abstraction has 1177 states and 4076 transitions. [2021-11-25 20:39:31,830 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.772727272727273) internal successors, (83), 22 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:39:31,830 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 4076 transitions. [2021-11-25 20:39:31,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-25 20:39:31,833 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:39:31,834 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:39:31,871 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-11-25 20:39:32,058 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:39:32,058 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:39:32,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:39:32,058 INFO L85 PathProgramCache]: Analyzing trace with hash 303721940, now seen corresponding path program 6 times [2021-11-25 20:39:32,058 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:39:32,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614653298] [2021-11-25 20:39:32,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:39:32,059 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:39:32,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:39:32,337 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:39:32,337 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:39:32,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614653298] [2021-11-25 20:39:32,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614653298] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:39:32,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805479246] [2021-11-25 20:39:32,338 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 20:39:32,338 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:39:32,338 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:39:32,339 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:39:32,342 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-11-25 20:39:32,498 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 20:39:32,499 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:39:32,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 49 conjunts are in the unsatisfiable core [2021-11-25 20:39:32,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:39:32,684 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-11-25 20:39:32,735 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:39:32,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:39:32,862 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:39:32,863 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 25 treesize of output 26 [2021-11-25 20:39:32,884 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:39:32,884 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 26 treesize of output 27 [2021-11-25 20:39:32,991 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:39:32,991 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805479246] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:39:32,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [108910821] [2021-11-25 20:39:32,992 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:39:32,993 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:39:32,994 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 16 [2021-11-25 20:39:32,994 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270250927] [2021-11-25 20:39:32,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:39:32,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-25 20:39:32,995 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:39:32,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-25 20:39:32,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2021-11-25 20:39:32,996 INFO L87 Difference]: Start difference. First operand 1177 states and 4076 transitions. Second operand has 17 states, 16 states have (on average 4.25) internal successors, (68), 17 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:39:33,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:39:33,700 INFO L93 Difference]: Finished difference Result 1633 states and 5671 transitions. [2021-11-25 20:39:33,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-25 20:39:33,700 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.25) internal successors, (68), 17 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 36 [2021-11-25 20:39:33,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:39:33,712 INFO L225 Difference]: With dead ends: 1633 [2021-11-25 20:39:33,712 INFO L226 Difference]: Without dead ends: 1567 [2021-11-25 20:39:33,713 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=152, Invalid=604, Unknown=0, NotChecked=0, Total=756 [2021-11-25 20:39:33,715 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 214 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-25 20:39:33,715 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [214 Valid, 142 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 788 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-25 20:39:33,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2021-11-25 20:39:33,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1189. [2021-11-25 20:39:33,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1189 states, 1188 states have (on average 3.5033670033670035) internal successors, (4162), 1188 states have internal predecessors, (4162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:39:33,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1189 states to 1189 states and 4162 transitions. [2021-11-25 20:39:33,766 INFO L78 Accepts]: Start accepts. Automaton has 1189 states and 4162 transitions. Word has length 36 [2021-11-25 20:39:33,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:39:33,767 INFO L470 AbstractCegarLoop]: Abstraction has 1189 states and 4162 transitions. [2021-11-25 20:39:33,767 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.25) internal successors, (68), 17 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:39:33,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1189 states and 4162 transitions. [2021-11-25 20:39:33,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-25 20:39:33,771 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:39:33,771 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:39:33,814 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-11-25 20:39:33,998 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:39:33,998 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:39:33,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:39:33,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1242914242, now seen corresponding path program 7 times [2021-11-25 20:39:33,998 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:39:33,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673686998] [2021-11-25 20:39:33,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:39:33,999 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:39:34,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:39:34,284 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:39:34,284 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:39:34,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673686998] [2021-11-25 20:39:34,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673686998] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:39:34,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630398863] [2021-11-25 20:39:34,285 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 20:39:34,285 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:39:34,285 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:39:34,290 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:39:34,294 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-11-25 20:39:34,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:39:34,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 54 conjunts are in the unsatisfiable core [2021-11-25 20:39:34,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:39:34,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:39:34,707 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-11-25 20:39:34,755 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-11-25 20:39:34,807 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:39:34,807 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:39:34,917 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1059 (Array Int Int))) (<= c_~s_2~0 (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1059) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_7~0 4) 4))))) (forall ((v_ArrVal_1059 (Array Int Int))) (< (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1059) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_7~0 4) 4))) (+ c_~s_2~0 1)))) is different from false [2021-11-25 20:39:34,932 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1059 (Array Int Int))) (< (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1059) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_7~0 4) 4))) (+ c_~s_2~0 c_~t_4~0 1))) (forall ((v_ArrVal_1059 (Array Int Int))) (<= (+ c_~s_2~0 c_~t_4~0) (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1059) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_7~0 4) 4)))))) is different from false [2021-11-25 20:39:34,944 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:39:34,944 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 60 treesize of output 51 [2021-11-25 20:39:34,957 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 19 treesize of output 12 [2021-11-25 20:39:34,989 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:39:34,996 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:39:34,996 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2021-11-25 20:39:35,195 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2021-11-25 20:39:35,195 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630398863] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:39:35,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1526931658] [2021-11-25 20:39:35,195 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:39:35,196 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:39:35,196 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 22 [2021-11-25 20:39:35,196 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398540529] [2021-11-25 20:39:35,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:39:35,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-11-25 20:39:35,196 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:39:35,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-25 20:39:35,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=394, Unknown=2, NotChecked=82, Total=552 [2021-11-25 20:39:35,197 INFO L87 Difference]: Start difference. First operand 1189 states and 4162 transitions. Second operand has 24 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 23 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:39:36,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:39:36,106 INFO L93 Difference]: Finished difference Result 1836 states and 6431 transitions. [2021-11-25 20:39:36,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-25 20:39:36,108 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 23 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-25 20:39:36,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:39:36,113 INFO L225 Difference]: With dead ends: 1836 [2021-11-25 20:39:36,114 INFO L226 Difference]: Without dead ends: 1771 [2021-11-25 20:39:36,114 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 54 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=228, Invalid=961, Unknown=9, NotChecked=134, Total=1332 [2021-11-25 20:39:36,115 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 351 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 1083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 304 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-25 20:39:36,115 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [351 Valid, 127 Invalid, 1083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 738 Invalid, 0 Unknown, 304 Unchecked, 0.5s Time] [2021-11-25 20:39:36,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1771 states. [2021-11-25 20:39:36,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1771 to 1199. [2021-11-25 20:39:36,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1199 states, 1198 states have (on average 3.51669449081803) internal successors, (4213), 1198 states have internal predecessors, (4213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:39:36,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 4213 transitions. [2021-11-25 20:39:36,160 INFO L78 Accepts]: Start accepts. Automaton has 1199 states and 4213 transitions. Word has length 36 [2021-11-25 20:39:36,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:39:36,161 INFO L470 AbstractCegarLoop]: Abstraction has 1199 states and 4213 transitions. [2021-11-25 20:39:36,161 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 23 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:39:36,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 4213 transitions. [2021-11-25 20:39:36,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-25 20:39:36,165 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:39:36,165 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:39:36,198 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-11-25 20:39:36,378 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:39:36,378 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:39:36,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:39:36,379 INFO L85 PathProgramCache]: Analyzing trace with hash -938226144, now seen corresponding path program 8 times [2021-11-25 20:39:36,379 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:39:36,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879419168] [2021-11-25 20:39:36,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:39:36,379 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:39:36,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:39:36,642 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:39:36,642 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:39:36,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879419168] [2021-11-25 20:39:36,643 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879419168] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:39:36,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207070971] [2021-11-25 20:39:36,643 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 20:39:36,643 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:39:36,643 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:39:36,644 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:39:36,661 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-11-25 20:39:36,793 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-11-25 20:39:36,793 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:39:36,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 76 conjunts are in the unsatisfiable core [2021-11-25 20:39:36,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:39:36,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:39:36,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:39:36,831 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-25 20:39:36,832 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2021-11-25 20:39:36,898 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-25 20:39:36,927 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 20:39:36,971 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-25 20:39:36,971 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 15 treesize of output 15 [2021-11-25 20:39:37,025 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 20:39:37,108 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 20:39:37,203 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-11-25 20:39:37,251 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-11-25 20:39:37,313 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:39:37,313 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:39:37,436 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1126 (Array Int Int))) (< (+ c_~s_2~0 c_~t_4~0) (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1126) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_7~0 4) 4)) 1))) (forall ((v_ArrVal_1126 (Array Int Int))) (<= (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1126) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_7~0 4) 4))) (+ c_~s_2~0 c_~t_4~0)))) is different from false [2021-11-25 20:39:37,447 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1126 (Array Int Int))) (< (+ c_~s_2~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1126) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_7~0 4) 4)) 1))) (forall ((v_ArrVal_1126 (Array Int Int))) (<= (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1126) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_7~0 4) 4))) (+ c_~s_2~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)))))) is different from false [2021-11-25 20:39:37,472 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1126 (Array Int Int))) (< (+ c_~s_2~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1126) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 1))) (forall ((v_ArrVal_1126 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1126) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_2~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)))))) is different from false [2021-11-25 20:39:37,501 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1126 (Array Int Int)) (v_ArrVal_1125 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1125))) (< (+ c_~s_2~0 (select (select .cse0 c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (+ 1 (select (select (store .cse0 |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1126) c_~X_0~0.base) (+ c_~X_0~0.offset 4)))))) (forall ((v_ArrVal_1126 (Array Int Int)) (v_ArrVal_1125 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1125))) (<= (select (select (store .cse1 |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1126) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_2~0 (select (select .cse1 c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))))))) is different from false [2021-11-25 20:39:37,559 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1126 (Array Int Int)) (v_ArrVal_1125 (Array Int Int)) (v_ArrVal_1124 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_1124) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1125))) (<= (select (select (store .cse0 |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1126) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_2~0 (select (select .cse0 c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)))))) (forall ((v_ArrVal_1126 (Array Int Int)) (v_ArrVal_1125 (Array Int Int)) (v_ArrVal_1124 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_1124) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1125))) (< (+ c_~s_2~0 (select (select .cse1 c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (+ 1 (select (select (store .cse1 |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1126) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))))) is different from false [2021-11-25 20:39:38,127 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:39:38,127 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 123 treesize of output 88 [2021-11-25 20:39:38,229 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:39:38,232 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 1290362 treesize of output 1220672 [2021-11-25 20:41:25,935 WARN L227 SmtUtils]: Spent 1.79m on a formula simplification. DAG size of input: 1696 DAG size of output: 1678 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-25 20:41:30,491 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 1171245 treesize of output 1040173 [2021-11-25 20:41:35,296 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 1040173 treesize of output 1036589 [2021-11-25 20:41:39,839 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 1036589 treesize of output 1032493 [2021-11-25 20:41:44,376 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 1032493 treesize of output 1030189 [2021-11-25 20:41:48,778 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 1030189 treesize of output 948269 [2021-11-25 20:41:53,149 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 948269 treesize of output 903213 [2021-11-25 20:41:57,368 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 903213 treesize of output 772141 [2021-11-25 20:42:01,595 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 772141 treesize of output 770861 [2021-11-25 20:42:05,809 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-11-25 20:42:05,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1222161112] [2021-11-25 20:42:05,809 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:42:05,811 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-25 20:42:05,811 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2021-11-25 20:42:05,811 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772551393] [2021-11-25 20:42:05,811 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-25 20:42:05,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-25 20:42:05,812 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:42:05,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-25 20:42:05,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=482, Unknown=5, NotChecked=240, Total=812 [2021-11-25 20:42:05,813 INFO L87 Difference]: Start difference. First operand 1199 states and 4213 transitions. Second operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:42:06,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:42:06,236 INFO L93 Difference]: Finished difference Result 1498 states and 5264 transitions. [2021-11-25 20:42:06,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-25 20:42:06,237 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-25 20:42:06,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:42:06,240 INFO L225 Difference]: With dead ends: 1498 [2021-11-25 20:42:06,240 INFO L226 Difference]: Without dead ends: 1459 [2021-11-25 20:42:06,240 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=133, Invalid=752, Unknown=5, NotChecked=300, Total=1190 [2021-11-25 20:42:06,241 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 124 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-25 20:42:06,241 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 92 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-25 20:42:06,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2021-11-25 20:42:06,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 1189. [2021-11-25 20:42:06,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1189 states, 1188 states have (on average 3.5134680134680134) internal successors, (4174), 1188 states have internal predecessors, (4174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:42:06,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1189 states to 1189 states and 4174 transitions. [2021-11-25 20:42:06,280 INFO L78 Accepts]: Start accepts. Automaton has 1189 states and 4174 transitions. Word has length 36 [2021-11-25 20:42:06,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:42:06,281 INFO L470 AbstractCegarLoop]: Abstraction has 1189 states and 4174 transitions. [2021-11-25 20:42:06,281 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:42:06,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1189 states and 4174 transitions. [2021-11-25 20:42:06,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-25 20:42:06,284 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:42:06,285 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:42:06,322 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-11-25 20:42:06,510 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-11-25 20:42:06,510 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:42:06,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:42:06,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1733815734, now seen corresponding path program 9 times [2021-11-25 20:42:06,510 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:42:06,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559378566] [2021-11-25 20:42:06,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:42:06,511 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:42:06,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:42:06,773 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:42:06,773 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:42:06,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559378566] [2021-11-25 20:42:06,773 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559378566] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:42:06,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677463195] [2021-11-25 20:42:06,773 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 20:42:06,774 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:42:06,774 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:42:06,775 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:42:06,782 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-11-25 20:42:06,945 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 20:42:06,945 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:42:06,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 54 conjunts are in the unsatisfiable core [2021-11-25 20:42:06,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:42:07,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:42:07,130 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-11-25 20:42:07,161 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-11-25 20:42:07,239 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:42:07,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:42:07,362 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1183 (Array Int Int))) (<= c_~s_6~0 (+ c_~s_2~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1183) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))))) (forall ((v_ArrVal_1183 (Array Int Int))) (< (+ c_~s_2~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1183) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (+ c_~s_6~0 1)))) is different from false [2021-11-25 20:42:07,380 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:42:07,380 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 58 treesize of output 49 [2021-11-25 20:42:07,385 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 18 treesize of output 11 [2021-11-25 20:42:07,425 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:42:07,432 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:42:07,432 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2021-11-25 20:42:07,603 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2021-11-25 20:42:07,603 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677463195] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:42:07,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [357472491] [2021-11-25 20:42:07,604 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:42:07,605 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:42:07,606 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2021-11-25 20:42:07,606 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283553611] [2021-11-25 20:42:07,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:42:07,606 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-11-25 20:42:07,606 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:42:07,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-25 20:42:07,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=388, Unknown=1, NotChecked=40, Total=506 [2021-11-25 20:42:07,607 INFO L87 Difference]: Start difference. First operand 1189 states and 4174 transitions. Second operand has 23 states, 22 states have (on average 3.5) internal successors, (77), 22 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:42:08,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:42:08,234 INFO L93 Difference]: Finished difference Result 1514 states and 5318 transitions. [2021-11-25 20:42:08,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-25 20:42:08,235 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.5) internal successors, (77), 22 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-25 20:42:08,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:42:08,239 INFO L225 Difference]: With dead ends: 1514 [2021-11-25 20:42:08,239 INFO L226 Difference]: Without dead ends: 1475 [2021-11-25 20:42:08,240 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 54 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=149, Invalid=610, Unknown=1, NotChecked=52, Total=812 [2021-11-25 20:42:08,240 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 207 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 106 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-25 20:42:08,241 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 142 Invalid, 912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 788 Invalid, 0 Unknown, 106 Unchecked, 0.5s Time] [2021-11-25 20:42:08,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1475 states. [2021-11-25 20:42:08,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1475 to 1201. [2021-11-25 20:42:08,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1201 states, 1200 states have (on average 3.5166666666666666) internal successors, (4220), 1200 states have internal predecessors, (4220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:42:08,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1201 states to 1201 states and 4220 transitions. [2021-11-25 20:42:08,279 INFO L78 Accepts]: Start accepts. Automaton has 1201 states and 4220 transitions. Word has length 36 [2021-11-25 20:42:08,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:42:08,279 INFO L470 AbstractCegarLoop]: Abstraction has 1201 states and 4220 transitions. [2021-11-25 20:42:08,279 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.5) internal successors, (77), 22 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:42:08,279 INFO L276 IsEmpty]: Start isEmpty. Operand 1201 states and 4220 transitions. [2021-11-25 20:42:08,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-25 20:42:08,287 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:42:08,287 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:42:08,309 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2021-11-25 20:42:08,494 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-11-25 20:42:08,494 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:42:08,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:42:08,494 INFO L85 PathProgramCache]: Analyzing trace with hash 93078744, now seen corresponding path program 7 times [2021-11-25 20:42:08,494 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:42:08,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658321261] [2021-11-25 20:42:08,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:42:08,495 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:42:08,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:42:08,743 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:42:08,743 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:42:08,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658321261] [2021-11-25 20:42:08,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658321261] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:42:08,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871873943] [2021-11-25 20:42:08,743 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 20:42:08,744 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:42:08,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:42:08,745 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:42:08,765 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-11-25 20:42:08,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:42:08,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 54 conjunts are in the unsatisfiable core [2021-11-25 20:42:08,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:42:09,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:42:09,139 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-11-25 20:42:09,174 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-11-25 20:42:09,259 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:42:09,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:42:09,391 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1240 (Array Int Int))) (< (+ c_~s_2~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1240) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (+ c_~s_6~0 1))) (forall ((v_ArrVal_1240 (Array Int Int))) (<= c_~s_6~0 (+ c_~s_2~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1240) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)))))) is different from false [2021-11-25 20:42:09,411 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:42:09,412 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 58 treesize of output 49 [2021-11-25 20:42:09,416 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 18 treesize of output 11 [2021-11-25 20:42:09,450 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:42:09,457 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:42:09,457 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2021-11-25 20:42:09,650 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2021-11-25 20:42:09,650 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [871873943] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:42:09,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [75569423] [2021-11-25 20:42:09,650 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:42:09,650 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:42:09,651 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2021-11-25 20:42:09,651 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426123619] [2021-11-25 20:42:09,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:42:09,652 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-11-25 20:42:09,652 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:42:09,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-25 20:42:09,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=388, Unknown=1, NotChecked=40, Total=506 [2021-11-25 20:42:09,653 INFO L87 Difference]: Start difference. First operand 1201 states and 4220 transitions. Second operand has 23 states, 22 states have (on average 3.5) internal successors, (77), 22 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:42:10,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:42:10,331 INFO L93 Difference]: Finished difference Result 1506 states and 5293 transitions. [2021-11-25 20:42:10,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-25 20:42:10,331 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.5) internal successors, (77), 22 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-25 20:42:10,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:42:10,334 INFO L225 Difference]: With dead ends: 1506 [2021-11-25 20:42:10,334 INFO L226 Difference]: Without dead ends: 1463 [2021-11-25 20:42:10,334 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 54 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=188, Invalid=685, Unknown=1, NotChecked=56, Total=930 [2021-11-25 20:42:10,335 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 250 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 844 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 135 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-25 20:42:10,335 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [250 Valid, 153 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 844 Invalid, 0 Unknown, 135 Unchecked, 0.4s Time] [2021-11-25 20:42:10,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2021-11-25 20:42:10,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 1189. [2021-11-25 20:42:10,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1189 states, 1188 states have (on average 3.5134680134680134) internal successors, (4174), 1188 states have internal predecessors, (4174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:42:10,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1189 states to 1189 states and 4174 transitions. [2021-11-25 20:42:10,375 INFO L78 Accepts]: Start accepts. Automaton has 1189 states and 4174 transitions. Word has length 36 [2021-11-25 20:42:10,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:42:10,375 INFO L470 AbstractCegarLoop]: Abstraction has 1189 states and 4174 transitions. [2021-11-25 20:42:10,375 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.5) internal successors, (77), 22 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:42:10,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1189 states and 4174 transitions. [2021-11-25 20:42:10,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-25 20:42:10,379 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:42:10,379 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:42:10,413 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2021-11-25 20:42:10,602 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-11-25 20:42:10,602 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:42:10,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:42:10,602 INFO L85 PathProgramCache]: Analyzing trace with hash 2128680666, now seen corresponding path program 10 times [2021-11-25 20:42:10,602 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:42:10,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633906938] [2021-11-25 20:42:10,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:42:10,603 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:42:10,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:42:10,884 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:42:10,885 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:42:10,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633906938] [2021-11-25 20:42:10,885 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633906938] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:42:10,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92785525] [2021-11-25 20:42:10,885 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 20:42:10,885 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:42:10,885 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:42:10,886 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:42:10,887 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-11-25 20:42:11,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:42:11,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 59 conjunts are in the unsatisfiable core [2021-11-25 20:42:11,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:42:11,071 INFO L354 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2021-11-25 20:42:11,071 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 2 case distinctions, treesize of input 12 treesize of output 27 [2021-11-25 20:42:11,140 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-25 20:42:11,141 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-25 20:42:11,262 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-11-25 20:42:11,308 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-11-25 20:42:11,439 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:42:11,439 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:42:11,598 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1300 (Array Int Int))) (< (+ c_~s_2~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_1300) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (+ c_~s_6~0 1))) (forall ((v_ArrVal_1300 (Array Int Int))) (<= c_~s_6~0 (+ c_~s_2~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_1300) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)))))) is different from false [2021-11-25 20:42:11,610 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:42:11,611 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 58 treesize of output 49 [2021-11-25 20:42:11,615 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 18 treesize of output 11 [2021-11-25 20:42:11,645 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:42:11,651 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:42:11,651 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2021-11-25 20:42:11,795 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:42:11,795 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [92785525] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:42:11,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1531803114] [2021-11-25 20:42:11,795 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:42:11,796 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:42:11,796 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 22 [2021-11-25 20:42:11,796 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096465228] [2021-11-25 20:42:11,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:42:11,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-11-25 20:42:11,797 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:42:11,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-25 20:42:11,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=438, Unknown=1, NotChecked=42, Total=552 [2021-11-25 20:42:11,798 INFO L87 Difference]: Start difference. First operand 1189 states and 4174 transitions. Second operand has 24 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 23 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-25 20:42:12,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:42:12,683 INFO L93 Difference]: Finished difference Result 1581 states and 5560 transitions. [2021-11-25 20:42:12,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-25 20:42:12,683 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 23 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 36 [2021-11-25 20:42:12,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:42:12,686 INFO L225 Difference]: With dead ends: 1581 [2021-11-25 20:42:12,686 INFO L226 Difference]: Without dead ends: 1536 [2021-11-25 20:42:12,687 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 56 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=216, Invalid=976, Unknown=2, NotChecked=66, Total=1260 [2021-11-25 20:42:12,687 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 294 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 160 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-25 20:42:12,688 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [294 Valid, 170 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 786 Invalid, 0 Unknown, 160 Unchecked, 0.5s Time] [2021-11-25 20:42:12,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1536 states. [2021-11-25 20:42:12,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1536 to 1213. [2021-11-25 20:42:12,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1213 states, 1212 states have (on average 3.5033003300330035) internal successors, (4246), 1212 states have internal predecessors, (4246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:42:12,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1213 states to 1213 states and 4246 transitions. [2021-11-25 20:42:12,727 INFO L78 Accepts]: Start accepts. Automaton has 1213 states and 4246 transitions. Word has length 36 [2021-11-25 20:42:12,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:42:12,727 INFO L470 AbstractCegarLoop]: Abstraction has 1213 states and 4246 transitions. [2021-11-25 20:42:12,727 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 23 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-25 20:42:12,728 INFO L276 IsEmpty]: Start isEmpty. Operand 1213 states and 4246 transitions. [2021-11-25 20:42:12,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-25 20:42:12,731 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:42:12,731 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:42:12,766 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2021-11-25 20:42:12,950 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:42:12,950 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:42:12,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:42:12,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1409636218, now seen corresponding path program 11 times [2021-11-25 20:42:12,950 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:42:12,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139474657] [2021-11-25 20:42:12,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:42:12,951 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:42:13,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:42:13,230 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:42:13,230 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:42:13,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139474657] [2021-11-25 20:42:13,230 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139474657] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:42:13,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635018654] [2021-11-25 20:42:13,230 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 20:42:13,231 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:42:13,231 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:42:13,233 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:42:13,256 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-11-25 20:42:13,414 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 20:42:13,414 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:42:13,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 66 conjunts are in the unsatisfiable core [2021-11-25 20:42:13,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:42:13,440 INFO L354 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2021-11-25 20:42:13,440 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 2 case distinctions, treesize of input 12 treesize of output 27 [2021-11-25 20:42:13,504 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-25 20:42:13,504 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 15 treesize of output 15 [2021-11-25 20:42:13,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:42:13,709 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-11-25 20:42:13,779 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-11-25 20:42:13,810 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-11-25 20:42:13,871 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:42:13,871 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:42:13,981 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1363 (Array Int Int))) (< (+ c_~s_2~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1363) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (+ c_~s_6~0 1))) (forall ((v_ArrVal_1363 (Array Int Int))) (<= c_~s_6~0 (+ c_~s_2~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1363) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)))))) is different from false [2021-11-25 20:42:14,012 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1363 (Array Int Int)) (v_ArrVal_1362 (Array Int Int))) (< (+ c_~s_2~0 (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_1362) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1363) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (+ c_~s_6~0 1))) (forall ((v_ArrVal_1363 (Array Int Int)) (v_ArrVal_1362 (Array Int Int))) (<= c_~s_6~0 (+ c_~s_2~0 (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_1362) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1363) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)))))) is different from false [2021-11-25 20:42:14,022 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:42:14,022 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 128 treesize of output 101 [2021-11-25 20:42:14,025 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 83 treesize of output 69 [2021-11-25 20:42:14,029 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 37 treesize of output 30 [2021-11-25 20:42:14,121 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:42:14,122 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:42:14,129 INFO L354 Elim1Store]: treesize reduction 14, result has 22.2 percent of original size [2021-11-25 20:42:14,129 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2021-11-25 20:42:14,478 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2021-11-25 20:42:14,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [635018654] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:42:14,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1588811169] [2021-11-25 20:42:14,479 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:42:14,481 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:42:14,481 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2021-11-25 20:42:14,481 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103673068] [2021-11-25 20:42:14,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:42:14,482 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-11-25 20:42:14,482 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:42:14,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-11-25 20:42:14,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=471, Unknown=2, NotChecked=90, Total=650 [2021-11-25 20:42:14,483 INFO L87 Difference]: Start difference. First operand 1213 states and 4246 transitions. Second operand has 26 states, 25 states have (on average 3.16) internal successors, (79), 25 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:42:15,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:42:15,550 INFO L93 Difference]: Finished difference Result 1861 states and 6255 transitions. [2021-11-25 20:42:15,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-25 20:42:15,550 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.16) internal successors, (79), 25 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-25 20:42:15,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:42:15,554 INFO L225 Difference]: With dead ends: 1861 [2021-11-25 20:42:15,554 INFO L226 Difference]: Without dead ends: 1783 [2021-11-25 20:42:15,554 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 53 SyntacticMatches, 11 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=223, Invalid=973, Unknown=2, NotChecked=134, Total=1332 [2021-11-25 20:42:15,555 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 293 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 982 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 1335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 325 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-25 20:42:15,555 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [293 Valid, 219 Invalid, 1335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 982 Invalid, 0 Unknown, 325 Unchecked, 0.5s Time] [2021-11-25 20:42:15,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1783 states. [2021-11-25 20:42:15,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1783 to 1239. [2021-11-25 20:42:15,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1239 states, 1238 states have (on average 3.498384491114701) internal successors, (4331), 1238 states have internal predecessors, (4331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:42:15,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 4331 transitions. [2021-11-25 20:42:15,595 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 4331 transitions. Word has length 36 [2021-11-25 20:42:15,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:42:15,595 INFO L470 AbstractCegarLoop]: Abstraction has 1239 states and 4331 transitions. [2021-11-25 20:42:15,596 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.16) internal successors, (79), 25 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:42:15,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 4331 transitions. [2021-11-25 20:42:15,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-25 20:42:15,599 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:42:15,600 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:42:15,636 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2021-11-25 20:42:15,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-11-25 20:42:15,812 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:42:15,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:42:15,813 INFO L85 PathProgramCache]: Analyzing trace with hash 417258260, now seen corresponding path program 8 times [2021-11-25 20:42:15,813 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:42:15,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879379215] [2021-11-25 20:42:15,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:42:15,813 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:42:15,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:42:16,134 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:42:16,135 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:42:16,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879379215] [2021-11-25 20:42:16,135 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879379215] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:42:16,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408063729] [2021-11-25 20:42:16,135 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 20:42:16,138 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:42:16,139 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:42:16,140 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:42:16,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2021-11-25 20:42:16,290 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 20:42:16,291 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:42:16,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 66 conjunts are in the unsatisfiable core [2021-11-25 20:42:16,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:42:16,316 INFO L354 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2021-11-25 20:42:16,316 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 2 case distinctions, treesize of input 12 treesize of output 27 [2021-11-25 20:42:16,374 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-25 20:42:16,375 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-25 20:42:16,538 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-11-25 20:42:16,627 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-11-25 20:42:16,669 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-11-25 20:42:16,757 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:42:16,757 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:42:16,898 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1426 (Array Int Int))) (<= c_~s_6~0 (+ c_~s_2~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1426) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))))) (forall ((v_ArrVal_1426 (Array Int Int))) (< (+ c_~s_2~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1426) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (+ c_~s_6~0 1)))) is different from false [2021-11-25 20:42:16,943 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1425 (Array Int Int))) (<= c_~s_6~0 (+ c_~s_2~0 (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_1425) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1426) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))))) (forall ((v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1425 (Array Int Int))) (< (+ c_~s_2~0 (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_1425) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1426) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (+ c_~s_6~0 1)))) is different from false [2021-11-25 20:42:16,958 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:42:16,958 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 258 treesize of output 186 [2021-11-25 20:42:16,965 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 168 treesize of output 140 [2021-11-25 20:42:16,971 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 77 treesize of output 63 [2021-11-25 20:42:17,067 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:42:17,068 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:42:17,074 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:42:17,075 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2021-11-25 20:42:17,477 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2021-11-25 20:42:17,478 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408063729] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:42:17,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2105223710] [2021-11-25 20:42:17,478 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:42:17,478 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:42:17,478 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2021-11-25 20:42:17,478 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385336361] [2021-11-25 20:42:17,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:42:17,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-11-25 20:42:17,479 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:42:17,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-11-25 20:42:17,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=472, Unknown=2, NotChecked=90, Total=650 [2021-11-25 20:42:17,480 INFO L87 Difference]: Start difference. First operand 1239 states and 4331 transitions. Second operand has 26 states, 25 states have (on average 3.16) internal successors, (79), 25 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:42:18,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:42:18,059 INFO L93 Difference]: Finished difference Result 1503 states and 5270 transitions. [2021-11-25 20:42:18,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-25 20:42:18,059 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.16) internal successors, (79), 25 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-25 20:42:18,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:42:18,065 INFO L225 Difference]: With dead ends: 1503 [2021-11-25 20:42:18,065 INFO L226 Difference]: Without dead ends: 1460 [2021-11-25 20:42:18,066 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=155, Invalid=843, Unknown=2, NotChecked=122, Total=1122 [2021-11-25 20:42:18,067 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 236 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 355 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-25 20:42:18,067 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [236 Valid, 165 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 707 Invalid, 0 Unknown, 355 Unchecked, 0.4s Time] [2021-11-25 20:42:18,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1460 states. [2021-11-25 20:42:18,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460 to 1234. [2021-11-25 20:42:18,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1234 states, 1233 states have (on average 3.502838605028386) internal successors, (4319), 1233 states have internal predecessors, (4319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:42:18,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1234 states to 1234 states and 4319 transitions. [2021-11-25 20:42:18,096 INFO L78 Accepts]: Start accepts. Automaton has 1234 states and 4319 transitions. Word has length 36 [2021-11-25 20:42:18,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:42:18,096 INFO L470 AbstractCegarLoop]: Abstraction has 1234 states and 4319 transitions. [2021-11-25 20:42:18,096 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.16) internal successors, (79), 25 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:42:18,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1234 states and 4319 transitions. [2021-11-25 20:42:18,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-25 20:42:18,104 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:42:18,104 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:42:18,138 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2021-11-25 20:42:18,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-11-25 20:42:18,330 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:42:18,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:42:18,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1081551286, now seen corresponding path program 12 times [2021-11-25 20:42:18,330 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:42:18,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972122638] [2021-11-25 20:42:18,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:42:18,331 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:42:18,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:42:18,581 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:42:18,581 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:42:18,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972122638] [2021-11-25 20:42:18,581 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972122638] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:42:18,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219729152] [2021-11-25 20:42:18,581 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 20:42:18,581 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:42:18,582 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:42:18,582 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:42:18,583 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2021-11-25 20:42:18,725 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 20:42:18,725 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:42:18,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 63 conjunts are in the unsatisfiable core [2021-11-25 20:42:18,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:42:18,751 INFO L354 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2021-11-25 20:42:18,751 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 2 case distinctions, treesize of input 12 treesize of output 27 [2021-11-25 20:42:18,803 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-25 20:42:18,804 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-25 20:42:18,965 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-11-25 20:42:19,020 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-11-25 20:42:19,050 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-11-25 20:42:19,152 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:42:19,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:42:19,287 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1488 (Array Int Int))) (< (+ c_~s_2~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1488) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (+ c_~s_6~0 1))) (forall ((v_ArrVal_1488 (Array Int Int))) (<= c_~s_6~0 (+ c_~s_2~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1488) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)))))) is different from false [2021-11-25 20:42:19,321 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1488 (Array Int Int)) (v_ArrVal_1487 (Array Int Int))) (<= c_~s_6~0 (+ c_~s_2~0 (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_1487) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1488) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))))) (forall ((v_ArrVal_1488 (Array Int Int)) (v_ArrVal_1487 (Array Int Int))) (< (+ c_~s_2~0 (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_1487) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1488) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (+ c_~s_6~0 1)))) is different from false [2021-11-25 20:42:19,344 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:42:19,344 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 258 treesize of output 186 [2021-11-25 20:42:19,351 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 84 treesize of output 70 [2021-11-25 20:42:19,355 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 154 treesize of output 126 [2021-11-25 20:42:19,438 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:42:19,439 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:42:19,444 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:42:19,445 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2021-11-25 20:42:19,786 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2021-11-25 20:42:19,786 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219729152] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:42:19,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2140775541] [2021-11-25 20:42:19,786 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:42:19,786 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:42:19,787 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2021-11-25 20:42:19,787 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766796617] [2021-11-25 20:42:19,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:42:19,787 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-11-25 20:42:19,787 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:42:19,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-11-25 20:42:19,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=472, Unknown=2, NotChecked=90, Total=650 [2021-11-25 20:42:19,791 INFO L87 Difference]: Start difference. First operand 1234 states and 4319 transitions. Second operand has 26 states, 25 states have (on average 3.16) internal successors, (79), 25 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:42:20,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:42:20,771 INFO L93 Difference]: Finished difference Result 1613 states and 5595 transitions. [2021-11-25 20:42:20,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-25 20:42:20,772 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.16) internal successors, (79), 25 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-25 20:42:20,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:42:20,774 INFO L225 Difference]: With dead ends: 1613 [2021-11-25 20:42:20,774 INFO L226 Difference]: Without dead ends: 1574 [2021-11-25 20:42:20,775 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 53 SyntacticMatches, 6 SemanticMatches, 37 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=289, Invalid=1043, Unknown=8, NotChecked=142, Total=1482 [2021-11-25 20:42:20,776 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 311 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 276 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-25 20:42:20,776 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [311 Valid, 115 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 554 Invalid, 0 Unknown, 276 Unchecked, 0.4s Time] [2021-11-25 20:42:20,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1574 states. [2021-11-25 20:42:20,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1574 to 1197. [2021-11-25 20:42:20,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1197 states, 1196 states have (on average 3.5066889632107023) internal successors, (4194), 1196 states have internal predecessors, (4194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:42:20,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 1197 states and 4194 transitions. [2021-11-25 20:42:20,801 INFO L78 Accepts]: Start accepts. Automaton has 1197 states and 4194 transitions. Word has length 36 [2021-11-25 20:42:20,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:42:20,801 INFO L470 AbstractCegarLoop]: Abstraction has 1197 states and 4194 transitions. [2021-11-25 20:42:20,801 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.16) internal successors, (79), 25 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:42:20,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 4194 transitions. [2021-11-25 20:42:20,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-25 20:42:20,805 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:42:20,805 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:42:20,830 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2021-11-25 20:42:21,018 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-11-25 20:42:21,018 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:42:21,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:42:21,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1273686664, now seen corresponding path program 13 times [2021-11-25 20:42:21,018 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:42:21,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193427735] [2021-11-25 20:42:21,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:42:21,019 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:42:21,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:42:21,178 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:42:21,178 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:42:21,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193427735] [2021-11-25 20:42:21,179 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193427735] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:42:21,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668973183] [2021-11-25 20:42:21,179 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 20:42:21,179 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:42:21,180 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:42:21,180 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:42:21,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2021-11-25 20:42:21,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:42:21,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 49 conjunts are in the unsatisfiable core [2021-11-25 20:42:21,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:42:21,500 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-11-25 20:42:21,569 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:42:21,569 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:42:21,696 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:42:21,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 25 treesize of output 26 [2021-11-25 20:42:21,717 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:42:21,717 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 26 treesize of output 27 [2021-11-25 20:42:21,792 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:42:21,792 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668973183] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:42:21,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2059580994] [2021-11-25 20:42:21,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-25 20:42:21,793 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:42:21,794 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 15 [2021-11-25 20:42:21,794 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275135560] [2021-11-25 20:42:21,794 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:42:21,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-25 20:42:21,796 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:42:21,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-25 20:42:21,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2021-11-25 20:42:21,802 INFO L87 Difference]: Start difference. First operand 1197 states and 4194 transitions. Second operand has 16 states, 15 states have (on average 4.133333333333334) internal successors, (62), 16 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:42:22,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:42:22,428 INFO L93 Difference]: Finished difference Result 1877 states and 6562 transitions. [2021-11-25 20:42:22,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-25 20:42:22,429 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.133333333333334) internal successors, (62), 16 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 36 [2021-11-25 20:42:22,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:42:22,433 INFO L225 Difference]: With dead ends: 1877 [2021-11-25 20:42:22,433 INFO L226 Difference]: Without dead ends: 1795 [2021-11-25 20:42:22,434 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=581, Unknown=0, NotChecked=0, Total=756 [2021-11-25 20:42:22,436 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 245 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-25 20:42:22,436 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [245 Valid, 134 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 650 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-25 20:42:22,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1795 states. [2021-11-25 20:42:22,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1795 to 1231. [2021-11-25 20:42:22,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1231 states, 1230 states have (on average 3.5195121951219512) internal successors, (4329), 1230 states have internal predecessors, (4329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:42:22,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1231 states and 4329 transitions. [2021-11-25 20:42:22,466 INFO L78 Accepts]: Start accepts. Automaton has 1231 states and 4329 transitions. Word has length 36 [2021-11-25 20:42:22,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:42:22,466 INFO L470 AbstractCegarLoop]: Abstraction has 1231 states and 4329 transitions. [2021-11-25 20:42:22,467 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.133333333333334) internal successors, (62), 16 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:42:22,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 4329 transitions. [2021-11-25 20:42:22,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-25 20:42:22,470 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:42:22,471 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:42:22,508 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2021-11-25 20:42:22,686 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:42:22,686 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:42:22,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:42:22,686 INFO L85 PathProgramCache]: Analyzing trace with hash 658338782, now seen corresponding path program 14 times [2021-11-25 20:42:22,686 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:42:22,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392418124] [2021-11-25 20:42:22,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:42:22,686 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:42:22,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:42:22,957 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:42:22,958 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:42:22,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392418124] [2021-11-25 20:42:22,958 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392418124] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:42:22,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747067791] [2021-11-25 20:42:22,958 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 20:42:22,959 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:42:22,959 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:42:22,960 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:42:22,970 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2021-11-25 20:42:23,136 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 20:42:23,136 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:42:23,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 58 conjunts are in the unsatisfiable core [2021-11-25 20:42:23,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:42:23,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:42:23,387 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-11-25 20:42:23,424 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-11-25 20:42:23,472 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 20:42:23,472 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:42:23,559 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1601 (Array Int Int))) (< (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1601) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_7~0 4) 4))) (+ c_~s_2~0 1))) (forall ((v_ArrVal_1601 (Array Int Int))) (<= c_~s_2~0 (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1601) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_7~0 4) 4)))))) is different from false [2021-11-25 20:42:23,584 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1601 (Array Int Int))) (<= (+ c_~s_2~0 c_~t_4~0) (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1601) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_7~0 4) 4))))) (forall ((v_ArrVal_1601 (Array Int Int))) (< (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1601) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_7~0 4) 4))) (+ c_~s_2~0 c_~t_4~0 1)))) is different from false [2021-11-25 20:42:23,593 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:42:23,593 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 49 [2021-11-25 20:42:23,599 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2021-11-25 20:42:23,621 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:42:23,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:42:23,624 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 5 [2021-11-25 20:42:23,752 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2021-11-25 20:42:23,752 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747067791] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:42:23,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1054617539] [2021-11-25 20:42:23,753 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:42:23,753 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:42:23,753 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 24 [2021-11-25 20:42:23,753 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859464207] [2021-11-25 20:42:23,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:42:23,754 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-11-25 20:42:23,754 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:42:23,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-11-25 20:42:23,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=473, Unknown=2, NotChecked=90, Total=650 [2021-11-25 20:42:23,755 INFO L87 Difference]: Start difference. First operand 1231 states and 4329 transitions. Second operand has 26 states, 25 states have (on average 3.28) internal successors, (82), 25 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:42:24,327 WARN L838 $PredicateComparison]: unable to prove that (and (= c_~X_0~0.offset 0) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (forall ((v_ArrVal_1601 (Array Int Int))) (< (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1601) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_7~0 4) 4))) (+ c_~s_2~0 1))) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (forall ((v_ArrVal_1601 (Array Int Int))) (<= c_~s_2~0 (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1601) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_7~0 4) 4))))) (= |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)) is different from false [2021-11-25 20:42:24,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:42:24,775 INFO L93 Difference]: Finished difference Result 2351 states and 8375 transitions. [2021-11-25 20:42:24,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-25 20:42:24,775 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.28) internal successors, (82), 25 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-25 20:42:24,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:42:24,779 INFO L225 Difference]: With dead ends: 2351 [2021-11-25 20:42:24,780 INFO L226 Difference]: Without dead ends: 2281 [2021-11-25 20:42:24,780 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 55 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=300, Invalid=1114, Unknown=4, NotChecked=222, Total=1640 [2021-11-25 20:42:24,781 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 334 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 1035 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 1369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 303 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-25 20:42:24,781 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [334 Valid, 212 Invalid, 1369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1035 Invalid, 0 Unknown, 303 Unchecked, 0.5s Time] [2021-11-25 20:42:24,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2281 states. [2021-11-25 20:42:24,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2281 to 1239. [2021-11-25 20:42:24,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1239 states, 1238 states have (on average 3.5339256865912763) internal successors, (4375), 1238 states have internal predecessors, (4375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:42:24,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 4375 transitions. [2021-11-25 20:42:24,813 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 4375 transitions. Word has length 36 [2021-11-25 20:42:24,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:42:24,813 INFO L470 AbstractCegarLoop]: Abstraction has 1239 states and 4375 transitions. [2021-11-25 20:42:24,814 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.28) internal successors, (82), 25 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:42:24,814 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 4375 transitions. [2021-11-25 20:42:24,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-25 20:42:24,817 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:42:24,817 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:42:24,842 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2021-11-25 20:42:25,029 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:42:25,029 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:42:25,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:42:25,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1876314518, now seen corresponding path program 15 times [2021-11-25 20:42:25,029 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:42:25,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65357362] [2021-11-25 20:42:25,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:42:25,030 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:42:25,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:42:25,182 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:42:25,183 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:42:25,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65357362] [2021-11-25 20:42:25,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65357362] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:42:25,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131122406] [2021-11-25 20:42:25,183 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 20:42:25,184 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:42:25,184 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:42:25,184 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:42:25,207 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2021-11-25 20:42:25,380 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 20:42:25,381 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:42:25,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 53 conjunts are in the unsatisfiable core [2021-11-25 20:42:25,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:42:25,507 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-11-25 20:42:25,605 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 20:42:25,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:42:25,742 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:42:25,742 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2021-11-25 20:42:25,759 INFO L354 Elim1Store]: treesize reduction 14, result has 22.2 percent of original size [2021-11-25 20:42:25,760 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 25 treesize of output 12 [2021-11-25 20:42:25,826 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:42:25,827 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131122406] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:42:25,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1048709019] [2021-11-25 20:42:25,827 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:42:25,827 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:42:25,827 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 15 [2021-11-25 20:42:25,828 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546630693] [2021-11-25 20:42:25,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:42:25,828 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-25 20:42:25,828 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:42:25,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-25 20:42:25,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2021-11-25 20:42:25,829 INFO L87 Difference]: Start difference. First operand 1239 states and 4375 transitions. Second operand has 16 states, 15 states have (on average 4.0) internal successors, (60), 16 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-25 20:42:26,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:42:26,233 INFO L93 Difference]: Finished difference Result 1532 states and 5395 transitions. [2021-11-25 20:42:26,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-25 20:42:26,234 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.0) internal successors, (60), 16 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 36 [2021-11-25 20:42:26,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:42:26,237 INFO L225 Difference]: With dead ends: 1532 [2021-11-25 20:42:26,237 INFO L226 Difference]: Without dead ends: 1487 [2021-11-25 20:42:26,237 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 67 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=467, Unknown=0, NotChecked=0, Total=600 [2021-11-25 20:42:26,238 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 145 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-25 20:42:26,238 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 151 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-25 20:42:26,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2021-11-25 20:42:26,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 1233. [2021-11-25 20:42:26,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1233 states, 1232 states have (on average 3.529220779220779) internal successors, (4348), 1232 states have internal predecessors, (4348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:42:26,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1233 states and 4348 transitions. [2021-11-25 20:42:26,260 INFO L78 Accepts]: Start accepts. Automaton has 1233 states and 4348 transitions. Word has length 36 [2021-11-25 20:42:26,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:42:26,260 INFO L470 AbstractCegarLoop]: Abstraction has 1233 states and 4348 transitions. [2021-11-25 20:42:26,260 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.0) internal successors, (60), 16 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-25 20:42:26,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 4348 transitions. [2021-11-25 20:42:26,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-25 20:42:26,263 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:42:26,263 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:42:26,283 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2021-11-25 20:42:26,466 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:42:26,466 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:42:26,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:42:26,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1471862468, now seen corresponding path program 16 times [2021-11-25 20:42:26,466 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:42:26,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466080773] [2021-11-25 20:42:26,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:42:26,467 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:42:26,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:42:26,681 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:42:26,682 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:42:26,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466080773] [2021-11-25 20:42:26,682 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466080773] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:42:26,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959811042] [2021-11-25 20:42:26,682 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 20:42:26,682 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:42:26,682 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:42:26,683 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:42:26,705 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2021-11-25 20:42:26,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:42:26,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 54 conjunts are in the unsatisfiable core [2021-11-25 20:42:26,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:42:27,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:42:27,014 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-11-25 20:42:27,059 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-11-25 20:42:27,124 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:42:27,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:42:27,231 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1714 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1714) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_7~0 4) 4)) c_~s_6~0) (+ c_~s_2~0 c_~t_4~0))) (forall ((v_ArrVal_1714 (Array Int Int))) (< (+ c_~s_2~0 c_~t_4~0) (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1714) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_7~0 4) 4)) c_~s_6~0 1)))) is different from false [2021-11-25 20:42:27,254 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:42:27,254 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 60 treesize of output 51 [2021-11-25 20:42:27,257 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 19 treesize of output 12 [2021-11-25 20:42:27,283 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:42:27,288 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:42:27,288 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2021-11-25 20:42:27,421 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:42:27,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959811042] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:42:27,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [812724475] [2021-11-25 20:42:27,421 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:42:27,421 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:42:27,421 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2021-11-25 20:42:27,422 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247086066] [2021-11-25 20:42:27,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:42:27,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-11-25 20:42:27,422 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:42:27,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-25 20:42:27,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=351, Unknown=1, NotChecked=38, Total=462 [2021-11-25 20:42:27,423 INFO L87 Difference]: Start difference. First operand 1233 states and 4348 transitions. Second operand has 22 states, 21 states have (on average 3.619047619047619) internal successors, (76), 21 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:42:28,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:42:28,036 INFO L93 Difference]: Finished difference Result 1588 states and 5590 transitions. [2021-11-25 20:42:28,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-25 20:42:28,037 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.619047619047619) internal successors, (76), 21 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-25 20:42:28,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:42:28,040 INFO L225 Difference]: With dead ends: 1588 [2021-11-25 20:42:28,040 INFO L226 Difference]: Without dead ends: 1549 [2021-11-25 20:42:28,040 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 54 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=180, Invalid=635, Unknown=1, NotChecked=54, Total=870 [2021-11-25 20:42:28,040 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 221 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 125 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-25 20:42:28,041 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [221 Valid, 179 Invalid, 949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 807 Invalid, 0 Unknown, 125 Unchecked, 0.4s Time] [2021-11-25 20:42:28,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1549 states. [2021-11-25 20:42:28,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1549 to 1221. [2021-11-25 20:42:28,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1221 states, 1220 states have (on average 3.5262295081967214) internal successors, (4302), 1220 states have internal predecessors, (4302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:42:28,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 1221 states and 4302 transitions. [2021-11-25 20:42:28,062 INFO L78 Accepts]: Start accepts. Automaton has 1221 states and 4302 transitions. Word has length 36 [2021-11-25 20:42:28,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:42:28,063 INFO L470 AbstractCegarLoop]: Abstraction has 1221 states and 4302 transitions. [2021-11-25 20:42:28,063 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.619047619047619) internal successors, (76), 21 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:42:28,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 4302 transitions. [2021-11-25 20:42:28,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-25 20:42:28,065 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:42:28,065 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:42:28,092 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2021-11-25 20:42:28,286 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:42:28,286 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:42:28,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:42:28,286 INFO L85 PathProgramCache]: Analyzing trace with hash -884300770, now seen corresponding path program 17 times [2021-11-25 20:42:28,286 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:42:28,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039441038] [2021-11-25 20:42:28,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:42:28,287 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:42:28,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:42:28,475 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:42:28,475 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:42:28,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039441038] [2021-11-25 20:42:28,475 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039441038] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:42:28,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729228389] [2021-11-25 20:42:28,476 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 20:42:28,476 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:42:28,476 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:42:28,477 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:42:28,503 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2021-11-25 20:42:28,690 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 20:42:28,690 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:42:28,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 49 conjunts are in the unsatisfiable core [2021-11-25 20:42:28,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:42:28,789 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-11-25 20:42:28,897 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:42:28,897 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:42:29,009 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:42:29,009 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 26 treesize of output 27 [2021-11-25 20:42:29,024 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:42:29,025 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 25 treesize of output 26 [2021-11-25 20:42:29,110 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:42:29,110 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729228389] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:42:29,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1251619901] [2021-11-25 20:42:29,111 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:42:29,111 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:42:29,111 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 15 [2021-11-25 20:42:29,111 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666294050] [2021-11-25 20:42:29,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:42:29,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-25 20:42:29,112 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:42:29,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-25 20:42:29,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2021-11-25 20:42:29,112 INFO L87 Difference]: Start difference. First operand 1221 states and 4302 transitions. Second operand has 16 states, 15 states have (on average 4.066666666666666) internal successors, (61), 16 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:42:29,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:42:29,573 INFO L93 Difference]: Finished difference Result 1560 states and 5485 transitions. [2021-11-25 20:42:29,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-25 20:42:29,573 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.066666666666666) internal successors, (61), 16 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 36 [2021-11-25 20:42:29,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:42:29,576 INFO L225 Difference]: With dead ends: 1560 [2021-11-25 20:42:29,576 INFO L226 Difference]: Without dead ends: 1515 [2021-11-25 20:42:29,576 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 67 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2021-11-25 20:42:29,577 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 163 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-25 20:42:29,577 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 193 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-25 20:42:29,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2021-11-25 20:42:29,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1249. [2021-11-25 20:42:29,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1249 states, 1248 states have (on average 3.5256410256410255) internal successors, (4400), 1248 states have internal predecessors, (4400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:42:29,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 4400 transitions. [2021-11-25 20:42:29,600 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 4400 transitions. Word has length 36 [2021-11-25 20:42:29,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:42:29,600 INFO L470 AbstractCegarLoop]: Abstraction has 1249 states and 4400 transitions. [2021-11-25 20:42:29,600 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.066666666666666) internal successors, (61), 16 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:42:29,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 4400 transitions. [2021-11-25 20:42:29,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-25 20:42:29,604 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:42:29,604 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:42:29,639 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2021-11-25 20:42:29,830 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:42:29,830 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:42:29,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:42:29,830 INFO L85 PathProgramCache]: Analyzing trace with hash -127650358, now seen corresponding path program 18 times [2021-11-25 20:42:29,830 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:42:29,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427910071] [2021-11-25 20:42:29,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:42:29,831 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:42:29,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:42:30,079 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:42:30,079 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:42:30,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427910071] [2021-11-25 20:42:30,079 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427910071] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:42:30,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012910584] [2021-11-25 20:42:30,079 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 20:42:30,079 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:42:30,080 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:42:30,081 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:42:30,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2021-11-25 20:42:30,233 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 20:42:30,234 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:42:30,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 60 conjunts are in the unsatisfiable core [2021-11-25 20:42:30,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:42:30,259 INFO L354 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2021-11-25 20:42:30,259 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 2 case distinctions, treesize of input 12 treesize of output 27 [2021-11-25 20:42:30,338 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-25 20:42:30,338 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 15 treesize of output 15 [2021-11-25 20:42:30,460 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-11-25 20:42:30,490 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-11-25 20:42:30,557 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:42:30,557 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:42:30,662 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1831 (Array Int Int))) (<= c_~s_6~0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1831) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)) c_~s_2~0))) (forall ((v_ArrVal_1831 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1831) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)) c_~s_2~0) (+ c_~s_6~0 1)))) is different from false [2021-11-25 20:42:30,695 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:42:30,696 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 51 [2021-11-25 20:42:30,699 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 19 treesize of output 12 [2021-11-25 20:42:30,729 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:42:30,735 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:42:30,735 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2021-11-25 20:42:30,914 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2021-11-25 20:42:30,914 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2012910584] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:42:30,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [402165647] [2021-11-25 20:42:30,914 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:42:30,915 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:42:30,915 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 22 [2021-11-25 20:42:30,915 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693174813] [2021-11-25 20:42:30,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:42:30,915 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-11-25 20:42:30,915 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:42:30,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-25 20:42:30,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=436, Unknown=1, NotChecked=42, Total=552 [2021-11-25 20:42:30,916 INFO L87 Difference]: Start difference. First operand 1249 states and 4400 transitions. Second operand has 24 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 23 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:42:31,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:42:31,801 INFO L93 Difference]: Finished difference Result 1670 states and 5870 transitions. [2021-11-25 20:42:31,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-25 20:42:31,801 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 23 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-25 20:42:31,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:42:31,804 INFO L225 Difference]: With dead ends: 1670 [2021-11-25 20:42:31,805 INFO L226 Difference]: Without dead ends: 1631 [2021-11-25 20:42:31,805 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=214, Invalid=1049, Unknown=1, NotChecked=68, Total=1332 [2021-11-25 20:42:31,805 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 240 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 1473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 466 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-25 20:42:31,806 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [240 Valid, 225 Invalid, 1473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 986 Invalid, 0 Unknown, 466 Unchecked, 0.5s Time] [2021-11-25 20:42:31,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2021-11-25 20:42:31,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1249. [2021-11-25 20:42:31,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1249 states, 1248 states have (on average 3.5256410256410255) internal successors, (4400), 1248 states have internal predecessors, (4400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:42:31,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 4400 transitions. [2021-11-25 20:42:31,827 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 4400 transitions. Word has length 36 [2021-11-25 20:42:31,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:42:31,828 INFO L470 AbstractCegarLoop]: Abstraction has 1249 states and 4400 transitions. [2021-11-25 20:42:31,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 23 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:42:31,828 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 4400 transitions. [2021-11-25 20:42:31,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-25 20:42:31,830 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:42:31,830 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:42:31,850 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2021-11-25 20:42:32,030 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2021-11-25 20:42:32,030 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:42:32,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:42:32,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1699244120, now seen corresponding path program 9 times [2021-11-25 20:42:32,031 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:42:32,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580395354] [2021-11-25 20:42:32,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:42:32,031 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:42:32,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:42:32,301 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:42:32,301 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:42:32,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580395354] [2021-11-25 20:42:32,302 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580395354] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:42:32,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988932619] [2021-11-25 20:42:32,302 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 20:42:32,302 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:42:32,302 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:42:32,303 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:42:32,322 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2021-11-25 20:42:32,506 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 20:42:32,506 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:42:32,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 65 conjunts are in the unsatisfiable core [2021-11-25 20:42:32,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:42:32,538 INFO L354 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2021-11-25 20:42:32,539 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 2 case distinctions, treesize of input 12 treesize of output 27 [2021-11-25 20:42:32,639 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-25 20:42:32,639 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-25 20:42:32,745 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-11-25 20:42:32,776 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-11-25 20:42:32,844 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:42:32,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:42:32,951 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1893 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1893) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)) c_~s_2~0) (+ c_~s_6~0 1))) (forall ((v_ArrVal_1893 (Array Int Int))) (<= c_~s_6~0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1893) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)) c_~s_2~0)))) is different from false [2021-11-25 20:42:32,978 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:42:32,978 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 60 treesize of output 51 [2021-11-25 20:42:32,997 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 19 treesize of output 12 [2021-11-25 20:42:33,029 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:42:33,036 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:42:33,036 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2021-11-25 20:42:33,305 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2021-11-25 20:42:33,306 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1988932619] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:42:33,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1325647184] [2021-11-25 20:42:33,306 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:42:33,306 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:42:33,306 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 22 [2021-11-25 20:42:33,306 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912457722] [2021-11-25 20:42:33,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:42:33,307 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-11-25 20:42:33,307 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:42:33,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-25 20:42:33,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=436, Unknown=1, NotChecked=42, Total=552 [2021-11-25 20:42:33,308 INFO L87 Difference]: Start difference. First operand 1249 states and 4400 transitions. Second operand has 24 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 23 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:42:34,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:42:34,377 INFO L93 Difference]: Finished difference Result 1558 states and 5483 transitions. [2021-11-25 20:42:34,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-25 20:42:34,377 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 23 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-25 20:42:34,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:42:34,380 INFO L225 Difference]: With dead ends: 1558 [2021-11-25 20:42:34,380 INFO L226 Difference]: Without dead ends: 1515 [2021-11-25 20:42:34,381 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 56 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 2 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=233, Invalid=1102, Unknown=1, NotChecked=70, Total=1406 [2021-11-25 20:42:34,381 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 210 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 1038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 299 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-25 20:42:34,381 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [210 Valid, 224 Invalid, 1038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 717 Invalid, 0 Unknown, 299 Unchecked, 0.5s Time] [2021-11-25 20:42:34,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2021-11-25 20:42:34,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1261. [2021-11-25 20:42:34,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1261 states, 1260 states have (on average 3.5317460317460316) internal successors, (4450), 1260 states have internal predecessors, (4450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:42:34,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1261 states to 1261 states and 4450 transitions. [2021-11-25 20:42:34,402 INFO L78 Accepts]: Start accepts. Automaton has 1261 states and 4450 transitions. Word has length 36 [2021-11-25 20:42:34,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:42:34,402 INFO L470 AbstractCegarLoop]: Abstraction has 1261 states and 4450 transitions. [2021-11-25 20:42:34,402 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 23 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:42:34,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 4450 transitions. [2021-11-25 20:42:34,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-25 20:42:34,404 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:42:34,405 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:42:34,425 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2021-11-25 20:42:34,605 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2021-11-25 20:42:34,605 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:42:34,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:42:34,606 INFO L85 PathProgramCache]: Analyzing trace with hash 992395096, now seen corresponding path program 10 times [2021-11-25 20:42:34,606 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:42:34,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804334876] [2021-11-25 20:42:34,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:42:34,606 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:42:34,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:42:34,787 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:42:34,787 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:42:34,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804334876] [2021-11-25 20:42:34,788 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804334876] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:42:34,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243022663] [2021-11-25 20:42:34,788 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 20:42:34,788 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:42:34,789 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:42:34,789 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:42:34,808 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2021-11-25 20:42:34,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:42:35,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 49 conjunts are in the unsatisfiable core [2021-11-25 20:42:35,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:42:35,130 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-11-25 20:42:35,210 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:42:35,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:42:35,305 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:42:35,306 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 26 treesize of output 27 [2021-11-25 20:42:35,338 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:42:35,339 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 25 treesize of output 26 [2021-11-25 20:42:35,429 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:42:35,430 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [243022663] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:42:35,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [688183580] [2021-11-25 20:42:35,430 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:42:35,430 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:42:35,430 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 14 [2021-11-25 20:42:35,431 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684053637] [2021-11-25 20:42:35,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:42:35,431 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 20:42:35,431 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:42:35,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 20:42:35,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2021-11-25 20:42:35,432 INFO L87 Difference]: Start difference. First operand 1261 states and 4450 transitions. Second operand has 15 states, 14 states have (on average 5.0) internal successors, (70), 15 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-25 20:42:35,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:42:35,960 INFO L93 Difference]: Finished difference Result 1516 states and 5353 transitions. [2021-11-25 20:42:35,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-25 20:42:35,961 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 5.0) internal successors, (70), 15 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 36 [2021-11-25 20:42:35,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:42:35,964 INFO L225 Difference]: With dead ends: 1516 [2021-11-25 20:42:35,964 INFO L226 Difference]: Without dead ends: 1473 [2021-11-25 20:42:35,964 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 68 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=381, Unknown=0, NotChecked=0, Total=506 [2021-11-25 20:42:35,965 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 160 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 886 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-25 20:42:35,965 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 208 Invalid, 894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 886 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-25 20:42:35,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1473 states. [2021-11-25 20:42:35,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1473 to 1275. [2021-11-25 20:42:35,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1275 states, 1274 states have (on average 3.536106750392465) internal successors, (4505), 1274 states have internal predecessors, (4505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:42:35,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 4505 transitions. [2021-11-25 20:42:35,994 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 4505 transitions. Word has length 36 [2021-11-25 20:42:35,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:42:35,994 INFO L470 AbstractCegarLoop]: Abstraction has 1275 states and 4505 transitions. [2021-11-25 20:42:35,994 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 5.0) internal successors, (70), 15 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-25 20:42:35,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 4505 transitions. [2021-11-25 20:42:35,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-25 20:42:35,997 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:42:35,997 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:42:36,017 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2021-11-25 20:42:36,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2021-11-25 20:42:36,198 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:42:36,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:42:36,198 INFO L85 PathProgramCache]: Analyzing trace with hash 953880984, now seen corresponding path program 11 times [2021-11-25 20:42:36,198 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:42:36,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305281910] [2021-11-25 20:42:36,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:42:36,199 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:42:36,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:42:36,585 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:42:36,585 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:42:36,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305281910] [2021-11-25 20:42:36,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305281910] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:42:36,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737217008] [2021-11-25 20:42:36,586 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 20:42:36,586 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:42:36,586 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:42:36,590 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:42:36,605 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2021-11-25 20:42:36,818 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 20:42:36,819 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:42:36,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 53 conjunts are in the unsatisfiable core [2021-11-25 20:42:36,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:42:37,055 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-11-25 20:42:37,109 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 20:42:37,109 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:42:37,218 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:42:37,219 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 26 treesize of output 27 [2021-11-25 20:42:37,232 INFO L354 Elim1Store]: treesize reduction 14, result has 22.2 percent of original size [2021-11-25 20:42:37,232 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 25 treesize of output 12 [2021-11-25 20:42:37,317 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:42:37,318 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737217008] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:42:37,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1067649822] [2021-11-25 20:42:37,318 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:42:37,319 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:42:37,319 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 6] total 21 [2021-11-25 20:42:37,320 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751127051] [2021-11-25 20:42:37,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:42:37,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-11-25 20:42:37,320 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:42:37,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-25 20:42:37,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2021-11-25 20:42:37,321 INFO L87 Difference]: Start difference. First operand 1275 states and 4505 transitions. Second operand has 22 states, 21 states have (on average 3.5238095238095237) internal successors, (74), 22 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:42:38,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:42:38,003 INFO L93 Difference]: Finished difference Result 1542 states and 5431 transitions. [2021-11-25 20:42:38,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-25 20:42:38,003 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.5238095238095237) internal successors, (74), 22 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-25 20:42:38,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:42:38,006 INFO L225 Difference]: With dead ends: 1542 [2021-11-25 20:42:38,006 INFO L226 Difference]: Without dead ends: 1509 [2021-11-25 20:42:38,006 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 68 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=183, Invalid=809, Unknown=0, NotChecked=0, Total=992 [2021-11-25 20:42:38,007 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 181 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-25 20:42:38,007 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [181 Valid, 185 Invalid, 935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-25 20:42:38,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states. [2021-11-25 20:42:38,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 1261. [2021-11-25 20:42:38,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1261 states, 1260 states have (on average 3.5317460317460316) internal successors, (4450), 1260 states have internal predecessors, (4450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:42:38,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1261 states to 1261 states and 4450 transitions. [2021-11-25 20:42:38,028 INFO L78 Accepts]: Start accepts. Automaton has 1261 states and 4450 transitions. Word has length 36 [2021-11-25 20:42:38,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:42:38,028 INFO L470 AbstractCegarLoop]: Abstraction has 1261 states and 4450 transitions. [2021-11-25 20:42:38,028 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.5238095238095237) internal successors, (74), 22 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:42:38,028 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 4450 transitions. [2021-11-25 20:42:38,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-25 20:42:38,030 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:42:38,030 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:42:38,050 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2021-11-25 20:42:38,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2021-11-25 20:42:38,231 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:42:38,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:42:38,231 INFO L85 PathProgramCache]: Analyzing trace with hash 2142383406, now seen corresponding path program 12 times [2021-11-25 20:42:38,231 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:42:38,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969000122] [2021-11-25 20:42:38,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:42:38,232 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:42:38,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:42:38,480 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:42:38,481 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:42:38,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969000122] [2021-11-25 20:42:38,481 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969000122] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:42:38,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423867943] [2021-11-25 20:42:38,481 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 20:42:38,481 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:42:38,481 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:42:38,482 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:42:38,484 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2021-11-25 20:42:38,648 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 20:42:38,648 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:42:38,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 60 conjunts are in the unsatisfiable core [2021-11-25 20:42:38,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:42:38,673 INFO L354 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2021-11-25 20:42:38,673 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 2 case distinctions, treesize of input 12 treesize of output 27 [2021-11-25 20:42:38,747 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-25 20:42:38,747 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2021-11-25 20:42:38,858 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-11-25 20:42:38,887 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-11-25 20:42:38,954 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:42:38,954 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:42:39,060 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2066 (Array Int Int))) (< (+ c_~s_2~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2066) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (+ c_~s_6~0 1))) (forall ((v_ArrVal_2066 (Array Int Int))) (<= c_~s_6~0 (+ c_~s_2~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2066) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)))))) is different from false [2021-11-25 20:42:39,091 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:42:39,091 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 60 treesize of output 51 [2021-11-25 20:42:39,095 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 19 treesize of output 12 [2021-11-25 20:42:39,126 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:42:39,131 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:42:39,131 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2021-11-25 20:42:39,321 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2021-11-25 20:42:39,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [423867943] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:42:39,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1278082099] [2021-11-25 20:42:39,322 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:42:39,322 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:42:39,322 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 22 [2021-11-25 20:42:39,322 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331178363] [2021-11-25 20:42:39,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:42:39,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-11-25 20:42:39,323 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:42:39,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-25 20:42:39,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=436, Unknown=1, NotChecked=42, Total=552 [2021-11-25 20:42:39,324 INFO L87 Difference]: Start difference. First operand 1261 states and 4450 transitions. Second operand has 24 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 23 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:42:40,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:42:40,118 INFO L93 Difference]: Finished difference Result 1634 states and 5750 transitions. [2021-11-25 20:42:40,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-25 20:42:40,118 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 23 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-25 20:42:40,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:42:40,121 INFO L225 Difference]: With dead ends: 1634 [2021-11-25 20:42:40,121 INFO L226 Difference]: Without dead ends: 1591 [2021-11-25 20:42:40,122 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 57 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 2 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=246, Invalid=1163, Unknown=1, NotChecked=72, Total=1482 [2021-11-25 20:42:40,122 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 216 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 251 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-25 20:42:40,122 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [216 Valid, 189 Invalid, 963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 683 Invalid, 0 Unknown, 251 Unchecked, 0.4s Time] [2021-11-25 20:42:40,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2021-11-25 20:42:40,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 1249. [2021-11-25 20:42:40,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1249 states, 1248 states have (on average 3.5256410256410255) internal successors, (4400), 1248 states have internal predecessors, (4400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:42:40,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 4400 transitions. [2021-11-25 20:42:40,151 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 4400 transitions. Word has length 36 [2021-11-25 20:42:40,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:42:40,151 INFO L470 AbstractCegarLoop]: Abstraction has 1249 states and 4400 transitions. [2021-11-25 20:42:40,151 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 23 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:42:40,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 4400 transitions. [2021-11-25 20:42:40,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-25 20:42:40,155 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:42:40,155 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:42:40,198 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2021-11-25 20:42:40,370 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2021-11-25 20:42:40,370 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:42:40,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:42:40,370 INFO L85 PathProgramCache]: Analyzing trace with hash 2082679322, now seen corresponding path program 19 times [2021-11-25 20:42:40,370 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:42:40,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468979327] [2021-11-25 20:42:40,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:42:40,371 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:42:40,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:42:40,625 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:42:40,625 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:42:40,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468979327] [2021-11-25 20:42:40,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468979327] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:42:40,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934111226] [2021-11-25 20:42:40,625 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 20:42:40,625 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:42:40,625 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:42:40,630 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:42:40,652 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2021-11-25 20:42:40,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:42:40,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 54 conjunts are in the unsatisfiable core [2021-11-25 20:42:40,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:42:40,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:42:40,962 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-11-25 20:42:41,001 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-11-25 20:42:41,081 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:42:41,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:42:41,211 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2123 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_2123) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)) c_~s_2~0) (+ c_~s_6~0 1))) (forall ((v_ArrVal_2123 (Array Int Int))) (<= c_~s_6~0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_2123) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)) c_~s_2~0)))) is different from false [2021-11-25 20:42:41,220 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:42:41,221 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 60 treesize of output 51 [2021-11-25 20:42:41,224 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 19 treesize of output 12 [2021-11-25 20:42:41,249 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:42:41,254 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:42:41,254 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2021-11-25 20:42:41,378 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:42:41,378 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934111226] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:42:41,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1801091478] [2021-11-25 20:42:41,378 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:42:41,378 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:42:41,379 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 22 [2021-11-25 20:42:41,379 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125406642] [2021-11-25 20:42:41,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:42:41,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-11-25 20:42:41,379 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:42:41,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-25 20:42:41,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=439, Unknown=1, NotChecked=42, Total=552 [2021-11-25 20:42:41,380 INFO L87 Difference]: Start difference. First operand 1249 states and 4400 transitions. Second operand has 24 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 23 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-25 20:42:42,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:42:42,400 INFO L93 Difference]: Finished difference Result 1690 states and 5939 transitions. [2021-11-25 20:42:42,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-25 20:42:42,400 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 23 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 36 [2021-11-25 20:42:42,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:42:42,403 INFO L225 Difference]: With dead ends: 1690 [2021-11-25 20:42:42,403 INFO L226 Difference]: Without dead ends: 1645 [2021-11-25 20:42:42,404 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 55 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=264, Invalid=1071, Unknown=1, NotChecked=70, Total=1406 [2021-11-25 20:42:42,404 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 274 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 1150 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 1312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 135 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-25 20:42:42,405 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [274 Valid, 265 Invalid, 1312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1150 Invalid, 0 Unknown, 135 Unchecked, 0.6s Time] [2021-11-25 20:42:42,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1645 states. [2021-11-25 20:42:42,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1645 to 1261. [2021-11-25 20:42:42,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1261 states, 1260 states have (on average 3.522222222222222) internal successors, (4438), 1260 states have internal predecessors, (4438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:42:42,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1261 states to 1261 states and 4438 transitions. [2021-11-25 20:42:42,426 INFO L78 Accepts]: Start accepts. Automaton has 1261 states and 4438 transitions. Word has length 36 [2021-11-25 20:42:42,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:42:42,427 INFO L470 AbstractCegarLoop]: Abstraction has 1261 states and 4438 transitions. [2021-11-25 20:42:42,427 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 23 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-25 20:42:42,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 4438 transitions. [2021-11-25 20:42:42,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-25 20:42:42,429 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:42:42,429 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:42:42,449 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2021-11-25 20:42:42,629 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2021-11-25 20:42:42,630 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:42:42,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:42:42,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1101031360, now seen corresponding path program 20 times [2021-11-25 20:42:42,630 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:42:42,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854909457] [2021-11-25 20:42:42,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:42:42,630 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:42:42,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:42:42,855 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:42:42,856 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:42:42,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854909457] [2021-11-25 20:42:42,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854909457] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:42:42,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902744269] [2021-11-25 20:42:42,856 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 20:42:42,856 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:42:42,856 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:42:42,858 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:42:42,880 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2021-11-25 20:42:43,092 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 20:42:43,092 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:42:43,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 63 conjunts are in the unsatisfiable core [2021-11-25 20:42:43,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:42:43,124 INFO L354 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2021-11-25 20:42:43,124 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 2 case distinctions, treesize of input 12 treesize of output 27 [2021-11-25 20:42:43,224 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-25 20:42:43,225 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-11-25 20:42:43,310 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-11-25 20:42:43,361 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-11-25 20:42:43,459 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 20:42:43,460 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:42:43,615 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2183 (Array Int Int))) (<= c_~s_6~0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_2183) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)) c_~s_2~0))) (forall ((v_ArrVal_2183 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_2183) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)) c_~s_2~0) (+ c_~s_6~0 1)))) is different from false [2021-11-25 20:42:43,627 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:42:43,627 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 58 treesize of output 49 [2021-11-25 20:42:43,631 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 18 treesize of output 11 [2021-11-25 20:42:43,666 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:42:43,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:42:43,669 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 5 [2021-11-25 20:42:43,794 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:42:43,794 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1902744269] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:42:43,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2081433658] [2021-11-25 20:42:43,795 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:42:43,795 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:42:43,795 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 23 [2021-11-25 20:42:43,795 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716267069] [2021-11-25 20:42:43,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:42:43,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-25 20:42:43,796 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:42:43,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-25 20:42:43,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=471, Unknown=1, NotChecked=44, Total=600 [2021-11-25 20:42:43,796 INFO L87 Difference]: Start difference. First operand 1261 states and 4438 transitions. Second operand has 25 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 24 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:42:44,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:42:44,500 INFO L93 Difference]: Finished difference Result 1707 states and 5999 transitions. [2021-11-25 20:42:44,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-25 20:42:44,501 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 24 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-25 20:42:44,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:42:44,504 INFO L225 Difference]: With dead ends: 1707 [2021-11-25 20:42:44,504 INFO L226 Difference]: Without dead ends: 1662 [2021-11-25 20:42:44,504 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=212, Invalid=913, Unknown=1, NotChecked=64, Total=1190 [2021-11-25 20:42:44,505 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 214 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 938 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 1207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 252 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-25 20:42:44,505 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [214 Valid, 256 Invalid, 1207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 938 Invalid, 0 Unknown, 252 Unchecked, 0.5s Time] [2021-11-25 20:42:44,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1662 states. [2021-11-25 20:42:44,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1662 to 1273. [2021-11-25 20:42:44,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1273 states, 1272 states have (on average 3.5157232704402515) internal successors, (4472), 1272 states have internal predecessors, (4472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:42:44,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1273 states to 1273 states and 4472 transitions. [2021-11-25 20:42:44,527 INFO L78 Accepts]: Start accepts. Automaton has 1273 states and 4472 transitions. Word has length 36 [2021-11-25 20:42:44,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:42:44,527 INFO L470 AbstractCegarLoop]: Abstraction has 1273 states and 4472 transitions. [2021-11-25 20:42:44,527 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 24 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:42:44,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1273 states and 4472 transitions. [2021-11-25 20:42:44,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-25 20:42:44,530 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:42:44,530 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:42:44,550 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2021-11-25 20:42:44,730 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2021-11-25 20:42:44,730 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:42:44,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:42:44,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1455637562, now seen corresponding path program 21 times [2021-11-25 20:42:44,731 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:42:44,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30613849] [2021-11-25 20:42:44,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:42:44,731 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:42:44,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:42:45,067 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:42:45,067 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:42:45,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30613849] [2021-11-25 20:42:45,068 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30613849] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:42:45,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034936307] [2021-11-25 20:42:45,068 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 20:42:45,068 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:42:45,068 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:42:45,069 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:42:45,092 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2021-11-25 20:42:45,292 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 20:42:45,292 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:42:45,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 62 conjunts are in the unsatisfiable core [2021-11-25 20:42:45,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:42:45,326 INFO L354 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2021-11-25 20:42:45,327 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 2 case distinctions, treesize of input 12 treesize of output 27 [2021-11-25 20:42:45,453 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-25 20:42:45,454 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-25 20:42:45,543 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-11-25 20:42:45,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:42:45,621 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-11-25 20:42:45,651 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-11-25 20:42:45,717 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:42:45,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:42:45,822 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2244 (Array Int Int))) (<= c_~s_6~0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2244) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)) c_~s_2~0))) (forall ((v_ArrVal_2244 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2244) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)) c_~s_2~0) (+ c_~s_6~0 1)))) is different from false [2021-11-25 20:42:45,853 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2244 (Array Int Int)) (v_ArrVal_2243 (Array Int Int))) (< (+ c_~s_2~0 (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_2243) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2244) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (+ c_~s_6~0 1))) (forall ((v_ArrVal_2244 (Array Int Int)) (v_ArrVal_2243 (Array Int Int))) (<= c_~s_6~0 (+ c_~s_2~0 (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_2243) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2244) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)))))) is different from false [2021-11-25 20:42:45,863 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:42:45,863 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 128 treesize of output 101 [2021-11-25 20:42:45,867 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 44 treesize of output 37 [2021-11-25 20:42:45,869 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 76 treesize of output 62 [2021-11-25 20:42:45,938 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:42:45,939 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:42:45,944 INFO L354 Elim1Store]: treesize reduction 14, result has 22.2 percent of original size [2021-11-25 20:42:45,944 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2021-11-25 20:42:46,275 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2021-11-25 20:42:46,275 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034936307] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:42:46,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1831699750] [2021-11-25 20:42:46,276 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:42:46,276 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:42:46,276 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2021-11-25 20:42:46,276 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318719596] [2021-11-25 20:42:46,276 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:42:46,276 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-25 20:42:46,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:42:46,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-25 20:42:46,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=431, Unknown=2, NotChecked=86, Total=600 [2021-11-25 20:42:46,277 INFO L87 Difference]: Start difference. First operand 1273 states and 4472 transitions. Second operand has 25 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 24 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:42:46,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:42:46,955 INFO L93 Difference]: Finished difference Result 1654 states and 5813 transitions. [2021-11-25 20:42:46,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-25 20:42:46,955 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 24 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-25 20:42:46,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:42:46,958 INFO L225 Difference]: With dead ends: 1654 [2021-11-25 20:42:46,958 INFO L226 Difference]: Without dead ends: 1615 [2021-11-25 20:42:46,959 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 54 SyntacticMatches, 6 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=148, Invalid=728, Unknown=2, NotChecked=114, Total=992 [2021-11-25 20:42:46,959 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 164 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 1375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 449 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-25 20:42:46,959 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 227 Invalid, 1375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 911 Invalid, 0 Unknown, 449 Unchecked, 0.5s Time] [2021-11-25 20:42:46,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1615 states. [2021-11-25 20:42:46,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1615 to 1271. [2021-11-25 20:42:46,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1271 states, 1270 states have (on average 3.5244094488188975) internal successors, (4476), 1270 states have internal predecessors, (4476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:42:46,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 4476 transitions. [2021-11-25 20:42:46,991 INFO L78 Accepts]: Start accepts. Automaton has 1271 states and 4476 transitions. Word has length 36 [2021-11-25 20:42:46,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:42:46,991 INFO L470 AbstractCegarLoop]: Abstraction has 1271 states and 4476 transitions. [2021-11-25 20:42:46,992 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 24 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:42:46,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 4476 transitions. [2021-11-25 20:42:46,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-25 20:42:46,995 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:42:46,995 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:42:47,034 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2021-11-25 20:42:47,217 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:42:47,218 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:42:47,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:42:47,218 INFO L85 PathProgramCache]: Analyzing trace with hash 371256916, now seen corresponding path program 13 times [2021-11-25 20:42:47,218 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:42:47,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407163736] [2021-11-25 20:42:47,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:42:47,218 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:42:47,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:42:47,550 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:42:47,550 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:42:47,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407163736] [2021-11-25 20:42:47,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407163736] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:42:47,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719285256] [2021-11-25 20:42:47,551 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 20:42:47,551 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:42:47,551 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:42:47,558 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:42:47,581 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2021-11-25 20:42:47,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:42:47,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 56 conjunts are in the unsatisfiable core [2021-11-25 20:42:47,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:42:47,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:42:47,974 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-11-25 20:42:48,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:42:48,062 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-11-25 20:42:48,101 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-11-25 20:42:48,191 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:42:48,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:42:48,335 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2302 (Array Int Int))) (<= c_~s_6~0 (+ c_~s_2~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2302) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))))) (forall ((v_ArrVal_2302 (Array Int Int))) (< (+ c_~s_2~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2302) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (+ c_~s_6~0 1)))) is different from false [2021-11-25 20:42:48,377 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2302 (Array Int Int)) (v_ArrVal_2301 (Array Int Int))) (<= c_~s_6~0 (+ c_~s_2~0 (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_2301) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2302) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))))) (forall ((v_ArrVal_2302 (Array Int Int)) (v_ArrVal_2301 (Array Int Int))) (< (+ c_~s_2~0 (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_2301) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2302) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (+ c_~s_6~0 1)))) is different from false [2021-11-25 20:42:48,391 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:42:48,392 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 258 treesize of output 186 [2021-11-25 20:42:48,396 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 168 treesize of output 140 [2021-11-25 20:42:48,404 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 77 treesize of output 63 [2021-11-25 20:42:48,501 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:42:48,501 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:42:48,508 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:42:48,508 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2021-11-25 20:42:48,701 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2021-11-25 20:42:48,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719285256] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:42:48,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1778888515] [2021-11-25 20:42:48,701 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:42:48,702 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:42:48,702 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2021-11-25 20:42:48,702 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755240581] [2021-11-25 20:42:48,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:42:48,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-11-25 20:42:48,702 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:42:48,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-11-25 20:42:48,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=473, Unknown=2, NotChecked=90, Total=650 [2021-11-25 20:42:48,703 INFO L87 Difference]: Start difference. First operand 1271 states and 4476 transitions. Second operand has 26 states, 25 states have (on average 3.16) internal successors, (79), 25 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:42:49,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:42:49,587 INFO L93 Difference]: Finished difference Result 1623 states and 5717 transitions. [2021-11-25 20:42:49,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-25 20:42:49,588 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.16) internal successors, (79), 25 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-25 20:42:49,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:42:49,591 INFO L225 Difference]: With dead ends: 1623 [2021-11-25 20:42:49,591 INFO L226 Difference]: Without dead ends: 1580 [2021-11-25 20:42:49,591 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 54 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=266, Invalid=1072, Unknown=2, NotChecked=142, Total=1482 [2021-11-25 20:42:49,592 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 265 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 1014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 325 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-25 20:42:49,592 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [265 Valid, 158 Invalid, 1014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 659 Invalid, 0 Unknown, 325 Unchecked, 0.4s Time] [2021-11-25 20:42:49,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1580 states. [2021-11-25 20:42:49,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1580 to 1221. [2021-11-25 20:42:49,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1221 states, 1220 states have (on average 3.5262295081967214) internal successors, (4302), 1220 states have internal predecessors, (4302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:42:49,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 1221 states and 4302 transitions. [2021-11-25 20:42:49,612 INFO L78 Accepts]: Start accepts. Automaton has 1221 states and 4302 transitions. Word has length 36 [2021-11-25 20:42:49,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:42:49,612 INFO L470 AbstractCegarLoop]: Abstraction has 1221 states and 4302 transitions. [2021-11-25 20:42:49,612 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.16) internal successors, (79), 25 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:42:49,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 4302 transitions. [2021-11-25 20:42:49,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-25 20:42:49,614 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:42:49,615 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:42:49,635 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2021-11-25 20:42:49,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:42:49,815 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:42:49,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:42:49,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1966772322, now seen corresponding path program 22 times [2021-11-25 20:42:49,816 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:42:49,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414863877] [2021-11-25 20:42:49,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:42:49,816 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:42:49,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:42:50,047 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:42:50,048 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:42:50,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414863877] [2021-11-25 20:42:50,048 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414863877] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:42:50,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116133283] [2021-11-25 20:42:50,048 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 20:42:50,048 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:42:50,048 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:42:50,050 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:42:50,072 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2021-11-25 20:42:50,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:42:50,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 54 conjunts are in the unsatisfiable core [2021-11-25 20:42:50,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:42:50,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:42:50,427 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-11-25 20:42:50,473 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-11-25 20:42:50,572 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:42:50,572 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:42:50,731 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2359 (Array Int Int))) (< (+ c_~s_2~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_2359) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (+ c_~s_6~0 1))) (forall ((v_ArrVal_2359 (Array Int Int))) (<= c_~s_6~0 (+ c_~s_2~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_2359) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)))))) is different from false [2021-11-25 20:42:52,763 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork3_~#t2~0.base_155| Int)) (or (and (forall ((v_ArrVal_2359 (Array Int Int))) (< (select (select (store |c_#memory_int| |v_thread1Thread1of1ForFork3_~#t2~0.base_155| v_ArrVal_2359) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 1))) (forall ((v_ArrVal_2359 (Array Int Int))) (<= c_~s_6~0 (select (select (store |c_#memory_int| |v_thread1Thread1of1ForFork3_~#t2~0.base_155| v_ArrVal_2359) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))) (<= |v_thread1Thread1of1ForFork3_~#t2~0.base_155| |c_#StackHeapBarrier|))) is different from false [2021-11-25 20:42:52,774 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:42:52,774 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 99 treesize of output 67 [2021-11-25 20:42:52,778 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 51 treesize of output 47 [2021-11-25 20:42:52,782 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 47 treesize of output 43 [2021-11-25 20:42:52,900 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:42:52,900 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116133283] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:42:52,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1078171483] [2021-11-25 20:42:52,900 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:42:52,900 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:42:52,901 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 22 [2021-11-25 20:42:52,901 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458827513] [2021-11-25 20:42:52,901 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:42:52,901 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-11-25 20:42:52,901 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:42:52,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-25 20:42:52,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=400, Unknown=2, NotChecked=82, Total=552 [2021-11-25 20:42:52,902 INFO L87 Difference]: Start difference. First operand 1221 states and 4302 transitions. Second operand has 24 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 23 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-25 20:42:55,076 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_~X_0~0.base))) (let ((.cse0 (select .cse1 (+ c_~X_0~0.offset (* c_~i_7~0 4))))) (and (= c_~X_0~0.offset 0) (forall ((|v_thread1Thread1of1ForFork3_~#t2~0.base_155| Int)) (or (and (forall ((v_ArrVal_2359 (Array Int Int))) (< (select (select (store |c_#memory_int| |v_thread1Thread1of1ForFork3_~#t2~0.base_155| v_ArrVal_2359) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 1))) (forall ((v_ArrVal_2359 (Array Int Int))) (<= c_~s_6~0 (select (select (store |c_#memory_int| |v_thread1Thread1of1ForFork3_~#t2~0.base_155| v_ArrVal_2359) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))) (<= |v_thread1Thread1of1ForFork3_~#t2~0.base_155| |c_#StackHeapBarrier|))) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (= (+ c_~X_0~0.offset (* 4 c_~i_7~0)) 4) (<= .cse0 c_~s_6~0) (<= c_~s_6~0 .cse0) (= (select .cse1 (+ c_~X_0~0.offset 4)) c_~s_6~0) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= (select |c_#valid| c_~X_0~0.base) 1) (= |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< c_~X_0~0.base |c_#StackHeapBarrier|)))) is different from false [2021-11-25 20:42:57,604 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thread1Thread1of1ForFork3_~#t2~0.base_155| Int)) (or (and (forall ((v_ArrVal_2359 (Array Int Int))) (< (select (select (store |c_#memory_int| |v_thread1Thread1of1ForFork3_~#t2~0.base_155| v_ArrVal_2359) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 1))) (forall ((v_ArrVal_2359 (Array Int Int))) (<= c_~s_6~0 (select (select (store |c_#memory_int| |v_thread1Thread1of1ForFork3_~#t2~0.base_155| v_ArrVal_2359) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))) (<= |v_thread1Thread1of1ForFork3_~#t2~0.base_155| |c_#StackHeapBarrier|))) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (= (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset 4)) c_~s_6~0) (= |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< c_~X_0~0.base |c_#StackHeapBarrier|)) is different from false [2021-11-25 20:42:57,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:42:57,663 INFO L93 Difference]: Finished difference Result 1987 states and 7097 transitions. [2021-11-25 20:42:57,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-25 20:42:57,663 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 23 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 36 [2021-11-25 20:42:57,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:42:57,667 INFO L225 Difference]: With dead ends: 1987 [2021-11-25 20:42:57,667 INFO L226 Difference]: Without dead ends: 1942 [2021-11-25 20:42:57,667 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 55 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=153, Invalid=729, Unknown=4, NotChecked=236, Total=1122 [2021-11-25 20:42:57,668 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 339 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 1114 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 1350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 200 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-25 20:42:57,668 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [339 Valid, 267 Invalid, 1350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1114 Invalid, 0 Unknown, 200 Unchecked, 0.6s Time] [2021-11-25 20:42:57,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1942 states. [2021-11-25 20:42:57,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1942 to 1247. [2021-11-25 20:42:57,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1247 states, 1246 states have (on average 3.516051364365971) internal successors, (4381), 1246 states have internal predecessors, (4381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:42:57,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1247 states to 1247 states and 4381 transitions. [2021-11-25 20:42:57,693 INFO L78 Accepts]: Start accepts. Automaton has 1247 states and 4381 transitions. Word has length 36 [2021-11-25 20:42:57,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:42:57,694 INFO L470 AbstractCegarLoop]: Abstraction has 1247 states and 4381 transitions. [2021-11-25 20:42:57,694 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 23 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-25 20:42:57,694 INFO L276 IsEmpty]: Start isEmpty. Operand 1247 states and 4381 transitions. [2021-11-25 20:42:57,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-25 20:42:57,697 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:42:57,697 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:42:57,717 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2021-11-25 20:42:57,897 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2021-11-25 20:42:57,897 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:42:57,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:42:57,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1210121910, now seen corresponding path program 23 times [2021-11-25 20:42:57,898 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:42:57,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085568265] [2021-11-25 20:42:57,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:42:57,898 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:42:57,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:42:58,201 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:42:58,201 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:42:58,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085568265] [2021-11-25 20:42:58,202 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085568265] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:42:58,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354414608] [2021-11-25 20:42:58,202 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 20:42:58,202 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:42:58,202 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:42:58,206 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:42:58,224 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2021-11-25 20:42:58,434 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 20:42:58,434 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:42:58,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 62 conjunts are in the unsatisfiable core [2021-11-25 20:42:58,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:42:58,468 INFO L354 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2021-11-25 20:42:58,468 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 2 case distinctions, treesize of input 12 treesize of output 27 [2021-11-25 20:42:58,600 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-25 20:42:58,600 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-25 20:42:58,638 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-11-25 20:42:58,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:42:58,698 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-11-25 20:42:58,729 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-11-25 20:42:58,795 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:42:58,795 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:42:58,900 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2420 (Array Int Int))) (<= c_~s_6~0 (+ c_~s_2~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2420) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))))) (forall ((v_ArrVal_2420 (Array Int Int))) (< (+ c_~s_2~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2420) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (+ c_~s_6~0 1)))) is different from false [2021-11-25 20:42:58,952 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2420 (Array Int Int)) (v_ArrVal_2419 (Array Int Int))) (< (+ c_~s_2~0 (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_2419) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2420) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (+ c_~s_6~0 1))) (forall ((v_ArrVal_2420 (Array Int Int)) (v_ArrVal_2419 (Array Int Int))) (<= c_~s_6~0 (+ c_~s_2~0 (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_2419) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2420) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)))))) is different from false [2021-11-25 20:42:59,114 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:42:59,114 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 213 treesize of output 145 [2021-11-25 20:42:59,124 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 121 [2021-11-25 20:42:59,128 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 121 treesize of output 113 [2021-11-25 20:42:59,132 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 113 treesize of output 109 [2021-11-25 20:42:59,136 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 109 treesize of output 105 [2021-11-25 20:42:59,481 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2021-11-25 20:42:59,482 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354414608] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:42:59,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1491655051] [2021-11-25 20:42:59,482 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:42:59,483 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:42:59,484 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2021-11-25 20:42:59,484 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211201909] [2021-11-25 20:42:59,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:42:59,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-25 20:42:59,486 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:42:59,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-25 20:42:59,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=427, Unknown=3, NotChecked=86, Total=600 [2021-11-25 20:42:59,487 INFO L87 Difference]: Start difference. First operand 1247 states and 4381 transitions. Second operand has 25 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 24 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:43:00,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:43:00,442 INFO L93 Difference]: Finished difference Result 2258 states and 8048 transitions. [2021-11-25 20:43:00,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-25 20:43:00,443 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 24 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-25 20:43:00,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:43:00,447 INFO L225 Difference]: With dead ends: 2258 [2021-11-25 20:43:00,447 INFO L226 Difference]: Without dead ends: 2179 [2021-11-25 20:43:00,447 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 54 SyntacticMatches, 6 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=186, Invalid=811, Unknown=3, NotChecked=122, Total=1122 [2021-11-25 20:43:00,448 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 215 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 1131 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 1652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 493 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-25 20:43:00,448 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [215 Valid, 244 Invalid, 1652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1131 Invalid, 0 Unknown, 493 Unchecked, 0.7s Time] [2021-11-25 20:43:00,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2179 states. [2021-11-25 20:43:00,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2179 to 1261. [2021-11-25 20:43:00,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1261 states, 1260 states have (on average 3.515873015873016) internal successors, (4430), 1260 states have internal predecessors, (4430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:43:00,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1261 states to 1261 states and 4430 transitions. [2021-11-25 20:43:00,474 INFO L78 Accepts]: Start accepts. Automaton has 1261 states and 4430 transitions. Word has length 36 [2021-11-25 20:43:00,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:43:00,474 INFO L470 AbstractCegarLoop]: Abstraction has 1261 states and 4430 transitions. [2021-11-25 20:43:00,475 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 24 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:43:00,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 4430 transitions. [2021-11-25 20:43:00,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-25 20:43:00,477 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:43:00,477 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:43:00,497 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2021-11-25 20:43:00,677 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:43:00,677 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:43:00,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:43:00,678 INFO L85 PathProgramCache]: Analyzing trace with hash 616772568, now seen corresponding path program 14 times [2021-11-25 20:43:00,678 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:43:00,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236239044] [2021-11-25 20:43:00,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:43:00,678 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:43:00,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:43:00,991 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:43:00,992 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:43:00,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236239044] [2021-11-25 20:43:00,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236239044] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:43:00,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459656397] [2021-11-25 20:43:00,992 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 20:43:00,992 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:43:00,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:43:00,993 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:43:01,016 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2021-11-25 20:43:01,233 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 20:43:01,233 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:43:01,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 58 conjunts are in the unsatisfiable core [2021-11-25 20:43:01,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:43:01,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:43:01,386 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-11-25 20:43:01,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:43:01,471 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-11-25 20:43:01,515 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-11-25 20:43:01,609 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:43:01,609 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:43:01,749 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2478 (Array Int Int))) (< (+ c_~s_2~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2478) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (+ c_~s_6~0 1))) (forall ((v_ArrVal_2478 (Array Int Int))) (<= c_~s_6~0 (+ c_~s_2~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2478) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)))))) is different from false [2021-11-25 20:43:01,795 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2478 (Array Int Int)) (v_ArrVal_2477 (Array Int Int))) (<= c_~s_6~0 (+ c_~s_2~0 (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_2477) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2478) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))))) (forall ((v_ArrVal_2478 (Array Int Int)) (v_ArrVal_2477 (Array Int Int))) (< (+ c_~s_2~0 (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_2477) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2478) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (+ c_~s_6~0 1)))) is different from false [2021-11-25 20:43:03,937 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork3_~#t2~0.base_161| Int) (|v_thread1Thread1of1ForFork3_~#t3~0.base_159| Int)) (or (and (forall ((v_ArrVal_2478 (Array Int Int)) (v_ArrVal_2477 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork3_~#t2~0.base_161| v_ArrVal_2477) |v_thread1Thread1of1ForFork3_~#t3~0.base_159| v_ArrVal_2478) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 1))) (forall ((v_ArrVal_2478 (Array Int Int)) (v_ArrVal_2477 (Array Int Int))) (<= c_~s_6~0 (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork3_~#t2~0.base_161| v_ArrVal_2477) |v_thread1Thread1of1ForFork3_~#t3~0.base_159| v_ArrVal_2478) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))) (<= |v_thread1Thread1of1ForFork3_~#t3~0.base_159| |c_#StackHeapBarrier|) (<= |v_thread1Thread1of1ForFork3_~#t2~0.base_161| |c_#StackHeapBarrier|))) is different from false [2021-11-25 20:43:03,957 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:43:03,958 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 445 treesize of output 293 [2021-11-25 20:43:03,965 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 277 treesize of output 269 [2021-11-25 20:43:03,973 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 269 treesize of output 253 [2021-11-25 20:43:03,979 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 253 treesize of output 237 [2021-11-25 20:43:03,986 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 237 treesize of output 229 [2021-11-25 20:43:04,193 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2021-11-25 20:43:04,193 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459656397] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:43:04,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2137922260] [2021-11-25 20:43:04,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-25 20:43:04,194 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:43:04,194 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2021-11-25 20:43:04,194 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255156856] [2021-11-25 20:43:04,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:43:04,194 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-25 20:43:04,194 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:43:04,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-25 20:43:04,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=389, Unknown=3, NotChecked=126, Total=600 [2021-11-25 20:43:04,195 INFO L87 Difference]: Start difference. First operand 1261 states and 4430 transitions. Second operand has 25 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 24 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:43:04,312 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_7~0 4))))) (and (forall ((|v_thread1Thread1of1ForFork3_~#t2~0.base_161| Int) (|v_thread1Thread1of1ForFork3_~#t3~0.base_159| Int)) (or (and (forall ((v_ArrVal_2478 (Array Int Int)) (v_ArrVal_2477 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork3_~#t2~0.base_161| v_ArrVal_2477) |v_thread1Thread1of1ForFork3_~#t3~0.base_159| v_ArrVal_2478) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 1))) (forall ((v_ArrVal_2478 (Array Int Int)) (v_ArrVal_2477 (Array Int Int))) (<= c_~s_6~0 (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork3_~#t2~0.base_161| v_ArrVal_2477) |v_thread1Thread1of1ForFork3_~#t3~0.base_159| v_ArrVal_2478) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))) (<= |v_thread1Thread1of1ForFork3_~#t3~0.base_159| |c_#StackHeapBarrier|) (<= |v_thread1Thread1of1ForFork3_~#t2~0.base_161| |c_#StackHeapBarrier|))) (= c_~X_0~0.offset 0) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (<= 1 c_~i_7~0) (<= .cse0 c_~s_6~0) (<= c_~s_6~0 .cse0) (<= (+ c_~X_0~0.offset (* 4 c_~i_7~0)) 4) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0))) is different from false [2021-11-25 20:43:04,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:43:04,724 INFO L93 Difference]: Finished difference Result 1987 states and 7063 transitions. [2021-11-25 20:43:04,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-25 20:43:04,725 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 24 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-25 20:43:04,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:43:04,729 INFO L225 Difference]: With dead ends: 1987 [2021-11-25 20:43:04,729 INFO L226 Difference]: Without dead ends: 1944 [2021-11-25 20:43:04,729 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 54 SyntacticMatches, 6 SemanticMatches, 28 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=124, Invalid=538, Unknown=4, NotChecked=204, Total=870 [2021-11-25 20:43:04,730 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 262 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 1241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 458 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-25 20:43:04,730 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [262 Valid, 185 Invalid, 1241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 767 Invalid, 0 Unknown, 458 Unchecked, 0.4s Time] [2021-11-25 20:43:04,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1944 states. [2021-11-25 20:43:04,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1944 to 1253. [2021-11-25 20:43:04,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1253 states, 1252 states have (on average 3.5063897763578273) internal successors, (4390), 1252 states have internal predecessors, (4390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:43:04,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 4390 transitions. [2021-11-25 20:43:04,766 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 4390 transitions. Word has length 36 [2021-11-25 20:43:04,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:43:04,766 INFO L470 AbstractCegarLoop]: Abstraction has 1253 states and 4390 transitions. [2021-11-25 20:43:04,766 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 24 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:43:04,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 4390 transitions. [2021-11-25 20:43:04,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-25 20:43:04,770 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:43:04,770 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:43:04,795 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2021-11-25 20:43:04,986 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2021-11-25 20:43:04,986 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:43:04,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:43:04,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1204809432, now seen corresponding path program 15 times [2021-11-25 20:43:04,986 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:43:04,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366406577] [2021-11-25 20:43:04,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:43:04,987 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:43:05,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:43:05,238 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:43:05,239 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:43:05,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366406577] [2021-11-25 20:43:05,239 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366406577] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:43:05,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304366363] [2021-11-25 20:43:05,239 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 20:43:05,239 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:43:05,239 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:43:05,240 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:43:05,260 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2021-11-25 20:43:05,461 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 20:43:05,462 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:43:05,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 60 conjunts are in the unsatisfiable core [2021-11-25 20:43:05,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:43:05,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:43:05,597 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-11-25 20:43:05,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:43:05,653 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-11-25 20:43:05,680 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-11-25 20:43:05,744 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 20:43:05,744 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:43:05,861 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2536 (Array Int Int))) (<= c_~s_6~0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2536) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)) c_~s_2~0))) (forall ((v_ArrVal_2536 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2536) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)) c_~s_2~0) (+ c_~s_6~0 1)))) is different from false [2021-11-25 20:43:05,893 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2536 (Array Int Int)) (v_ArrVal_2535 (Array Int Int))) (< (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_2535) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2536) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)) c_~s_2~0) (+ c_~s_6~0 1))) (forall ((v_ArrVal_2536 (Array Int Int)) (v_ArrVal_2535 (Array Int Int))) (<= c_~s_6~0 (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_2535) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2536) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)) c_~s_2~0)))) is different from false [2021-11-25 20:43:08,011 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork3_~#t3~0.base_162| Int) (|v_thread1Thread1of1ForFork3_~#t2~0.base_164| Int)) (or (<= |v_thread1Thread1of1ForFork3_~#t3~0.base_162| |c_#StackHeapBarrier|) (<= |v_thread1Thread1of1ForFork3_~#t2~0.base_164| |c_#StackHeapBarrier|) (and (forall ((v_ArrVal_2536 (Array Int Int)) (v_ArrVal_2535 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork3_~#t2~0.base_164| v_ArrVal_2535) |v_thread1Thread1of1ForFork3_~#t3~0.base_162| v_ArrVal_2536) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 1))) (forall ((v_ArrVal_2536 (Array Int Int)) (v_ArrVal_2535 (Array Int Int))) (<= c_~s_6~0 (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork3_~#t2~0.base_164| v_ArrVal_2535) |v_thread1Thread1of1ForFork3_~#t3~0.base_162| v_ArrVal_2536) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))))) is different from false [2021-11-25 20:43:08,141 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:43:08,141 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 213 treesize of output 145 [2021-11-25 20:43:08,147 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 121 [2021-11-25 20:43:08,153 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 121 treesize of output 117 [2021-11-25 20:43:08,158 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 117 treesize of output 109 [2021-11-25 20:43:08,163 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 109 treesize of output 105 [2021-11-25 20:43:08,343 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2021-11-25 20:43:08,343 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304366363] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:43:08,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [33330312] [2021-11-25 20:43:08,344 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:43:08,345 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:43:08,346 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 25 [2021-11-25 20:43:08,346 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866322866] [2021-11-25 20:43:08,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:43:08,347 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-11-25 20:43:08,347 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:43:08,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-11-25 20:43:08,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=470, Unknown=3, NotChecked=138, Total=702 [2021-11-25 20:43:08,348 INFO L87 Difference]: Start difference. First operand 1253 states and 4390 transitions. Second operand has 27 states, 26 states have (on average 3.076923076923077) internal successors, (80), 26 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:43:10,540 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_7~0 4))))) (and (= c_~X_0~0.offset 0) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (= (+ c_~X_0~0.offset (* 4 c_~i_7~0)) 4) (forall ((|v_thread1Thread1of1ForFork3_~#t3~0.base_162| Int) (|v_thread1Thread1of1ForFork3_~#t2~0.base_164| Int)) (or (<= |v_thread1Thread1of1ForFork3_~#t3~0.base_162| |c_#StackHeapBarrier|) (<= |v_thread1Thread1of1ForFork3_~#t2~0.base_164| |c_#StackHeapBarrier|) (and (forall ((v_ArrVal_2536 (Array Int Int)) (v_ArrVal_2535 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork3_~#t2~0.base_164| v_ArrVal_2535) |v_thread1Thread1of1ForFork3_~#t3~0.base_162| v_ArrVal_2536) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 1))) (forall ((v_ArrVal_2536 (Array Int Int)) (v_ArrVal_2535 (Array Int Int))) (<= c_~s_6~0 (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork3_~#t2~0.base_164| v_ArrVal_2535) |v_thread1Thread1of1ForFork3_~#t3~0.base_162| v_ArrVal_2536) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))))) (<= .cse0 c_~s_6~0) (<= c_~s_6~0 .cse0) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0))) is different from false [2021-11-25 20:43:12,595 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_~X_0~0.base) 4))) (and (= c_~X_0~0.offset 0) (<= c_~s_6~0 .cse0) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (forall ((|v_thread1Thread1of1ForFork3_~#t3~0.base_162| Int) (|v_thread1Thread1of1ForFork3_~#t2~0.base_164| Int)) (or (<= |v_thread1Thread1of1ForFork3_~#t3~0.base_162| |c_#StackHeapBarrier|) (<= |v_thread1Thread1of1ForFork3_~#t2~0.base_164| |c_#StackHeapBarrier|) (and (forall ((v_ArrVal_2536 (Array Int Int)) (v_ArrVal_2535 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork3_~#t2~0.base_164| v_ArrVal_2535) |v_thread1Thread1of1ForFork3_~#t3~0.base_162| v_ArrVal_2536) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 1))) (forall ((v_ArrVal_2536 (Array Int Int)) (v_ArrVal_2535 (Array Int Int))) (<= c_~s_6~0 (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork3_~#t2~0.base_164| v_ArrVal_2535) |v_thread1Thread1of1ForFork3_~#t3~0.base_162| v_ArrVal_2536) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))))) (<= .cse0 c_~s_6~0))) is different from false [2021-11-25 20:43:13,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:43:13,051 INFO L93 Difference]: Finished difference Result 2136 states and 7396 transitions. [2021-11-25 20:43:13,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-25 20:43:13,051 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.076923076923077) internal successors, (80), 26 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-25 20:43:13,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:43:13,055 INFO L225 Difference]: With dead ends: 2136 [2021-11-25 20:43:13,055 INFO L226 Difference]: Without dead ends: 2093 [2021-11-25 20:43:13,055 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=147, Invalid=680, Unknown=5, NotChecked=290, Total=1122 [2021-11-25 20:43:13,056 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 286 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 1046 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 1792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 730 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-25 20:43:13,056 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [286 Valid, 240 Invalid, 1792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1046 Invalid, 0 Unknown, 730 Unchecked, 0.5s Time] [2021-11-25 20:43:13,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2093 states. [2021-11-25 20:43:13,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2093 to 1245. [2021-11-25 20:43:13,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1245 states, 1244 states have (on average 3.509646302250804) internal successors, (4366), 1244 states have internal predecessors, (4366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:43:13,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1245 states to 1245 states and 4366 transitions. [2021-11-25 20:43:13,083 INFO L78 Accepts]: Start accepts. Automaton has 1245 states and 4366 transitions. Word has length 36 [2021-11-25 20:43:13,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:43:13,084 INFO L470 AbstractCegarLoop]: Abstraction has 1245 states and 4366 transitions. [2021-11-25 20:43:13,084 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.076923076923077) internal successors, (80), 26 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:43:13,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1245 states and 4366 transitions. [2021-11-25 20:43:13,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-25 20:43:13,086 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:43:13,086 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:43:13,106 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2021-11-25 20:43:13,286 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2021-11-25 20:43:13,287 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:43:13,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:43:13,287 INFO L85 PathProgramCache]: Analyzing trace with hash -647340256, now seen corresponding path program 16 times [2021-11-25 20:43:13,287 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:43:13,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243535641] [2021-11-25 20:43:13,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:43:13,288 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:43:13,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:43:13,550 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:43:13,550 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:43:13,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243535641] [2021-11-25 20:43:13,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243535641] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:43:13,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559542583] [2021-11-25 20:43:13,551 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 20:43:13,551 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:43:13,551 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:43:13,552 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:43:13,568 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2021-11-25 20:43:13,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:43:13,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 56 conjunts are in the unsatisfiable core [2021-11-25 20:43:13,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:43:13,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:43:13,935 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-11-25 20:43:14,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:43:14,005 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-11-25 20:43:14,041 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-11-25 20:43:14,125 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:43:14,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:43:14,260 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2594 (Array Int Int))) (< (+ c_~s_2~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2594) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (+ c_~s_6~0 1))) (forall ((v_ArrVal_2594 (Array Int Int))) (<= c_~s_6~0 (+ c_~s_2~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2594) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)))))) is different from false [2021-11-25 20:43:14,294 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2594 (Array Int Int)) (v_ArrVal_2593 (Array Int Int))) (<= c_~s_6~0 (+ c_~s_2~0 (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_2593) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2594) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))))) (forall ((v_ArrVal_2594 (Array Int Int)) (v_ArrVal_2593 (Array Int Int))) (< (+ c_~s_2~0 (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_2593) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2594) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (+ c_~s_6~0 1)))) is different from false [2021-11-25 20:43:16,427 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork3_~#t2~0.base_167| Int) (|v_thread1Thread1of1ForFork3_~#t3~0.base_165| Int)) (or (and (forall ((v_ArrVal_2594 (Array Int Int)) (v_ArrVal_2593 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork3_~#t2~0.base_167| v_ArrVal_2593) |v_thread1Thread1of1ForFork3_~#t3~0.base_165| v_ArrVal_2594) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 1))) (forall ((v_ArrVal_2594 (Array Int Int)) (v_ArrVal_2593 (Array Int Int))) (<= c_~s_6~0 (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork3_~#t2~0.base_167| v_ArrVal_2593) |v_thread1Thread1of1ForFork3_~#t3~0.base_165| v_ArrVal_2594) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))) (<= |v_thread1Thread1of1ForFork3_~#t2~0.base_167| |c_#StackHeapBarrier|) (<= |v_thread1Thread1of1ForFork3_~#t3~0.base_165| |c_#StackHeapBarrier|))) is different from false [2021-11-25 20:43:16,642 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:43:16,642 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 213 treesize of output 145 [2021-11-25 20:43:16,647 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 125 [2021-11-25 20:43:16,652 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 125 treesize of output 117 [2021-11-25 20:43:16,657 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 117 treesize of output 113 [2021-11-25 20:43:16,662 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 113 treesize of output 105 [2021-11-25 20:43:16,799 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2021-11-25 20:43:16,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559542583] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:43:16,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1126819677] [2021-11-25 20:43:16,799 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:43:16,800 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:43:16,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2021-11-25 20:43:16,801 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189960546] [2021-11-25 20:43:16,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:43:16,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-25 20:43:16,801 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:43:16,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-25 20:43:16,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=388, Unknown=3, NotChecked=126, Total=600 [2021-11-25 20:43:16,802 INFO L87 Difference]: Start difference. First operand 1245 states and 4366 transitions. Second operand has 25 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 24 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:43:18,958 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_7~0 4))))) (and (= c_~X_0~0.offset 0) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (= (+ c_~X_0~0.offset (* 4 c_~i_7~0)) 4) (<= .cse0 c_~s_6~0) (<= c_~s_6~0 .cse0) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (forall ((|v_thread1Thread1of1ForFork3_~#t2~0.base_167| Int) (|v_thread1Thread1of1ForFork3_~#t3~0.base_165| Int)) (or (and (forall ((v_ArrVal_2594 (Array Int Int)) (v_ArrVal_2593 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork3_~#t2~0.base_167| v_ArrVal_2593) |v_thread1Thread1of1ForFork3_~#t3~0.base_165| v_ArrVal_2594) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 1))) (forall ((v_ArrVal_2594 (Array Int Int)) (v_ArrVal_2593 (Array Int Int))) (<= c_~s_6~0 (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork3_~#t2~0.base_167| v_ArrVal_2593) |v_thread1Thread1of1ForFork3_~#t3~0.base_165| v_ArrVal_2594) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))) (<= |v_thread1Thread1of1ForFork3_~#t2~0.base_167| |c_#StackHeapBarrier|) (<= |v_thread1Thread1of1ForFork3_~#t3~0.base_165| |c_#StackHeapBarrier|))) (= |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0))) is different from false [2021-11-25 20:43:21,020 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_~X_0~0.base) 4))) (and (= c_~X_0~0.offset 0) (<= c_~s_6~0 .cse0) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (<= .cse0 c_~s_6~0) (forall ((|v_thread1Thread1of1ForFork3_~#t2~0.base_167| Int) (|v_thread1Thread1of1ForFork3_~#t3~0.base_165| Int)) (or (and (forall ((v_ArrVal_2594 (Array Int Int)) (v_ArrVal_2593 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork3_~#t2~0.base_167| v_ArrVal_2593) |v_thread1Thread1of1ForFork3_~#t3~0.base_165| v_ArrVal_2594) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 1))) (forall ((v_ArrVal_2594 (Array Int Int)) (v_ArrVal_2593 (Array Int Int))) (<= c_~s_6~0 (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork3_~#t2~0.base_167| v_ArrVal_2593) |v_thread1Thread1of1ForFork3_~#t3~0.base_165| v_ArrVal_2594) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))) (<= |v_thread1Thread1of1ForFork3_~#t2~0.base_167| |c_#StackHeapBarrier|) (<= |v_thread1Thread1of1ForFork3_~#t3~0.base_165| |c_#StackHeapBarrier|))))) is different from false [2021-11-25 20:43:23,058 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (= (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset 4)) c_~s_6~0) (forall ((|v_thread1Thread1of1ForFork3_~#t2~0.base_167| Int) (|v_thread1Thread1of1ForFork3_~#t3~0.base_165| Int)) (or (and (forall ((v_ArrVal_2594 (Array Int Int)) (v_ArrVal_2593 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork3_~#t2~0.base_167| v_ArrVal_2593) |v_thread1Thread1of1ForFork3_~#t3~0.base_165| v_ArrVal_2594) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 1))) (forall ((v_ArrVal_2594 (Array Int Int)) (v_ArrVal_2593 (Array Int Int))) (<= c_~s_6~0 (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork3_~#t2~0.base_167| v_ArrVal_2593) |v_thread1Thread1of1ForFork3_~#t3~0.base_165| v_ArrVal_2594) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))) (<= |v_thread1Thread1of1ForFork3_~#t2~0.base_167| |c_#StackHeapBarrier|) (<= |v_thread1Thread1of1ForFork3_~#t3~0.base_165| |c_#StackHeapBarrier|)))) is different from false [2021-11-25 20:43:23,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:43:23,531 INFO L93 Difference]: Finished difference Result 2046 states and 7128 transitions. [2021-11-25 20:43:23,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-25 20:43:23,532 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 24 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-25 20:43:23,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:43:23,535 INFO L225 Difference]: With dead ends: 2046 [2021-11-25 20:43:23,535 INFO L226 Difference]: Without dead ends: 2023 [2021-11-25 20:43:23,535 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 54 SyntacticMatches, 9 SemanticMatches, 30 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=128, Invalid=540, Unknown=6, NotChecked=318, Total=992 [2021-11-25 20:43:23,536 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 196 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 1153 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 2018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 851 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-25 20:43:23,536 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [196 Valid, 248 Invalid, 2018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1153 Invalid, 0 Unknown, 851 Unchecked, 0.6s Time] [2021-11-25 20:43:23,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2023 states. [2021-11-25 20:43:23,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2023 to 1225. [2021-11-25 20:43:23,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 1224 states have (on average 3.522875816993464) internal successors, (4312), 1224 states have internal predecessors, (4312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:43:23,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 4312 transitions. [2021-11-25 20:43:23,564 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 4312 transitions. Word has length 36 [2021-11-25 20:43:23,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:43:23,564 INFO L470 AbstractCegarLoop]: Abstraction has 1225 states and 4312 transitions. [2021-11-25 20:43:23,565 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 24 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:43:23,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 4312 transitions. [2021-11-25 20:43:23,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-25 20:43:23,567 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:43:23,567 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:43:23,586 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2021-11-25 20:43:23,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2021-11-25 20:43:23,767 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:43:23,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:43:23,768 INFO L85 PathProgramCache]: Analyzing trace with hash -258059794, now seen corresponding path program 24 times [2021-11-25 20:43:23,768 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:43:23,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238212306] [2021-11-25 20:43:23,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:43:23,769 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:43:23,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:43:23,846 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 20:43:23,846 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:43:23,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238212306] [2021-11-25 20:43:23,847 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238212306] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:43:23,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795031417] [2021-11-25 20:43:23,847 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 20:43:23,847 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:43:23,847 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:43:23,848 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:43:23,864 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2021-11-25 20:43:24,073 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 20:43:24,073 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:43:24,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-25 20:43:24,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:43:24,188 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 20:43:24,188 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:43:24,296 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 20:43:24,296 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795031417] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:43:24,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1109349470] [2021-11-25 20:43:24,296 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:43:24,298 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:43:24,298 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2021-11-25 20:43:24,298 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287650257] [2021-11-25 20:43:24,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:43:24,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-25 20:43:24,299 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:43:24,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-25 20:43:24,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2021-11-25 20:43:24,300 INFO L87 Difference]: Start difference. First operand 1225 states and 4312 transitions. Second operand has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 16 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:43:24,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:43:24,731 INFO L93 Difference]: Finished difference Result 2473 states and 8377 transitions. [2021-11-25 20:43:24,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-25 20:43:24,732 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 16 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 37 [2021-11-25 20:43:24,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:43:24,737 INFO L225 Difference]: With dead ends: 2473 [2021-11-25 20:43:24,737 INFO L226 Difference]: Without dead ends: 2207 [2021-11-25 20:43:24,737 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2021-11-25 20:43:24,738 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 272 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-25 20:43:24,741 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [272 Valid, 188 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-25 20:43:24,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2207 states. [2021-11-25 20:43:24,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2207 to 1893. [2021-11-25 20:43:24,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1893 states, 1892 states have (on average 3.454016913319239) internal successors, (6535), 1892 states have internal predecessors, (6535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:43:24,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1893 states to 1893 states and 6535 transitions. [2021-11-25 20:43:24,792 INFO L78 Accepts]: Start accepts. Automaton has 1893 states and 6535 transitions. Word has length 37 [2021-11-25 20:43:24,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:43:24,792 INFO L470 AbstractCegarLoop]: Abstraction has 1893 states and 6535 transitions. [2021-11-25 20:43:24,792 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 16 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:43:24,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1893 states and 6535 transitions. [2021-11-25 20:43:24,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-25 20:43:24,797 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:43:24,797 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:43:24,839 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2021-11-25 20:43:25,024 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2021-11-25 20:43:25,024 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:43:25,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:43:25,025 INFO L85 PathProgramCache]: Analyzing trace with hash -173256605, now seen corresponding path program 25 times [2021-11-25 20:43:25,025 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:43:25,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677671516] [2021-11-25 20:43:25,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:43:25,025 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:43:25,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:43:25,114 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 20:43:25,114 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:43:25,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677671516] [2021-11-25 20:43:25,115 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677671516] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:43:25,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889813676] [2021-11-25 20:43:25,115 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 20:43:25,115 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:43:25,115 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:43:25,118 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:43:25,136 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2021-11-25 20:43:25,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:43:25,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-25 20:43:25,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:43:25,497 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 20:43:25,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:43:25,612 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 20:43:25,612 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889813676] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:43:25,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [683571367] [2021-11-25 20:43:25,613 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:43:25,613 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:43:25,613 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2021-11-25 20:43:25,613 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164968289] [2021-11-25 20:43:25,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:43:25,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-25 20:43:25,614 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:43:25,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-25 20:43:25,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2021-11-25 20:43:25,615 INFO L87 Difference]: Start difference. First operand 1893 states and 6535 transitions. Second operand has 17 states, 17 states have (on average 3.411764705882353) internal successors, (58), 16 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:43:25,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:43:25,887 INFO L93 Difference]: Finished difference Result 1515 states and 5083 transitions. [2021-11-25 20:43:25,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-25 20:43:25,887 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.411764705882353) internal successors, (58), 16 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 38 [2021-11-25 20:43:25,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:43:25,890 INFO L225 Difference]: With dead ends: 1515 [2021-11-25 20:43:25,891 INFO L226 Difference]: Without dead ends: 1226 [2021-11-25 20:43:25,891 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2021-11-25 20:43:25,891 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 119 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 20:43:25,892 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 121 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 20:43:25,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2021-11-25 20:43:25,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 1226. [2021-11-25 20:43:25,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1226 states, 1225 states have (on average 3.5208163265306123) internal successors, (4313), 1225 states have internal predecessors, (4313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:43:25,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 4313 transitions. [2021-11-25 20:43:25,917 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 4313 transitions. Word has length 38 [2021-11-25 20:43:25,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:43:25,918 INFO L470 AbstractCegarLoop]: Abstraction has 1226 states and 4313 transitions. [2021-11-25 20:43:25,918 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.411764705882353) internal successors, (58), 16 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:43:25,918 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 4313 transitions. [2021-11-25 20:43:25,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-25 20:43:25,920 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:43:25,920 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:43:25,940 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Ended with exit code 0 [2021-11-25 20:43:26,120 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2021-11-25 20:43:26,120 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:43:26,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:43:26,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1693065051, now seen corresponding path program 26 times [2021-11-25 20:43:26,121 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:43:26,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363349157] [2021-11-25 20:43:26,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:43:26,121 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:43:26,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:43:26,202 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:43:26,202 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:43:26,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363349157] [2021-11-25 20:43:26,203 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363349157] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:43:26,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088438619] [2021-11-25 20:43:26,203 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 20:43:26,203 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:43:26,203 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:43:26,210 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:43:26,214 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2021-11-25 20:43:26,453 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 20:43:26,453 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:43:26,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-25 20:43:26,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:43:26,549 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 20:43:26,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:43:26,620 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 20:43:26,620 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088438619] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:43:26,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [725057885] [2021-11-25 20:43:26,620 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:43:26,620 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:43:26,620 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2021-11-25 20:43:26,621 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764385724] [2021-11-25 20:43:26,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:43:26,621 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 20:43:26,621 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:43:26,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 20:43:26,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2021-11-25 20:43:26,621 INFO L87 Difference]: Start difference. First operand 1226 states and 4313 transitions. Second operand has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 15 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:43:26,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:43:26,894 INFO L93 Difference]: Finished difference Result 1106 states and 3893 transitions. [2021-11-25 20:43:26,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-25 20:43:26,895 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 15 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-11-25 20:43:26,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:43:26,897 INFO L225 Difference]: With dead ends: 1106 [2021-11-25 20:43:26,897 INFO L226 Difference]: Without dead ends: 1106 [2021-11-25 20:43:26,897 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2021-11-25 20:43:26,897 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 293 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 20:43:26,898 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [293 Valid, 121 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 20:43:26,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2021-11-25 20:43:26,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 998. [2021-11-25 20:43:26,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 998 states, 997 states have (on average 3.535606820461384) internal successors, (3525), 997 states have internal predecessors, (3525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:43:26,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 3525 transitions. [2021-11-25 20:43:26,913 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 3525 transitions. Word has length 38 [2021-11-25 20:43:26,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:43:26,913 INFO L470 AbstractCegarLoop]: Abstraction has 998 states and 3525 transitions. [2021-11-25 20:43:26,913 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 15 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:43:26,913 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 3525 transitions. [2021-11-25 20:43:26,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-25 20:43:26,915 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:43:26,915 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:43:26,936 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 [2021-11-25 20:43:27,118 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2021-11-25 20:43:27,118 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:43:27,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:43:27,118 INFO L85 PathProgramCache]: Analyzing trace with hash 182071446, now seen corresponding path program 27 times [2021-11-25 20:43:27,119 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:43:27,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001734549] [2021-11-25 20:43:27,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:43:27,119 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:43:27,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:43:27,198 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-25 20:43:27,198 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:43:27,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001734549] [2021-11-25 20:43:27,199 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001734549] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:43:27,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194701188] [2021-11-25 20:43:27,199 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 20:43:27,199 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:43:27,200 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:43:27,202 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:43:27,224 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2021-11-25 20:43:27,451 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 20:43:27,452 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:43:27,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-25 20:43:27,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:43:27,597 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-25 20:43:27,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:43:27,704 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-25 20:43:27,704 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194701188] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:43:27,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1153431752] [2021-11-25 20:43:27,704 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:43:27,704 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:43:27,704 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2021-11-25 20:43:27,705 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550004101] [2021-11-25 20:43:27,705 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:43:27,705 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-25 20:43:27,705 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:43:27,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-25 20:43:27,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2021-11-25 20:43:27,706 INFO L87 Difference]: Start difference. First operand 998 states and 3525 transitions. Second operand has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 16 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:43:27,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:43:27,862 INFO L93 Difference]: Finished difference Result 1172 states and 3990 transitions. [2021-11-25 20:43:27,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-25 20:43:27,863 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 16 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 39 [2021-11-25 20:43:27,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:43:27,866 INFO L225 Difference]: With dead ends: 1172 [2021-11-25 20:43:27,866 INFO L226 Difference]: Without dead ends: 1172 [2021-11-25 20:43:27,866 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2021-11-25 20:43:27,866 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 197 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:43:27,866 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [197 Valid, 64 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:43:27,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2021-11-25 20:43:27,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 1095. [2021-11-25 20:43:27,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1095 states, 1094 states have (on average 3.4488117001828154) internal successors, (3773), 1094 states have internal predecessors, (3773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:43:27,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 3773 transitions. [2021-11-25 20:43:27,883 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 3773 transitions. Word has length 39 [2021-11-25 20:43:27,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:43:27,884 INFO L470 AbstractCegarLoop]: Abstraction has 1095 states and 3773 transitions. [2021-11-25 20:43:27,884 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 16 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:43:27,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 3773 transitions. [2021-11-25 20:43:27,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-25 20:43:27,886 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:43:27,886 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:43:27,906 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Ended with exit code 0 [2021-11-25 20:43:28,086 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,48 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:43:28,087 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:43:28,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:43:28,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1347573864, now seen corresponding path program 28 times [2021-11-25 20:43:28,087 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:43:28,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443884748] [2021-11-25 20:43:28,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:43:28,087 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:43:28,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:43:28,571 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:43:28,571 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:43:28,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443884748] [2021-11-25 20:43:28,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443884748] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:43:28,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594199884] [2021-11-25 20:43:28,571 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 20:43:28,571 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:43:28,572 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:43:28,572 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:43:28,573 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2021-11-25 20:43:28,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:43:28,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 96 conjunts are in the unsatisfiable core [2021-11-25 20:43:28,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:43:29,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:43:29,217 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2021-11-25 20:43:29,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:43:29,327 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2021-11-25 20:43:29,433 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:43:29,433 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 16 [2021-11-25 20:43:29,457 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 20:43:29,457 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:43:29,623 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2888 (Array Int Int))) (<= c_~s_2~0 (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2888) c_~X_0~0.base))) (+ (select .cse0 (+ c_~X_0~0.offset 8)) (select .cse0 (+ c_~X_0~0.offset 4)))))) (forall ((v_ArrVal_2888 (Array Int Int))) (< (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2888) c_~X_0~0.base))) (+ (select .cse1 (+ c_~X_0~0.offset 8)) (select .cse1 (+ c_~X_0~0.offset 4)))) (+ c_~s_2~0 1)))) is different from false [2021-11-25 20:43:29,713 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2888 (Array Int Int)) (v_ArrVal_2887 (Array Int Int))) (<= c_~s_2~0 (let ((.cse0 (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2887) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2888) c_~X_0~0.base))) (+ (select .cse0 (+ c_~X_0~0.offset 4)) (select .cse0 (+ c_~X_0~0.offset 8)))))) (forall ((v_ArrVal_2888 (Array Int Int)) (v_ArrVal_2887 (Array Int Int))) (< (let ((.cse1 (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2887) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2888) c_~X_0~0.base))) (+ (select .cse1 (+ c_~X_0~0.offset 4)) (select .cse1 (+ c_~X_0~0.offset 8)))) (+ c_~s_2~0 1)))) is different from false [2021-11-25 20:43:29,751 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2888 (Array Int Int)) (v_ArrVal_2887 (Array Int Int))) (<= (+ c_~s_2~0 c_~t_4~0) (let ((.cse0 (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2887) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2888) c_~X_0~0.base))) (+ (select .cse0 (+ c_~X_0~0.offset 4)) (select .cse0 (+ c_~X_0~0.offset 8)))))) (forall ((v_ArrVal_2888 (Array Int Int)) (v_ArrVal_2887 (Array Int Int))) (< (let ((.cse1 (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2887) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2888) c_~X_0~0.base))) (+ (select .cse1 (+ c_~X_0~0.offset 4)) (select .cse1 (+ c_~X_0~0.offset 8)))) (+ c_~s_2~0 c_~t_4~0 1)))) is different from false [2021-11-25 20:43:29,765 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2888 (Array Int Int)) (v_ArrVal_2887 (Array Int Int))) (<= (+ c_~s_2~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (let ((.cse0 (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2887) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2888) c_~X_0~0.base))) (+ (select .cse0 (+ c_~X_0~0.offset 4)) (select .cse0 (+ c_~X_0~0.offset 8)))))) (forall ((v_ArrVal_2888 (Array Int Int)) (v_ArrVal_2887 (Array Int Int))) (< (let ((.cse1 (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2887) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2888) c_~X_0~0.base))) (+ (select .cse1 (+ c_~X_0~0.offset 4)) (select .cse1 (+ c_~X_0~0.offset 8)))) (+ c_~s_2~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)) 1)))) is different from false [2021-11-25 20:43:29,780 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2888 (Array Int Int)) (v_ArrVal_2887 (Array Int Int))) (< (let ((.cse0 (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2887) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2888) c_~X_0~0.base))) (+ (select .cse0 (+ c_~X_0~0.offset 4)) (select .cse0 (+ c_~X_0~0.offset 8)))) (+ c_~s_2~0 c_~t_4~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)) 1))) (forall ((v_ArrVal_2888 (Array Int Int)) (v_ArrVal_2887 (Array Int Int))) (<= (+ c_~s_2~0 c_~t_4~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (let ((.cse1 (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2887) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2888) c_~X_0~0.base))) (+ (select .cse1 (+ c_~X_0~0.offset 4)) (select .cse1 (+ c_~X_0~0.offset 8))))))) is different from false [2021-11-25 20:43:29,825 INFO L354 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2021-11-25 20:43:29,825 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 170 treesize of output 128 [2021-11-25 20:43:29,833 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-25 20:43:29,833 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 86 treesize of output 70 [2021-11-25 20:43:29,842 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-25 20:43:29,843 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 38 treesize of output 30 [2021-11-25 20:43:29,983 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:43:29,983 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:43:29,997 INFO L354 Elim1Store]: treesize reduction 82, result has 9.9 percent of original size [2021-11-25 20:43:29,997 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 18 [2021-11-25 20:43:30,162 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 4 not checked. [2021-11-25 20:43:30,162 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594199884] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:43:30,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [8192904] [2021-11-25 20:43:30,163 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:43:30,163 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:43:30,163 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 12] total 38 [2021-11-25 20:43:30,163 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139386787] [2021-11-25 20:43:30,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:43:30,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-11-25 20:43:30,164 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:43:30,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-11-25 20:43:30,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1087, Unknown=5, NotChecked=350, Total=1560 [2021-11-25 20:43:30,165 INFO L87 Difference]: Start difference. First operand 1095 states and 3773 transitions. Second operand has 40 states, 39 states have (on average 2.7435897435897436) internal successors, (107), 39 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:43:33,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:43:33,247 INFO L93 Difference]: Finished difference Result 2997 states and 10472 transitions. [2021-11-25 20:43:33,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-25 20:43:33,248 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.7435897435897436) internal successors, (107), 39 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-11-25 20:43:33,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:43:33,253 INFO L225 Difference]: With dead ends: 2997 [2021-11-25 20:43:33,253 INFO L226 Difference]: Without dead ends: 2956 [2021-11-25 20:43:33,253 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 54 SyntacticMatches, 9 SemanticMatches, 60 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 745 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=356, Invalid=2851, Unknown=5, NotChecked=570, Total=3782 [2021-11-25 20:43:33,254 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 518 mSDsluCounter, 2244 mSDsCounter, 0 mSdLazyCounter, 4010 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 5316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 4010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1198 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-11-25 20:43:33,254 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [518 Valid, 646 Invalid, 5316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 4010 Invalid, 0 Unknown, 1198 Unchecked, 2.0s Time] [2021-11-25 20:43:33,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2021-11-25 20:43:33,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 1380. [2021-11-25 20:43:33,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1380 states, 1379 states have (on average 3.3988397389412617) internal successors, (4687), 1379 states have internal predecessors, (4687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:43:33,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1380 states and 4687 transitions. [2021-11-25 20:43:33,303 INFO L78 Accepts]: Start accepts. Automaton has 1380 states and 4687 transitions. Word has length 40 [2021-11-25 20:43:33,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:43:33,303 INFO L470 AbstractCegarLoop]: Abstraction has 1380 states and 4687 transitions. [2021-11-25 20:43:33,303 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.7435897435897436) internal successors, (107), 39 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:43:33,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1380 states and 4687 transitions. [2021-11-25 20:43:33,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-25 20:43:33,307 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:43:33,307 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:43:33,343 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2021-11-25 20:43:33,522 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,49 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:43:33,522 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:43:33,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:43:33,522 INFO L85 PathProgramCache]: Analyzing trace with hash 70541480, now seen corresponding path program 29 times [2021-11-25 20:43:33,522 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:43:33,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394245799] [2021-11-25 20:43:33,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:43:33,523 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:43:33,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:43:34,003 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:43:34,003 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:43:34,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394245799] [2021-11-25 20:43:34,003 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394245799] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:43:34,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31640103] [2021-11-25 20:43:34,004 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 20:43:34,004 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:43:34,004 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:43:34,004 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:43:34,006 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2021-11-25 20:43:34,243 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-11-25 20:43:34,243 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:43:34,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 104 conjunts are in the unsatisfiable core [2021-11-25 20:43:34,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:43:34,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:43:34,266 INFO L354 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2021-11-25 20:43:34,266 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 23 [2021-11-25 20:43:34,377 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-25 20:43:34,377 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 15 treesize of output 15 [2021-11-25 20:43:34,567 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2021-11-25 20:43:34,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:43:34,637 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2021-11-25 20:43:34,807 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-25 20:43:34,807 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 11 [2021-11-25 20:43:34,856 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 20:43:34,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:43:35,110 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2955 (Array Int Int))) (<= (+ c_~s_2~0 c_~t_4~0) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2955) c_~X_0~0.base))) (+ (select .cse0 (+ c_~X_0~0.offset 4)) (select .cse0 (+ c_~X_0~0.offset 8)))))) (forall ((v_ArrVal_2955 (Array Int Int))) (< (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2955) c_~X_0~0.base))) (+ (select .cse1 (+ c_~X_0~0.offset 4)) (select .cse1 (+ c_~X_0~0.offset 8)))) (+ c_~s_2~0 c_~t_4~0 1)))) is different from false [2021-11-25 20:43:35,157 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2955 (Array Int Int)) (v_ArrVal_2954 (Array Int Int))) (< (let ((.cse0 (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2954) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2955) c_~X_0~0.base))) (+ (select .cse0 (+ c_~X_0~0.offset 4)) (select .cse0 (+ c_~X_0~0.offset 8)))) (+ c_~s_2~0 c_~t_4~0 1))) (forall ((v_ArrVal_2955 (Array Int Int)) (v_ArrVal_2954 (Array Int Int))) (<= (+ c_~s_2~0 c_~t_4~0) (let ((.cse1 (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2954) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2955) c_~X_0~0.base))) (+ (select .cse1 (+ c_~X_0~0.offset 4)) (select .cse1 (+ c_~X_0~0.offset 8))))))) is different from false [2021-11-25 20:43:35,184 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2955 (Array Int Int)) (v_ArrVal_2954 (Array Int Int))) (< (let ((.cse0 (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2954) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2955) c_~X_0~0.base))) (+ (select .cse0 (+ c_~X_0~0.offset 4)) (select .cse0 (+ c_~X_0~0.offset 8)))) (+ c_~s_2~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)) 1))) (forall ((v_ArrVal_2955 (Array Int Int)) (v_ArrVal_2954 (Array Int Int))) (<= (+ c_~s_2~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (let ((.cse1 (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2954) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2955) c_~X_0~0.base))) (+ (select .cse1 (+ c_~X_0~0.offset 4)) (select .cse1 (+ c_~X_0~0.offset 8))))))) is different from false [2021-11-25 20:43:35,198 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2955 (Array Int Int)) (v_ArrVal_2954 (Array Int Int))) (<= (+ c_~s_2~0 c_~t_4~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (let ((.cse0 (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2954) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2955) c_~X_0~0.base))) (+ (select .cse0 (+ c_~X_0~0.offset 4)) (select .cse0 (+ c_~X_0~0.offset 8)))))) (forall ((v_ArrVal_2955 (Array Int Int)) (v_ArrVal_2954 (Array Int Int))) (< (let ((.cse1 (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2954) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2955) c_~X_0~0.base))) (+ (select .cse1 (+ c_~X_0~0.offset 4)) (select .cse1 (+ c_~X_0~0.offset 8)))) (+ c_~s_2~0 c_~t_4~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)) 1)))) is different from false [2021-11-25 20:43:35,239 INFO L354 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2021-11-25 20:43:35,239 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 174 treesize of output 132 [2021-11-25 20:43:35,250 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-25 20:43:35,250 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 90 treesize of output 74 [2021-11-25 20:43:35,260 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-25 20:43:35,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 40 treesize of output 32 [2021-11-25 20:43:35,435 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:43:35,436 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:43:35,450 INFO L354 Elim1Store]: treesize reduction 82, result has 9.9 percent of original size [2021-11-25 20:43:35,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, 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 17 [2021-11-25 20:43:35,786 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 3 not checked. [2021-11-25 20:43:35,786 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31640103] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:43:35,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [754454712] [2021-11-25 20:43:35,786 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:43:35,787 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:43:35,787 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 12] total 39 [2021-11-25 20:43:35,787 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170076281] [2021-11-25 20:43:35,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:43:35,787 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-11-25 20:43:35,788 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:43:35,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-11-25 20:43:35,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1224, Unknown=4, NotChecked=292, Total=1640 [2021-11-25 20:43:35,788 INFO L87 Difference]: Start difference. First operand 1380 states and 4687 transitions. Second operand has 41 states, 40 states have (on average 2.4) internal successors, (96), 40 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:43:39,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:43:39,929 INFO L93 Difference]: Finished difference Result 2033 states and 7052 transitions. [2021-11-25 20:43:39,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-11-25 20:43:39,930 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.4) internal successors, (96), 40 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-11-25 20:43:39,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:43:39,933 INFO L225 Difference]: With dead ends: 2033 [2021-11-25 20:43:39,933 INFO L226 Difference]: Without dead ends: 1992 [2021-11-25 20:43:39,934 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 53 SyntacticMatches, 7 SemanticMatches, 68 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 690 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=482, Invalid=3820, Unknown=4, NotChecked=524, Total=4830 [2021-11-25 20:43:39,934 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 563 mSDsluCounter, 2207 mSDsCounter, 0 mSdLazyCounter, 4107 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 5265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 4107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1018 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-11-25 20:43:39,934 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [563 Valid, 666 Invalid, 5265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 4107 Invalid, 0 Unknown, 1018 Unchecked, 2.2s Time] [2021-11-25 20:43:39,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1992 states. [2021-11-25 20:43:39,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1992 to 1462. [2021-11-25 20:43:39,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1462 states, 1461 states have (on average 3.4072553045859) internal successors, (4978), 1461 states have internal predecessors, (4978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:43:39,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1462 states to 1462 states and 4978 transitions. [2021-11-25 20:43:39,959 INFO L78 Accepts]: Start accepts. Automaton has 1462 states and 4978 transitions. Word has length 40 [2021-11-25 20:43:39,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:43:39,959 INFO L470 AbstractCegarLoop]: Abstraction has 1462 states and 4978 transitions. [2021-11-25 20:43:39,960 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.4) internal successors, (96), 40 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:43:39,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1462 states and 4978 transitions. [2021-11-25 20:43:39,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-25 20:43:39,963 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:43:39,963 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:43:39,983 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2021-11-25 20:43:40,165 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,50 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:43:40,165 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:43:40,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:43:40,165 INFO L85 PathProgramCache]: Analyzing trace with hash -218107156, now seen corresponding path program 30 times [2021-11-25 20:43:40,166 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:43:40,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505748011] [2021-11-25 20:43:40,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:43:40,166 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:43:40,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:43:40,659 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:43:40,660 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:43:40,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505748011] [2021-11-25 20:43:40,660 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505748011] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:43:40,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892153433] [2021-11-25 20:43:40,660 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 20:43:40,660 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:43:40,660 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:43:40,663 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:43:40,664 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2021-11-25 20:43:40,870 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 20:43:40,870 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:43:40,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 98 conjunts are in the unsatisfiable core [2021-11-25 20:43:40,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:43:40,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:43:40,892 INFO L354 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2021-11-25 20:43:40,892 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 23 [2021-11-25 20:43:40,985 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-25 20:43:40,985 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 15 treesize of output 15 [2021-11-25 20:43:41,206 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2021-11-25 20:43:41,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:43:41,274 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2021-11-25 20:43:41,441 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-25 20:43:41,441 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 11 [2021-11-25 20:43:41,490 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 20:43:41,490 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:43:41,716 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3022 (Array Int Int))) (< (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3022) c_~X_0~0.base))) (+ (select .cse0 (+ c_~X_0~0.offset 8)) (select .cse0 (+ c_~X_0~0.offset 4)))) (+ c_~s_2~0 c_~t_4~0 1))) (forall ((v_ArrVal_3022 (Array Int Int))) (<= (+ c_~s_2~0 c_~t_4~0) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3022) c_~X_0~0.base))) (+ (select .cse1 (+ c_~X_0~0.offset 8)) (select .cse1 (+ c_~X_0~0.offset 4))))))) is different from false [2021-11-25 20:43:41,762 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3021 (Array Int Int)) (v_ArrVal_3022 (Array Int Int))) (< (let ((.cse0 (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3021) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3022) c_~X_0~0.base))) (+ (select .cse0 (+ c_~X_0~0.offset 4)) (select .cse0 (+ c_~X_0~0.offset 8)))) (+ c_~s_2~0 c_~t_4~0 1))) (forall ((v_ArrVal_3021 (Array Int Int)) (v_ArrVal_3022 (Array Int Int))) (<= (+ c_~s_2~0 c_~t_4~0) (let ((.cse1 (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3021) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3022) c_~X_0~0.base))) (+ (select .cse1 (+ c_~X_0~0.offset 4)) (select .cse1 (+ c_~X_0~0.offset 8))))))) is different from false [2021-11-25 20:43:41,789 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3021 (Array Int Int)) (v_ArrVal_3022 (Array Int Int))) (<= (+ c_~s_2~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (let ((.cse0 (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3021) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3022) c_~X_0~0.base))) (+ (select .cse0 (+ c_~X_0~0.offset 4)) (select .cse0 (+ c_~X_0~0.offset 8)))))) (forall ((v_ArrVal_3021 (Array Int Int)) (v_ArrVal_3022 (Array Int Int))) (< (let ((.cse1 (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3021) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3022) c_~X_0~0.base))) (+ (select .cse1 (+ c_~X_0~0.offset 4)) (select .cse1 (+ c_~X_0~0.offset 8)))) (+ c_~s_2~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)) 1)))) is different from false [2021-11-25 20:43:41,804 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3021 (Array Int Int)) (v_ArrVal_3022 (Array Int Int))) (<= (+ c_~s_2~0 c_~t_4~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (let ((.cse0 (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3021) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3022) c_~X_0~0.base))) (+ (select .cse0 (+ c_~X_0~0.offset 4)) (select .cse0 (+ c_~X_0~0.offset 8)))))) (forall ((v_ArrVal_3021 (Array Int Int)) (v_ArrVal_3022 (Array Int Int))) (< (let ((.cse1 (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3021) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3022) c_~X_0~0.base))) (+ (select .cse1 (+ c_~X_0~0.offset 4)) (select .cse1 (+ c_~X_0~0.offset 8)))) (+ c_~s_2~0 c_~t_4~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)) 1)))) is different from false [2021-11-25 20:43:41,852 INFO L354 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2021-11-25 20:43:41,853 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 174 treesize of output 132 [2021-11-25 20:43:41,864 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-25 20:43:41,865 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 90 treesize of output 74 [2021-11-25 20:43:41,873 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-25 20:43:41,874 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 40 treesize of output 32 [2021-11-25 20:43:42,096 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:43:42,096 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:43:42,114 INFO L354 Elim1Store]: treesize reduction 82, result has 9.9 percent of original size [2021-11-25 20:43:42,115 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 17 [2021-11-25 20:43:42,396 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 3 not checked. [2021-11-25 20:43:42,396 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [892153433] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:43:42,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1593337254] [2021-11-25 20:43:42,397 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:43:42,397 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:43:42,397 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 37 [2021-11-25 20:43:42,397 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266591547] [2021-11-25 20:43:42,397 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:43:42,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-11-25 20:43:42,398 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:43:42,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-11-25 20:43:42,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1095, Unknown=4, NotChecked=276, Total=1482 [2021-11-25 20:43:42,398 INFO L87 Difference]: Start difference. First operand 1462 states and 4978 transitions. Second operand has 39 states, 38 states have (on average 2.473684210526316) internal successors, (94), 38 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:43:45,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:43:45,607 INFO L93 Difference]: Finished difference Result 2613 states and 9168 transitions. [2021-11-25 20:43:45,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-25 20:43:45,607 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.473684210526316) internal successors, (94), 38 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-11-25 20:43:45,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:43:45,612 INFO L225 Difference]: With dead ends: 2613 [2021-11-25 20:43:45,612 INFO L226 Difference]: Without dead ends: 2572 [2021-11-25 20:43:45,613 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 56 SyntacticMatches, 6 SemanticMatches, 60 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=354, Invalid=2963, Unknown=5, NotChecked=460, Total=3782 [2021-11-25 20:43:45,613 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 384 mSDsluCounter, 2079 mSDsCounter, 0 mSdLazyCounter, 3318 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 4538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 3318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1143 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-11-25 20:43:45,613 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [384 Valid, 652 Invalid, 4538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 3318 Invalid, 0 Unknown, 1143 Unchecked, 1.7s Time] [2021-11-25 20:43:45,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2572 states. [2021-11-25 20:43:45,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2572 to 1612. [2021-11-25 20:43:45,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1612 states, 1611 states have (on average 3.4072004965859715) internal successors, (5489), 1611 states have internal predecessors, (5489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:43:45,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1612 states to 1612 states and 5489 transitions. [2021-11-25 20:43:45,679 INFO L78 Accepts]: Start accepts. Automaton has 1612 states and 5489 transitions. Word has length 40 [2021-11-25 20:43:45,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:43:45,679 INFO L470 AbstractCegarLoop]: Abstraction has 1612 states and 5489 transitions. [2021-11-25 20:43:45,679 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.473684210526316) internal successors, (94), 38 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:43:45,679 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 5489 transitions. [2021-11-25 20:43:45,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-25 20:43:45,682 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:43:45,683 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:43:45,703 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Ended with exit code 0 [2021-11-25 20:43:45,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2021-11-25 20:43:45,883 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:43:45,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:43:45,884 INFO L85 PathProgramCache]: Analyzing trace with hash 340399498, now seen corresponding path program 31 times [2021-11-25 20:43:45,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:43:45,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729001043] [2021-11-25 20:43:45,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:43:45,885 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:43:45,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:43:46,336 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:43:46,337 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:43:46,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729001043] [2021-11-25 20:43:46,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729001043] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:43:46,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093378308] [2021-11-25 20:43:46,337 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 20:43:46,337 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:43:46,337 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:43:46,338 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:43:46,339 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2021-11-25 20:43:46,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:43:46,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 94 conjunts are in the unsatisfiable core [2021-11-25 20:43:46,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:43:46,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:43:46,845 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2021-11-25 20:43:46,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:43:46,917 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2021-11-25 20:43:47,043 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-25 20:43:47,043 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 36 treesize of output 12 [2021-11-25 20:43:47,113 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 20:43:47,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:43:47,320 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3084 (Array Int Int))) (<= (+ c_~s_2~0 c_~t_4~0) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3084) c_~X_0~0.base))) (+ (select .cse0 (+ c_~X_0~0.offset 4)) (select .cse0 (+ c_~X_0~0.offset 8)))))) (forall ((v_ArrVal_3084 (Array Int Int))) (<= (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3084) c_~X_0~0.base))) (+ (select .cse1 (+ c_~X_0~0.offset 4)) (select .cse1 (+ c_~X_0~0.offset 8)))) (+ c_~s_2~0 c_~t_4~0)))) is different from false [2021-11-25 20:43:47,356 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3083 (Array Int Int)) (v_ArrVal_3084 (Array Int Int))) (<= (let ((.cse0 (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3083) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3084) c_~X_0~0.base))) (+ (select .cse0 (+ c_~X_0~0.offset 4)) (select .cse0 (+ c_~X_0~0.offset 8)))) (+ c_~s_2~0 c_~t_4~0))) (forall ((v_ArrVal_3083 (Array Int Int)) (v_ArrVal_3084 (Array Int Int))) (<= (+ c_~s_2~0 c_~t_4~0) (let ((.cse1 (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3083) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3084) c_~X_0~0.base))) (+ (select .cse1 (+ c_~X_0~0.offset 4)) (select .cse1 (+ c_~X_0~0.offset 8))))))) is different from false [2021-11-25 20:43:47,378 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3083 (Array Int Int)) (v_ArrVal_3084 (Array Int Int))) (<= (let ((.cse0 (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3083) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3084) c_~X_0~0.base))) (+ (select .cse0 (+ c_~X_0~0.offset 4)) (select .cse0 (+ c_~X_0~0.offset 8)))) (+ c_~s_2~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))))) (forall ((v_ArrVal_3083 (Array Int Int)) (v_ArrVal_3084 (Array Int Int))) (<= (+ c_~s_2~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (let ((.cse1 (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3083) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3084) c_~X_0~0.base))) (+ (select .cse1 (+ c_~X_0~0.offset 4)) (select .cse1 (+ c_~X_0~0.offset 8))))))) is different from false [2021-11-25 20:43:47,389 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3083 (Array Int Int)) (v_ArrVal_3084 (Array Int Int))) (<= (let ((.cse0 (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3083) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3084) c_~X_0~0.base))) (+ (select .cse0 (+ c_~X_0~0.offset 4)) (select .cse0 (+ c_~X_0~0.offset 8)))) (+ c_~s_2~0 c_~t_4~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))))) (forall ((v_ArrVal_3083 (Array Int Int)) (v_ArrVal_3084 (Array Int Int))) (<= (+ c_~s_2~0 c_~t_4~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (let ((.cse1 (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3083) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3084) c_~X_0~0.base))) (+ (select .cse1 (+ c_~X_0~0.offset 4)) (select .cse1 (+ c_~X_0~0.offset 8))))))) is different from false [2021-11-25 20:43:47,423 INFO L354 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2021-11-25 20:43:47,423 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 170 treesize of output 128 [2021-11-25 20:43:47,429 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-25 20:43:47,429 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 86 treesize of output 70 [2021-11-25 20:43:47,436 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-25 20:43:47,436 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 38 treesize of output 30 [2021-11-25 20:43:47,580 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:43:47,580 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:43:47,593 INFO L354 Elim1Store]: treesize reduction 82, result has 9.9 percent of original size [2021-11-25 20:43:47,593 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 17 [2021-11-25 20:43:47,742 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 3 not checked. [2021-11-25 20:43:47,742 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2093378308] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:43:47,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [163413667] [2021-11-25 20:43:47,743 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:43:47,743 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:43:47,743 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 12] total 36 [2021-11-25 20:43:47,743 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154551751] [2021-11-25 20:43:47,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:43:47,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-11-25 20:43:47,744 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:43:47,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-11-25 20:43:47,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1019, Unknown=4, NotChecked=268, Total=1406 [2021-11-25 20:43:47,745 INFO L87 Difference]: Start difference. First operand 1612 states and 5489 transitions. Second operand has 38 states, 37 states have (on average 2.4864864864864864) internal successors, (92), 37 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:43:50,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:43:50,534 INFO L93 Difference]: Finished difference Result 2824 states and 9835 transitions. [2021-11-25 20:43:50,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-11-25 20:43:50,534 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.4864864864864864) internal successors, (92), 37 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-11-25 20:43:50,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:43:50,539 INFO L225 Difference]: With dead ends: 2824 [2021-11-25 20:43:50,540 INFO L226 Difference]: Without dead ends: 2779 [2021-11-25 20:43:50,540 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 54 SyntacticMatches, 9 SemanticMatches, 63 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 740 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=447, Invalid=3225, Unknown=4, NotChecked=484, Total=4160 [2021-11-25 20:43:50,540 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 534 mSDsluCounter, 1451 mSDsCounter, 0 mSdLazyCounter, 2760 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 3688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 2760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 799 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-11-25 20:43:50,541 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [534 Valid, 426 Invalid, 3688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 2760 Invalid, 0 Unknown, 799 Unchecked, 1.4s Time] [2021-11-25 20:43:50,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2779 states. [2021-11-25 20:43:50,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2779 to 1660. [2021-11-25 20:43:50,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1660 states, 1659 states have (on average 3.4291742013261) internal successors, (5689), 1659 states have internal predecessors, (5689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:43:50,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1660 states to 1660 states and 5689 transitions. [2021-11-25 20:43:50,580 INFO L78 Accepts]: Start accepts. Automaton has 1660 states and 5689 transitions. Word has length 40 [2021-11-25 20:43:50,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:43:50,580 INFO L470 AbstractCegarLoop]: Abstraction has 1660 states and 5689 transitions. [2021-11-25 20:43:50,580 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.4864864864864864) internal successors, (92), 37 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:43:50,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1660 states and 5689 transitions. [2021-11-25 20:43:50,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-25 20:43:50,582 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:43:50,582 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:43:50,602 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Ended with exit code 0 [2021-11-25 20:43:50,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,52 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:43:50,783 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:43:50,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:43:50,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1607091862, now seen corresponding path program 32 times [2021-11-25 20:43:50,783 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:43:50,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636993621] [2021-11-25 20:43:50,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:43:50,784 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:43:50,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:43:51,318 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:43:51,318 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:43:51,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636993621] [2021-11-25 20:43:51,318 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636993621] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:43:51,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656878910] [2021-11-25 20:43:51,318 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 20:43:51,321 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:43:51,322 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:43:51,323 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:43:51,334 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2021-11-25 20:43:51,543 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-11-25 20:43:51,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:43:51,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 109 conjunts are in the unsatisfiable core [2021-11-25 20:43:51,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:43:51,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:43:51,577 INFO L354 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2021-11-25 20:43:51,578 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 23 [2021-11-25 20:43:51,771 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-25 20:43:51,771 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 15 treesize of output 15 [2021-11-25 20:43:52,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:43:52,076 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2021-11-25 20:43:52,446 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 35 [2021-11-25 20:43:52,565 INFO L354 Elim1Store]: treesize reduction 38, result has 7.3 percent of original size [2021-11-25 20:43:52,565 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 37 treesize of output 14 [2021-11-25 20:43:52,636 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:43:52,636 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:43:52,760 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3150 (Array Int Int))) (<= c_~s_2~0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3150) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_7~0 4) 4)) c_~s_6~0))) (forall ((v_ArrVal_3150 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3150) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_7~0 4) 4)) c_~s_6~0) (+ c_~s_2~0 1)))) is different from false [2021-11-25 20:43:52,769 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3150 (Array Int Int))) (< (let ((.cse0 (* c_~i_7~0 4))) (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3150) c_~X_0~0.base) (+ c_~X_0~0.offset .cse0 8)) (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset .cse0 4)))) (+ c_~s_2~0 1))) (forall ((v_ArrVal_3150 (Array Int Int))) (<= c_~s_2~0 (let ((.cse1 (* c_~i_7~0 4))) (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3150) c_~X_0~0.base) (+ c_~X_0~0.offset .cse1 8)) (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset .cse1 4))))))) is different from false [2021-11-25 20:43:53,535 INFO L354 Elim1Store]: treesize reduction 33, result has 62.5 percent of original size [2021-11-25 20:43:53,535 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1065 treesize of output 604 [2021-11-25 20:43:53,548 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-25 20:43:53,548 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 549 treesize of output 525 [2021-11-25 20:43:53,555 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 525 treesize of output 509 [2021-11-25 20:43:53,562 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 509 treesize of output 477 [2021-11-25 20:43:53,572 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-25 20:43:53,573 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 477 treesize of output 429 [2021-11-25 20:43:55,272 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-11-25 20:43:55,272 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656878910] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:43:55,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1515178255] [2021-11-25 20:43:55,273 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:43:55,273 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:43:55,273 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 46 [2021-11-25 20:43:55,273 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083173078] [2021-11-25 20:43:55,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:43:55,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2021-11-25 20:43:55,274 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:43:55,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-11-25 20:43:55,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1885, Unknown=27, NotChecked=178, Total=2256 [2021-11-25 20:43:55,275 INFO L87 Difference]: Start difference. First operand 1660 states and 5689 transitions. Second operand has 48 states, 47 states have (on average 2.0425531914893615) internal successors, (96), 47 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:43:58,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:43:58,640 INFO L93 Difference]: Finished difference Result 2337 states and 8089 transitions. [2021-11-25 20:43:58,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-11-25 20:43:58,641 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 2.0425531914893615) internal successors, (96), 47 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-11-25 20:43:58,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:43:58,645 INFO L225 Difference]: With dead ends: 2337 [2021-11-25 20:43:58,645 INFO L226 Difference]: Without dead ends: 2296 [2021-11-25 20:43:58,646 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 58 SyntacticMatches, 12 SemanticMatches, 69 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 785 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=482, Invalid=4191, Unknown=27, NotChecked=270, Total=4970 [2021-11-25 20:43:58,646 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 520 mSDsluCounter, 2073 mSDsCounter, 0 mSdLazyCounter, 2633 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 4624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 2633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1897 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-25 20:43:58,646 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [520 Valid, 711 Invalid, 4624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 2633 Invalid, 0 Unknown, 1897 Unchecked, 1.3s Time] [2021-11-25 20:43:58,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2296 states. [2021-11-25 20:43:58,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2296 to 1788. [2021-11-25 20:43:58,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1788 states, 1787 states have (on average 3.438724118634583) internal successors, (6145), 1787 states have internal predecessors, (6145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:43:58,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1788 states to 1788 states and 6145 transitions. [2021-11-25 20:43:58,680 INFO L78 Accepts]: Start accepts. Automaton has 1788 states and 6145 transitions. Word has length 40 [2021-11-25 20:43:58,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:43:58,680 INFO L470 AbstractCegarLoop]: Abstraction has 1788 states and 6145 transitions. [2021-11-25 20:43:58,680 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 2.0425531914893615) internal successors, (96), 47 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:43:58,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1788 states and 6145 transitions. [2021-11-25 20:43:58,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-25 20:43:58,683 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:43:58,683 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:43:58,703 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Ended with exit code 0 [2021-11-25 20:43:58,886 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2021-11-25 20:43:58,886 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:43:58,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:43:58,886 INFO L85 PathProgramCache]: Analyzing trace with hash 2048802518, now seen corresponding path program 33 times [2021-11-25 20:43:58,886 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:43:58,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217618196] [2021-11-25 20:43:58,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:43:58,887 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:43:58,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:43:59,487 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:43:59,488 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:43:59,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217618196] [2021-11-25 20:43:59,488 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217618196] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:43:59,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343291296] [2021-11-25 20:43:59,488 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 20:43:59,488 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:43:59,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:43:59,489 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:43:59,489 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2021-11-25 20:43:59,700 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 20:43:59,701 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:43:59,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 88 conjunts are in the unsatisfiable core [2021-11-25 20:43:59,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:43:59,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:43:59,987 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2021-11-25 20:44:00,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:44:00,187 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2021-11-25 20:44:00,271 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-25 20:44:00,271 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 11 [2021-11-25 20:44:00,324 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 20:44:00,324 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:44:00,435 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3212 (Array Int Int))) (<= c_~s_2~0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3212) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_7~0 4) 4)) c_~s_6~0))) (forall ((v_ArrVal_3212 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3212) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_7~0 4) 4)) c_~s_6~0) (+ c_~s_2~0 1)))) is different from false [2021-11-25 20:44:00,444 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3212 (Array Int Int))) (<= c_~s_2~0 (let ((.cse0 (* c_~i_7~0 4))) (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3212) c_~X_0~0.base) (+ c_~X_0~0.offset .cse0 8)) c_~s_6~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset .cse0 4)))))) (forall ((v_ArrVal_3212 (Array Int Int))) (< (let ((.cse1 (* c_~i_7~0 4))) (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3212) c_~X_0~0.base) (+ c_~X_0~0.offset .cse1 8)) c_~s_6~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset .cse1 4)))) (+ c_~s_2~0 1)))) is different from false [2021-11-25 20:44:00,461 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3212 (Array Int Int))) (< (let ((.cse0 (* c_~i_7~0 4))) (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3212) c_~X_0~0.base) (+ c_~X_0~0.offset .cse0 8)) c_~s_6~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset .cse0 4)))) (+ c_~s_2~0 c_~t_4~0 1))) (forall ((v_ArrVal_3212 (Array Int Int))) (<= (+ c_~s_2~0 c_~t_4~0) (let ((.cse1 (* c_~i_7~0 4))) (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3212) c_~X_0~0.base) (+ c_~X_0~0.offset .cse1 8)) c_~s_6~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset .cse1 4))))))) is different from false [2021-11-25 20:44:00,469 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3212 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3212) c_~X_0~0.base) (+ c_~X_0~0.offset 8)) (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset 4))) (+ c_~s_2~0 c_~t_4~0 1))) (forall ((v_ArrVal_3212 (Array Int Int))) (<= (+ c_~s_2~0 c_~t_4~0) (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3212) c_~X_0~0.base) (+ c_~X_0~0.offset 8)) (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset 4)))))) is different from false [2021-11-25 20:44:00,491 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3211 (Array Int Int)) (v_ArrVal_3212 (Array Int Int))) (<= (+ c_~s_2~0 c_~t_4~0) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3211))) (+ (select (select (store .cse0 |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3212) c_~X_0~0.base) (+ c_~X_0~0.offset 8)) (select (select .cse0 c_~X_0~0.base) (+ c_~X_0~0.offset 4)))))) (forall ((v_ArrVal_3211 (Array Int Int)) (v_ArrVal_3212 (Array Int Int))) (< (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3211))) (+ (select (select (store .cse1 |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3212) c_~X_0~0.base) (+ c_~X_0~0.offset 8)) (select (select .cse1 c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) (+ c_~s_2~0 c_~t_4~0 1)))) is different from false [2021-11-25 20:44:00,526 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3211 (Array Int Int)) (v_ArrVal_3212 (Array Int Int))) (<= (+ c_~s_2~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3211))) (+ (select (select (store .cse0 |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3212) c_~X_0~0.base) (+ c_~X_0~0.offset 8)) (select (select .cse0 c_~X_0~0.base) (+ c_~X_0~0.offset 4)))))) (forall ((v_ArrVal_3211 (Array Int Int)) (v_ArrVal_3212 (Array Int Int))) (< (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3211))) (+ (select (select (store .cse1 |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3212) c_~X_0~0.base) (+ c_~X_0~0.offset 8)) (select (select .cse1 c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) (+ c_~s_2~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)) 1)))) is different from false [2021-11-25 20:44:00,537 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3211 (Array Int Int)) (v_ArrVal_3212 (Array Int Int))) (< (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3211))) (+ (select (select (store .cse0 |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3212) c_~X_0~0.base) (+ c_~X_0~0.offset 8)) (select (select .cse0 c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) (+ c_~s_2~0 c_~t_4~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)) 1))) (forall ((v_ArrVal_3211 (Array Int Int)) (v_ArrVal_3212 (Array Int Int))) (<= (+ c_~s_2~0 c_~t_4~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3211))) (+ (select (select (store .cse1 |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3212) c_~X_0~0.base) (+ c_~X_0~0.offset 8)) (select (select .cse1 c_~X_0~0.base) (+ c_~X_0~0.offset 4))))))) is different from false [2021-11-25 20:44:00,573 INFO L354 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2021-11-25 20:44:00,574 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 734 treesize of output 416 [2021-11-25 20:44:00,582 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-25 20:44:00,582 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 374 treesize of output 326 [2021-11-25 20:44:00,588 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 326 treesize of output 294 [2021-11-25 20:44:00,815 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:44:00,816 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:44:00,833 INFO L354 Elim1Store]: treesize reduction 82, result has 9.9 percent of original size [2021-11-25 20:44:00,834 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 17 [2021-11-25 20:44:01,014 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 6 not checked. [2021-11-25 20:44:01,014 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343291296] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:44:01,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [470376656] [2021-11-25 20:44:01,015 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:44:01,015 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:44:01,015 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 12] total 38 [2021-11-25 20:44:01,015 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403662491] [2021-11-25 20:44:01,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:44:01,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-11-25 20:44:01,016 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:44:01,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-11-25 20:44:01,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=976, Unknown=7, NotChecked=476, Total=1560 [2021-11-25 20:44:01,016 INFO L87 Difference]: Start difference. First operand 1788 states and 6145 transitions. Second operand has 40 states, 39 states have (on average 2.4615384615384617) internal successors, (96), 39 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:44:04,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:44:04,675 INFO L93 Difference]: Finished difference Result 3380 states and 11824 transitions. [2021-11-25 20:44:04,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-11-25 20:44:04,676 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.4615384615384617) internal successors, (96), 39 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-11-25 20:44:04,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:44:04,682 INFO L225 Difference]: With dead ends: 3380 [2021-11-25 20:44:04,682 INFO L226 Difference]: Without dead ends: 3359 [2021-11-25 20:44:04,683 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 57 SyntacticMatches, 7 SemanticMatches, 68 ConstructedPredicates, 7 IntricatePredicates, 4 DeprecatedPredicates, 656 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=437, Invalid=3490, Unknown=7, NotChecked=896, Total=4830 [2021-11-25 20:44:04,683 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 400 mSDsluCounter, 2130 mSDsCounter, 0 mSdLazyCounter, 3677 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 5051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 3677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1281 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-11-25 20:44:04,684 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [400 Valid, 681 Invalid, 5051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 3677 Invalid, 0 Unknown, 1281 Unchecked, 1.8s Time] [2021-11-25 20:44:04,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3359 states. [2021-11-25 20:44:04,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3359 to 1819. [2021-11-25 20:44:04,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1819 states, 1818 states have (on average 3.435093509350935) internal successors, (6245), 1818 states have internal predecessors, (6245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:44:04,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1819 states to 1819 states and 6245 transitions. [2021-11-25 20:44:04,725 INFO L78 Accepts]: Start accepts. Automaton has 1819 states and 6245 transitions. Word has length 40 [2021-11-25 20:44:04,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:44:04,725 INFO L470 AbstractCegarLoop]: Abstraction has 1819 states and 6245 transitions. [2021-11-25 20:44:04,725 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.4615384615384617) internal successors, (96), 39 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:44:04,725 INFO L276 IsEmpty]: Start isEmpty. Operand 1819 states and 6245 transitions. [2021-11-25 20:44:04,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-25 20:44:04,727 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:44:04,727 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:44:04,748 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Forceful destruction successful, exit code 0 [2021-11-25 20:44:04,928 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2021-11-25 20:44:04,928 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:44:04,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:44:04,928 INFO L85 PathProgramCache]: Analyzing trace with hash -2117082059, now seen corresponding path program 1 times [2021-11-25 20:44:04,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:44:04,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670902607] [2021-11-25 20:44:04,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:44:04,929 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:44:04,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:44:05,483 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:44:05,483 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:44:05,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670902607] [2021-11-25 20:44:05,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670902607] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:44:05,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143530950] [2021-11-25 20:44:05,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:44:05,484 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:44:05,484 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:44:05,485 INFO L229 MonitoredProcess]: Starting monitored process 55 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:44:05,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2021-11-25 20:44:05,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:44:05,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 94 conjunts are in the unsatisfiable core [2021-11-25 20:44:05,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:44:06,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:44:06,025 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2021-11-25 20:44:06,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:44:06,221 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2021-11-25 20:44:06,294 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-25 20:44:06,294 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 11 [2021-11-25 20:44:06,340 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 20:44:06,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:44:06,456 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3274 (Array Int Int))) (<= c_~s_2~0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3274) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_7~0 4) 4)) c_~s_6~0))) (forall ((v_ArrVal_3274 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3274) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_7~0 4) 4)) c_~s_6~0) (+ c_~s_2~0 1)))) is different from false [2021-11-25 20:44:06,467 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3274 (Array Int Int))) (<= c_~s_2~0 (let ((.cse0 (* c_~i_7~0 4))) (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3274) c_~X_0~0.base) (+ c_~X_0~0.offset .cse0 8)) c_~s_6~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset .cse0 4)))))) (forall ((v_ArrVal_3274 (Array Int Int))) (< (let ((.cse1 (* c_~i_7~0 4))) (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3274) c_~X_0~0.base) (+ c_~X_0~0.offset .cse1 8)) c_~s_6~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset .cse1 4)))) (+ c_~s_2~0 1)))) is different from false [2021-11-25 20:44:06,482 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3274 (Array Int Int))) (< (let ((.cse0 (* c_~i_7~0 4))) (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3274) c_~X_0~0.base) (+ c_~X_0~0.offset .cse0 8)) c_~s_6~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset .cse0 4)))) (+ c_~s_2~0 c_~t_4~0 1))) (forall ((v_ArrVal_3274 (Array Int Int))) (<= (+ c_~s_2~0 c_~t_4~0) (let ((.cse1 (* c_~i_7~0 4))) (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3274) c_~X_0~0.base) (+ c_~X_0~0.offset .cse1 8)) c_~s_6~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset .cse1 4))))))) is different from false [2021-11-25 20:44:06,491 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3274 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3274) c_~X_0~0.base) (+ c_~X_0~0.offset 8)) (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset 4))) (+ c_~s_2~0 c_~t_4~0 1))) (forall ((v_ArrVal_3274 (Array Int Int))) (<= (+ c_~s_2~0 c_~t_4~0) (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3274) c_~X_0~0.base) (+ c_~X_0~0.offset 8)) (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset 4)))))) is different from false [2021-11-25 20:44:06,511 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3273 (Array Int Int)) (v_ArrVal_3274 (Array Int Int))) (< (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3273))) (+ (select (select (store .cse0 |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3274) c_~X_0~0.base) (+ c_~X_0~0.offset 8)) (select (select .cse0 c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) (+ c_~s_2~0 c_~t_4~0 1))) (forall ((v_ArrVal_3273 (Array Int Int)) (v_ArrVal_3274 (Array Int Int))) (<= (+ c_~s_2~0 c_~t_4~0) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3273))) (+ (select (select (store .cse1 |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3274) c_~X_0~0.base) (+ c_~X_0~0.offset 8)) (select (select .cse1 c_~X_0~0.base) (+ c_~X_0~0.offset 4))))))) is different from false [2021-11-25 20:44:06,546 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3273 (Array Int Int)) (v_ArrVal_3274 (Array Int Int))) (<= (+ c_~s_2~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3273))) (+ (select (select (store .cse0 |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3274) c_~X_0~0.base) (+ c_~X_0~0.offset 8)) (select (select .cse0 c_~X_0~0.base) (+ c_~X_0~0.offset 4)))))) (forall ((v_ArrVal_3273 (Array Int Int)) (v_ArrVal_3274 (Array Int Int))) (< (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3273))) (+ (select (select (store .cse1 |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3274) c_~X_0~0.base) (+ c_~X_0~0.offset 8)) (select (select .cse1 c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) (+ c_~s_2~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)) 1)))) is different from false [2021-11-25 20:44:06,557 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3273 (Array Int Int)) (v_ArrVal_3274 (Array Int Int))) (< (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3273))) (+ (select (select (store .cse0 |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3274) c_~X_0~0.base) (+ c_~X_0~0.offset 8)) (select (select .cse0 c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) (+ c_~s_2~0 c_~t_4~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)) 1))) (forall ((v_ArrVal_3273 (Array Int Int)) (v_ArrVal_3274 (Array Int Int))) (<= (+ c_~s_2~0 c_~t_4~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3273))) (+ (select (select (store .cse1 |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3274) c_~X_0~0.base) (+ c_~X_0~0.offset 8)) (select (select .cse1 c_~X_0~0.base) (+ c_~X_0~0.offset 4))))))) is different from false [2021-11-25 20:44:06,592 INFO L354 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2021-11-25 20:44:06,593 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 734 treesize of output 416 [2021-11-25 20:44:06,601 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-25 20:44:06,601 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 374 treesize of output 326 [2021-11-25 20:44:06,605 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 326 treesize of output 294 [2021-11-25 20:44:06,924 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:44:06,925 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:44:06,938 INFO L354 Elim1Store]: treesize reduction 82, result has 9.9 percent of original size [2021-11-25 20:44:06,938 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 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 17 [2021-11-25 20:44:07,104 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 6 not checked. [2021-11-25 20:44:07,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [143530950] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:44:07,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [769827095] [2021-11-25 20:44:07,104 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:44:07,105 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:44:07,105 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 12] total 40 [2021-11-25 20:44:07,105 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144525510] [2021-11-25 20:44:07,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:44:07,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2021-11-25 20:44:07,106 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:44:07,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-11-25 20:44:07,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1097, Unknown=7, NotChecked=504, Total=1722 [2021-11-25 20:44:07,106 INFO L87 Difference]: Start difference. First operand 1819 states and 6245 transitions. Second operand has 42 states, 41 states have (on average 2.3902439024390243) internal successors, (98), 41 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:44:10,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:44:10,283 INFO L93 Difference]: Finished difference Result 3191 states and 11108 transitions. [2021-11-25 20:44:10,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-11-25 20:44:10,284 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.3902439024390243) internal successors, (98), 41 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-11-25 20:44:10,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:44:10,289 INFO L225 Difference]: With dead ends: 3191 [2021-11-25 20:44:10,289 INFO L226 Difference]: Without dead ends: 3170 [2021-11-25 20:44:10,290 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 55 SyntacticMatches, 8 SemanticMatches, 66 ConstructedPredicates, 7 IntricatePredicates, 3 DeprecatedPredicates, 694 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=375, Invalid=3306, Unknown=7, NotChecked=868, Total=4556 [2021-11-25 20:44:10,291 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 345 mSDsluCounter, 2004 mSDsCounter, 0 mSdLazyCounter, 3479 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 5159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 3479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1600 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-11-25 20:44:10,291 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [345 Valid, 645 Invalid, 5159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 3479 Invalid, 0 Unknown, 1600 Unchecked, 1.7s Time] [2021-11-25 20:44:10,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3170 states. [2021-11-25 20:44:10,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3170 to 1870. [2021-11-25 20:44:10,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1870 states, 1869 states have (on average 3.4323167469234885) internal successors, (6415), 1869 states have internal predecessors, (6415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:44:10,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1870 states to 1870 states and 6415 transitions. [2021-11-25 20:44:10,349 INFO L78 Accepts]: Start accepts. Automaton has 1870 states and 6415 transitions. Word has length 40 [2021-11-25 20:44:10,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:44:10,350 INFO L470 AbstractCegarLoop]: Abstraction has 1870 states and 6415 transitions. [2021-11-25 20:44:10,350 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.3902439024390243) internal successors, (98), 41 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:44:10,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1870 states and 6415 transitions. [2021-11-25 20:44:10,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-25 20:44:10,354 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:44:10,354 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:44:10,388 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Forceful destruction successful, exit code 0 [2021-11-25 20:44:10,574 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2021-11-25 20:44:10,574 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:44:10,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:44:10,574 INFO L85 PathProgramCache]: Analyzing trace with hash -62318118, now seen corresponding path program 34 times [2021-11-25 20:44:10,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:44:10,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850127271] [2021-11-25 20:44:10,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:44:10,575 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:44:10,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:44:11,124 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:44:11,125 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:44:11,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850127271] [2021-11-25 20:44:11,125 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850127271] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:44:11,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080009099] [2021-11-25 20:44:11,125 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 20:44:11,125 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:44:11,125 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:44:11,126 INFO L229 MonitoredProcess]: Starting monitored process 56 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:44:11,127 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2021-11-25 20:44:11,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:44:11,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 96 conjunts are in the unsatisfiable core [2021-11-25 20:44:11,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:44:11,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:44:11,733 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2021-11-25 20:44:11,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:44:11,888 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2021-11-25 20:44:12,014 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:44:12,014 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2021-11-25 20:44:12,072 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 20:44:12,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:44:12,229 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3336 (Array Int Int))) (<= c_~s_2~0 (let ((.cse0 (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3336) c_~X_0~0.base)) (.cse1 (* c_~i_7~0 4))) (+ c_~s_6~0 (select .cse0 (+ c_~X_0~0.offset .cse1 8)) (select .cse0 (+ c_~X_0~0.offset .cse1 4)))))) (forall ((v_ArrVal_3336 (Array Int Int))) (< (let ((.cse2 (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3336) c_~X_0~0.base)) (.cse3 (* c_~i_7~0 4))) (+ c_~s_6~0 (select .cse2 (+ c_~X_0~0.offset .cse3 8)) (select .cse2 (+ c_~X_0~0.offset .cse3 4)))) (+ c_~s_2~0 1)))) is different from false [2021-11-25 20:44:12,244 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3336 (Array Int Int))) (< (let ((.cse0 (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3336) c_~X_0~0.base)) (.cse1 (* c_~i_7~0 4))) (+ c_~s_6~0 (select .cse0 (+ c_~X_0~0.offset .cse1 8)) (select .cse0 (+ c_~X_0~0.offset .cse1 4)))) (+ c_~s_2~0 c_~t_4~0 1))) (forall ((v_ArrVal_3336 (Array Int Int))) (<= (+ c_~s_2~0 c_~t_4~0) (let ((.cse2 (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3336) c_~X_0~0.base)) (.cse3 (* c_~i_7~0 4))) (+ c_~s_6~0 (select .cse2 (+ c_~X_0~0.offset .cse3 8)) (select .cse2 (+ c_~X_0~0.offset .cse3 4))))))) is different from false [2021-11-25 20:44:12,253 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3336 (Array Int Int))) (<= (+ c_~s_2~0 c_~t_4~0) (let ((.cse0 (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3336) c_~X_0~0.base))) (+ (select .cse0 (+ c_~X_0~0.offset 4)) (select .cse0 (+ c_~X_0~0.offset 8)))))) (forall ((v_ArrVal_3336 (Array Int Int))) (< (let ((.cse1 (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3336) c_~X_0~0.base))) (+ (select .cse1 (+ c_~X_0~0.offset 4)) (select .cse1 (+ c_~X_0~0.offset 8)))) (+ c_~s_2~0 c_~t_4~0 1)))) is different from false [2021-11-25 20:44:12,273 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3335 (Array Int Int)) (v_ArrVal_3336 (Array Int Int))) (<= (+ c_~s_2~0 c_~t_4~0) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3335) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3336) c_~X_0~0.base))) (+ (select .cse0 (+ c_~X_0~0.offset 8)) (select .cse0 (+ c_~X_0~0.offset 4)))))) (forall ((v_ArrVal_3335 (Array Int Int)) (v_ArrVal_3336 (Array Int Int))) (< (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3335) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3336) c_~X_0~0.base))) (+ (select .cse1 (+ c_~X_0~0.offset 8)) (select .cse1 (+ c_~X_0~0.offset 4)))) (+ c_~s_2~0 c_~t_4~0 1)))) is different from false [2021-11-25 20:44:12,306 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3335 (Array Int Int)) (v_ArrVal_3336 (Array Int Int))) (< (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3335) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3336) c_~X_0~0.base))) (+ (select .cse0 (+ c_~X_0~0.offset 8)) (select .cse0 (+ c_~X_0~0.offset 4)))) (+ c_~s_2~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)) 1))) (forall ((v_ArrVal_3335 (Array Int Int)) (v_ArrVal_3336 (Array Int Int))) (<= (+ c_~s_2~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3335) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3336) c_~X_0~0.base))) (+ (select .cse1 (+ c_~X_0~0.offset 8)) (select .cse1 (+ c_~X_0~0.offset 4))))))) is different from false [2021-11-25 20:44:12,317 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3335 (Array Int Int)) (v_ArrVal_3336 (Array Int Int))) (< (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3335) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3336) c_~X_0~0.base))) (+ (select .cse0 (+ c_~X_0~0.offset 8)) (select .cse0 (+ c_~X_0~0.offset 4)))) (+ c_~s_2~0 c_~t_4~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)) 1))) (forall ((v_ArrVal_3335 (Array Int Int)) (v_ArrVal_3336 (Array Int Int))) (<= (+ c_~s_2~0 c_~t_4~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3335) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3336) c_~X_0~0.base))) (+ (select .cse1 (+ c_~X_0~0.offset 8)) (select .cse1 (+ c_~X_0~0.offset 4))))))) is different from false [2021-11-25 20:44:12,351 INFO L354 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2021-11-25 20:44:12,351 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 174 treesize of output 132 [2021-11-25 20:44:12,356 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-25 20:44:12,357 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 90 treesize of output 74 [2021-11-25 20:44:12,363 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-25 20:44:12,363 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 40 treesize of output 32 [2021-11-25 20:44:12,503 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:44:12,503 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:44:12,520 INFO L354 Elim1Store]: treesize reduction 82, result has 9.9 percent of original size [2021-11-25 20:44:12,520 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 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 17 [2021-11-25 20:44:12,682 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 4 not checked. [2021-11-25 20:44:12,682 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080009099] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:44:12,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1508299614] [2021-11-25 20:44:12,682 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:44:12,683 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:44:12,683 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 12] total 39 [2021-11-25 20:44:12,683 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600172275] [2021-11-25 20:44:12,683 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:44:12,685 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-11-25 20:44:12,686 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:44:12,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-11-25 20:44:12,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1086, Unknown=6, NotChecked=426, Total=1640 [2021-11-25 20:44:12,687 INFO L87 Difference]: Start difference. First operand 1870 states and 6415 transitions. Second operand has 41 states, 40 states have (on average 2.45) internal successors, (98), 40 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:44:15,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:44:15,953 INFO L93 Difference]: Finished difference Result 2539 states and 8821 transitions. [2021-11-25 20:44:15,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-11-25 20:44:15,953 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.45) internal successors, (98), 40 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-11-25 20:44:15,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:44:15,958 INFO L225 Difference]: With dead ends: 2539 [2021-11-25 20:44:15,958 INFO L226 Difference]: Without dead ends: 2504 [2021-11-25 20:44:15,958 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 57 SyntacticMatches, 9 SemanticMatches, 67 ConstructedPredicates, 6 IntricatePredicates, 1 DeprecatedPredicates, 956 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=506, Invalid=3418, Unknown=6, NotChecked=762, Total=4692 [2021-11-25 20:44:15,959 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 340 mSDsluCounter, 1914 mSDsCounter, 0 mSdLazyCounter, 3726 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 4951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 3726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1134 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-11-25 20:44:15,959 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [340 Valid, 593 Invalid, 4951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 3726 Invalid, 0 Unknown, 1134 Unchecked, 1.8s Time] [2021-11-25 20:44:15,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2504 states. [2021-11-25 20:44:15,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2504 to 1810. [2021-11-25 20:44:15,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1810 states, 1809 states have (on average 3.441127694859038) internal successors, (6225), 1809 states have internal predecessors, (6225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:44:15,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1810 states to 1810 states and 6225 transitions. [2021-11-25 20:44:15,991 INFO L78 Accepts]: Start accepts. Automaton has 1810 states and 6225 transitions. Word has length 40 [2021-11-25 20:44:15,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:44:15,991 INFO L470 AbstractCegarLoop]: Abstraction has 1810 states and 6225 transitions. [2021-11-25 20:44:15,991 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.45) internal successors, (98), 40 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:44:15,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1810 states and 6225 transitions. [2021-11-25 20:44:15,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-25 20:44:15,994 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:44:15,994 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:44:16,014 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Forceful destruction successful, exit code 0 [2021-11-25 20:44:16,194 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 56 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2021-11-25 20:44:16,194 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:44:16,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:44:16,195 INFO L85 PathProgramCache]: Analyzing trace with hash -434774418, now seen corresponding path program 35 times [2021-11-25 20:44:16,195 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:44:16,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956290254] [2021-11-25 20:44:16,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:44:16,195 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:44:16,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:44:16,770 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:44:16,770 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:44:16,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956290254] [2021-11-25 20:44:16,770 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956290254] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:44:16,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553533601] [2021-11-25 20:44:16,770 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 20:44:16,771 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:44:16,771 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:44:16,774 INFO L229 MonitoredProcess]: Starting monitored process 57 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:44:16,792 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2021-11-25 20:44:17,073 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-11-25 20:44:17,073 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:44:17,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 104 conjunts are in the unsatisfiable core [2021-11-25 20:44:17,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:44:17,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:44:17,441 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2021-11-25 20:44:17,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:44:17,674 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 26 [2021-11-25 20:44:17,852 INFO L354 Elim1Store]: treesize reduction 38, result has 7.3 percent of original size [2021-11-25 20:44:17,852 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 37 treesize of output 14 [2021-11-25 20:44:17,899 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 20:44:17,899 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:44:18,088 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n_1~0 (+ c_~i_7~0 1)) (and (forall ((v_ArrVal_3398 (Array Int Int))) (<= c_~s_2~0 (let ((.cse0 (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3398) c_~X_0~0.base)) (.cse1 (* c_~i_7~0 4))) (+ c_~s_6~0 (select .cse0 (+ c_~X_0~0.offset .cse1 8)) (select .cse0 (+ c_~X_0~0.offset .cse1 4)))))) (forall ((v_ArrVal_3398 (Array Int Int))) (< (let ((.cse2 (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3398) c_~X_0~0.base)) (.cse3 (* c_~i_7~0 4))) (+ c_~s_6~0 (select .cse2 (+ c_~X_0~0.offset .cse3 8)) (select .cse2 (+ c_~X_0~0.offset .cse3 4)))) (+ c_~s_2~0 1))))) is different from false [2021-11-25 20:44:18,125 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n_1~0 (+ c_~i_7~0 1)) (< c_~i_3~0 c_~n_1~0) (and (forall ((v_ArrVal_3398 (Array Int Int))) (<= c_~s_2~0 (let ((.cse0 (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3398) c_~X_0~0.base)) (.cse1 (* c_~i_7~0 4))) (+ c_~s_6~0 (select .cse0 (+ c_~X_0~0.offset .cse1 8)) (select .cse0 (+ c_~X_0~0.offset .cse1 4)))))) (forall ((v_ArrVal_3398 (Array Int Int))) (< (let ((.cse2 (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3398) c_~X_0~0.base)) (.cse3 (* c_~i_7~0 4))) (+ c_~s_6~0 (select .cse2 (+ c_~X_0~0.offset .cse3 8)) (select .cse2 (+ c_~X_0~0.offset .cse3 4)))) (+ c_~s_2~0 1))))) is different from false [2021-11-25 20:44:18,376 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n_1~0 1) (and (forall ((v_ArrVal_3397 (Array Int Int)) (v_ArrVal_3398 (Array Int Int))) (<= (+ c_~s_2~0 c_~t_4~0) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3397) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3398) c_~X_0~0.base))) (+ (select .cse0 (+ c_~X_0~0.offset 4)) (select .cse0 (+ c_~X_0~0.offset 8)))))) (forall ((v_ArrVal_3397 (Array Int Int)) (v_ArrVal_3398 (Array Int Int))) (< (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3397) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3398) c_~X_0~0.base))) (+ (select .cse1 (+ c_~X_0~0.offset 4)) (select .cse1 (+ c_~X_0~0.offset 8)))) (+ c_~s_2~0 c_~t_4~0 1)))) (< c_~i_3~0 c_~n_1~0)) is different from false [2021-11-25 20:44:18,752 INFO L354 Elim1Store]: treesize reduction 43, result has 51.1 percent of original size [2021-11-25 20:44:18,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, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 693 treesize of output 418 [2021-11-25 20:44:18,762 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-25 20:44:18,762 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 373 treesize of output 357 [2021-11-25 20:44:18,771 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-25 20:44:18,771 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 357 treesize of output 325 [2021-11-25 20:44:18,781 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-25 20:44:18,781 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 325 treesize of output 293 [2021-11-25 20:44:18,791 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-25 20:44:18,791 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 293 treesize of output 277 [2021-11-25 20:44:19,478 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2021-11-25 20:44:19,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553533601] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:44:19,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1178341181] [2021-11-25 20:44:19,479 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:44:19,479 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:44:19,479 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 14] total 42 [2021-11-25 20:44:19,479 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430404914] [2021-11-25 20:44:19,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:44:19,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2021-11-25 20:44:19,480 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:44:19,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-11-25 20:44:19,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1482, Unknown=26, NotChecked=240, Total=1892 [2021-11-25 20:44:19,480 INFO L87 Difference]: Start difference. First operand 1810 states and 6225 transitions. Second operand has 44 states, 43 states have (on average 2.302325581395349) internal successors, (99), 43 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:44:25,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:44:25,944 INFO L93 Difference]: Finished difference Result 3196 states and 10630 transitions. [2021-11-25 20:44:25,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-11-25 20:44:25,944 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.302325581395349) internal successors, (99), 43 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-11-25 20:44:25,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:44:25,950 INFO L225 Difference]: With dead ends: 3196 [2021-11-25 20:44:25,950 INFO L226 Difference]: Without dead ends: 3127 [2021-11-25 20:44:25,950 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 64 SyntacticMatches, 19 SemanticMatches, 81 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1454 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=845, Invalid=5461, Unknown=26, NotChecked=474, Total=6806 [2021-11-25 20:44:25,950 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 548 mSDsluCounter, 2486 mSDsCounter, 0 mSdLazyCounter, 3529 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 6229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 3529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2586 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-11-25 20:44:25,950 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [548 Valid, 849 Invalid, 6229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 3529 Invalid, 0 Unknown, 2586 Unchecked, 2.0s Time] [2021-11-25 20:44:25,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3127 states. [2021-11-25 20:44:25,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3127 to 2024. [2021-11-25 20:44:25,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2024 states, 2023 states have (on average 3.4468610973801286) internal successors, (6973), 2023 states have internal predecessors, (6973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:44:25,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2024 states to 2024 states and 6973 transitions. [2021-11-25 20:44:25,993 INFO L78 Accepts]: Start accepts. Automaton has 2024 states and 6973 transitions. Word has length 40 [2021-11-25 20:44:25,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:44:25,993 INFO L470 AbstractCegarLoop]: Abstraction has 2024 states and 6973 transitions. [2021-11-25 20:44:25,993 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.302325581395349) internal successors, (99), 43 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:44:25,993 INFO L276 IsEmpty]: Start isEmpty. Operand 2024 states and 6973 transitions. [2021-11-25 20:44:25,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-25 20:44:25,996 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:44:25,996 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:44:26,016 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Ended with exit code 0 [2021-11-25 20:44:26,196 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 57 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2021-11-25 20:44:26,196 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:44:26,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:44:26,197 INFO L85 PathProgramCache]: Analyzing trace with hash -631324874, now seen corresponding path program 36 times [2021-11-25 20:44:26,197 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:44:26,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310941396] [2021-11-25 20:44:26,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:44:26,197 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:44:26,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:44:26,728 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:44:26,729 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:44:26,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310941396] [2021-11-25 20:44:26,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310941396] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:44:26,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125405159] [2021-11-25 20:44:26,729 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 20:44:26,729 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:44:26,729 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:44:26,730 INFO L229 MonitoredProcess]: Starting monitored process 58 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:44:26,731 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2021-11-25 20:44:26,957 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 20:44:26,957 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:44:26,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 90 conjunts are in the unsatisfiable core [2021-11-25 20:44:26,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:44:27,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:44:27,236 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2021-11-25 20:44:27,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:44:27,383 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2021-11-25 20:44:27,505 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-25 20:44:27,505 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 11 [2021-11-25 20:44:27,544 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 20:44:27,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:44:27,696 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3460 (Array Int Int))) (<= c_~s_2~0 (let ((.cse0 (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3460) c_~X_0~0.base)) (.cse1 (* c_~i_7~0 4))) (+ (select .cse0 (+ c_~X_0~0.offset .cse1 4)) c_~s_6~0 (select .cse0 (+ c_~X_0~0.offset .cse1 8)))))) (forall ((v_ArrVal_3460 (Array Int Int))) (< (let ((.cse2 (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3460) c_~X_0~0.base)) (.cse3 (* c_~i_7~0 4))) (+ (select .cse2 (+ c_~X_0~0.offset .cse3 4)) c_~s_6~0 (select .cse2 (+ c_~X_0~0.offset .cse3 8)))) (+ c_~s_2~0 1)))) is different from false [2021-11-25 20:44:27,711 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3460 (Array Int Int))) (< (let ((.cse0 (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3460) c_~X_0~0.base)) (.cse1 (* c_~i_7~0 4))) (+ (select .cse0 (+ c_~X_0~0.offset .cse1 4)) c_~s_6~0 (select .cse0 (+ c_~X_0~0.offset .cse1 8)))) (+ c_~s_2~0 c_~t_4~0 1))) (forall ((v_ArrVal_3460 (Array Int Int))) (<= (+ c_~s_2~0 c_~t_4~0) (let ((.cse2 (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3460) c_~X_0~0.base)) (.cse3 (* c_~i_7~0 4))) (+ (select .cse2 (+ c_~X_0~0.offset .cse3 4)) c_~s_6~0 (select .cse2 (+ c_~X_0~0.offset .cse3 8))))))) is different from false [2021-11-25 20:44:27,720 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3460 (Array Int Int))) (< (let ((.cse0 (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3460) c_~X_0~0.base))) (+ (select .cse0 (+ c_~X_0~0.offset 8)) (select .cse0 (+ c_~X_0~0.offset 4)))) (+ c_~s_2~0 c_~t_4~0 1))) (forall ((v_ArrVal_3460 (Array Int Int))) (<= (+ c_~s_2~0 c_~t_4~0) (let ((.cse1 (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3460) c_~X_0~0.base))) (+ (select .cse1 (+ c_~X_0~0.offset 8)) (select .cse1 (+ c_~X_0~0.offset 4))))))) is different from false [2021-11-25 20:44:27,740 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3460 (Array Int Int)) (v_ArrVal_3459 (Array Int Int))) (<= (+ c_~s_2~0 c_~t_4~0) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3459) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3460) c_~X_0~0.base))) (+ (select .cse0 (+ c_~X_0~0.offset 4)) (select .cse0 (+ c_~X_0~0.offset 8)))))) (forall ((v_ArrVal_3460 (Array Int Int)) (v_ArrVal_3459 (Array Int Int))) (< (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3459) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3460) c_~X_0~0.base))) (+ (select .cse1 (+ c_~X_0~0.offset 4)) (select .cse1 (+ c_~X_0~0.offset 8)))) (+ c_~s_2~0 c_~t_4~0 1)))) is different from false [2021-11-25 20:44:27,778 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3460 (Array Int Int)) (v_ArrVal_3459 (Array Int Int))) (<= (+ c_~s_2~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3459) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3460) c_~X_0~0.base))) (+ (select .cse0 (+ c_~X_0~0.offset 4)) (select .cse0 (+ c_~X_0~0.offset 8)))))) (forall ((v_ArrVal_3460 (Array Int Int)) (v_ArrVal_3459 (Array Int Int))) (< (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3459) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3460) c_~X_0~0.base))) (+ (select .cse1 (+ c_~X_0~0.offset 4)) (select .cse1 (+ c_~X_0~0.offset 8)))) (+ c_~s_2~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)) 1)))) is different from false [2021-11-25 20:44:27,789 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3460 (Array Int Int)) (v_ArrVal_3459 (Array Int Int))) (<= (+ c_~s_2~0 c_~t_4~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3459) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3460) c_~X_0~0.base))) (+ (select .cse0 (+ c_~X_0~0.offset 4)) (select .cse0 (+ c_~X_0~0.offset 8)))))) (forall ((v_ArrVal_3460 (Array Int Int)) (v_ArrVal_3459 (Array Int Int))) (< (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3459) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3460) c_~X_0~0.base))) (+ (select .cse1 (+ c_~X_0~0.offset 4)) (select .cse1 (+ c_~X_0~0.offset 8)))) (+ c_~s_2~0 c_~t_4~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)) 1)))) is different from false [2021-11-25 20:44:27,823 INFO L354 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2021-11-25 20:44:27,824 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 358 treesize of output 232 [2021-11-25 20:44:27,829 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:44:27,829 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 79 [2021-11-25 20:44:27,836 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-25 20:44:27,836 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 174 treesize of output 142 [2021-11-25 20:44:28,030 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:44:28,030 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:44:28,043 INFO L354 Elim1Store]: treesize reduction 82, result has 9.9 percent of original size [2021-11-25 20:44:28,043 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 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 17 [2021-11-25 20:44:28,191 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 4 not checked. [2021-11-25 20:44:28,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125405159] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:44:28,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [719489077] [2021-11-25 20:44:28,192 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:44:28,192 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:44:28,192 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 37 [2021-11-25 20:44:28,192 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009300391] [2021-11-25 20:44:28,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:44:28,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-11-25 20:44:28,193 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:44:28,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-11-25 20:44:28,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=967, Unknown=6, NotChecked=402, Total=1482 [2021-11-25 20:44:28,193 INFO L87 Difference]: Start difference. First operand 2024 states and 6973 transitions. Second operand has 39 states, 38 states have (on average 2.6315789473684212) internal successors, (100), 38 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:44:31,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:44:31,392 INFO L93 Difference]: Finished difference Result 3678 states and 12702 transitions. [2021-11-25 20:44:31,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-11-25 20:44:31,393 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.6315789473684212) internal successors, (100), 38 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-11-25 20:44:31,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:44:31,399 INFO L225 Difference]: With dead ends: 3678 [2021-11-25 20:44:31,399 INFO L226 Difference]: Without dead ends: 3659 [2021-11-25 20:44:31,400 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 58 SyntacticMatches, 9 SemanticMatches, 59 ConstructedPredicates, 6 IntricatePredicates, 2 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=328, Invalid=2660, Unknown=6, NotChecked=666, Total=3660 [2021-11-25 20:44:31,400 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 418 mSDsluCounter, 2057 mSDsCounter, 0 mSdLazyCounter, 3650 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 5031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 3650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1298 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-11-25 20:44:31,400 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [418 Valid, 644 Invalid, 5031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 3650 Invalid, 0 Unknown, 1298 Unchecked, 1.8s Time] [2021-11-25 20:44:31,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3659 states. [2021-11-25 20:44:31,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3659 to 2092. [2021-11-25 20:44:31,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2092 states, 2091 states have (on average 3.4457197513151603) internal successors, (7205), 2091 states have internal predecessors, (7205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:44:31,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2092 states to 2092 states and 7205 transitions. [2021-11-25 20:44:31,476 INFO L78 Accepts]: Start accepts. Automaton has 2092 states and 7205 transitions. Word has length 40 [2021-11-25 20:44:31,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:44:31,476 INFO L470 AbstractCegarLoop]: Abstraction has 2092 states and 7205 transitions. [2021-11-25 20:44:31,476 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.6315789473684212) internal successors, (100), 38 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:44:31,477 INFO L276 IsEmpty]: Start isEmpty. Operand 2092 states and 7205 transitions. [2021-11-25 20:44:31,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-25 20:44:31,479 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:44:31,479 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:44:31,499 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Forceful destruction successful, exit code 0 [2021-11-25 20:44:31,680 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,58 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:44:31,680 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:44:31,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:44:31,681 INFO L85 PathProgramCache]: Analyzing trace with hash -924727881, now seen corresponding path program 2 times [2021-11-25 20:44:31,682 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:44:31,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191377321] [2021-11-25 20:44:31,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:44:31,682 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:44:31,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:44:32,286 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:44:32,286 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:44:32,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191377321] [2021-11-25 20:44:32,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191377321] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:44:32,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621040416] [2021-11-25 20:44:32,287 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 20:44:32,287 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:44:32,287 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:44:32,290 INFO L229 MonitoredProcess]: Starting monitored process 59 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:44:32,306 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2021-11-25 20:44:32,599 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-11-25 20:44:32,599 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:44:32,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 106 conjunts are in the unsatisfiable core [2021-11-25 20:44:32,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:44:32,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:44:32,939 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2021-11-25 20:44:33,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:44:33,087 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2021-11-25 20:44:33,227 INFO L354 Elim1Store]: treesize reduction 20, result has 51.2 percent of original size [2021-11-25 20:44:33,227 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 37 treesize of output 31 [2021-11-25 20:44:33,358 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 20:44:33,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:44:34,966 INFO L354 Elim1Store]: treesize reduction 46, result has 52.6 percent of original size [2021-11-25 20:44:34,966 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 549 treesize of output 342 [2021-11-25 20:44:34,975 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-11-25 20:44:34,975 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 291 treesize of output 271 [2021-11-25 20:44:34,984 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-11-25 20:44:34,985 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 271 treesize of output 231 [2021-11-25 20:44:34,993 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-11-25 20:44:34,994 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 231 treesize of output 211 [2021-11-25 20:44:35,006 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-11-25 20:44:35,007 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 211 treesize of output 201 [2021-11-25 20:44:35,775 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:44:35,775 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621040416] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:44:35,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2130738646] [2021-11-25 20:44:35,776 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:44:35,777 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:44:35,777 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 14] total 42 [2021-11-25 20:44:35,777 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591355223] [2021-11-25 20:44:35,778 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:44:35,778 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2021-11-25 20:44:35,778 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:44:35,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-11-25 20:44:35,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1726, Unknown=19, NotChecked=0, Total=1892 [2021-11-25 20:44:35,779 INFO L87 Difference]: Start difference. First operand 2092 states and 7205 transitions. Second operand has 44 states, 43 states have (on average 2.441860465116279) internal successors, (105), 43 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:44:40,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:44:40,037 INFO L93 Difference]: Finished difference Result 3203 states and 11161 transitions. [2021-11-25 20:44:40,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-11-25 20:44:40,038 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.441860465116279) internal successors, (105), 43 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-11-25 20:44:40,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:44:40,043 INFO L225 Difference]: With dead ends: 3203 [2021-11-25 20:44:40,043 INFO L226 Difference]: Without dead ends: 3166 [2021-11-25 20:44:40,044 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 701 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=568, Invalid=4362, Unknown=40, NotChecked=0, Total=4970 [2021-11-25 20:44:40,044 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 639 mSDsluCounter, 2245 mSDsCounter, 0 mSdLazyCounter, 2660 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 5291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 2660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2503 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-11-25 20:44:40,044 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [639 Valid, 734 Invalid, 5291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 2660 Invalid, 0 Unknown, 2503 Unchecked, 1.4s Time] [2021-11-25 20:44:40,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3166 states. [2021-11-25 20:44:40,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3166 to 2019. [2021-11-25 20:44:40,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2019 states, 2018 states have (on average 3.4400396432111) internal successors, (6942), 2018 states have internal predecessors, (6942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:44:40,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2019 states to 2019 states and 6942 transitions. [2021-11-25 20:44:40,085 INFO L78 Accepts]: Start accepts. Automaton has 2019 states and 6942 transitions. Word has length 40 [2021-11-25 20:44:40,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:44:40,086 INFO L470 AbstractCegarLoop]: Abstraction has 2019 states and 6942 transitions. [2021-11-25 20:44:40,086 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.441860465116279) internal successors, (105), 43 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:44:40,086 INFO L276 IsEmpty]: Start isEmpty. Operand 2019 states and 6942 transitions. [2021-11-25 20:44:40,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-25 20:44:40,090 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:44:40,090 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:44:40,123 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Forceful destruction successful, exit code 0 [2021-11-25 20:44:40,306 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,59 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:44:40,306 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:44:40,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:44:40,306 INFO L85 PathProgramCache]: Analyzing trace with hash -29681958, now seen corresponding path program 37 times [2021-11-25 20:44:40,306 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:44:40,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189836026] [2021-11-25 20:44:40,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:44:40,307 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:44:40,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:44:40,857 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:44:40,857 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:44:40,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189836026] [2021-11-25 20:44:40,857 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189836026] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:44:40,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588426111] [2021-11-25 20:44:40,857 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 20:44:40,857 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:44:40,858 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:44:40,859 INFO L229 MonitoredProcess]: Starting monitored process 60 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:44:40,879 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2021-11-25 20:44:41,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:44:41,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 88 conjunts are in the unsatisfiable core [2021-11-25 20:44:41,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:44:41,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:44:41,474 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2021-11-25 20:44:41,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:44:41,667 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2021-11-25 20:44:41,727 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-25 20:44:41,727 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 11 [2021-11-25 20:44:41,780 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 20:44:41,781 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:44:41,886 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3584 (Array Int Int))) (<= c_~s_2~0 (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3584) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_7~0 4) 4))))) (forall ((v_ArrVal_3584 (Array Int Int))) (< (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3584) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_7~0 4) 4))) (+ c_~s_2~0 1)))) is different from false [2021-11-25 20:44:41,900 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3584 (Array Int Int))) (< (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3584) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_7~0 4) 4))) (+ c_~s_2~0 c_~t_4~0 1))) (forall ((v_ArrVal_3584 (Array Int Int))) (<= (+ c_~s_2~0 c_~t_4~0) (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3584) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_7~0 4) 4)))))) is different from false [2021-11-25 20:44:41,917 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3584 (Array Int Int))) (< (let ((.cse0 (* c_~i_7~0 4))) (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3584) c_~X_0~0.base) (+ c_~X_0~0.offset .cse0 8)) (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset .cse0 4)))) (+ c_~s_2~0 c_~t_4~0 1))) (forall ((v_ArrVal_3584 (Array Int Int))) (<= (+ c_~s_2~0 c_~t_4~0) (let ((.cse1 (* c_~i_7~0 4))) (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3584) c_~X_0~0.base) (+ c_~X_0~0.offset .cse1 8)) (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset .cse1 4))))))) is different from false [2021-11-25 20:44:41,926 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3584 (Array Int Int))) (<= (+ c_~s_2~0 c_~t_4~0) (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3584) c_~X_0~0.base) (+ c_~X_0~0.offset 8)) (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset 4))))) (forall ((v_ArrVal_3584 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3584) c_~X_0~0.base) (+ c_~X_0~0.offset 8)) (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset 4))) (+ c_~s_2~0 c_~t_4~0 1)))) is different from false [2021-11-25 20:44:41,962 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3583 (Array Int Int)) (v_ArrVal_3584 (Array Int Int))) (<= (+ c_~s_2~0 c_~t_4~0) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3583))) (+ (select (select (store .cse0 |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3584) c_~X_0~0.base) (+ c_~X_0~0.offset 8)) (select (select .cse0 c_~X_0~0.base) (+ c_~X_0~0.offset 4)))))) (forall ((v_ArrVal_3583 (Array Int Int)) (v_ArrVal_3584 (Array Int Int))) (< (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3583))) (+ (select (select (store .cse1 |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3584) c_~X_0~0.base) (+ c_~X_0~0.offset 8)) (select (select .cse1 c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) (+ c_~s_2~0 c_~t_4~0 1)))) is different from false [2021-11-25 20:44:42,005 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3583 (Array Int Int)) (v_ArrVal_3584 (Array Int Int))) (< (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3583))) (+ (select (select (store .cse0 |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3584) c_~X_0~0.base) (+ c_~X_0~0.offset 8)) (select (select .cse0 c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) (+ c_~s_2~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)) 1))) (forall ((v_ArrVal_3583 (Array Int Int)) (v_ArrVal_3584 (Array Int Int))) (<= (+ c_~s_2~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3583))) (+ (select (select (store .cse1 |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3584) c_~X_0~0.base) (+ c_~X_0~0.offset 8)) (select (select .cse1 c_~X_0~0.base) (+ c_~X_0~0.offset 4))))))) is different from false [2021-11-25 20:44:42,016 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3583 (Array Int Int)) (v_ArrVal_3584 (Array Int Int))) (<= (+ c_~s_2~0 c_~t_4~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3583))) (+ (select (select (store .cse0 |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3584) c_~X_0~0.base) (+ c_~X_0~0.offset 8)) (select (select .cse0 c_~X_0~0.base) (+ c_~X_0~0.offset 4)))))) (forall ((v_ArrVal_3583 (Array Int Int)) (v_ArrVal_3584 (Array Int Int))) (< (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3583))) (+ (select (select (store .cse1 |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3584) c_~X_0~0.base) (+ c_~X_0~0.offset 8)) (select (select .cse1 c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) (+ c_~s_2~0 c_~t_4~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)) 1)))) is different from false [2021-11-25 20:44:42,052 INFO L354 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2021-11-25 20:44:42,052 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 734 treesize of output 416 [2021-11-25 20:44:42,060 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-25 20:44:42,060 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 374 treesize of output 326 [2021-11-25 20:44:42,065 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 326 treesize of output 294 [2021-11-25 20:44:42,321 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:44:42,322 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:44:42,335 INFO L354 Elim1Store]: treesize reduction 82, result has 9.9 percent of original size [2021-11-25 20:44:42,336 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 17 [2021-11-25 20:44:42,484 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 6 not checked. [2021-11-25 20:44:42,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588426111] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:44:42,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [498120775] [2021-11-25 20:44:42,485 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:44:42,485 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:44:42,485 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 12] total 38 [2021-11-25 20:44:42,485 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117645624] [2021-11-25 20:44:42,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:44:42,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-11-25 20:44:42,486 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:44:42,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-11-25 20:44:42,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=972, Unknown=7, NotChecked=476, Total=1560 [2021-11-25 20:44:42,487 INFO L87 Difference]: Start difference. First operand 2019 states and 6942 transitions. Second operand has 40 states, 39 states have (on average 2.358974358974359) internal successors, (92), 39 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:44:45,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:44:45,644 INFO L93 Difference]: Finished difference Result 3945 states and 13849 transitions. [2021-11-25 20:44:45,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-11-25 20:44:45,644 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.358974358974359) internal successors, (92), 39 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-11-25 20:44:45,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:44:45,651 INFO L225 Difference]: With dead ends: 3945 [2021-11-25 20:44:45,651 INFO L226 Difference]: Without dead ends: 3904 [2021-11-25 20:44:45,652 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 58 SyntacticMatches, 7 SemanticMatches, 69 ConstructedPredicates, 7 IntricatePredicates, 4 DeprecatedPredicates, 752 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=443, Invalid=3610, Unknown=7, NotChecked=910, Total=4970 [2021-11-25 20:44:45,652 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 444 mSDsluCounter, 1546 mSDsCounter, 0 mSdLazyCounter, 2735 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 4325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 2735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1485 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-11-25 20:44:45,652 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [444 Valid, 485 Invalid, 4325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 2735 Invalid, 0 Unknown, 1485 Unchecked, 1.4s Time] [2021-11-25 20:44:45,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3904 states. [2021-11-25 20:44:45,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3904 to 2119. [2021-11-25 20:44:45,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2119 states, 2118 states have (on average 3.4598677998111427) internal successors, (7328), 2118 states have internal predecessors, (7328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:44:45,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2119 states to 2119 states and 7328 transitions. [2021-11-25 20:44:45,695 INFO L78 Accepts]: Start accepts. Automaton has 2119 states and 7328 transitions. Word has length 40 [2021-11-25 20:44:45,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:44:45,695 INFO L470 AbstractCegarLoop]: Abstraction has 2119 states and 7328 transitions. [2021-11-25 20:44:45,695 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.358974358974359) internal successors, (92), 39 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:44:45,695 INFO L276 IsEmpty]: Start isEmpty. Operand 2119 states and 7328 transitions. [2021-11-25 20:44:45,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-25 20:44:45,698 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:44:45,698 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:44:45,718 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Forceful destruction successful, exit code 0 [2021-11-25 20:44:45,902 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,60 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:44:45,902 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:44:45,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:44:45,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1459648948, now seen corresponding path program 38 times [2021-11-25 20:44:45,902 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:44:45,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535069669] [2021-11-25 20:44:45,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:44:45,903 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:44:45,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:44:46,455 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:44:46,455 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:44:46,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535069669] [2021-11-25 20:44:46,456 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535069669] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:44:46,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715225101] [2021-11-25 20:44:46,456 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 20:44:46,456 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:44:46,456 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:44:46,457 INFO L229 MonitoredProcess]: Starting monitored process 61 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:44:46,473 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2021-11-25 20:44:46,740 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-11-25 20:44:46,740 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:44:46,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 108 conjunts are in the unsatisfiable core [2021-11-25 20:44:46,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:44:46,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:44:46,763 INFO L354 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2021-11-25 20:44:46,764 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 23 [2021-11-25 20:44:46,948 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-25 20:44:46,948 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 15 treesize of output 15 [2021-11-25 20:44:47,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:44:47,227 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2021-11-25 20:44:47,482 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2021-11-25 20:44:47,590 INFO L354 Elim1Store]: treesize reduction 81, result has 8.0 percent of original size [2021-11-25 20:44:47,590 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 40 treesize of output 17 [2021-11-25 20:44:47,640 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:44:47,640 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:44:47,777 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_3650 (Array Int Int))) (< (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3650) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_7~0 4) 4))) (+ c_~s_2~0 1))) (forall ((v_ArrVal_3650 (Array Int Int))) (<= c_~s_2~0 (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3650) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_7~0 4) 4)))))) (<= c_~n_1~0 c_~i_7~0)) is different from false [2021-11-25 20:44:47,796 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_3650 (Array Int Int))) (<= (+ c_~s_2~0 c_~t_4~0) (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3650) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_7~0 4) 4))))) (forall ((v_ArrVal_3650 (Array Int Int))) (< (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3650) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_7~0 4) 4))) (+ c_~s_2~0 c_~t_4~0 1)))) (<= c_~n_1~0 c_~i_7~0)) is different from false [2021-11-25 20:44:48,874 INFO L354 Elim1Store]: treesize reduction 51, result has 51.9 percent of original size [2021-11-25 20:44:48,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 1201 treesize of output 674 [2021-11-25 20:44:48,881 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 619 treesize of output 591 [2021-11-25 20:44:48,889 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 591 treesize of output 535 [2021-11-25 20:44:48,900 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2021-11-25 20:44:48,900 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 535 treesize of output 497 [2021-11-25 20:44:48,911 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2021-11-25 20:44:48,911 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 497 treesize of output 421 [2021-11-25 20:44:50,161 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2021-11-25 20:44:50,162 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715225101] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:44:50,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2107306922] [2021-11-25 20:44:50,162 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:44:50,162 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:44:50,162 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 44 [2021-11-25 20:44:50,162 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029672409] [2021-11-25 20:44:50,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:44:50,163 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2021-11-25 20:44:50,163 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:44:50,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-11-25 20:44:50,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1743, Unknown=25, NotChecked=170, Total=2070 [2021-11-25 20:44:50,164 INFO L87 Difference]: Start difference. First operand 2119 states and 7328 transitions. Second operand has 46 states, 45 states have (on average 2.1777777777777776) internal successors, (98), 45 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:44:57,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:44:57,140 INFO L93 Difference]: Finished difference Result 4740 states and 16450 transitions. [2021-11-25 20:44:57,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2021-11-25 20:44:57,141 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.1777777777777776) internal successors, (98), 45 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-11-25 20:44:57,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:44:57,149 INFO L225 Difference]: With dead ends: 4740 [2021-11-25 20:44:57,149 INFO L226 Difference]: Without dead ends: 4705 [2021-11-25 20:44:57,150 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 53 SyntacticMatches, 6 SemanticMatches, 97 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1847 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=745, Invalid=8544, Unknown=31, NotChecked=382, Total=9702 [2021-11-25 20:44:57,150 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 627 mSDsluCounter, 3726 mSDsCounter, 0 mSdLazyCounter, 4066 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 1067 SdHoareTripleChecker+Invalid, 8935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 4066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4701 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-11-25 20:44:57,150 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [627 Valid, 1067 Invalid, 8935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 4066 Invalid, 0 Unknown, 4701 Unchecked, 2.2s Time] [2021-11-25 20:44:57,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4705 states. [2021-11-25 20:44:57,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4705 to 2904. [2021-11-25 20:44:57,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2904 states, 2903 states have (on average 3.4612469858766794) internal successors, (10048), 2903 states have internal predecessors, (10048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:44:57,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2904 states to 2904 states and 10048 transitions. [2021-11-25 20:44:57,209 INFO L78 Accepts]: Start accepts. Automaton has 2904 states and 10048 transitions. Word has length 40 [2021-11-25 20:44:57,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:44:57,209 INFO L470 AbstractCegarLoop]: Abstraction has 2904 states and 10048 transitions. [2021-11-25 20:44:57,209 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.1777777777777776) internal successors, (98), 45 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:44:57,209 INFO L276 IsEmpty]: Start isEmpty. Operand 2904 states and 10048 transitions. [2021-11-25 20:44:57,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-25 20:44:57,213 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:44:57,213 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:44:57,233 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Ended with exit code 0 [2021-11-25 20:44:57,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63,61 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:44:57,414 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:44:57,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:44:57,414 INFO L85 PathProgramCache]: Analyzing trace with hash -792403128, now seen corresponding path program 39 times [2021-11-25 20:44:57,414 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:44:57,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957249129] [2021-11-25 20:44:57,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:44:57,415 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:44:57,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:44:57,973 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:44:57,974 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:44:57,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957249129] [2021-11-25 20:44:57,974 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957249129] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:44:57,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678112304] [2021-11-25 20:44:57,974 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 20:44:57,974 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:44:57,974 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:44:57,975 INFO L229 MonitoredProcess]: Starting monitored process 62 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:44:57,986 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2021-11-25 20:44:58,270 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 20:44:58,271 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:44:58,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 94 conjunts are in the unsatisfiable core [2021-11-25 20:44:58,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:44:58,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:44:58,660 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2021-11-25 20:44:58,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:44:58,884 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2021-11-25 20:44:58,955 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-25 20:44:58,955 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 11 [2021-11-25 20:44:59,001 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 20:44:59,002 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:44:59,112 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3712 (Array Int Int))) (<= c_~s_2~0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3712) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_7~0 4) 4)) c_~s_6~0))) (forall ((v_ArrVal_3712 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3712) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_7~0 4) 4)) c_~s_6~0) (+ c_~s_2~0 1)))) is different from false [2021-11-25 20:44:59,121 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3712 (Array Int Int))) (< (let ((.cse0 (* c_~i_7~0 4))) (+ c_~s_6~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset .cse0 4)) (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3712) c_~X_0~0.base) (+ c_~X_0~0.offset .cse0 8)))) (+ c_~s_2~0 1))) (forall ((v_ArrVal_3712 (Array Int Int))) (<= c_~s_2~0 (let ((.cse1 (* c_~i_7~0 4))) (+ c_~s_6~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset .cse1 4)) (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3712) c_~X_0~0.base) (+ c_~X_0~0.offset .cse1 8))))))) is different from false [2021-11-25 20:44:59,142 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3712 (Array Int Int))) (< (let ((.cse0 (* c_~i_7~0 4))) (+ c_~s_6~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset .cse0 4)) (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3712) c_~X_0~0.base) (+ c_~X_0~0.offset .cse0 8)))) (+ c_~s_2~0 c_~t_4~0 1))) (forall ((v_ArrVal_3712 (Array Int Int))) (<= (+ c_~s_2~0 c_~t_4~0) (let ((.cse1 (* c_~i_7~0 4))) (+ c_~s_6~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset .cse1 4)) (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3712) c_~X_0~0.base) (+ c_~X_0~0.offset .cse1 8))))))) is different from false [2021-11-25 20:44:59,150 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3712 (Array Int Int))) (< (+ (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3712) c_~X_0~0.base) (+ c_~X_0~0.offset 8))) (+ c_~s_2~0 c_~t_4~0 1))) (forall ((v_ArrVal_3712 (Array Int Int))) (<= (+ c_~s_2~0 c_~t_4~0) (+ (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3712) c_~X_0~0.base) (+ c_~X_0~0.offset 8)))))) is different from false [2021-11-25 20:44:59,165 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3711 (Array Int Int)) (v_ArrVal_3712 (Array Int Int))) (<= (+ c_~s_2~0 c_~t_4~0) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3711))) (+ (select (select (store .cse0 |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3712) c_~X_0~0.base) (+ c_~X_0~0.offset 8)) (select (select .cse0 c_~X_0~0.base) (+ c_~X_0~0.offset 4)))))) (forall ((v_ArrVal_3711 (Array Int Int)) (v_ArrVal_3712 (Array Int Int))) (< (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3711))) (+ (select (select (store .cse1 |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3712) c_~X_0~0.base) (+ c_~X_0~0.offset 8)) (select (select .cse1 c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) (+ c_~s_2~0 c_~t_4~0 1)))) is different from false [2021-11-25 20:44:59,198 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3711 (Array Int Int)) (v_ArrVal_3712 (Array Int Int))) (<= (+ c_~s_2~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3711))) (+ (select (select (store .cse0 |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3712) c_~X_0~0.base) (+ c_~X_0~0.offset 8)) (select (select .cse0 c_~X_0~0.base) (+ c_~X_0~0.offset 4)))))) (forall ((v_ArrVal_3711 (Array Int Int)) (v_ArrVal_3712 (Array Int Int))) (< (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3711))) (+ (select (select (store .cse1 |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3712) c_~X_0~0.base) (+ c_~X_0~0.offset 8)) (select (select .cse1 c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) (+ c_~s_2~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)) 1)))) is different from false [2021-11-25 20:44:59,208 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3711 (Array Int Int)) (v_ArrVal_3712 (Array Int Int))) (< (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3711))) (+ (select (select (store .cse0 |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3712) c_~X_0~0.base) (+ c_~X_0~0.offset 8)) (select (select .cse0 c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) (+ c_~s_2~0 c_~t_4~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)) 1))) (forall ((v_ArrVal_3711 (Array Int Int)) (v_ArrVal_3712 (Array Int Int))) (<= (+ c_~s_2~0 c_~t_4~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3711))) (+ (select (select (store .cse1 |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3712) c_~X_0~0.base) (+ c_~X_0~0.offset 8)) (select (select .cse1 c_~X_0~0.base) (+ c_~X_0~0.offset 4))))))) is different from false [2021-11-25 20:44:59,244 INFO L354 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2021-11-25 20:44:59,244 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 354 treesize of output 216 [2021-11-25 20:44:59,250 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-25 20:44:59,251 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 174 treesize of output 150 [2021-11-25 20:44:59,254 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 150 treesize of output 134 [2021-11-25 20:44:59,491 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:44:59,492 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:44:59,505 INFO L354 Elim1Store]: treesize reduction 82, result has 9.9 percent of original size [2021-11-25 20:44:59,505 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 39 treesize of output 18 [2021-11-25 20:44:59,659 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 6 not checked. [2021-11-25 20:44:59,659 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678112304] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:44:59,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [162581071] [2021-11-25 20:44:59,660 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:44:59,660 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:44:59,660 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 12] total 40 [2021-11-25 20:44:59,660 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375275512] [2021-11-25 20:44:59,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:44:59,661 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2021-11-25 20:44:59,661 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:44:59,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-11-25 20:44:59,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1097, Unknown=7, NotChecked=504, Total=1722 [2021-11-25 20:44:59,662 INFO L87 Difference]: Start difference. First operand 2904 states and 10048 transitions. Second operand has 42 states, 41 states have (on average 2.3902439024390243) internal successors, (98), 41 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:45:03,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:45:03,105 INFO L93 Difference]: Finished difference Result 5607 states and 19696 transitions. [2021-11-25 20:45:03,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-11-25 20:45:03,106 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.3902439024390243) internal successors, (98), 41 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-11-25 20:45:03,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:45:03,116 INFO L225 Difference]: With dead ends: 5607 [2021-11-25 20:45:03,116 INFO L226 Difference]: Without dead ends: 5595 [2021-11-25 20:45:03,117 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 57 SyntacticMatches, 5 SemanticMatches, 72 ConstructedPredicates, 7 IntricatePredicates, 5 DeprecatedPredicates, 867 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=399, Invalid=4044, Unknown=7, NotChecked=952, Total=5402 [2021-11-25 20:45:03,117 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 434 mSDsluCounter, 1966 mSDsCounter, 0 mSdLazyCounter, 3570 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 5096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 3570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1444 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-11-25 20:45:03,117 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [434 Valid, 668 Invalid, 5096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 3570 Invalid, 0 Unknown, 1444 Unchecked, 1.7s Time] [2021-11-25 20:45:03,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5595 states. [2021-11-25 20:45:03,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5595 to 2968. [2021-11-25 20:45:03,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2968 states, 2967 states have (on average 3.4647792382878326) internal successors, (10280), 2967 states have internal predecessors, (10280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:45:03,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2968 states to 2968 states and 10280 transitions. [2021-11-25 20:45:03,185 INFO L78 Accepts]: Start accepts. Automaton has 2968 states and 10280 transitions. Word has length 40 [2021-11-25 20:45:03,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:45:03,186 INFO L470 AbstractCegarLoop]: Abstraction has 2968 states and 10280 transitions. [2021-11-25 20:45:03,186 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.3902439024390243) internal successors, (98), 41 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:45:03,186 INFO L276 IsEmpty]: Start isEmpty. Operand 2968 states and 10280 transitions. [2021-11-25 20:45:03,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-25 20:45:03,190 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:45:03,190 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:45:03,209 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Ended with exit code 0 [2021-11-25 20:45:03,394 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 62 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable64 [2021-11-25 20:45:03,394 INFO L402 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:45:03,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:45:03,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1822361912, now seen corresponding path program 40 times [2021-11-25 20:45:03,394 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:45:03,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888487002] [2021-11-25 20:45:03,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:45:03,395 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:45:03,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:45:03,964 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:45:03,964 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:45:03,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888487002] [2021-11-25 20:45:03,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888487002] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:45:03,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709576286] [2021-11-25 20:45:03,964 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 20:45:03,964 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:45:03,965 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:45:03,970 INFO L229 MonitoredProcess]: Starting monitored process 63 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:45:03,986 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2021-11-25 20:45:04,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:45:04,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 88 conjunts are in the unsatisfiable core [2021-11-25 20:45:04,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:45:04,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:45:04,510 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2021-11-25 20:45:04,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:45:04,744 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2021-11-25 20:45:04,801 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-25 20:45:04,801 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 11 [2021-11-25 20:45:04,853 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 20:45:04,853 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:45:04,975 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3774 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3774) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_7~0 4) 4)) c_~s_6~0) (+ c_~s_2~0 1))) (forall ((v_ArrVal_3774 (Array Int Int))) (<= c_~s_2~0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3774) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_7~0 4) 4)) c_~s_6~0)))) is different from false [2021-11-25 20:45:04,994 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3774 (Array Int Int))) (< (let ((.cse0 (* c_~i_7~0 4))) (+ c_~s_6~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset .cse0 4)) (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3774) c_~X_0~0.base) (+ c_~X_0~0.offset .cse0 8)))) (+ c_~s_2~0 1))) (forall ((v_ArrVal_3774 (Array Int Int))) (<= c_~s_2~0 (let ((.cse1 (* c_~i_7~0 4))) (+ c_~s_6~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset .cse1 4)) (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3774) c_~X_0~0.base) (+ c_~X_0~0.offset .cse1 8))))))) is different from false [2021-11-25 20:45:05,008 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3774 (Array Int Int))) (< (let ((.cse0 (* c_~i_7~0 4))) (+ c_~s_6~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset .cse0 4)) (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3774) c_~X_0~0.base) (+ c_~X_0~0.offset .cse0 8)))) (+ c_~s_2~0 c_~t_4~0 1))) (forall ((v_ArrVal_3774 (Array Int Int))) (<= (+ c_~s_2~0 c_~t_4~0) (let ((.cse1 (* c_~i_7~0 4))) (+ c_~s_6~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset .cse1 4)) (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3774) c_~X_0~0.base) (+ c_~X_0~0.offset .cse1 8))))))) is different from false [2021-11-25 20:45:05,017 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3774 (Array Int Int))) (< (+ (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3774) c_~X_0~0.base) (+ c_~X_0~0.offset 8))) (+ c_~s_2~0 c_~t_4~0 1))) (forall ((v_ArrVal_3774 (Array Int Int))) (<= (+ c_~s_2~0 c_~t_4~0) (+ (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3774) c_~X_0~0.base) (+ c_~X_0~0.offset 8)))))) is different from false [2021-11-25 20:45:05,031 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3773 (Array Int Int)) (v_ArrVal_3774 (Array Int Int))) (<= (+ c_~s_2~0 c_~t_4~0) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3773))) (+ (select (select .cse0 c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (select (select (store .cse0 |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3774) c_~X_0~0.base) (+ c_~X_0~0.offset 8)))))) (forall ((v_ArrVal_3773 (Array Int Int)) (v_ArrVal_3774 (Array Int Int))) (< (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3773))) (+ (select (select .cse1 c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (select (select (store .cse1 |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3774) c_~X_0~0.base) (+ c_~X_0~0.offset 8)))) (+ c_~s_2~0 c_~t_4~0 1)))) is different from false [2021-11-25 20:45:05,064 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3773 (Array Int Int)) (v_ArrVal_3774 (Array Int Int))) (<= (+ c_~s_2~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3773))) (+ (select (select .cse0 c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (select (select (store .cse0 |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3774) c_~X_0~0.base) (+ c_~X_0~0.offset 8)))))) (forall ((v_ArrVal_3773 (Array Int Int)) (v_ArrVal_3774 (Array Int Int))) (< (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3773))) (+ (select (select .cse1 c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (select (select (store .cse1 |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3774) c_~X_0~0.base) (+ c_~X_0~0.offset 8)))) (+ c_~s_2~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)) 1)))) is different from false [2021-11-25 20:45:05,075 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3773 (Array Int Int)) (v_ArrVal_3774 (Array Int Int))) (<= (+ c_~s_2~0 c_~t_4~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3773))) (+ (select (select .cse0 c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (select (select (store .cse0 |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3774) c_~X_0~0.base) (+ c_~X_0~0.offset 8)))))) (forall ((v_ArrVal_3773 (Array Int Int)) (v_ArrVal_3774 (Array Int Int))) (< (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3773))) (+ (select (select .cse1 c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (select (select (store .cse1 |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3774) c_~X_0~0.base) (+ c_~X_0~0.offset 8)))) (+ c_~s_2~0 c_~t_4~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)) 1)))) is different from false [2021-11-25 20:45:05,110 INFO L354 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2021-11-25 20:45:05,110 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 718 treesize of output 400 [2021-11-25 20:45:05,117 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-25 20:45:05,118 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 358 treesize of output 310 [2021-11-25 20:45:05,122 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 310 treesize of output 278 [2021-11-25 20:45:05,401 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:45:05,401 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:45:05,414 INFO L354 Elim1Store]: treesize reduction 82, result has 9.9 percent of original size [2021-11-25 20:45:05,415 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 39 treesize of output 18 [2021-11-25 20:45:05,564 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 6 not checked. [2021-11-25 20:45:05,565 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709576286] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:45:05,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [890859022] [2021-11-25 20:45:05,565 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:45:05,565 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:45:05,565 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 37 [2021-11-25 20:45:05,565 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328839456] [2021-11-25 20:45:05,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:45:05,566 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-11-25 20:45:05,566 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:45:05,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-11-25 20:45:05,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=916, Unknown=7, NotChecked=462, Total=1482 [2021-11-25 20:45:05,566 INFO L87 Difference]: Start difference. First operand 2968 states and 10280 transitions. Second operand has 39 states, 38 states have (on average 2.4210526315789473) internal successors, (92), 38 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:45:08,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:45:08,500 INFO L93 Difference]: Finished difference Result 4683 states and 16321 transitions. [2021-11-25 20:45:08,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-11-25 20:45:08,500 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.4210526315789473) internal successors, (92), 38 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-11-25 20:45:08,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:45:08,509 INFO L225 Difference]: With dead ends: 4683 [2021-11-25 20:45:08,509 INFO L226 Difference]: Without dead ends: 4652 [2021-11-25 20:45:08,509 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 59 SyntacticMatches, 9 SemanticMatches, 62 ConstructedPredicates, 7 IntricatePredicates, 2 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=347, Invalid=2866, Unknown=7, NotChecked=812, Total=4032 [2021-11-25 20:45:08,510 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 543 mSDsluCounter, 1652 mSDsCounter, 0 mSdLazyCounter, 2930 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 4774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 2930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1723 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-11-25 20:45:08,510 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [543 Valid, 530 Invalid, 4774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 2930 Invalid, 0 Unknown, 1723 Unchecked, 1.5s Time] [2021-11-25 20:45:08,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4652 states. [2021-11-25 20:45:08,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4652 to 2988. [2021-11-25 20:45:08,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2988 states, 2987 states have (on average 3.467358553732842) internal successors, (10357), 2987 states have internal predecessors, (10357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:45:08,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2988 states to 2988 states and 10357 transitions. [2021-11-25 20:45:08,570 INFO L78 Accepts]: Start accepts. Automaton has 2988 states and 10357 transitions. Word has length 40 [2021-11-25 20:45:08,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:45:08,571 INFO L470 AbstractCegarLoop]: Abstraction has 2988 states and 10357 transitions. [2021-11-25 20:45:08,571 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.4210526315789473) internal successors, (92), 38 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:45:08,571 INFO L276 IsEmpty]: Start isEmpty. Operand 2988 states and 10357 transitions. [2021-11-25 20:45:08,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-25 20:45:08,575 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:45:08,576 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:45:08,596 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Ended with exit code 0 [2021-11-25 20:45:08,776 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65,63 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:45:08,776 INFO L402 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:45:08,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:45:08,777 INFO L85 PathProgramCache]: Analyzing trace with hash -333031006, now seen corresponding path program 41 times [2021-11-25 20:45:08,777 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:45:08,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610123397] [2021-11-25 20:45:08,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:45:08,777 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:45:08,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:45:09,346 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:45:09,346 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:45:09,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610123397] [2021-11-25 20:45:09,346 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610123397] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:45:09,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262979214] [2021-11-25 20:45:09,347 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 20:45:09,347 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:45:09,347 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:45:09,348 INFO L229 MonitoredProcess]: Starting monitored process 64 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:45:09,368 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2021-11-25 20:45:09,643 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-11-25 20:45:09,643 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:45:09,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 94 conjunts are in the unsatisfiable core [2021-11-25 20:45:09,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:45:09,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:45:09,973 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2021-11-25 20:45:10,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:45:10,183 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2021-11-25 20:45:10,251 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-25 20:45:10,252 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 11 [2021-11-25 20:45:10,302 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 20:45:10,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:45:10,415 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3836 (Array Int Int))) (<= c_~s_2~0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3836) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_7~0 4) 4)) c_~s_6~0))) (forall ((v_ArrVal_3836 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3836) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_7~0 4) 4)) c_~s_6~0) (+ c_~s_2~0 1)))) is different from false [2021-11-25 20:45:10,430 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3836 (Array Int Int))) (<= c_~s_2~0 (let ((.cse0 (* c_~i_7~0 4))) (+ c_~s_6~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset .cse0 4)) (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3836) c_~X_0~0.base) (+ c_~X_0~0.offset .cse0 8)))))) (forall ((v_ArrVal_3836 (Array Int Int))) (< (let ((.cse1 (* c_~i_7~0 4))) (+ c_~s_6~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset .cse1 4)) (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3836) c_~X_0~0.base) (+ c_~X_0~0.offset .cse1 8)))) (+ c_~s_2~0 1)))) is different from false [2021-11-25 20:45:10,446 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3836 (Array Int Int))) (<= (+ c_~s_2~0 c_~t_4~0) (let ((.cse0 (* c_~i_7~0 4))) (+ c_~s_6~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset .cse0 4)) (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3836) c_~X_0~0.base) (+ c_~X_0~0.offset .cse0 8)))))) (forall ((v_ArrVal_3836 (Array Int Int))) (< (let ((.cse1 (* c_~i_7~0 4))) (+ c_~s_6~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset .cse1 4)) (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3836) c_~X_0~0.base) (+ c_~X_0~0.offset .cse1 8)))) (+ c_~s_2~0 c_~t_4~0 1)))) is different from false [2021-11-25 20:45:10,455 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3836 (Array Int Int))) (<= (+ c_~s_2~0 c_~t_4~0) (+ (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3836) c_~X_0~0.base) (+ c_~X_0~0.offset 8))))) (forall ((v_ArrVal_3836 (Array Int Int))) (< (+ (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3836) c_~X_0~0.base) (+ c_~X_0~0.offset 8))) (+ c_~s_2~0 c_~t_4~0 1)))) is different from false [2021-11-25 20:45:10,470 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3835 (Array Int Int)) (v_ArrVal_3836 (Array Int Int))) (< (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3835))) (+ (select (select (store .cse0 |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3836) c_~X_0~0.base) (+ c_~X_0~0.offset 8)) (select (select .cse0 c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) (+ c_~s_2~0 c_~t_4~0 1))) (forall ((v_ArrVal_3835 (Array Int Int)) (v_ArrVal_3836 (Array Int Int))) (<= (+ c_~s_2~0 c_~t_4~0) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3835))) (+ (select (select (store .cse1 |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3836) c_~X_0~0.base) (+ c_~X_0~0.offset 8)) (select (select .cse1 c_~X_0~0.base) (+ c_~X_0~0.offset 4))))))) is different from false [2021-11-25 20:45:10,506 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3835 (Array Int Int)) (v_ArrVal_3836 (Array Int Int))) (< (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3835))) (+ (select (select (store .cse0 |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3836) c_~X_0~0.base) (+ c_~X_0~0.offset 8)) (select (select .cse0 c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) (+ c_~s_2~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)) 1))) (forall ((v_ArrVal_3835 (Array Int Int)) (v_ArrVal_3836 (Array Int Int))) (<= (+ c_~s_2~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3835))) (+ (select (select (store .cse1 |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3836) c_~X_0~0.base) (+ c_~X_0~0.offset 8)) (select (select .cse1 c_~X_0~0.base) (+ c_~X_0~0.offset 4))))))) is different from false [2021-11-25 20:45:10,517 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3835 (Array Int Int)) (v_ArrVal_3836 (Array Int Int))) (<= (+ c_~s_2~0 c_~t_4~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3835))) (+ (select (select (store .cse0 |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3836) c_~X_0~0.base) (+ c_~X_0~0.offset 8)) (select (select .cse0 c_~X_0~0.base) (+ c_~X_0~0.offset 4)))))) (forall ((v_ArrVal_3835 (Array Int Int)) (v_ArrVal_3836 (Array Int Int))) (< (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3835))) (+ (select (select (store .cse1 |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3836) c_~X_0~0.base) (+ c_~X_0~0.offset 8)) (select (select .cse1 c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) (+ c_~s_2~0 c_~t_4~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)) 1)))) is different from false [2021-11-25 20:45:10,553 INFO L354 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2021-11-25 20:45:10,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, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 354 treesize of output 216 [2021-11-25 20:45:10,557 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 174 treesize of output 158 [2021-11-25 20:45:10,563 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-25 20:45:10,564 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 158 treesize of output 134 [2021-11-25 20:45:10,738 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:45:10,738 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:45:10,751 INFO L354 Elim1Store]: treesize reduction 82, result has 9.9 percent of original size [2021-11-25 20:45:10,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, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 18 [2021-11-25 20:45:10,907 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 6 not checked. [2021-11-25 20:45:10,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262979214] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:45:10,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1702534227] [2021-11-25 20:45:10,908 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:45:10,908 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:45:10,908 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 12] total 40 [2021-11-25 20:45:10,908 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396350401] [2021-11-25 20:45:10,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:45:10,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2021-11-25 20:45:10,909 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:45:10,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-11-25 20:45:10,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1102, Unknown=7, NotChecked=504, Total=1722 [2021-11-25 20:45:10,909 INFO L87 Difference]: Start difference. First operand 2988 states and 10357 transitions. Second operand has 42 states, 41 states have (on average 2.341463414634146) internal successors, (96), 41 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:45:14,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:45:14,074 INFO L93 Difference]: Finished difference Result 5984 states and 20903 transitions. [2021-11-25 20:45:14,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-11-25 20:45:14,074 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.341463414634146) internal successors, (96), 41 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-11-25 20:45:14,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:45:14,085 INFO L225 Difference]: With dead ends: 5984 [2021-11-25 20:45:14,085 INFO L226 Difference]: Without dead ends: 5938 [2021-11-25 20:45:14,086 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 55 SyntacticMatches, 6 SemanticMatches, 65 ConstructedPredicates, 7 IntricatePredicates, 4 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=340, Invalid=3221, Unknown=7, NotChecked=854, Total=4422 [2021-11-25 20:45:14,086 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 469 mSDsluCounter, 2264 mSDsCounter, 0 mSdLazyCounter, 3382 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 5698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 3382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2236 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-11-25 20:45:14,086 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [469 Valid, 688 Invalid, 5698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 3382 Invalid, 0 Unknown, 2236 Unchecked, 1.6s Time] [2021-11-25 20:45:14,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5938 states. [2021-11-25 20:45:14,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5938 to 3350. [2021-11-25 20:45:14,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3350 states, 3349 states have (on average 3.467303672738131) internal successors, (11612), 3349 states have internal predecessors, (11612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:45:14,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3350 states to 3350 states and 11612 transitions. [2021-11-25 20:45:14,162 INFO L78 Accepts]: Start accepts. Automaton has 3350 states and 11612 transitions. Word has length 40 [2021-11-25 20:45:14,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:45:14,162 INFO L470 AbstractCegarLoop]: Abstraction has 3350 states and 11612 transitions. [2021-11-25 20:45:14,162 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.341463414634146) internal successors, (96), 41 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:45:14,162 INFO L276 IsEmpty]: Start isEmpty. Operand 3350 states and 11612 transitions. [2021-11-25 20:45:14,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-25 20:45:14,167 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:45:14,167 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:45:14,187 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Ended with exit code 0 [2021-11-25 20:45:14,370 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 64 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable66 [2021-11-25 20:45:14,370 INFO L402 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:45:14,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:45:14,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1558678270, now seen corresponding path program 42 times [2021-11-25 20:45:14,370 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:45:14,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706360570] [2021-11-25 20:45:14,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:45:14,371 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:45:14,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:45:15,029 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:45:15,029 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:45:15,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706360570] [2021-11-25 20:45:15,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706360570] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:45:15,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372127325] [2021-11-25 20:45:15,029 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 20:45:15,029 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:45:15,030 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:45:15,034 INFO L229 MonitoredProcess]: Starting monitored process 65 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:45:15,049 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2021-11-25 20:45:15,280 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 20:45:15,281 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:45:15,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 90 conjunts are in the unsatisfiable core [2021-11-25 20:45:15,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:45:15,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:45:15,596 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2021-11-25 20:45:15,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:45:15,684 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2021-11-25 20:45:15,812 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-25 20:45:15,812 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 11 [2021-11-25 20:45:15,834 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 20:45:15,834 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:45:15,980 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3898 (Array Int Int))) (= c_~s_2~0 (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3898) c_~X_0~0.base))) (+ (select .cse0 (+ c_~X_0~0.offset 4)) (select .cse0 (+ c_~X_0~0.offset 8)))))) is different from false [2021-11-25 20:45:16,014 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3897 (Array Int Int)) (v_ArrVal_3898 (Array Int Int))) (= c_~s_2~0 (let ((.cse0 (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3897) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3898) c_~X_0~0.base))) (+ (select .cse0 (+ c_~X_0~0.offset 4)) (select .cse0 (+ c_~X_0~0.offset 8)))))) is different from false [2021-11-25 20:45:16,026 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3897 (Array Int Int)) (v_ArrVal_3898 (Array Int Int))) (= (+ c_~s_2~0 c_~t_4~0) (let ((.cse0 (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3897) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3898) c_~X_0~0.base))) (+ (select .cse0 (+ c_~X_0~0.offset 4)) (select .cse0 (+ c_~X_0~0.offset 8)))))) is different from false [2021-11-25 20:45:16,032 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3897 (Array Int Int)) (v_ArrVal_3898 (Array Int Int))) (= (let ((.cse0 (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3897) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3898) c_~X_0~0.base))) (+ (select .cse0 (+ c_~X_0~0.offset 4)) (select .cse0 (+ c_~X_0~0.offset 8)))) (+ c_~s_2~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))))) is different from false [2021-11-25 20:45:16,043 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3897 (Array Int Int)) (v_ArrVal_3898 (Array Int Int))) (= (+ c_~s_2~0 c_~t_4~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (let ((.cse0 (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3897) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3898) c_~X_0~0.base))) (+ (select .cse0 (+ c_~X_0~0.offset 4)) (select .cse0 (+ c_~X_0~0.offset 8)))))) is different from false [2021-11-25 20:45:16,075 INFO L354 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2021-11-25 20:45:16,076 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 170 treesize of output 128 [2021-11-25 20:45:16,081 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-25 20:45:16,081 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 86 treesize of output 70 [2021-11-25 20:45:16,088 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-25 20:45:16,088 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 38 treesize of output 30 [2021-11-25 20:45:16,421 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 4 not checked. [2021-11-25 20:45:16,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372127325] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:45:16,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1076789358] [2021-11-25 20:45:16,422 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:45:16,422 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:45:16,422 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 12] total 38 [2021-11-25 20:45:16,422 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289922481] [2021-11-25 20:45:16,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:45:16,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-11-25 20:45:16,423 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:45:16,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-11-25 20:45:16,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1092, Unknown=5, NotChecked=350, Total=1560 [2021-11-25 20:45:16,423 INFO L87 Difference]: Start difference. First operand 3350 states and 11612 transitions. Second operand has 40 states, 39 states have (on average 2.717948717948718) internal successors, (106), 39 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:45:20,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:45:20,385 INFO L93 Difference]: Finished difference Result 7539 states and 26622 transitions. [2021-11-25 20:45:20,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-11-25 20:45:20,385 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.717948717948718) internal successors, (106), 39 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-11-25 20:45:20,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:45:20,399 INFO L225 Difference]: With dead ends: 7539 [2021-11-25 20:45:20,399 INFO L226 Difference]: Without dead ends: 7499 [2021-11-25 20:45:20,400 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 58 SyntacticMatches, 6 SemanticMatches, 77 ConstructedPredicates, 5 IntricatePredicates, 4 DeprecatedPredicates, 1017 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=515, Invalid=4902, Unknown=5, NotChecked=740, Total=6162 [2021-11-25 20:45:20,400 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 731 mSDsluCounter, 1935 mSDsCounter, 0 mSdLazyCounter, 3673 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 4673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 3673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 835 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-11-25 20:45:20,400 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [731 Valid, 586 Invalid, 4673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 3673 Invalid, 0 Unknown, 835 Unchecked, 1.9s Time] [2021-11-25 20:45:20,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7499 states. [2021-11-25 20:45:20,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7499 to 3518. [2021-11-25 20:45:20,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3518 states, 3517 states have (on average 3.471993176002275) internal successors, (12211), 3517 states have internal predecessors, (12211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:45:20,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3518 states to 3518 states and 12211 transitions. [2021-11-25 20:45:20,506 INFO L78 Accepts]: Start accepts. Automaton has 3518 states and 12211 transitions. Word has length 40 [2021-11-25 20:45:20,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:45:20,506 INFO L470 AbstractCegarLoop]: Abstraction has 3518 states and 12211 transitions. [2021-11-25 20:45:20,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.717948717948718) internal successors, (106), 39 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:45:20,507 INFO L276 IsEmpty]: Start isEmpty. Operand 3518 states and 12211 transitions. [2021-11-25 20:45:20,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-25 20:45:20,511 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:45:20,511 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:45:20,531 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Forceful destruction successful, exit code 0 [2021-11-25 20:45:20,712 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 65 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67 [2021-11-25 20:45:20,712 INFO L402 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:45:20,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:45:20,712 INFO L85 PathProgramCache]: Analyzing trace with hash -135898728, now seen corresponding path program 43 times [2021-11-25 20:45:20,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:45:20,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409219067] [2021-11-25 20:45:20,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:45:20,713 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:45:20,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:45:21,183 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:45:21,183 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:45:21,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409219067] [2021-11-25 20:45:21,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409219067] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:45:21,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469404000] [2021-11-25 20:45:21,183 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 20:45:21,183 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:45:21,183 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:45:21,184 INFO L229 MonitoredProcess]: Starting monitored process 66 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:45:21,185 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2021-11-25 20:45:21,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:45:21,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 94 conjunts are in the unsatisfiable core [2021-11-25 20:45:21,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:45:21,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:45:21,765 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2021-11-25 20:45:21,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:45:21,824 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2021-11-25 20:45:21,951 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-25 20:45:21,951 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 11 [2021-11-25 20:45:22,000 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 20:45:22,000 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:45:22,171 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3960 (Array Int Int))) (= c_~s_2~0 (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3960) c_~X_0~0.base))) (+ (select .cse0 (+ c_~X_0~0.offset 4)) (select .cse0 (+ c_~X_0~0.offset 8)))))) is different from false [2021-11-25 20:45:22,191 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3959 (Array Int Int)) (v_ArrVal_3960 (Array Int Int))) (= c_~s_2~0 (let ((.cse0 (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3959) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3960) c_~X_0~0.base))) (+ (select .cse0 (+ c_~X_0~0.offset 4)) (select .cse0 (+ c_~X_0~0.offset 8)))))) is different from false [2021-11-25 20:45:22,199 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3959 (Array Int Int)) (v_ArrVal_3960 (Array Int Int))) (= (+ c_~s_2~0 c_~t_4~0) (let ((.cse0 (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3959) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3960) c_~X_0~0.base))) (+ (select .cse0 (+ c_~X_0~0.offset 4)) (select .cse0 (+ c_~X_0~0.offset 8)))))) is different from false [2021-11-25 20:45:22,205 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3959 (Array Int Int)) (v_ArrVal_3960 (Array Int Int))) (= (+ c_~s_2~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (let ((.cse0 (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3959) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3960) c_~X_0~0.base))) (+ (select .cse0 (+ c_~X_0~0.offset 4)) (select .cse0 (+ c_~X_0~0.offset 8)))))) is different from false [2021-11-25 20:45:22,215 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3959 (Array Int Int)) (v_ArrVal_3960 (Array Int Int))) (= (+ c_~s_2~0 c_~t_4~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (let ((.cse0 (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3959) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3960) c_~X_0~0.base))) (+ (select .cse0 (+ c_~X_0~0.offset 4)) (select .cse0 (+ c_~X_0~0.offset 8)))))) is different from false [2021-11-25 20:45:22,248 INFO L354 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2021-11-25 20:45:22,248 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 350 treesize of output 224 [2021-11-25 20:45:22,254 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-25 20:45:22,255 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 182 treesize of output 166 [2021-11-25 20:45:22,261 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-25 20:45:22,261 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 166 treesize of output 134 [2021-11-25 20:45:22,640 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 3 not checked. [2021-11-25 20:45:22,641 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469404000] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:45:22,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [637972286] [2021-11-25 20:45:22,641 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:45:22,641 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:45:22,641 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 12] total 38 [2021-11-25 20:45:22,642 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534196640] [2021-11-25 20:45:22,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:45:22,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-11-25 20:45:22,642 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:45:22,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-11-25 20:45:22,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1092, Unknown=5, NotChecked=350, Total=1560 [2021-11-25 20:45:22,643 INFO L87 Difference]: Start difference. First operand 3518 states and 12211 transitions. Second operand has 40 states, 39 states have (on average 2.41025641025641) internal successors, (94), 39 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:45:26,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:45:26,619 INFO L93 Difference]: Finished difference Result 4866 states and 16932 transitions. [2021-11-25 20:45:26,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-11-25 20:45:26,619 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.41025641025641) internal successors, (94), 39 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-11-25 20:45:26,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:45:26,628 INFO L225 Difference]: With dead ends: 4866 [2021-11-25 20:45:26,628 INFO L226 Difference]: Without dead ends: 4827 [2021-11-25 20:45:26,629 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 53 SyntacticMatches, 9 SemanticMatches, 69 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 838 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=551, Invalid=3754, Unknown=5, NotChecked=660, Total=4970 [2021-11-25 20:45:26,630 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 577 mSDsluCounter, 2125 mSDsCounter, 0 mSdLazyCounter, 4273 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 5415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 4273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 999 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-11-25 20:45:26,630 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [577 Valid, 661 Invalid, 5415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 4273 Invalid, 0 Unknown, 999 Unchecked, 2.2s Time] [2021-11-25 20:45:26,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4827 states. [2021-11-25 20:45:26,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4827 to 3350. [2021-11-25 20:45:26,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3350 states, 3349 states have (on average 3.467303672738131) internal successors, (11612), 3349 states have internal predecessors, (11612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:45:26,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3350 states to 3350 states and 11612 transitions. [2021-11-25 20:45:26,702 INFO L78 Accepts]: Start accepts. Automaton has 3350 states and 11612 transitions. Word has length 40 [2021-11-25 20:45:26,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:45:26,702 INFO L470 AbstractCegarLoop]: Abstraction has 3350 states and 11612 transitions. [2021-11-25 20:45:26,703 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.41025641025641) internal successors, (94), 39 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:45:26,703 INFO L276 IsEmpty]: Start isEmpty. Operand 3350 states and 11612 transitions. [2021-11-25 20:45:26,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-25 20:45:26,707 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:45:26,707 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:45:26,727 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Ended with exit code 0 [2021-11-25 20:45:26,908 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable68 [2021-11-25 20:45:26,908 INFO L402 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:45:26,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:45:26,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1177873696, now seen corresponding path program 44 times [2021-11-25 20:45:26,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:45:26,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619255086] [2021-11-25 20:45:26,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:45:26,909 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:45:26,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:45:27,371 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:45:27,371 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:45:27,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619255086] [2021-11-25 20:45:27,372 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619255086] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:45:27,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810102611] [2021-11-25 20:45:27,372 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 20:45:27,374 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:45:27,374 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:45:27,376 INFO L229 MonitoredProcess]: Starting monitored process 67 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:45:27,379 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2021-11-25 20:45:27,750 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-11-25 20:45:27,750 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:45:27,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 104 conjunts are in the unsatisfiable core [2021-11-25 20:45:27,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:45:28,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:45:28,179 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2021-11-25 20:45:28,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:45:28,282 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2021-11-25 20:45:28,469 INFO L354 Elim1Store]: treesize reduction 42, result has 50.6 percent of original size [2021-11-25 20:45:28,470 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 40 treesize of output 54 [2021-11-25 20:45:28,738 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:45:28,738 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:45:29,735 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_~i_7~0_334 Int) (v_~i_7~0_333 Int)) (or (and (forall ((v_ArrVal_4022 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_4022) c_~X_0~0.base))) (+ (select .cse0 (+ c_~X_0~0.offset (* v_~i_7~0_333 4))) (select .cse0 (+ c_~X_0~0.offset (* v_~i_7~0_334 4))))) (+ c_~s_2~0 c_~t_4~0))) (forall ((v_ArrVal_4022 (Array Int Int))) (< (+ c_~s_2~0 c_~t_4~0) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_4022) c_~X_0~0.base))) (+ (select .cse1 (+ c_~X_0~0.offset (* v_~i_7~0_333 4))) (select .cse1 (+ c_~X_0~0.offset (* v_~i_7~0_334 4))) 1))))) (<= c_~n_1~0 v_~i_7~0_334) (< (+ v_~i_7~0_334 1) v_~i_7~0_333) (< v_~i_7~0_333 c_~n_1~0))) is different from false [2021-11-25 20:45:30,491 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_~i_7~0_334 Int) (v_~i_7~0_333 Int)) (or (and (forall ((v_ArrVal_4021 (Array Int Int)) (v_ArrVal_4022 (Array Int Int))) (<= (let ((.cse0 (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_4021) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_4022) c_~X_0~0.base))) (+ (select .cse0 (+ c_~X_0~0.offset (* v_~i_7~0_333 4))) (select .cse0 (+ c_~X_0~0.offset (* v_~i_7~0_334 4))))) (+ c_~s_2~0 c_~t_4~0))) (forall ((v_ArrVal_4021 (Array Int Int)) (v_ArrVal_4022 (Array Int Int))) (< (+ c_~s_2~0 c_~t_4~0) (let ((.cse1 (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_4021) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_4022) c_~X_0~0.base))) (+ (select .cse1 (+ c_~X_0~0.offset (* v_~i_7~0_333 4))) (select .cse1 (+ c_~X_0~0.offset (* v_~i_7~0_334 4))) 1))))) (<= c_~n_1~0 v_~i_7~0_334) (< (+ v_~i_7~0_334 1) v_~i_7~0_333) (< v_~i_7~0_333 c_~n_1~0))) is different from false [2021-11-25 20:45:30,840 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_~i_7~0_334 Int) (v_~i_7~0_333 Int)) (or (and (forall ((v_ArrVal_4021 (Array Int Int)) (v_ArrVal_4022 (Array Int Int))) (<= (let ((.cse0 (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_4021) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_4022) c_~X_0~0.base))) (+ (select .cse0 (+ c_~X_0~0.offset (* v_~i_7~0_333 4))) (select .cse0 (+ c_~X_0~0.offset (* v_~i_7~0_334 4))))) (+ c_~s_2~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))))) (forall ((v_ArrVal_4021 (Array Int Int)) (v_ArrVal_4022 (Array Int Int))) (< (+ c_~s_2~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (let ((.cse1 (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_4021) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_4022) c_~X_0~0.base))) (+ (select .cse1 (+ c_~X_0~0.offset (* v_~i_7~0_333 4))) (select .cse1 (+ c_~X_0~0.offset (* v_~i_7~0_334 4))) 1))))) (<= c_~n_1~0 v_~i_7~0_334) (< (+ v_~i_7~0_334 1) v_~i_7~0_333) (< v_~i_7~0_333 c_~n_1~0))) is different from false [2021-11-25 20:45:31,238 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_~i_7~0_334 Int) (v_~i_7~0_333 Int)) (or (and (forall ((v_ArrVal_4021 (Array Int Int)) (v_ArrVal_4022 (Array Int Int))) (< (+ c_~s_2~0 c_~t_4~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (let ((.cse0 (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_4021) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_4022) c_~X_0~0.base))) (+ (select .cse0 (+ c_~X_0~0.offset (* v_~i_7~0_333 4))) (select .cse0 (+ c_~X_0~0.offset (* v_~i_7~0_334 4))) 1)))) (forall ((v_ArrVal_4021 (Array Int Int)) (v_ArrVal_4022 (Array Int Int))) (<= (let ((.cse1 (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_4021) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_4022) c_~X_0~0.base))) (+ (select .cse1 (+ c_~X_0~0.offset (* v_~i_7~0_333 4))) (select .cse1 (+ c_~X_0~0.offset (* v_~i_7~0_334 4))))) (+ c_~s_2~0 c_~t_4~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)))))) (<= c_~n_1~0 v_~i_7~0_334) (< (+ v_~i_7~0_334 1) v_~i_7~0_333) (< v_~i_7~0_333 c_~n_1~0))) is different from false [2021-11-25 20:45:31,299 INFO L354 Elim1Store]: treesize reduction 46, result has 55.3 percent of original size [2021-11-25 20:45:31,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 577 treesize of output 370 [2021-11-25 20:45:31,315 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-11-25 20:45:31,316 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 313 treesize of output 265 [2021-11-25 20:45:31,331 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-11-25 20:45:31,332 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 265 treesize of output 241 [2021-11-25 20:45:31,346 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-11-25 20:45:31,346 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 241 treesize of output 217 [2021-11-25 20:45:31,361 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-11-25 20:45:31,361 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 217 treesize of output 205 [2021-11-25 20:45:32,357 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2021-11-25 20:45:32,357 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810102611] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:45:32,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [76016027] [2021-11-25 20:45:32,357 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:45:32,358 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:45:32,359 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 16] total 45 [2021-11-25 20:45:32,359 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573427386] [2021-11-25 20:45:32,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:45:32,359 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2021-11-25 20:45:32,360 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:45:32,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-11-25 20:45:32,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1696, Unknown=4, NotChecked=340, Total=2162 [2021-11-25 20:45:32,360 INFO L87 Difference]: Start difference. First operand 3350 states and 11612 transitions. Second operand has 47 states, 46 states have (on average 2.130434782608696) internal successors, (98), 46 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:45:41,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:45:41,695 INFO L93 Difference]: Finished difference Result 7776 states and 27126 transitions. [2021-11-25 20:45:41,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2021-11-25 20:45:41,695 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.130434782608696) internal successors, (98), 46 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-11-25 20:45:41,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:45:41,709 INFO L225 Difference]: With dead ends: 7776 [2021-11-25 20:45:41,709 INFO L226 Difference]: Without dead ends: 7688 [2021-11-25 20:45:41,710 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 53 SyntacticMatches, 18 SemanticMatches, 96 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 2012 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=1150, Invalid=7604, Unknown=4, NotChecked=748, Total=9506 [2021-11-25 20:45:41,710 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 1372 mSDsluCounter, 2625 mSDsCounter, 0 mSdLazyCounter, 4273 mSolverCounterSat, 320 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1372 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 7276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 320 IncrementalHoareTripleChecker+Valid, 4273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2683 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2021-11-25 20:45:41,710 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1372 Valid, 732 Invalid, 7276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [320 Valid, 4273 Invalid, 0 Unknown, 2683 Unchecked, 2.4s Time] [2021-11-25 20:45:41,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7688 states. [2021-11-25 20:45:41,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7688 to 3434. [2021-11-25 20:45:41,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3434 states, 3433 states have (on average 3.4713078939702884) internal successors, (11917), 3433 states have internal predecessors, (11917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:45:41,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3434 states to 3434 states and 11917 transitions. [2021-11-25 20:45:41,811 INFO L78 Accepts]: Start accepts. Automaton has 3434 states and 11917 transitions. Word has length 40 [2021-11-25 20:45:41,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:45:41,811 INFO L470 AbstractCegarLoop]: Abstraction has 3434 states and 11917 transitions. [2021-11-25 20:45:41,811 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.130434782608696) internal successors, (98), 46 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:45:41,811 INFO L276 IsEmpty]: Start isEmpty. Operand 3434 states and 11917 transitions. [2021-11-25 20:45:41,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-25 20:45:41,816 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:45:41,817 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:45:41,847 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Ended with exit code 0 [2021-11-25 20:45:42,042 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 67 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable69 [2021-11-25 20:45:42,042 INFO L402 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:45:42,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:45:42,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1777761674, now seen corresponding path program 45 times [2021-11-25 20:45:42,042 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:45:42,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285939172] [2021-11-25 20:45:42,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:45:42,042 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:45:42,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:45:42,420 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:45:42,420 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:45:42,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285939172] [2021-11-25 20:45:42,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285939172] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:45:42,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770864229] [2021-11-25 20:45:42,421 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 20:45:42,421 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:45:42,421 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:45:42,422 INFO L229 MonitoredProcess]: Starting monitored process 68 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:45:42,422 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2021-11-25 20:45:42,668 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 20:45:42,668 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:45:42,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 86 conjunts are in the unsatisfiable core [2021-11-25 20:45:42,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:45:42,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:45:42,877 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2021-11-25 20:45:43,059 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-25 20:45:43,059 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 11 [2021-11-25 20:45:43,119 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 20:45:43,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:45:43,317 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4083 (Array Int Int))) (< (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_4083) c_~X_0~0.base))) (+ (select .cse0 (+ c_~X_0~0.offset 8)) (select .cse0 (+ c_~X_0~0.offset 4)))) (+ c_~s_2~0 c_~t_4~0 1))) (forall ((v_ArrVal_4083 (Array Int Int))) (<= (+ c_~s_2~0 c_~t_4~0) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_4083) c_~X_0~0.base))) (+ (select .cse1 (+ c_~X_0~0.offset 8)) (select .cse1 (+ c_~X_0~0.offset 4))))))) is different from false [2021-11-25 20:45:43,360 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4083 (Array Int Int))) (< (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_4083) c_~X_0~0.base))) (+ (select .cse0 (+ c_~X_0~0.offset 8)) (select .cse0 (+ c_~X_0~0.offset 4)))) (+ c_~s_2~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)) 1))) (forall ((v_ArrVal_4083 (Array Int Int))) (<= (+ c_~s_2~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_4083) c_~X_0~0.base))) (+ (select .cse1 (+ c_~X_0~0.offset 8)) (select .cse1 (+ c_~X_0~0.offset 4))))))) is different from false [2021-11-25 20:45:43,381 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4083 (Array Int Int))) (<= (+ c_~s_2~0 c_~t_4~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_4083) c_~X_0~0.base))) (+ (select .cse0 (+ c_~X_0~0.offset 8)) (select .cse0 (+ c_~X_0~0.offset 4)))))) (forall ((v_ArrVal_4083 (Array Int Int))) (< (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_4083) c_~X_0~0.base))) (+ (select .cse1 (+ c_~X_0~0.offset 8)) (select .cse1 (+ c_~X_0~0.offset 4)))) (+ c_~s_2~0 c_~t_4~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)) 1)))) is different from false [2021-11-25 20:45:43,425 INFO L354 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2021-11-25 20:45:43,425 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 82 treesize of output 76 [2021-11-25 20:45:43,432 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-25 20:45:43,433 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 20 treesize of output 12 [2021-11-25 20:45:43,564 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:45:43,580 INFO L354 Elim1Store]: treesize reduction 82, result has 9.9 percent of original size [2021-11-25 20:45:43,581 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 39 treesize of output 18 [2021-11-25 20:45:43,684 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 3 not checked. [2021-11-25 20:45:43,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770864229] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:45:43,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1168947126] [2021-11-25 20:45:43,685 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:45:43,685 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:45:43,685 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 34 [2021-11-25 20:45:43,685 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074824232] [2021-11-25 20:45:43,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:45:43,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-11-25 20:45:43,686 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:45:43,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-11-25 20:45:43,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=944, Unknown=3, NotChecked=192, Total=1260 [2021-11-25 20:45:43,686 INFO L87 Difference]: Start difference. First operand 3434 states and 11917 transitions. Second operand has 36 states, 35 states have (on average 2.4571428571428573) internal successors, (86), 35 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:45:46,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:45:46,379 INFO L93 Difference]: Finished difference Result 5002 states and 17592 transitions. [2021-11-25 20:45:46,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-11-25 20:45:46,380 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.4571428571428573) internal successors, (86), 35 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-11-25 20:45:46,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:45:46,388 INFO L225 Difference]: With dead ends: 5002 [2021-11-25 20:45:46,388 INFO L226 Difference]: Without dead ends: 4961 [2021-11-25 20:45:46,389 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 56 SyntacticMatches, 6 SemanticMatches, 62 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 753 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=520, Invalid=3149, Unknown=3, NotChecked=360, Total=4032 [2021-11-25 20:45:46,389 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 541 mSDsluCounter, 1402 mSDsCounter, 0 mSdLazyCounter, 2765 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 3142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 2765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 265 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-11-25 20:45:46,389 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [541 Valid, 415 Invalid, 3142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 2765 Invalid, 0 Unknown, 265 Unchecked, 1.4s Time] [2021-11-25 20:45:46,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4961 states. [2021-11-25 20:45:46,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4961 to 3469. [2021-11-25 20:45:46,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3469 states, 3468 states have (on average 3.4994232987312572) internal successors, (12136), 3468 states have internal predecessors, (12136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:45:46,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3469 states to 3469 states and 12136 transitions. [2021-11-25 20:45:46,457 INFO L78 Accepts]: Start accepts. Automaton has 3469 states and 12136 transitions. Word has length 40 [2021-11-25 20:45:46,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:45:46,457 INFO L470 AbstractCegarLoop]: Abstraction has 3469 states and 12136 transitions. [2021-11-25 20:45:46,457 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.4571428571428573) internal successors, (86), 35 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:45:46,457 INFO L276 IsEmpty]: Start isEmpty. Operand 3469 states and 12136 transitions. [2021-11-25 20:45:46,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-25 20:45:46,462 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:45:46,462 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:45:46,482 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Ended with exit code 0 [2021-11-25 20:45:46,662 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,68 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:45:46,662 INFO L402 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:45:46,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:45:46,663 INFO L85 PathProgramCache]: Analyzing trace with hash -19818358, now seen corresponding path program 46 times [2021-11-25 20:45:46,663 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:45:46,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328607922] [2021-11-25 20:45:46,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:45:46,663 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:45:46,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:45:47,324 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:45:47,324 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:45:47,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328607922] [2021-11-25 20:45:47,324 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328607922] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:45:47,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983722589] [2021-11-25 20:45:47,324 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 20:45:47,324 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:45:47,324 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:45:47,325 INFO L229 MonitoredProcess]: Starting monitored process 69 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:45:47,326 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2021-11-25 20:45:47,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:45:47,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 96 conjunts are in the unsatisfiable core [2021-11-25 20:45:47,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:45:47,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:45:47,943 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2021-11-25 20:45:48,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:45:48,097 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2021-11-25 20:45:48,212 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:45:48,213 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2021-11-25 20:45:48,267 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 20:45:48,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:45:48,433 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4145 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_4145) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_7~0 4) 4)) c_~s_6~0) (+ c_~s_2~0 c_~t_4~0 1))) (forall ((v_ArrVal_4145 (Array Int Int))) (<= (+ c_~s_2~0 c_~t_4~0) (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_4145) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_7~0 4) 4)) c_~s_6~0)))) is different from false [2021-11-25 20:45:48,443 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4145 (Array Int Int))) (< (let ((.cse0 (* c_~i_7~0 4))) (+ c_~s_6~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset .cse0 4)) (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_4145) c_~X_0~0.base) (+ c_~X_0~0.offset .cse0 8)))) (+ c_~s_2~0 c_~t_4~0 1))) (forall ((v_ArrVal_4145 (Array Int Int))) (<= (+ c_~s_2~0 c_~t_4~0) (let ((.cse1 (* c_~i_7~0 4))) (+ c_~s_6~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset .cse1 4)) (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_4145) c_~X_0~0.base) (+ c_~X_0~0.offset .cse1 8))))))) is different from false [2021-11-25 20:45:48,452 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4145 (Array Int Int))) (<= (+ c_~s_2~0 c_~t_4~0) (+ (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_4145) c_~X_0~0.base) (+ c_~X_0~0.offset 8))))) (forall ((v_ArrVal_4145 (Array Int Int))) (< (+ (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_4145) c_~X_0~0.base) (+ c_~X_0~0.offset 8))) (+ c_~s_2~0 c_~t_4~0 1)))) is different from false [2021-11-25 20:45:48,472 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4144 (Array Int Int)) (v_ArrVal_4145 (Array Int Int))) (< (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_4144))) (+ (select (select .cse0 c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (select (select (store .cse0 |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_4145) c_~X_0~0.base) (+ c_~X_0~0.offset 8)))) (+ c_~s_2~0 c_~t_4~0 1))) (forall ((v_ArrVal_4144 (Array Int Int)) (v_ArrVal_4145 (Array Int Int))) (<= (+ c_~s_2~0 c_~t_4~0) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_4144))) (+ (select (select .cse1 c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (select (select (store .cse1 |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_4145) c_~X_0~0.base) (+ c_~X_0~0.offset 8))))))) is different from false [2021-11-25 20:45:48,501 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4144 (Array Int Int)) (v_ArrVal_4145 (Array Int Int))) (<= (+ c_~s_2~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_4144))) (+ (select (select .cse0 c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (select (select (store .cse0 |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_4145) c_~X_0~0.base) (+ c_~X_0~0.offset 8)))))) (forall ((v_ArrVal_4144 (Array Int Int)) (v_ArrVal_4145 (Array Int Int))) (< (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_4144))) (+ (select (select .cse1 c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (select (select (store .cse1 |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_4145) c_~X_0~0.base) (+ c_~X_0~0.offset 8)))) (+ c_~s_2~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)) 1)))) is different from false [2021-11-25 20:45:48,519 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4144 (Array Int Int)) (v_ArrVal_4145 (Array Int Int))) (<= (+ c_~s_2~0 c_~t_4~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_4144))) (+ (select (select .cse0 c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (select (select (store .cse0 |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_4145) c_~X_0~0.base) (+ c_~X_0~0.offset 8)))))) (forall ((v_ArrVal_4144 (Array Int Int)) (v_ArrVal_4145 (Array Int Int))) (< (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_4144))) (+ (select (select .cse1 c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (select (select (store .cse1 |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_4145) c_~X_0~0.base) (+ c_~X_0~0.offset 8)))) (+ c_~s_2~0 c_~t_4~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)) 1)))) is different from false [2021-11-25 20:45:48,554 INFO L354 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2021-11-25 20:45:48,554 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 354 treesize of output 216 [2021-11-25 20:45:48,561 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-25 20:45:48,561 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 174 treesize of output 150 [2021-11-25 20:45:48,565 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 150 treesize of output 134 [2021-11-25 20:45:48,739 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:45:48,740 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:45:48,753 INFO L354 Elim1Store]: treesize reduction 82, result has 9.9 percent of original size [2021-11-25 20:45:48,753 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 39 treesize of output 18 [2021-11-25 20:45:48,922 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 5 not checked. [2021-11-25 20:45:48,922 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983722589] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:45:48,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1968272113] [2021-11-25 20:45:48,922 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:45:48,923 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:45:48,923 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 12] total 40 [2021-11-25 20:45:48,923 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137150927] [2021-11-25 20:45:48,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:45:48,923 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2021-11-25 20:45:48,923 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:45:48,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-11-25 20:45:48,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1154, Unknown=6, NotChecked=438, Total=1722 [2021-11-25 20:45:48,924 INFO L87 Difference]: Start difference. First operand 3469 states and 12136 transitions. Second operand has 42 states, 41 states have (on average 2.292682926829268) internal successors, (94), 41 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:45:51,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:45:51,772 INFO L93 Difference]: Finished difference Result 6771 states and 24077 transitions. [2021-11-25 20:45:51,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-11-25 20:45:51,772 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.292682926829268) internal successors, (94), 41 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-11-25 20:45:51,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:45:51,785 INFO L225 Difference]: With dead ends: 6771 [2021-11-25 20:45:51,785 INFO L226 Difference]: Without dead ends: 6736 [2021-11-25 20:45:51,785 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 57 SyntacticMatches, 8 SemanticMatches, 67 ConstructedPredicates, 6 IntricatePredicates, 2 DeprecatedPredicates, 1039 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=413, Invalid=3511, Unknown=6, NotChecked=762, Total=4692 [2021-11-25 20:45:51,785 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 479 mSDsluCounter, 1704 mSDsCounter, 0 mSdLazyCounter, 2937 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 4256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 2937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1215 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-11-25 20:45:51,786 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [479 Valid, 551 Invalid, 4256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 2937 Invalid, 0 Unknown, 1215 Unchecked, 1.5s Time] [2021-11-25 20:45:51,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6736 states. [2021-11-25 20:45:51,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6736 to 3481. [2021-11-25 20:45:51,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3481 states, 3480 states have (on average 3.4991379310344826) internal successors, (12177), 3480 states have internal predecessors, (12177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:45:51,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3481 states to 3481 states and 12177 transitions. [2021-11-25 20:45:51,866 INFO L78 Accepts]: Start accepts. Automaton has 3481 states and 12177 transitions. Word has length 40 [2021-11-25 20:45:51,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:45:51,866 INFO L470 AbstractCegarLoop]: Abstraction has 3481 states and 12177 transitions. [2021-11-25 20:45:51,867 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.292682926829268) internal successors, (94), 41 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:45:51,867 INFO L276 IsEmpty]: Start isEmpty. Operand 3481 states and 12177 transitions. [2021-11-25 20:45:51,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-25 20:45:51,871 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:45:51,872 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:45:51,893 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Forceful destruction successful, exit code 0 [2021-11-25 20:45:52,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,69 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:45:52,075 INFO L402 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:45:52,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:45:52,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1618391874, now seen corresponding path program 1 times [2021-11-25 20:45:52,075 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:45:52,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472574198] [2021-11-25 20:45:52,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:45:52,076 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:45:52,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:45:52,517 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:45:52,517 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:45:52,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472574198] [2021-11-25 20:45:52,517 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472574198] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:45:52,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936081252] [2021-11-25 20:45:52,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:45:52,518 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:45:52,518 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:45:52,518 INFO L229 MonitoredProcess]: Starting monitored process 70 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:45:52,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Waiting until timeout for monitored process [2021-11-25 20:45:52,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:45:52,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 88 conjunts are in the unsatisfiable core [2021-11-25 20:45:52,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:45:52,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:45:52,995 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-11-25 20:45:53,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:45:53,159 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2021-11-25 20:45:53,282 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-25 20:45:53,282 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 11 [2021-11-25 20:45:53,304 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 20:45:53,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:45:53,445 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4207 (Array Int Int))) (= c_~s_2~0 (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_4207) c_~X_0~0.base))) (+ (select .cse0 (+ c_~X_0~0.offset 4)) (select .cse0 (+ c_~X_0~0.offset 8)))))) is different from false [2021-11-25 20:45:53,474 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4207 (Array Int Int))) (= (+ c_~s_2~0 c_~t_5~0) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_4207) c_~X_0~0.base))) (+ (select .cse0 (+ c_~X_0~0.offset 4)) (select .cse0 (+ c_~X_0~0.offset 8)))))) is different from false [2021-11-25 20:45:53,484 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4207 (Array Int Int))) (= (+ c_~s_2~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_4207) c_~X_0~0.base))) (+ (select .cse0 (+ c_~X_0~0.offset 4)) (select .cse0 (+ c_~X_0~0.offset 8)))))) is different from false [2021-11-25 20:45:53,493 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4206 (Array Int Int)) (v_ArrVal_4207 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_4206))) (= (+ (select (select .cse0 c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)) c_~s_2~0) (let ((.cse1 (select (store .cse0 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_4207) c_~X_0~0.base))) (+ (select .cse1 (+ c_~X_0~0.offset 4)) (select .cse1 (+ c_~X_0~0.offset 8))))))) is different from false [2021-11-25 20:45:53,506 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4206 (Array Int Int)) (v_ArrVal_4207 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_4206))) (= (+ (select (select .cse0 c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)) c_~s_2~0 c_~t_4~0) (let ((.cse1 (select (store .cse0 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_4207) c_~X_0~0.base))) (+ (select .cse1 (+ c_~X_0~0.offset 4)) (select .cse1 (+ c_~X_0~0.offset 8))))))) is different from false [2021-11-25 20:45:53,542 INFO L354 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2021-11-25 20:45:53,542 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 342 treesize of output 252 [2021-11-25 20:45:53,563 INFO L354 Elim1Store]: treesize reduction 20, result has 53.5 percent of original size [2021-11-25 20:45:53,563 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 210 treesize of output 188 [2021-11-25 20:45:53,570 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-25 20:45:53,570 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 166 treesize of output 134 [2021-11-25 20:45:54,192 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 2 not checked. [2021-11-25 20:45:54,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1936081252] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:45:54,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [140979264] [2021-11-25 20:45:54,192 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:45:54,192 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:45:54,193 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 12] total 37 [2021-11-25 20:45:54,193 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050620808] [2021-11-25 20:45:54,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:45:54,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-11-25 20:45:54,193 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:45:54,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-11-25 20:45:54,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1037, Unknown=5, NotChecked=340, Total=1482 [2021-11-25 20:45:54,194 INFO L87 Difference]: Start difference. First operand 3481 states and 12177 transitions. Second operand has 39 states, 38 states have (on average 2.789473684210526) internal successors, (106), 38 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:45:57,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:45:57,429 INFO L93 Difference]: Finished difference Result 5430 states and 19159 transitions. [2021-11-25 20:45:57,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-11-25 20:45:57,429 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.789473684210526) internal successors, (106), 38 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-11-25 20:45:57,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:45:57,439 INFO L225 Difference]: With dead ends: 5430 [2021-11-25 20:45:57,439 INFO L226 Difference]: Without dead ends: 5397 [2021-11-25 20:45:57,439 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 57 SyntacticMatches, 9 SemanticMatches, 58 ConstructedPredicates, 5 IntricatePredicates, 2 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=298, Invalid=2687, Unknown=5, NotChecked=550, Total=3540 [2021-11-25 20:45:57,440 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 438 mSDsluCounter, 2191 mSDsCounter, 0 mSdLazyCounter, 3883 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 4981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 3883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1024 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-11-25 20:45:57,440 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [438 Valid, 588 Invalid, 4981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 3883 Invalid, 0 Unknown, 1024 Unchecked, 1.9s Time] [2021-11-25 20:45:57,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5397 states. [2021-11-25 20:45:57,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5397 to 3505. [2021-11-25 20:45:57,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3505 states, 3504 states have (on average 3.5037100456621006) internal successors, (12277), 3504 states have internal predecessors, (12277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:45:57,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3505 states to 3505 states and 12277 transitions. [2021-11-25 20:45:57,534 INFO L78 Accepts]: Start accepts. Automaton has 3505 states and 12277 transitions. Word has length 40 [2021-11-25 20:45:57,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:45:57,535 INFO L470 AbstractCegarLoop]: Abstraction has 3505 states and 12277 transitions. [2021-11-25 20:45:57,535 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.789473684210526) internal successors, (106), 38 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:45:57,535 INFO L276 IsEmpty]: Start isEmpty. Operand 3505 states and 12277 transitions. [2021-11-25 20:45:57,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-25 20:45:57,543 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:45:57,543 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:45:57,576 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Ended with exit code 0 [2021-11-25 20:45:57,758 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 70 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable72 [2021-11-25 20:45:57,758 INFO L402 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:45:57,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:45:57,758 INFO L85 PathProgramCache]: Analyzing trace with hash -181352126, now seen corresponding path program 2 times [2021-11-25 20:45:57,758 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:45:57,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125410320] [2021-11-25 20:45:57,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:45:57,759 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:45:57,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:45:58,179 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:45:58,179 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:45:58,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125410320] [2021-11-25 20:45:58,179 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125410320] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:45:58,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472306408] [2021-11-25 20:45:58,179 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 20:45:58,179 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:45:58,179 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:45:58,180 INFO L229 MonitoredProcess]: Starting monitored process 71 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:45:58,181 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb546b6-2612-4067-a4c7-3efb4ec796cc/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Waiting until timeout for monitored process [2021-11-25 20:45:58,472 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 20:45:58,473 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:45:58,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 117 conjunts are in the unsatisfiable core [2021-11-25 20:45:58,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:45:58,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:45:58,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:45:58,495 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-25 20:45:58,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2021-11-25 20:45:58,560 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-11-25 20:45:58,608 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 20:45:58,653 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-25 20:45:58,654 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 15 treesize of output 15 [2021-11-25 20:45:58,705 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 20:45:58,843 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-11-25 20:45:59,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:45:59,083 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2021-11-25 20:45:59,237 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-25 20:45:59,237 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 11 [2021-11-25 20:45:59,259 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:45:59,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:45:59,458 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n_1~0 1) (and (forall ((v_ArrVal_4278 (Array Int Int))) (< (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_4278) c_~X_0~0.base))) (+ (select .cse0 (+ c_~X_0~0.offset 8)) (select .cse0 (+ c_~X_0~0.offset 4)))) (+ c_~s_2~0 1))) (forall ((v_ArrVal_4278 (Array Int Int))) (<= c_~s_2~0 (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_4278) c_~X_0~0.base))) (+ (select .cse1 (+ c_~X_0~0.offset 8)) (select .cse1 (+ c_~X_0~0.offset 4)))))))) is different from false [2021-11-25 20:45:59,521 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n_1~0 1) (and (forall ((v_ArrVal_4278 (Array Int Int))) (<= (+ c_~s_2~0 c_~t_5~0) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_4278) c_~X_0~0.base))) (+ (select .cse0 (+ c_~X_0~0.offset 8)) (select .cse0 (+ c_~X_0~0.offset 4)))))) (forall ((v_ArrVal_4278 (Array Int Int))) (< (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_4278) c_~X_0~0.base))) (+ (select .cse1 (+ c_~X_0~0.offset 8)) (select .cse1 (+ c_~X_0~0.offset 4)))) (+ c_~s_2~0 c_~t_5~0 1))))) is different from false [2021-11-25 20:45:59,559 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n_1~0 1) (and (forall ((v_ArrVal_4278 (Array Int Int))) (<= (+ c_~s_2~0 c_~t_5~0) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_4278) c_~X_0~0.base))) (+ (select .cse0 (+ c_~X_0~0.offset 8)) (select .cse0 (+ c_~X_0~0.offset 4)))))) (forall ((v_ArrVal_4278 (Array Int Int))) (< (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_4278) c_~X_0~0.base))) (+ (select .cse1 (+ c_~X_0~0.offset 8)) (select .cse1 (+ c_~X_0~0.offset 4)))) (+ c_~s_2~0 c_~t_5~0 1)))) (< c_~i_3~0 c_~n_1~0)) is different from false [2021-11-25 20:45:59,573 WARN L838 $PredicateComparison]: unable to prove that (or (< (+ c_~i_3~0 1) c_~n_1~0) (and (forall ((v_ArrVal_4278 (Array Int Int))) (<= (+ c_~s_2~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_4278) c_~X_0~0.base))) (+ (select .cse0 (+ c_~X_0~0.offset 8)) (select .cse0 (+ c_~X_0~0.offset 4)))))) (forall ((v_ArrVal_4278 (Array Int Int))) (< (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_4278) c_~X_0~0.base))) (+ (select .cse1 (+ c_~X_0~0.offset 8)) (select .cse1 (+ c_~X_0~0.offset 4)))) (+ c_~s_2~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)) 1)))) (<= c_~n_1~0 1)) is different from false [2021-11-25 20:45:59,598 WARN L838 $PredicateComparison]: unable to prove that (or (< (+ c_~i_3~0 1) c_~n_1~0) (<= c_~n_1~0 1) (and (forall ((v_ArrVal_4277 (Array Int Int)) (v_ArrVal_4278 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_4277))) (<= (+ (select (select .cse0 c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)) c_~s_2~0) (let ((.cse1 (select (store .cse0 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_4278) c_~X_0~0.base))) (+ (select .cse1 (+ c_~X_0~0.offset 4)) (select .cse1 (+ c_~X_0~0.offset 8))))))) (forall ((v_ArrVal_4277 (Array Int Int)) (v_ArrVal_4278 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_4277))) (< (let ((.cse2 (select (store .cse3 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_4278) c_~X_0~0.base))) (+ (select .cse2 (+ c_~X_0~0.offset 4)) (select .cse2 (+ c_~X_0~0.offset 8)))) (+ (select (select .cse3 c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)) c_~s_2~0 1)))))) is different from false [2021-11-25 20:45:59,656 WARN L838 $PredicateComparison]: unable to prove that (or (< (+ c_~i_3~0 1) c_~n_1~0) (<= c_~n_1~0 1) (and (forall ((v_ArrVal_4277 (Array Int Int)) (v_ArrVal_4278 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_4277))) (<= (+ (select (select .cse0 c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)) c_~s_2~0 c_~t_4~0) (let ((.cse1 (select (store .cse0 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_4278) c_~X_0~0.base))) (+ (select .cse1 (+ c_~X_0~0.offset 4)) (select .cse1 (+ c_~X_0~0.offset 8))))))) (forall ((v_ArrVal_4277 (Array Int Int)) (v_ArrVal_4278 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_4277))) (< (let ((.cse2 (select (store .cse3 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_4278) c_~X_0~0.base))) (+ (select .cse2 (+ c_~X_0~0.offset 4)) (select .cse2 (+ c_~X_0~0.offset 8)))) (+ (select (select .cse3 c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)) c_~s_2~0 c_~t_4~0 1)))))) is different from false [2021-11-25 20:45:59,676 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_4277 (Array Int Int)) (v_ArrVal_4278 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_4277))) (< (let ((.cse0 (select (store .cse1 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_4278) c_~X_0~0.base))) (+ (select .cse0 (+ c_~X_0~0.offset 4)) (select .cse0 (+ c_~X_0~0.offset 8)))) (let ((.cse2 (* c_~i_3~0 4))) (+ c_~s_2~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset .cse2 4)) (select (select .cse1 c_~X_0~0.base) (+ c_~X_0~0.offset 8 .cse2)) 1))))) (forall ((v_ArrVal_4277 (Array Int Int)) (v_ArrVal_4278 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_4277))) (<= (let ((.cse3 (* c_~i_3~0 4))) (+ c_~s_2~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset .cse3 4)) (select (select .cse4 c_~X_0~0.base) (+ c_~X_0~0.offset 8 .cse3)))) (let ((.cse5 (select (store .cse4 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_4278) c_~X_0~0.base))) (+ (select .cse5 (+ c_~X_0~0.offset 4)) (select .cse5 (+ c_~X_0~0.offset 8)))))))) (<= c_~n_1~0 1) (< (+ c_~i_3~0 2) c_~n_1~0)) is different from false [2021-11-25 20:45:59,707 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n_1~0 1) (and (forall ((v_ArrVal_4276 (Array Int Int)) (v_ArrVal_4277 (Array Int Int)) (v_ArrVal_4278 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_4276))) (let ((.cse0 (store .cse2 |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_4277))) (<= (let ((.cse1 (* c_~i_3~0 4))) (+ (select (select .cse0 c_~X_0~0.base) (+ c_~X_0~0.offset 8 .cse1)) c_~s_2~0 (select (select .cse2 c_~X_0~0.base) (+ c_~X_0~0.offset .cse1 4)))) (let ((.cse3 (select (store .cse0 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_4278) c_~X_0~0.base))) (+ (select .cse3 (+ c_~X_0~0.offset 8)) (select .cse3 (+ c_~X_0~0.offset 4)))))))) (forall ((v_ArrVal_4276 (Array Int Int)) (v_ArrVal_4277 (Array Int Int)) (v_ArrVal_4278 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_4276))) (let ((.cse5 (store .cse7 |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_4277))) (< (let ((.cse4 (select (store .cse5 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_4278) c_~X_0~0.base))) (+ (select .cse4 (+ c_~X_0~0.offset 8)) (select .cse4 (+ c_~X_0~0.offset 4)))) (let ((.cse6 (* c_~i_3~0 4))) (+ (select (select .cse5 c_~X_0~0.base) (+ c_~X_0~0.offset 8 .cse6)) c_~s_2~0 (select (select .cse7 c_~X_0~0.base) (+ c_~X_0~0.offset .cse6 4)) 1))))))) (< (+ c_~i_3~0 2) c_~n_1~0)) is different from false [2021-11-25 20:46:00,194 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:46:00,195 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 238 treesize of output 155 [2021-11-25 20:46:00,316 INFO L354 Elim1Store]: treesize reduction 20, result has 51.2 percent of original size [2021-11-25 20:46:00,320 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 17133178 treesize of output 15618694